# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
242930 | MatesV13 | Zagonetka (COI18_zagonetka) | C++11 | 13 ms | 384 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;
long long n, x, starix, prvi, drugi;
vector<int> ansmin, ansmax, cur;
int main (){
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cin >> n;
for (int i=0; i<n; i++) cin >> x;
for (int i=1; i<=n; i++) cur.push_back(i);
ansmax.resize(n, 0);
if (n<7){
do {
cout << "query";
for (int i=0; i<n; i++) cout << " " << cur[i];
cout << endl << flush; cin >> x;
if (x){
if (ansmin.empty())
ansmin=cur;
ansmax=cur;
}
} while(next_permutation(cur.begin(), cur.end()));
cout << "end" << endl;
for (int i=0; i<n; i++) cout << ansmin[i] << " "; cout << endl;
for (int i=0; i<n; i++) cout << ansmax[i] << " "; cout << endl << flush;
}
else {
cout << "query" << endl;
for (int i=0; i<n; i++) cout << " " << cur[i];
cout << endl << flush; cin >> starix;
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... |