oj.uz

Submission #242860

# Submission time Handle Problem Language Result Execution time Memory
242860 2020-06-29T12:48:55 Z VEGAnn Zagonetka (COI18_zagonetka) C++14
100 / 100
 97 ms 512 KB 
#include <bits/stdc++.h>
#define PB push_back
#define sz(x) ((int)x.size())
using namespace std;
const int N = 110;
vector<int> g[N], gr[N];
priority_queue<int, vector<int>, greater<int> > pq;
priority_queue<int> PQ;
int per[N], qur[N], mrk[N], in[N], n, loc[N], out[N];
bool was;

void dfs(int v){
    if (was) return;

    mrk[v] = 1;

    for (int u : g[v]){
        if (was) return;

        if (mrk[u] == 0)
            dfs(u); else
        if (mrk[u] == 1){
            was = 1;
            return;
        }
    }

    mrk[v] = 2;
}

void prit(){
    for (int i = 1; i <= n; i++){
        cout << qur[i];

        if (i == n)
            cout << endl;
        else cout << " ";
    }
}

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

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

    cin >> n;

    for (int i = 1; i <= n; i++) {
        cin >> per[i];
        loc[per[i]] = i;
    }

    for (int vl = 2; vl <= n; vl++)
    for (int pr = vl - 1; pr > 0; pr--){
        gr[loc[pr]].PB(loc[vl]);
        g[loc[vl]].PB(loc[pr]);

        for (int i = 1; i <= n; i++) {
            qur[i] = per[i];
            mrk[i] = 0;
        }

        was = 0;

        for (int i = pr; i <= vl && !was; i++){
            if (mrk[loc[i]]) continue;

            dfs(loc[i]);
        }

        if (was){
            gr[loc[pr]].pop_back();
            g[loc[vl]].pop_back();
            continue;
        }

        for (int i = pr; i <= vl; i++){
            in[loc[i]] = 0;

            for (int u : gr[loc[i]])
                if (per[u] >= pr)
                    in[loc[i]]++;

            if (in[loc[i]] == 0)
                pq.push(loc[i]);
        }

        int cur = pr;

        while (sz(pq) > 0){
            int v = pq.top(); pq.pop();

            qur[v] = cur++;

            for (int u : g[v]){
                if (per[u] < pr) continue;

                in[u]--;

                if (in[u] == 0)
                    pq.push(u);
            }
        }

        cout << "query";

        for (int i = 1; i <= n; i++)
            cout << " " << qur[i];

        cout << endl;

        int res; cin >> res;

        gr[loc[pr]].pop_back();
        g[loc[vl]].pop_back();

        if (res == 0){
            g[loc[pr]].PB(loc[vl]);
            gr[loc[vl]].PB(loc[pr]);
        }
    }

    cout << "end" << endl;

    for (int i = 1; i <= n; i++){
        out[i] = sz(g[i]);

        if (out[i] == 0)
            PQ.push(i);
    }

    int cur = n;

    while (sz(PQ) > 0){
        int v = PQ.top(); PQ.pop();

        qur[v] = cur--;

        for (int u : gr[v]){
            out[u]--;

            if (out[u] == 0)
                PQ.push(u);
        }
    }

    prit();

    for (int i = 1; i <= n; i++){
        in[i] = sz(gr[i]);

        if (in[i] == 0)
            PQ.push(i);
    }

    fill(qur + 1, qur + n + 1, -1);

    cur = 1;

    while (sz(PQ) > 0){
        int v = PQ.top(); PQ.pop();

        qur[v] = cur++;

        for (int u : g[v]){
            in[u]--;

            if (in[u] == 0)
                PQ.push(u);
        }
    }

    prit();

    return 0;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 288 KB Output is correct
2 Correct 38 ms 384 KB Output is correct
3 Correct 43 ms 384 KB Output is correct
4 Correct 44 ms 384 KB Output is correct
5 Correct 13 ms 384 KB Output is correct
6 Correct 48 ms 384 KB Output is correct
7 Correct 9 ms 384 KB Output is correct
8 Correct 11 ms 384 KB Output is correct
9 Correct 38 ms 384 KB Output is correct
10 Correct 20 ms 384 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 10 ms 384 KB Output is correct
4 Correct 11 ms 384 KB Output is correct
5 Correct 7 ms 384 KB Output is correct
6 Correct 9 ms 384 KB Output is correct
7 Correct 9 ms 384 KB Output is correct
8 Correct 11 ms 384 KB Output is correct
9 Correct 10 ms 384 KB Output is correct
10 Correct 6 ms 384 KB Output is correct
11 Correct 9 ms 384 KB Output is correct
12 Correct 9 ms 384 KB Output is correct

Subtask #4
51.0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 82 ms 384 KB Output is correct
2 Correct 88 ms 480 KB Output is correct
3 Correct 67 ms 384 KB Output is correct
4 Correct 9 ms 384 KB Output is correct
5 Correct 9 ms 512 KB Output is correct
6 Correct 8 ms 384 KB Output is correct
7 Correct 19 ms 384 KB Output is correct
8 Correct 36 ms 384 KB Output is correct
9 Correct 28 ms 392 KB Output is correct
10 Correct 84 ms 504 KB Output is correct
11 Correct 68 ms 384 KB Output is correct
12 Correct 83 ms 384 KB Output is correct
13 Correct 94 ms 504 KB Output is correct
14 Correct 74 ms 504 KB Output is correct
15 Correct 97 ms 384 KB Output is correct
16 Correct 80 ms 384 KB Output is correct