oj.uz

Submission #574961

# Submission time Handle Problem Language Result Execution time Memory
574961 2022-06-09T13:26:33 Z Dodo Carnival (CEOI14_carnival) C++14
0 / 100
 19 ms 328 KB 
#include <bits/stdc++.h>
#define ll long long
#define pb push_back

using namespace std;
ll inf =1e12;
const ll mx=155;

ll arr[mx];
vector<ll>v[155];
ll vis[mx+1];
ll c=0;

void dfs(ll x)
{
	vis[x]=c;
	for(auto u:v[x])
		if(!vis[u])dfs(u);
}

ll cnt (ll l,ll r)
{
	ll k=0;
	for(int i=l;i<=r;i++)if(arr[i]==0)k++;
	return k;
}

ll call (ll k,ll l,ll r)
{
	if(k==1)return 1;
	if(l==r)return k;

	cout<<k<<endl;
	for(int i=l;i<=r;i++)if(arr[i]==0)cout<<i<<' ';
	cout<<endl;
	fflush(stdout);

	ll x;
	cin>>x;
	return x;
}

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	ll n;
	cin>>n;
	ll l=1,r=2;

	while(r<=n)
	{
		ll k=cnt(l,r);
		ll ans=call(k,l,r);

		if(ans!=k)
		{
			ll le=l+1,ri=r;

				while(le<=ri)
				{
					ll k=cnt(le,ri);
					ll ans=call(k,le,ri);

						if(ans==k)
						{
							v[le-1].push_back(r);
							arr[le-1]=1;
							break;
						}
						else le++;

				}
		}

		r++;
		while(arr[l]==1&&l+1<r)l++;
	}

	for(int i=1;i<=n;i++)
	{
		if(vis[i]==0)
		{
			c++;
			dfs(i);
		}
	}
	for(int i=1;i<=n;i++)cout<<vis[i]<<' ';
	fflush(stdout);

	return 0;
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 19 ms 208 KB Same person came twice to the party.
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 328 KB Same person came twice to the party.
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 328 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 208 KB Same person came twice to the party.
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 324 KB Same person came twice to the party.
2 Halted 0 ms 0 KB -