oj.uz

Submission #835613

# Submission time Handle Problem Language Result Execution time Memory
835613 2023-08-23T16:39:02 Z Kerim Mechanical Doll (IOI18_doll) C++17
53 / 100
 110 ms 26052 KB 
#include "doll.h"
#include "bits/stdc++.h"
#define pb(x) push_back(x)
using namespace std;
const int N = 4e5+5;
vector<int> adj[N], id;
int who[N], sw[N], S, XX[N], YY[N];

void f(int nd, int pos, int pw, int id){
    if (!pw){
        who[pos] = id;
        return;
    }
    sw[nd] ^= 1;
    if (sw[nd])
        f(nd*2, pos, pw/2, id);
    else
        f(nd*2+1, pos+pw, pw/2, id);
}
int get_switch(){
    return --S;
}
int dfs(int l, int r, int rem, int root, vector<int>&values){
    if (l == r){
        if (r < rem)
            return root;
        return values[who[l]];
    }
    int nd = get_switch();
    int mid = (l+r) >> 1;
    XX[-nd] = dfs(l, mid, rem, root, values);
    YY[-nd] = dfs(mid+1, r, rem, root, values);
    return nd;
}
int get_root(vector<int> &values){
    int sz = values.size();
    if (sz == 0)
        return 0;
    if (sz == 1)
        return values[0];
    int pw = 1;
    while (pw < sz) pw *= 2;
    id.clear();
    for (int i = 0; i < pw; i++)
        f(1, 0, pw/2, i), id.pb(i);
    for (int i = 0; i < pw-sz; i++)
        who[i] = pw;
    sort(id.begin(), id.end(), [&](int x, int y){
        return (who[x] < who[y]);
    });
    for (int i = 0; i < sz; i++)
        who[id[i]] = i;
    return dfs(0, pw-1, pw-sz, S-1, values);
}
void create_circuit(int M, vector<int> A) {
    int N = A.size();
    adj[0].pb(A[0]);
    for (int i = 0; i < N - 1; i++)
        adj[A[i]].pb(A[i+1]);
    adj[A[N-1]].pb(0);
    vector<int> C(M + 1);
    for (int i = 0; i <= M; ++i)
        C[i] = get_root(adj[i]);
    vector<int> X(-S), Y(-S);
    for (int i = 1; i <= -S; i++)
        X[i-1] = XX[i], Y[i-1] = YY[i];
    answer(C, X, Y);
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 9684 KB Output is correct
2 Correct 22 ms 13432 KB Output is correct
3 Correct 19 ms 13044 KB Output is correct
4 Correct 4 ms 9684 KB Output is correct
5 Correct 12 ms 10836 KB Output is correct
6 Correct 30 ms 14768 KB Output is correct
7 Correct 4 ms 9684 KB Output is correct

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 9684 KB Output is correct
2 Correct 22 ms 13432 KB Output is correct
3 Correct 19 ms 13044 KB Output is correct
4 Correct 4 ms 9684 KB Output is correct
5 Correct 12 ms 10836 KB Output is correct
6 Correct 30 ms 14768 KB Output is correct
7 Correct 4 ms 9684 KB Output is correct
8 Correct 37 ms 15568 KB Output is correct
9 Correct 38 ms 15996 KB Output is correct
10 Correct 54 ms 18724 KB Output is correct
11 Correct 4 ms 9684 KB Output is correct
12 Correct 6 ms 9684 KB Output is correct
13 Correct 4 ms 9684 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 9684 KB Output is correct
2 Correct 22 ms 13432 KB Output is correct
3 Correct 19 ms 13044 KB Output is correct
4 Correct 4 ms 9684 KB Output is correct
5 Correct 12 ms 10836 KB Output is correct
6 Correct 30 ms 14768 KB Output is correct
7 Correct 4 ms 9684 KB Output is correct
8 Correct 37 ms 15568 KB Output is correct
9 Correct 38 ms 15996 KB Output is correct
10 Correct 54 ms 18724 KB Output is correct
11 Correct 4 ms 9684 KB Output is correct
12 Correct 6 ms 9684 KB Output is correct
13 Correct 4 ms 9684 KB Output is correct
14 Correct 69 ms 20352 KB Output is correct
15 Correct 37 ms 15220 KB Output is correct
16 Correct 55 ms 18040 KB Output is correct
17 Correct 4 ms 9684 KB Output is correct
18 Correct 5 ms 9684 KB Output is correct
19 Correct 6 ms 9684 KB Output is correct
20 Correct 62 ms 19416 KB Output is correct
21 Correct 4 ms 9684 KB Output is correct
22 Correct 4 ms 9684 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 9684 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
9.0000000036 / 18.0

# Verdict Execution time Memory Grader output
1 Partially correct 5 ms 9684 KB Output is partially correct
2 Correct 56 ms 17040 KB Output is correct
3 Partially correct 88 ms 22720 KB Output is partially correct
4 Partially correct 100 ms 23480 KB Output is partially correct

Subtask #6
28.0000000112 / 56.0

# Verdict Execution time Memory Grader output
1 Partially correct 5 ms 9684 KB Output is partially correct
2 Correct 56 ms 17040 KB Output is correct
3 Partially correct 88 ms 22720 KB Output is partially correct
4 Partially correct 100 ms 23480 KB Output is partially correct
5 Partially correct 78 ms 22648 KB Output is partially correct
6 Partially correct 83 ms 23928 KB Output is partially correct
7 Partially correct 88 ms 23548 KB Output is partially correct
8 Partially correct 89 ms 24688 KB Output is partially correct
9 Partially correct 85 ms 21128 KB Output is partially correct
10 Partially correct 110 ms 26052 KB Output is partially correct
11 Partially correct 103 ms 25472 KB Output is partially correct
12 Partially correct 68 ms 20076 KB Output is partially correct
13 Partially correct 56 ms 19068 KB Output is partially correct
14 Partially correct 68 ms 18748 KB Output is partially correct
15 Partially correct 53 ms 18260 KB Output is partially correct
16 Partially correct 6 ms 9940 KB Output is partially correct
17 Partially correct 51 ms 18028 KB Output is partially correct
18 Partially correct 61 ms 17996 KB Output is partially correct
19 Partially correct 57 ms 18508 KB Output is partially correct
20 Partially correct 67 ms 21068 KB Output is partially correct
21 Partially correct 98 ms 23444 KB Output is partially correct
22 Partially correct 69 ms 20348 KB Output is partially correct