oj.uz

Submission #116773

# Submission time Handle Problem Language Result Execution time Memory
116773 2019-06-13T19:51:45 Z ioilolcom Carnival (CEOI14_carnival) C++14
0 / 100
 14 ms 404 KB 
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
typedef long long int ll;
const int N=125;
int P[N],ans[N];
int cnt=0;
int query(int e,int a){
	if(a<=e) {
		cout<<e<<" ";
		for(int i=1; i<=e; i++) {
			cout<<i<<" ";
		}
		cout<<endl;
		fflush(stdout);
	}
	else{
		cout<<e+1<<" ";
		for(int i=1; i<=e; i++) {
			cout<<i<<" ";
		}
		cout<<a<<endl;
		fflush(stdout);
	}
	int cur;
	cin>>cur;
	return cur;
}
int main()
{
	int n; cin>>n;
	for(int i=1; i<=n; i++) {
		P[i]=query(i,0);
	}
	for(int i=1; i<=n; i++) {
		int l=1; int r=i;
		while(l<r) {
			int mid=(l+r)/2;
			if(P[mid]==query(mid,i)) {
				r=mid;
			}
			else{
				l=mid+1;
			}
		}
		if(i==l) {
			ans[i]=++cnt;
		}
		else{
			ans[i]=ans[l];
		}
	}
	cout<<0<<" ";
	for(int i=1; i<=n; i++) {
		cout<<ans[i]<<" ";
	}
	cout<<endl;
	return 0;
}

Subtask #1
0 / 20.0

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

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 384 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 256 KB Output is correct
2 Incorrect 10 ms 384 KB Incorrect
3 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 404 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 14 ms 256 KB Incorrect
2 Halted 0 ms 0 KB -