oj.uz

Submission #1040046

# Submission time Handle Problem Language Result Execution time Memory
1040046 2024-07-31T14:39:51 Z vjudge1 Carnival (CEOI14_carnival) C++17
100 / 100
 6 ms 460 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define ll long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pld pair<ld, ld>
#define pb push_back
#define fi first
#define se second
#define debug(x) cerr << #x << " => " << x << endl
#define all(x) x.begin(),x.end()

int ans[155];

int ask(int x,int y)
{
	cout<<y-x+1<<' ';
	for(int i=x;i<=y;i++) cout<<i<<' ';
	cout<<endl;
	int a;cin>>a;
	return a;
}

int sz(int x,int y)
{
	set<int> s;
	for(int i=x;i<=y;i++) s.insert(ans[i]);
	return s.size();
}

int main()
{
	ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
	int n;cin>>n;
	ans[1]=1;
	for(int i=2;i<=n;i++)
	{
		int a=sz(1,i-1);
		int b=ask(1,i);
		if(a!=b)
		{
			ans[i]=b;
			continue;
		}
		int l=1,r=i-1,id=1;
		while(l<=r)
		{
			int mid=(l+r)/2;
			int x=sz(mid,i-1);
			int y=ask(mid,i);
			if(x==y) l=mid+1,id=mid;
			else r=mid-1;
		}
		ans[i]=ans[id];
	}
	cout<<0<<' ';
	for(int i=1;i<=n;i++) cout<<ans[i]<<' ';
	cout<<endl;
	return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 340 KB Output is correct
2 Correct 6 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 5 ms 412 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 5 ms 344 KB Output is correct
2 Correct 5 ms 340 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 4 ms 344 KB Output is correct
2 Correct 5 ms 344 KB Output is correct
3 Correct 5 ms 344 KB Output is correct
4 Correct 2 ms 460 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 348 KB Output is correct
2 Correct 6 ms 340 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 452 KB Output is correct
6 Correct 3 ms 456 KB Output is correct
7 Correct 5 ms 344 KB Output is correct

Subtask #5
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 5 ms 344 KB Output is correct
4 Correct 4 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