Submission #643458

#	Time	Username	Problem	Language	Result	Execution time	Memory
643458		andecaandeci	Zagonetka (COI18_zagonetka)	C++17	9 / 100	7 ms	336 KiB

zagonetka

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;
const ll mod=1e9+7;
const ll maxn=2e5+5;
const int INF=1e9;
#define ok ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define fi first
#define se second
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define endl '\n'
int n, arr[maxn], ans[maxn], jwb, ans1[maxn], ans2[maxn];
bool udh;
int main() {
    ok
    cin >> n;
    for(int i=1; i<=n; i++) cin >> arr[i];
    if(n<=6) {
        for(int i=0; i<n; i++) ans[i]=i+1;
        do {
            cout << "query";
            for(int i=0; i<n; i++) cout << " " << ans[i];
            cout << endl;
            cout.flush();
            cin >> jwb;
            if(jwb==1) {
                if(!udh) {
                    for(int i=0; i<n; i++) ans1[i]=ans[i];
                    udh=1;
                }
                for(int i=0; i<n; i++) ans2[i]=ans[i];
            }
        } while(next_permutation(ans, ans+n));
        cout << "end" << endl;
        for(int i=0; i<n; i++) cout << ans1[i] << " ";
        cout << endl;
        for(int i=0; i<n; i++) cout << ans2[i] << " ";
        cout << endl;
        cout.flush();
        return 0;
    }
}

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