oj.uz

Submission #286103

# Submission time Handle Problem Language Result Execution time Memory
286103 2020-08-30T06:22:21 Z PeppaPig Zagonetka (COI18_zagonetka) C++14
100 / 100
 108 ms 512 KB 
#include <bits/stdc++.h>

#define pii pair<int, int>
#define x first
#define y second

using namespace std;

const int N = 105;

int n;
int p[N], pos[N], tmp[N];
vector<int> con[N], g[N];
vector<pii> E;

vector<int> toposort(int l, int r) {
    queue<int> Q;
    vector<int> deg(n + 1), ret;
    for(int i = l; i <= r; i++) for(int x : g[pos[i]])
        ++deg[x];
    for(int i = l; i <= r; i++) if(!deg[pos[i]])
        Q.emplace(pos[i]);
    while(!Q.empty()) {
        int u = Q.front(); Q.pop();
        ret.emplace_back(u);
        for(int v : g[u]) if(!--deg[v])
            Q.emplace(v);
    }
    return ret;
}

bool ask() {
    vector<int> vec(n + 1);
    for(int i = 1; i <= n; i++) vec[tmp[i]] = i;
    printf("query ");
    for(int i = 1; i <= n; i++) printf("%d ", vec[i]);
    printf("\n"), fflush(stdout);
    int ret;
    scanf("%d", &ret);
    return !ret;
}

int chk[N];
set<int> cand[N];

void get_cand(int u) {
    chk[u] = true;
    cand[u].emplace(u);
    for(int v : g[u]) {
        if(!chk[v]) get_cand(v);
        for(int x : cand[v]) cand[u].emplace(x);
    }
}

void get_answer(int u, vector<int> &ans) {
    chk[u] = true;
    for(int x : cand[u]) {
        if(!chk[x])
            get_answer(x, ans);
    }
    ans.emplace_back(u);
}

vector<int> solve() {
    vector<int> ans;
    for(int i = 1; i <= n; i++) if(!chk[i]) get_cand(i);
    memset(chk, 0, sizeof chk);
    for(int i = 1; i <= n; i++) if(!chk[i]) get_answer(i, ans); 
    return ans;
}

int main() {
    scanf("%d", &n);
    for(int i = 1; i <= n; i++) {
        scanf("%d", p + i);
        pos[p[i]] = i;
    }
    for(int i = n - 1; i; i--) for(int j = i + 1; j <= n; j++) {
        for(int k = i; k <= j; k++) {
            g[pos[k]].clear();
            for(int x : con[pos[k]]) if(i <= p[x] && p[x] <= j)
                g[pos[k]].emplace_back(x);
        }
        g[pos[j]].emplace_back(pos[i]);

        vector<int> order = toposort(i, j);
        if((int)order.size() != j - i + 1) continue;
        for(int k = 1; k <= n; k++) {
            if(i <= k && k <= j) tmp[k] = order[k - i];
            else tmp[k] = pos[k];
        }
        if(ask()) con[pos[i]].emplace_back(pos[j]);
    }
    printf("end\n"), fflush(stdout);

    vector<int> ans;
    for(int i = 1; i <= n; i++) g[i].clear(), cand[i].clear();
    for(int i = 1; i <= n; i++) for(int x : con[i]) g[x].emplace_back(i);
    ans = solve();
    for(int i = 1; i <= n; i++) tmp[ans[i - 1]] = i;
    for(int i = 1; i <= n; i++) printf("%d ", tmp[i]);
    printf("\n"), fflush(stdout);

    memset(chk, 0, sizeof chk);
    for(int i = 1; i <= n; i++) g[i].clear(), cand[i].clear();
    for(int i = 1; i <= n; i++) for(int x : con[i]) g[i].emplace_back(x);
    ans = solve();
    for(int i = 1; i <= n; i++) tmp[ans[i - 1]] = n - i + 1;
    for(int i = 1; i <= n; i++) printf("%d ", tmp[i]);
    printf("\n"), fflush(stdout);

    return 0;
}

Compilation message

zagonetka.cpp: In function 'bool ask()':
zagonetka.cpp:39:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   39 |     scanf("%d", &ret);
      |     ~~~~~^~~~~~~~~~~~
zagonetka.cpp: In function 'int main()':
zagonetka.cpp:73:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   73 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
zagonetka.cpp:75:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   75 |         scanf("%d", p + i);
      |         ~~~~~^~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 384 KB Output is correct
2 Correct 35 ms 384 KB Output is correct
3 Correct 39 ms 384 KB Output is correct
4 Correct 39 ms 504 KB Output is correct
5 Correct 10 ms 384 KB Output is correct
6 Correct 39 ms 384 KB Output is correct
7 Correct 8 ms 384 KB Output is correct
8 Correct 10 ms 384 KB Output is correct
9 Correct 41 ms 504 KB Output is correct
10 Correct 21 ms 384 KB Output is correct

Subtask #3
22.0 / 22.0

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

Subtask #4
51.0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 384 KB Output is correct
2 Correct 108 ms 384 KB Output is correct
3 Correct 80 ms 504 KB Output is correct
4 Correct 8 ms 512 KB Output is correct
5 Correct 9 ms 504 KB Output is correct
6 Correct 9 ms 512 KB Output is correct
7 Correct 33 ms 504 KB Output is correct
8 Correct 51 ms 504 KB Output is correct
9 Correct 40 ms 504 KB Output is correct
10 Correct 80 ms 384 KB Output is correct
11 Correct 79 ms 384 KB Output is correct
12 Correct 81 ms 384 KB Output is correct
13 Correct 90 ms 384 KB Output is correct
14 Correct 90 ms 384 KB Output is correct
15 Correct 99 ms 504 KB Output is correct
16 Correct 78 ms 504 KB Output is correct