oj.uz

답안 #557126

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
557126 2022-05-04T18:42:10 Z Yazan_Alattar Zagonetka (COI18_zagonetka) C++14
9 / 100
 71 ms 316 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define F first
#define S second
#define pb push_back
#define endl "\n"
#define all(x) x.begin(), x.end()
const int M = 200007;
const ll inf = 2e9;
const ll mod = 1e9 + 7;
const double pi = acos(-1);
const double eps = 1e-6;
const int dx[] = {0, -1, 0, 1}, dy[] = {1, 0, -1, 0};
const int block = 320;

int n, a[M], ans1[M], ans2[M];

bool ask(){
    cout << "query ";
    for(int i = 1; i <= n; ++i) cout << a[i] << " ";
    cout << endl;

    bool ret; cin >> ret;
    return ret;
}

int main(){
//    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n;
    for(int i = 1; i <= n; ++i) cin >> a[i];
    for(int i = 1; i <= n; ++i) a[i] = i;

    do{
        if(ask()){
            if(!ans1[1]) for(int i = 1; i <= n; ++i) ans1[i] = a[i];
            for(int i = 1; i <= n; ++i) ans2[i] = a[i];
        }
    } while(next_permutation(a + 1, a + n + 1));

    cout << "end\n";
    for(int i = 1; i <= n; ++i) cout << ans1[i] << " ";
    cout << endl;
    for(int i = 1; i <= n; ++i) cout << ans2[i] << " ";
    cout << endl;
    return 0;
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 308 KB Output is correct
4 Correct 2 ms 208 KB Output is correct
5 Correct 6 ms 316 KB Output is correct
6 Correct 7 ms 208 KB Output is correct
7 Correct 7 ms 312 KB Output is correct

Subtask #2
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 59 ms 296 KB Execution killed with signal 13
2 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 41 ms 296 KB Execution killed with signal 13
2 Halted 0 ms 0 KB -

Subtask #4
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 71 ms 300 KB Execution killed with signal 13
2 Halted 0 ms 0 KB -