Submission #557126

#	Time	Username	Problem	Language	Result	Execution time	Memory
557126		Yazan_Alattar	Zagonetka (COI18_zagonetka)	C++14	9 / 100	71 ms	316 KiB

zagonetka

#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 / 9
• Subtask 2: 0 / 18
• Subtask 3: 0 / 22
• Subtask 4: 0 / 51