Submission #531745

#TimeUsernameProblemLanguageResultExecution timeMemory
531745devariaotaCarnival (CEOI14_carnival)C++17
0 / 100
1 ms200 KiB
#include <iostream> #include <map> #include <algorithm> 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.count({x, y})) { return mp[{x, y}]; } cout << "2 " << x << " " << y << endl; int z; cin >> z; return mp[{x, y}] = z; } int main(){ cin.tie(0) -> ios_base::sync_with_stdio(0); cin >> n; for(int i=0;i<n;i++) a[i] = i + 1; for(int i=0;i<n;i++) { for(int j=0;j<i;j++) { int x = ask(a[i], a[j]); if(x == 1) { a[i] = a[j]; } } } cout << "0 " << flush; for(int i=0;i<n;i++) cout << a[i] << " "; cout << endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...