oj.uz

Submission #918589

# Submission time Handle Problem Language Result Execution time Memory
918589 2024-01-30T07:13:32 Z vjudge1 Carnival (CEOI14_carnival) C++17
100 / 100
 6 ms 596 KB 
#include<iostream>

using namespace std;


int  n, color;


int c[200], cn[200];


int main(){
	cin>>n;
	++color, c[1]=color, cn[1]=1;
	for(int i=2; i<=n; ++i){
		cout<<i<<' ';
		for(int j=1; j<=i; ++j){
			cout<<j<<' ';
		}
		cout<<endl;
		cin>>cn[i];
		if(cn[i] ^ cn[i-1]){
			c[i]=++color;
			continue;
		}
		
		
		
		int l=1, r=i-1, mid, best, cnt;
		
		while(l<=r){
			mid=l+((r-l)>>1);
			cout<<mid+1<<' ';
			for(int k=1; k<=mid; ++k){
				cout<<k<<' ';
			}
			cout<<i<<endl;
			cin>>cnt;
			if(cnt == cn[mid]){
				r=mid-1;
				best=mid;
			}else{
				l=mid+1;
			}		
			
		}
		c[i]=c[best];
			
	}
	
	for(int i=0; i<=n; ++i){
		cout<<c[i]<<' ';
	}
	cout<<endl;
	
	return 0;
}

Compilation message

carnival.cpp: In function 'int main()':
carnival.cpp:47:14: warning: 'best' may be used uninitialized in this function [-Wmaybe-uninitialized]
   47 |   c[i]=c[best];
      |        ~~~~~~^

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 344 KB Output is correct
2 Correct 4 ms 344 KB Output is correct
3 Correct 3 ms 344 KB Output is correct
4 Correct 2 ms 344 KB Output is correct
5 Correct 4 ms 344 KB Output is correct
6 Correct 4 ms 344 KB Output is correct
7 Correct 4 ms 344 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 344 KB Output is correct
2 Correct 5 ms 344 KB Output is correct
3 Correct 2 ms 344 KB Output is correct
4 Correct 2 ms 344 KB Output is correct
5 Correct 5 ms 344 KB Output is correct
6 Correct 5 ms 344 KB Output is correct
7 Correct 5 ms 344 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 344 KB Output is correct
2 Correct 6 ms 344 KB Output is correct
3 Correct 5 ms 344 KB Output is correct
4 Correct 2 ms 344 KB Output is correct
5 Correct 4 ms 344 KB Output is correct
6 Correct 4 ms 344 KB Output is correct
7 Correct 4 ms 344 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 344 KB Output is correct
2 Correct 5 ms 344 KB Output is correct
3 Correct 3 ms 344 KB Output is correct
4 Correct 2 ms 344 KB Output is correct
5 Correct 4 ms 344 KB Output is correct
6 Correct 3 ms 344 KB Output is correct
7 Correct 4 ms 344 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 596 KB Output is correct
2 Correct 5 ms 344 KB Output is correct
3 Correct 4 ms 344 KB Output is correct
4 Correct 5 ms 344 KB Output is correct
5 Correct 3 ms 344 KB Output is correct
6 Correct 3 ms 344 KB Output is correct
7 Correct 2 ms 344 KB Output is correct