Submission #240755

#	Time	Username	Problem	Language	Result	Execution time	Memory
240755		VEGAnn	Zagonetka (COI18_zagonetka)	C++14	9 / 100	13 ms	512 KiB

zagonetka

#include <bits/stdc++.h>
#define PB push_back
#define all(x) x.begin(),x.end()
#define sz(x) ((int)x.size())
using namespace std;
const int N = 100100;
vector<vector<int> > ans;
vector<int> vc;
int n, p[N];

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);

#ifdef _LOCAL
//    freopen("in.txt","r",stdin);
#endif // _LOCAL

    cin >> n;

    assert(n <= 6);

    for (int i = 1; i <= n; i++)
        cin >> p[i];

    for (int i = 1; i <= n; i++)
        vc.PB(i);

    do{
        cout << "query";

        for (int cr : vc)
            cout << " " << cr;
        cout << endl;

        int res; cin >> res;

        if (res == 1)
            ans.PB(vc);
    } while (next_permutation(all(vc)));

    sort(all(ans));

    cout << "end" << endl;

    for (int cr : ans[0]) {
        cout << cr;

        if (cr == ans[0].back())
            cout << endl;
        else cout << " ";
    }

    for (int cr : ans.back()) {
        cout << cr;

        if (cr == ans.back().back())
            cout << endl;
        else cout << " ";
    }

    return 0;
}

• Subtask 1: 9 / 9
• Subtask 2: 0 / 18
• Subtask 3: 0 / 22
• Subtask 4: 0 / 51