oj.uz

답안 #168040

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
168040 2019-12-11T07:47:29 Z egekabas Zagonetka (COI18_zagonetka) C++14
0 / 100
 16 ms 376 KB 
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long   ll;
typedef unsigned long long   ull;
typedef long double ld;
typedef pair<ll, ll>    pll;
typedef pair<ull, ull>    pull;
typedef pair<int, int>  pii;
typedef pair<ld, ld>  pld;
int n;
int a[109];
int b[109];
int q(int ar[]){
    cout << "query ";
    for(int i = 0; i < n; ++i){
        cout << ar[i] << " ";
    }
    cout << endl;
    int t1;
    cin >> t1;
    return t1;
}

void sf1(int l, int r){
    if(l >= r)
        return;
    int mini = 1e9;
    int id = -1;
    for(int i = l; i <= r; ++i){
        if(a[i] < mini){
            mini = a[i];
            id = i;
        }
    }
    sf1(l, id-1);
    for(id = id-1; id >= l; --id){
        swap(a[id+1], a[id]);
        if(q(a) == 0){
            swap(a[id+1], a[id]);
            break;
        }
    }
    id++;
    sf1(id+1, r);
}
void sf2(int l, int r){
    if(l >= r)
        return;
    int maxi = -1e9;
    int id = -1;
    for(int i = l; i <= r; ++i){
        if(b[i] > maxi){
            maxi = b[i];
            id = i;
        }
    }
    sf2(l, id-1);
    for(id = id-1; id >= l; --id){
        swap(b[id+1], b[id]);
        if(q(b) == 0){
            swap(b[id+1], b[id]);
            break;
        }
    }
    id++;
    sf2(id+1, r);
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    
    //freopen("in.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);
    
    cin >> n;
    for(int i = 0; i < n; ++i){
        cin >> a[i];
        b[i] = a[i];
    }
    sf1(0, n-1);
    sf2(0, n-1);
    cout << "end\n";
    for(int i = 0; i < n; ++i)
        cout << a[i] << " ";
    cout << "\n";

    for(int i = 0; i < n; ++i)
        cout << b[i] << " ";
    cout << "\n";
}

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 2 ms 248 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 248 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 16 ms 252 KB Output isn't correct
2 Halted 0 ms 0 KB -