Submission #1025802

# Submission time Handle Problem Language Result Execution time Memory
1025802 2024-07-17T10:15:58 Z vjudge1 Doktor (COCI17_doktor) C++17
80 / 100
211 ms 45240 KB
#include <bits/stdc++.h>

using namespace std;

int main()
{
	int n;
	cin>>n;
	vector<int> len[2*n];
	vector<int> a;
	for (int i=0;i<n;i++)
	{
		int x;
		cin>>x;
		a.push_back(x);
		a.push_back(0);
	}
	for (int i=0;i<2*n-1;i+=2)
	{
		int rc=2*a[i]-2;
		len[(i+rc)/2].push_back((i+rc)/2-min(i,rc));
	}
	int id=0;
	for (int i=0;i<2*n-1;i++)
	{
		if (len[i].size()>len[id].size())
			id=i;
	}
	int mx=0;
	for (int i:len[id])
		mx=max(mx,i);
	cout<<a[id-mx]<<' '<<a[id+mx]<<endl;
	
	return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 604 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 1112 KB Output is correct
2 Correct 73 ms 22068 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 27 ms 7880 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 211 ms 41604 KB Output is correct
2 Correct 115 ms 35000 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 106 ms 24500 KB Output is correct
2 Correct 151 ms 45240 KB Output is correct