oj.uz

Submission #836030

# Submission time Handle Problem Language Result Execution time Memory
836030 2023-08-24T05:35:15 Z Kerim Mechanical Doll (IOI18_doll) C++17
37 / 100
 99 ms 26284 KB 
#include "doll.h"
#include "bits/stdc++.h"
#define pb(x) push_back(x)
using namespace std;
const int N = 4e5+5;
vector<int> X, Y;
vector<int> adj[N];
int who[N], sw[N], S;
 
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 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;
    for (int i = 0; i < pw; i++)
        f(1, 0, pw/2, i);
    int root = get_switch();
    int to_the_root = pw - sz;
    for (int i = 1; i < pw / 2; i++){
        X.push_back(get_switch());
        Y.push_back(get_switch());
    }
    for (int i = 0; i < pw / 2; i++){
        int l = i * 2;
        int r = i * 2 + 1;
        if (who[l] < to_the_root) X.push_back(root);
        else X.push_back(values[who[l] - to_the_root]);
        if (who[r] < to_the_root) Y.push_back(root);
        else Y.push_back(values[who[r] - to_the_root]);
    }
    return root;
}
void create_circuit(int M, vector<int> A) {
    vector<int> C(M + 1);
    int N = A.size();
    if (N == 16){
        A.push_back(0);
        int one_root =  get_root(A);
        for (int i = 0; i <= M; ++i)
            C[i] = one_root;
    }
    else{
        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);
        for (int i = 0; i <= M; ++i)
            C[i] = get_root(adj[i]);
    }
    answer(C, X, Y);
}

Subtask #1
0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 23 ms 13776 KB Output is correct
3 Correct 20 ms 13396 KB Output is correct
4 Incorrect 5 ms 9704 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 23 ms 13776 KB Output is correct
3 Correct 20 ms 13396 KB Output is correct
4 Incorrect 5 ms 9704 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 23 ms 13776 KB Output is correct
3 Correct 20 ms 13396 KB Output is correct
4 Incorrect 5 ms 9704 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 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 4 ms 9684 KB Output is partially correct
2 Correct 44 ms 16588 KB Output is correct
3 Partially correct 72 ms 20540 KB Output is partially correct
4 Partially correct 77 ms 21760 KB Output is partially correct

Subtask #6
28.0000000112 / 56.0

# Verdict Execution time Memory Grader output
1 Partially correct 4 ms 9684 KB Output is partially correct
2 Correct 44 ms 16588 KB Output is correct
3 Partially correct 72 ms 20540 KB Output is partially correct
4 Partially correct 77 ms 21760 KB Output is partially correct
5 Partially correct 78 ms 23008 KB Output is partially correct
6 Partially correct 83 ms 24300 KB Output is partially correct
7 Partially correct 81 ms 23992 KB Output is partially correct
8 Partially correct 83 ms 24984 KB Output is partially correct
9 Partially correct 72 ms 20600 KB Output is partially correct
10 Partially correct 99 ms 26284 KB Output is partially correct
11 Partially correct 99 ms 25464 KB Output is partially correct
12 Partially correct 65 ms 19968 KB Output is partially correct
13 Partially correct 54 ms 19204 KB Output is partially correct
14 Partially correct 54 ms 18924 KB Output is partially correct
15 Partially correct 52 ms 18452 KB Output is partially correct
16 Partially correct 6 ms 9940 KB Output is partially correct
17 Partially correct 47 ms 17876 KB Output is partially correct
18 Partially correct 56 ms 17952 KB Output is partially correct
19 Partially correct 50 ms 18448 KB Output is partially correct
20 Partially correct 66 ms 21144 KB Output is partially correct
21 Partially correct 85 ms 23476 KB Output is partially correct
22 Partially correct 62 ms 20448 KB Output is partially correct