oj.uz

Submission #921246

# Submission time Handle Problem Language Result Execution time Memory
921246 2024-02-03T15:31:53 Z PM1 Carnival (CEOI14_carnival) C++17
0 / 100
 5 ms 344 KB 
#include <bits/stdc++.h>
using namespace std;
const int mxn=155;
int n,comp[mxn],sz,cnt;
bool a[mxn];
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		a[i]=1;
		sz++;
		cout<<sz<<endl;
		for(int j=1;j<=i;j++){
			if(a[j])cout<<j<<endl;
		}
		int x;
		cin>>x;
		if(x==sz){
			comp[i]=++cnt;
			continue;
		}
		int L=1,R=sz;
		while(R-L>1){
			int mid=(L+R)/2,sum=0;
			cout<<mid-L+1<<endl;
			for(int j=1;j<=i;j++){
				sum+=a[j];
				if(a[j] && sum>=L && sum<mid)cout<<j<<endl;
			}
			cout<<i<<endl;
			cin>>x;
			if(x==mid-L+1)
				L=mid;
			else
				R=mid;
		}
		comp[i]=comp[L];
		a[i]=0;
		sz--;
	}
	cout<<0<<endl;
	for(int i=1;i<=n;i++)
		cout<<comp[i]<<endl;
}

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 3 ms 344 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

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

Subtask #4
0 / 20.0

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

Subtask #5
0 / 20.0

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