oj.uz

Submission #911721

# Submission time Handle Problem Language Result Execution time Memory
911721 2024-01-19T04:54:47 Z biank Mechanical Doll (IOI18_doll) C++14
100 / 100
 123 ms 16252 KB 
#include <bits/stdc++.h>
#include "doll.h"
using namespace std;
#define SIZE(x) (int)x.size()
#define forn(i,n) for(int i=0;i<int(n);i++)
#define forsn(i,s,n) for(int i=int(s);i<int(n);i++)
#define pb push_back
typedef vector<int> vi;

vi L, R, v, state;
int t, skip, s;

void build(int u, int l, int r) {
    L.pb(0), R.pb(0), v.pb(0);
    if(r-l<=skip) {
        v[u]=-1, skip-=r-l;
        return;
    }
    if(r-l==1) return;
    v[u]=--s;
    int m=(l+r)/2;
    build(L[u]=t++,l,m);
    build(R[u]=t++,m,r);
}
     
void dfs(int u, int a) {
    if(u && v[u]==-1) dfs(0,a);
    else if(!v[u]) v[u]=a;
    else if(state[u]^=1) dfs(L[u],a);
    else dfs(R[u],a);
}
     
void create_circuit(int m, vi a) {
    vi c(m+1,0), x, y;
    c[0]=a[0];
    int n=SIZE(a);
    if(n==1) return answer(c,x,y);
    forsn(i,1,m+1) c[i]=-1;
    int sz=1;
    while(sz<n) sz*=2;
    skip=sz-n;
    build(t++,0,sz);
    a.pb(0);
    state.assign(SIZE(v),0);
    forsn(i,1,n+1) dfs(0,a[i]);
    forn(i,t) if(L[i]||R[i]) x.pb(v[L[i]]),y.pb(v[R[i]]);
    answer(c,x,y);
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 39 ms 5840 KB Output is correct
3 Correct 36 ms 6320 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 7 ms 1372 KB Output is correct
6 Correct 57 ms 8976 KB Output is correct
7 Correct 0 ms 600 KB Output is correct

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 39 ms 5840 KB Output is correct
3 Correct 36 ms 6320 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 7 ms 1372 KB Output is correct
6 Correct 57 ms 8976 KB Output is correct
7 Correct 0 ms 600 KB Output is correct
8 Correct 72 ms 10408 KB Output is correct
9 Correct 69 ms 11804 KB Output is correct
10 Correct 122 ms 16252 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 39 ms 5840 KB Output is correct
3 Correct 36 ms 6320 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 7 ms 1372 KB Output is correct
6 Correct 57 ms 8976 KB Output is correct
7 Correct 0 ms 600 KB Output is correct
8 Correct 72 ms 10408 KB Output is correct
9 Correct 69 ms 11804 KB Output is correct
10 Correct 122 ms 16252 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 112 ms 15556 KB Output is correct
15 Correct 68 ms 10712 KB Output is correct
16 Correct 107 ms 15556 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 111 ms 15856 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct

Subtask #4
10.0 / 10.0

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

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 92 ms 9552 KB Output is correct
3 Correct 67 ms 10192 KB Output is correct
4 Correct 123 ms 14528 KB Output is correct

Subtask #6
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 92 ms 9552 KB Output is correct
3 Correct 67 ms 10192 KB Output is correct
4 Correct 123 ms 14528 KB Output is correct
5 Correct 117 ms 15476 KB Output is correct
6 Correct 118 ms 15508 KB Output is correct
7 Correct 110 ms 15368 KB Output is correct
8 Correct 101 ms 15108 KB Output is correct
9 Correct 60 ms 9996 KB Output is correct
10 Correct 116 ms 15196 KB Output is correct
11 Correct 99 ms 14980 KB Output is correct
12 Correct 61 ms 10408 KB Output is correct
13 Correct 69 ms 10000 KB Output is correct
14 Correct 70 ms 12996 KB Output is correct
15 Correct 63 ms 10784 KB Output is correct
16 Correct 2 ms 604 KB Output is correct
17 Correct 68 ms 9812 KB Output is correct
18 Correct 68 ms 9868 KB Output is correct
19 Correct 61 ms 10408 KB Output is correct
20 Correct 101 ms 15156 KB Output is correct
21 Correct 110 ms 14988 KB Output is correct
22 Correct 103 ms 14988 KB Output is correct