oj.uz

Submission #911622

# Submission time Handle Problem Language Result Execution time Memory
911622 2024-01-19T04:21:01 Z biank Mechanical Doll (IOI18_doll) C++14
100 / 100
 115 ms 16996 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=1, skip, s=-1;
     
void build(int u, int l, int r) {
    L.pb(0), R.pb(0), v.pb(0);
    if(r<=l) {
        v[u]=-1;
        return;
    }
    if(skip>0 && r-l<=skip) {
        v[u]=-1;
        skip-=r-l;
        return;
    }
    if(r-l==1) return;
    v[u] = s--;
    int m=(l+r)/2;
    L[u] = t++;
    build(L[u], l, m);
    R[u] = t++;
    build(R[u], m, r);
}
     
bool dfs(int u, int a) {
    if(u!=0 && v[u]==-1) return false;
    if(!v[u]) {
        v[u]=a;
        return true;
    }
    state[u]^=1;
    if(state[u]) return dfs(L[u],a);
    return 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) {
        answer(c,x,y);
        return;
    }
    forsn(i,1,m+1) c[i]=-1;
    int sz=1;
    while(sz<n) sz*=2;
    skip = sz-n;
    build(0,0,sz);
    vi a;
    forsn(i,1,n) a.pb(A[i]);
    a.pb(0);
    state.assign(SIZE(v),0);
    forn(i,n) {
        bool flag=0;
        while(!flag) flag=dfs(0,a[i]);
    }
    forn(i,SIZE(v)) {
        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 348 KB Output is correct
2 Correct 53 ms 6348 KB Output is correct
3 Correct 35 ms 6320 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 7 ms 1372 KB Output is correct
6 Correct 55 ms 9216 KB Output is correct
7 Correct 0 ms 348 KB Output is correct

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 53 ms 6348 KB Output is correct
3 Correct 35 ms 6320 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 7 ms 1372 KB Output is correct
6 Correct 55 ms 9216 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 70 ms 11188 KB Output is correct
9 Correct 68 ms 11660 KB Output is correct
10 Correct 109 ms 16996 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 348 KB Output is correct
2 Correct 53 ms 6348 KB Output is correct
3 Correct 35 ms 6320 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 7 ms 1372 KB Output is correct
6 Correct 55 ms 9216 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 70 ms 11188 KB Output is correct
9 Correct 68 ms 11660 KB Output is correct
10 Correct 109 ms 16996 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 106 ms 16652 KB Output is correct
15 Correct 64 ms 11240 KB Output is correct
16 Correct 111 ms 16476 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 115 ms 16808 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 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 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 1 ms 348 KB Output is correct
2 Correct 64 ms 10420 KB Output is correct
3 Correct 65 ms 10876 KB Output is correct
4 Correct 104 ms 15460 KB Output is correct

Subtask #6
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 64 ms 10420 KB Output is correct
3 Correct 65 ms 10876 KB Output is correct
4 Correct 104 ms 15460 KB Output is correct
5 Correct 102 ms 16380 KB Output is correct
6 Correct 102 ms 16240 KB Output is correct
7 Correct 111 ms 16384 KB Output is correct
8 Correct 103 ms 16268 KB Output is correct
9 Correct 59 ms 10720 KB Output is correct
10 Correct 105 ms 16240 KB Output is correct
11 Correct 111 ms 15956 KB Output is correct
12 Correct 63 ms 10984 KB Output is correct
13 Correct 65 ms 11052 KB Output is correct
14 Correct 63 ms 11296 KB Output is correct
15 Correct 63 ms 11468 KB Output is correct
16 Correct 2 ms 600 KB Output is correct
17 Correct 70 ms 10776 KB Output is correct
18 Correct 65 ms 10676 KB Output is correct
19 Correct 63 ms 10920 KB Output is correct
20 Correct 98 ms 15968 KB Output is correct
21 Correct 104 ms 15956 KB Output is correct
22 Correct 115 ms 15972 KB Output is correct