Submission #1188399

#TimeUsernameProblemLanguageResultExecution timeMemory
1188399comxddddddCarnival (CEOI14_carnival)C++20
0 / 100
3 ms408 KiB
#include <bits/stdc++.h> using namespace std; int N, t; vector<int> costume; vector<bool> found; int main() { cin >> N; costume.resize(N + 1); found.resize(N + 1); for(int i = 1; i < N + 1; i++) { costume[i] = i; } for (int i = 1; i < N; i++) { if(found[i]){ continue; } for (int j = i + 1; j < N + 1; j++) { if (costume[i] != costume[j] && !found[j]) { cout << "2 " << i << " " << j << endl; cin >> t; if (t == 1) { costume[j] = costume[i]; found[j] = true; } } } found[i] = true; } cout << "0 "; for(int i = 1; i < N + 1; i++){ cout << costume[i] << " "; } cout << endl; }
#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...