oj.uz

Submission #171340

# Submission time Handle Problem Language Result Execution time Memory
171340 2019-12-28T11:12:50 Z MvC Carnival (CEOI14_carnival) C++11
100 / 100
 13 ms 424 KB 
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define mkp make_pair
#define in insert
#define er erase
#define fd find
#define fr first
#define sc second
typedef long long ll;
typedef long double ld;
const ll INF=0x3f3f3f3f3f3f3f3f;
const ll llinf=(1LL<<62);
const int inf=(1<<30);
const int nmax=1e5+50;
const int mod=1e9+7;
using namespace std;
int n,i,j,t,l,r,mid,p[155],a[155],c[155],col,rs,x;
int main()
{
	//freopen("sol.in","r",stdin);
	//freopen("sol.out","w",stdout);
	//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
	ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
	cin>>n;
	for(i=1;i<=n;i++)p[i]=i;
	a[++j]=1;
	for(i=2;i<=n;i++)
	{
		cout<<j+1<<" "<<i;
		for(t=1;t<=j;t++)cout<<" "<<a[t];
		cout<<endl;
		cin>>x;
		if(x==j+1)a[++j]=i;
		else
		{
			l=1,r=j,rs=1;
			while(l<=r)
			{
				if(l==r)
				{
					rs=l;
					break;
				}
				mid=(l+r)/2;
				cout<<mid-l+2<<" "<<i;
				for(t=l;t<=mid;t++)cout<<" "<<a[t];
				cout<<endl;
				cin>>x;
				if(x==mid-l+2)l=mid+1;
				else rs=mid,r=mid;
			}
			p[i]=a[rs];
		}
	}
	cout<<0;
	for(i=1;i<=n;i++)
	{
		if(!c[p[i]])c[p[i]]=++col;
		cout<<" "<<c[p[i]];
	}
	cout<<endl;
	return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 248 KB Output is correct
2 Correct 9 ms 300 KB Output is correct
3 Correct 6 ms 248 KB Output is correct
4 Correct 6 ms 248 KB Output is correct
5 Correct 7 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 296 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 248 KB Output is correct
2 Correct 13 ms 376 KB Output is correct
3 Correct 6 ms 248 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 8 ms 248 KB Output is correct
6 Correct 9 ms 248 KB Output is correct
7 Correct 8 ms 248 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 248 KB Output is correct
2 Correct 5 ms 248 KB Output is correct
3 Correct 9 ms 424 KB Output is correct
4 Correct 6 ms 248 KB Output is correct
5 Correct 7 ms 248 KB Output is correct
6 Correct 8 ms 296 KB Output is correct
7 Correct 5 ms 320 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 376 KB Output is correct
2 Correct 10 ms 296 KB Output is correct
3 Correct 6 ms 376 KB Output is correct
4 Correct 5 ms 248 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 4 ms 248 KB Output is correct
7 Correct 5 ms 324 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 248 KB Output is correct
2 Correct 6 ms 420 KB Output is correct
3 Correct 6 ms 376 KB Output is correct
4 Correct 10 ms 296 KB Output is correct
5 Correct 7 ms 296 KB Output is correct
6 Correct 9 ms 376 KB Output is correct
7 Correct 6 ms 376 KB Output is correct