oj.uz

Submission #1084332

# Submission time Handle Problem Language Result Execution time Memory
1084332 2024-09-05T22:21:55 Z 4QT0R Carnival (CEOI14_carnival) C++17
0 / 100
 8 ms 344 KB 
#include <bits/stdc++.h>
using namespace std;

int odp[152];
int dif[152];
int comm(int l, int r, int ind){
	if (l==r)return l;
	int md=(l+r)/2;

	int query;
	cout << md-l+2 << ' ';
	for (int j = l; j<=md; j++)cout << j << ' ';
	cout << ind << endl;
	cin >> query;

	if (query==(dif[md]-dif[l-1]))return comm(l,md,ind);
	else return comm(md+1,r,ind);
}

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);

	int n;
	cin >> n;
	odp[1]=1;
	dif[1]=1;
	int spoj=1;
	for (int i = 2; i<=n; i++){
		cout << i << ' ';
		for (int j = 1; j<=i; j++)cout << j << ' ';
		cout << endl;
		cin >> dif[i];
		if (dif[i]>spoj){
			odp[i]=++spoj;
			continue;
		}
		odp[i]=odp[comm(1,i-1,i)];
	}
	cout << "0 ";
	for (int i = 1; i<=n; i++)cout << odp[i] << ' ';
	cout << '\n';
	return 0;
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 344 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 344 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 344 KB Output is correct
2 Incorrect 5 ms 344 KB Incorrect
3 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 344 KB Output is correct
2 Incorrect 8 ms 344 KB Incorrect
3 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 344 KB Output is correct
2 Incorrect 7 ms 344 KB Incorrect
3 Halted 0 ms 0 KB -