# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
475741 | soba | Carnival (CEOI14_carnival) | C++14 | 47 ms | 328 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int par[151], siz[151];
int fnd(int node)
{
if(par[node]!=node)
{
return par[node]=fnd(par[node]);
}
return par[node]=node;
}
void uni(int a, int b)
{
a=fnd(a);
b=fnd(b);
if(a==b)
return;
if(siz[a]>siz[b])
{
par[b]=a;
siz[a]++;
}
else
{
par[a]=b;
siz[b]++;
}
return ;
}
int main()
{
int n;
cin >> n;
int start=1 , nxt , q;
for(int i =1 ; i<= n ;i++)
{
siz[i]=1;
par[i]=i;
}
int head[151] , had, expected=2 , hh;
for(int i =2 ; i<= n ; i++)
{
//cout << expected << "\n";
cout << i << " ";
for(int j =1 ; j<= i ; j++)
{
cout << j << " ";
}
cout << "\n";
cout.flush();
cin >> had;
if(had==expected)
{
head[i]++;
expected++;
//cout << "here\n";
continue;
}
hh=1;
for(int j = 2 ; j< i ; j++)
{
if(!head[j])continue;
cout << 2 << " " << i << " " << j << "\n";
cout.flush();
cin >> q ;
if(q==1)
{
uni(i , j);
hh=j;
break;
}
}
if(hh==1)
{
uni(i,1);
}
expected=had+1;
}
int cnt=1;
map<int,int>mp;
for(int i =1 ; i<=n ; i++)
{
q=fnd(i);
if(mp[q]==0)mp[q]=cnt++;
}
cout << 0 << " ";
for(int i =1 ; i<=n ; i++)
{
q=fnd(i);
cout <<mp[q] << " ";
}
cout <<"\n";
cout.flush();
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |