Submission #6,896

2023-12-19 14:59:42

cpp17

Wrong answer 52/80

34ms

4676 KiB

// Source: https://usaco.guide/general/io

#include <bits/stdc++.h>
using namespace std;

int main() {
	int n;cin>>n;
	int cnt=0;
	vector<int> v(n+1);
	map<int, int> m;
	for(int i = 1;i<=n;i++){
		cin>>v[i];
	}
	int j = 1;
	while(j<n){
		cnt++;
		m[v[j]]++;
		j+=v[j];
	}
	cout<<cnt<<endl;
	int maxk=0;
	for(auto p : m){
		if(p.second>m[maxk])maxk=p.first;
	}
	cout<<maxk<<endl;
}

	Sum	Test	Verdict		Time	Memory
base	52/80
		1	Accepted	0/0	3ms	1812 KiB
		2	Wrong answer	0/0	3ms	2156 KiB
		3	Partially correct	2/4	3ms	2328 KiB
		4	Partially correct	2/4	3ms	2540 KiB
		5	Partially correct	2/4	3ms	2648 KiB
		6	Accepted	4/4	3ms	2732 KiB
		7	Partially correct	2/4	3ms	2976 KiB
		8	Partially correct	2/4	3ms	3060 KiB
		9	Accepted	4/4	3ms	3188 KiB
		10	Partially correct	2/4	3ms	3404 KiB
		11	Partially correct	2/4	3ms	3404 KiB
		12	Partially correct	2/4	4ms	3440 KiB
		13	Partially correct	2/4	4ms	3520 KiB
		14	Partially correct	2/4	4ms	3512 KiB
		15	Accepted	4/4	6ms	3784 KiB
		16	Partially correct	2/4	6ms	3852 KiB
		17	Accepted	4/4	13ms	3860 KiB
		18	Partially correct	2/4	20ms	4424 KiB
		19	Partially correct	2/4	26ms	4556 KiB
		20	Accepted	4/4	28ms	4596 KiB
		21	Accepted	4/4	34ms	4676 KiB
		22	Partially correct	2/4	23ms	4676 KiB