Submission #548928

# Submission time Handle Problem Language Result Execution time Memory
548928 2022-04-14T18:44:16 Z Hanksburger Carnival (CEOI14_carnival) C++17
100 / 100
11 ms 208 KB
#include <bits/stdc++.h>
using namespace std;
int a[155], b[155];
int main()
{
	int n, cnt=1;
	cin >> n;
	for (int i=1; i<=n; i++)
	{
		int l=1, r=cnt;
		while (l<r)
		{
			int mid=(l+r)/2, res;
			cout << mid-l+2 << ' ' << i << ' ';
			for (int j=l; j<=mid; j++)
				cout << b[j] << ' ';
			cout << '\n';
			fflush(stdout);
			cin >> res;
			if (res==mid-l+1)
				r=mid;
			else
				l=mid+1;
		}
		a[i]=l;
		if (l==cnt)
		{
			b[cnt]=i;
			cnt++;
		}
	}
	cout << 0 << ' ';
	for (int i=1; i<=n; i++)
		cout << a[i] << ' ';
	fflush(stdout);
	return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 5 ms 208 KB Output is correct
2 Correct 6 ms 208 KB Output is correct
3 Correct 7 ms 208 KB Output is correct
4 Correct 7 ms 208 KB Output is correct
5 Correct 3 ms 208 KB Output is correct
6 Correct 3 ms 208 KB Output is correct
7 Correct 5 ms 208 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 4 ms 208 KB Output is correct
2 Correct 5 ms 208 KB Output is correct
3 Correct 5 ms 208 KB Output is correct
4 Correct 7 ms 208 KB Output is correct
5 Correct 5 ms 208 KB Output is correct
6 Correct 4 ms 208 KB Output is correct
7 Correct 4 ms 208 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 208 KB Output is correct
2 Correct 5 ms 208 KB Output is correct
3 Correct 8 ms 208 KB Output is correct
4 Correct 8 ms 208 KB Output is correct
5 Correct 5 ms 208 KB Output is correct
6 Correct 5 ms 208 KB Output is correct
7 Correct 6 ms 208 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 4 ms 208 KB Output is correct
2 Correct 4 ms 208 KB Output is correct
3 Correct 7 ms 208 KB Output is correct
4 Correct 7 ms 208 KB Output is correct
5 Correct 7 ms 208 KB Output is correct
6 Correct 7 ms 208 KB Output is correct
7 Correct 7 ms 208 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 4 ms 208 KB Output is correct
2 Correct 5 ms 208 KB Output is correct
3 Correct 9 ms 208 KB Output is correct
4 Correct 6 ms 208 KB Output is correct
5 Correct 6 ms 208 KB Output is correct
6 Correct 7 ms 208 KB Output is correct
7 Correct 11 ms 208 KB Output is correct