Submission #6,897

2023-12-19 15:01:00

cpp17

Accepted 80/80

34ms

4968 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	80/80
		1	Accepted	0/0	3ms	1816 KiB
		2	Accepted	0/0	3ms	2056 KiB
		3	Accepted	4/4	3ms	2260 KiB
		4	Accepted	4/4	3ms	2476 KiB
		5	Accepted	4/4	3ms	2512 KiB
		6	Accepted	4/4	3ms	2756 KiB
		7	Accepted	4/4	3ms	2848 KiB
		8	Accepted	4/4	3ms	2964 KiB
		9	Accepted	4/4	3ms	3104 KiB
		10	Accepted	4/4	3ms	3308 KiB
		11	Accepted	4/4	3ms	3416 KiB
		12	Accepted	4/4	4ms	3656 KiB
		13	Accepted	4/4	4ms	3884 KiB
		14	Accepted	4/4	4ms	3892 KiB
		15	Accepted	4/4	6ms	4248 KiB
		16	Accepted	4/4	6ms	4452 KiB
		17	Accepted	4/4	13ms	4500 KiB
		18	Accepted	4/4	20ms	4872 KiB
		19	Accepted	4/4	26ms	4872 KiB
		20	Accepted	4/4	27ms	4872 KiB
		21	Accepted	4/4	34ms	4868 KiB
		22	Accepted	4/4	23ms	4968 KiB