oj.uz

Submission #911594

# Submission time Handle Problem Language Result Execution time Memory
911594 2024-01-19T04:12:03 Z biank Mechanical Doll (IOI18_doll) C++14
84 / 100
 173 ms 16488 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);
    assert(u>=0 && u<SIZE(v));
    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) {
    assert(u>=0 && u<SIZE(v));
    if(u!=0 && v[u]==-1) return false;
    if(!v[u]) {
        v[u]=a;
        return true;
    }
    state[u]^=1;
    assert(v[L[u]]!=-1 || v[R[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);
    c[0]=A[0];
    forsn(i,1,m+1) c[i]=-1;
    int n=SIZE(A), sz=1;
    while(sz<n) sz*=2;
    assert(sz>=n);
    skip = sz-n;
    build(0,0,sz);
    assert(SIZE(L)==SIZE(R) && SIZE(v)==SIZE(L));
    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]);
    }
    vi x, y;
    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
0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 39 ms 6460 KB Output is correct
3 Correct 35 ms 6328 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 8 ms 1368 KB Output is correct
6 Correct 59 ms 9244 KB Output is correct
7 Incorrect 1 ms 344 KB wrong serial number
8 Halted 0 ms 0 KB -

Subtask #2
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 39 ms 6460 KB Output is correct
3 Correct 35 ms 6328 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 8 ms 1368 KB Output is correct
6 Correct 59 ms 9244 KB Output is correct
7 Incorrect 1 ms 344 KB wrong serial number
8 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 39 ms 6460 KB Output is correct
3 Correct 35 ms 6328 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 8 ms 1368 KB Output is correct
6 Correct 59 ms 9244 KB Output is correct
7 Incorrect 1 ms 344 KB wrong serial number
8 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 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 65 ms 10552 KB Output is correct
3 Correct 61 ms 10664 KB Output is correct
4 Correct 106 ms 15456 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 65 ms 10552 KB Output is correct
3 Correct 61 ms 10664 KB Output is correct
4 Correct 106 ms 15456 KB Output is correct
5 Correct 110 ms 16488 KB Output is correct
6 Correct 155 ms 16292 KB Output is correct
7 Correct 110 ms 16404 KB Output is correct
8 Correct 173 ms 16252 KB Output is correct
9 Correct 69 ms 10664 KB Output is correct
10 Correct 99 ms 16144 KB Output is correct
11 Correct 98 ms 15772 KB Output is correct
12 Correct 69 ms 10968 KB Output is correct
13 Correct 64 ms 11020 KB Output is correct
14 Correct 63 ms 11292 KB Output is correct
15 Correct 75 ms 11552 KB Output is correct
16 Correct 3 ms 604 KB Output is correct
17 Correct 69 ms 10836 KB Output is correct
18 Correct 85 ms 10832 KB Output is correct
19 Correct 63 ms 11008 KB Output is correct
20 Correct 122 ms 15964 KB Output is correct
21 Correct 110 ms 15916 KB Output is correct
22 Correct 113 ms 15940 KB Output is correct