제출 #103821

#제출 시각아이디문제언어결과실행 시간메모리
103821ShtefZagonetka (COI18_zagonetka)C++14
9 / 100
3094 ms416 KiB
#include <iostream> #include <vector> #include <algorithm> using namespace std; vector <int> a, mini, maxi; int n; void pitaj(){ cout << "query "; for(int i = 0 ; i < n ; ++i){ cout << a[i]; if(i < n - 1){ cout << " "; } } cout << endl; cout.flush(); } int main(){ ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n; for(int i = 0 ; i < n ; ++i){ int x; cin >> x; a.push_back(i + 1); } cout.flush(); do{ pitaj(); bool p; cin >> p; cout.flush(); if(p){ maxi = a; if(mini.empty()){ mini = a; } } }while(next_permutation(a.begin(), a.end())); cout << "end" << endl; cout.flush(); for(int i = 0 ; i < n ; ++i){ cout << mini[i] << ' '; } cout << endl; for(int i = 0 ; i < n ; ++i){ cout << maxi[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...