# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
531549 | andecaandeci | 사육제 (CEOI14_carnival) | C++17 | 1 ms | 200 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;
int a[151], n;
map<pair<int,int>, int> mp;
int ask(int x, int y){
if(x > y) swap(x, y);
if(mp.find({x, y}) != mp.end())
{
return mp[{x, y}];
}
cout << "2 " << x << " " << y << endl;
int z;
cin >> z;
mp[{x, y}] = z;
return z;
}
int main(){
cin.tie(0) -> ios_base::sync_with_stdio(0);
cin >> n;
iota(a, a + n, 1);
for(int i=0;i<n;i++)
{
for(int j=0;j<i;j++)
{
if(ask(a[i], a[j]) == 1)
{
a[i] = a[j];
}
}
}
cout << "0 ";
for(int i=0;i<n;i++) cout << a[i] << " "; cout << endl;
}
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... |