Submission #1222684

#TimeUsernameProblemLanguageResultExecution timeMemory
122268412345678Zagonetka (COI18_zagonetka)C++20
9 / 100
2 ms416 KiB
#include <bits/stdc++.h> using namespace std; const int nx=10; int n, p[nx], c[nx], mn[nx], mx[nx], x, f; int main() { cin >> n; for (int i=1; i<=n; i++) cin>>p[i], c[i]=i; do { cout<<"query "; for (int i=1; i<=n; i++) cout<<c[i]<<' '; cout<<endl; cin>>x; if (x) { for (int i=1; i<=n; i++) mx[i]=c[i]; if (!f) { f=1; for (int i=1; i<=n; i++) mn[i]=c[i]; } } } while (next_permutation(c+1, c+n+1)); cout<<"end"<<endl; for (int i=1; i<=n; i++) cout<<mn[i]<<' '; cout<<endl; for (int i=1; i<=n; i++) cout<<mx[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...