oj.uz

Submission #112714

# Submission time Handle Problem Language Result Execution time Memory
112714 2019-05-21T15:51:38 Z Budi145 Carnival (CEOI14_carnival) C++14
100 / 100
 21 ms 540 KB 
#include <bits/stdc++.h>
using namespace std;

int N, memo[200][200], c[200], ind;
int nanya = 0;

int tanya(int l, int r) {
	if (r-l+1 < 2) return r-l+1;
	int &ret = memo[l][r];
	if (ret != -1) return ret;
	nanya++;
	assert(nanya<1700);
	cout << r-l+1;
	for (;l<=r;l++) cout << " " << l;
	cout << endl;
	fflush(stdout);
	cin >> ret;
	return ret;
}

int main() {
	cin >> N;
	memset(memo, -1, sizeof(memo));
	memset(c, -1, sizeof(c));
	for (int i = 1; i <= N; i++) {
		if (c[i] == -1) {
			ind++;
			c[i] = ind;
		}
		if (tanya(i, N)>tanya(i+1, N)) continue;
		int L = i+1;
		int R = N;
		while (L<R) {
			int md = (L+R)/2;
			int t1 = tanya(i, md);
			int t2 = tanya(i+1, md);
			if (t2<t1){
				L = md+1;
			} else {
				R = md;
			}
		}
		c[L] = c[i];
	}
	cout << "0";
	for (int i = 1; i <= N; i++) cout << " " << c[i];
	cout << endl;
	return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 384 KB Output is correct
2 Correct 13 ms 384 KB Output is correct
3 Correct 10 ms 512 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 13 ms 512 KB Output is correct
6 Correct 8 ms 384 KB Output is correct
7 Correct 12 ms 384 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 384 KB Output is correct
2 Correct 21 ms 384 KB Output is correct
3 Correct 6 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 8 ms 384 KB Output is correct
6 Correct 8 ms 512 KB Output is correct
7 Correct 14 ms 512 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 512 KB Output is correct
2 Correct 13 ms 512 KB Output is correct
3 Correct 18 ms 384 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 16 ms 384 KB Output is correct
6 Correct 12 ms 512 KB Output is correct
7 Correct 18 ms 384 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 512 KB Output is correct
2 Correct 13 ms 384 KB Output is correct
3 Correct 9 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 14 ms 384 KB Output is correct
6 Correct 9 ms 540 KB Output is correct
7 Correct 13 ms 384 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 512 KB Output is correct
2 Correct 10 ms 512 KB Output is correct
3 Correct 11 ms 512 KB Output is correct
4 Correct 9 ms 512 KB Output is correct
5 Correct 10 ms 512 KB Output is correct
6 Correct 8 ms 384 KB Output is correct
7 Correct 6 ms 512 KB Output is correct