oj.uz

Submission #862241

# Submission time Handle Problem Language Result Execution time Memory
862241 2023-10-17T19:49:34 Z Rifal Zagonetka (COI18_zagonetka) C++14
9 / 100
 37 ms 444 KB 
#include <bits/stdc++.h>
#include <fstream>
///#define endl '\n'
#define mod 998244353
#define INF 900000000
//#define cin fin
//#define cout fout
//#define fi first
//#define se second
using namespace std;
//ofstream fout("intel.out");
//ifstream fin("intel.in");

int main()
{
    ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
    int n; cin >> n; int arr[n], cur[n], ans1[n], ans2[n];
    for(int i = 0; i <  n; i++) {
        cin >> arr[i];
    }
    for(int i = 0; i < n; i++) {
        cur[i] = i+1;
    }
    cout << "query ";
    for(int i = 0; i < n; i++) cout << cur[i] << " ";
    cout << endl;
    int x; cin >> x;
    if(x == 0) {
          while(next_permutation(cur,cur+n)) {
            cout << "query ";
             for(int i = 0; i < n; i++) cout << cur[i] << " ";
              cout << endl; cin >> x;
              if(x == 1) break;
          }
    }
    for(int i = 0; i < n; i++) ans1[i] = cur[i];
     bool ok = false;
    while(next_permutation(cur,cur+n)) {
        cout << "query ";
         for(int i = 0; i < n; i++) cout << cur[i] << " ";
          cout << endl; cin >> x;
          if(x == 1) {
            ok = true;
            for(int i = 0; i < n; i++) ans2[i] = cur[i];
          }
    }
    if(!ok) {
        for(int i = 0; i < n ; i++) ans2[i] = ans1[i];
    }
    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;
    
 return 0;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 344 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

Subtask #2
0 / 18.0

# Verdict Execution time Memory Grader output
1 Runtime error 26 ms 424 KB Execution killed with signal 13
2 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Runtime error 31 ms 444 KB Execution killed with signal 13
2 Halted 0 ms 0 KB -

Subtask #4
0 / 51.0

# Verdict Execution time Memory Grader output
1 Runtime error 37 ms 444 KB Execution killed with signal 13
2 Halted 0 ms 0 KB -