# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1044093 | 2024-08-05T07:19:22 Z | vjudge1 | Zagonetka (COI18_zagonetka) | C++17 | 46 ms | 592 KB |
#include<bits/stdc++.h> using namespace std; void print(vector<int> v) { for(int i = 0; i + 1 < v.size(); i++) cout << v[i] << ' '; cout << v.back() << endl; } bool ask(vector<int> v) { cout << "query "; print(v); bool res; cin >> res; return res; } void out(vector<int> a, vector<int> b) { cout << "end\n"; print(a); print(b); exit(0); } int main() { int n; cin >> n; vector<int> p(n), a, b; for(int i = 0; i < n; i ++) cin >> p[i]; a = b = p; sort(p.begin(), p.end()); do { bool res = ask(p); if(res) a = min(a, p), b = max(a, p); } while(next_permutation(p.begin(), p.end())); out(a, b); return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 344 KB | Output is correct |
2 | Correct | 1 ms | 340 KB | Output is correct |
3 | Correct | 1 ms | 344 KB | Output is correct |
4 | Correct | 1 ms | 344 KB | Output is correct |
5 | Correct | 3 ms | 344 KB | Output is correct |
6 | Correct | 3 ms | 344 KB | Output is correct |
7 | Correct | 3 ms | 344 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 46 ms | 412 KB | Execution killed with signal 13 |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 26 ms | 412 KB | Execution killed with signal 13 |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 45 ms | 592 KB | Execution killed with signal 13 |
2 | Halted | 0 ms | 0 KB | - |