oj.uz

답안 #911626

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
911626 2024-01-19T04:21:47 Z biank 자동 인형 (IOI18_doll) C++14
100 / 100
 153 ms 16968 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(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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 46 ms 6348 KB Output is correct
3 Correct 34 ms 6112 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 8 ms 1372 KB Output is correct
6 Correct 54 ms 9384 KB Output is correct
7 Correct 0 ms 344 KB Output is correct

Subtask #2
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 46 ms 6348 KB Output is correct
3 Correct 34 ms 6112 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 8 ms 1372 KB Output is correct
6 Correct 54 ms 9384 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 71 ms 11316 KB Output is correct
9 Correct 82 ms 11552 KB Output is correct
10 Correct 109 ms 16968 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 46 ms 6348 KB Output is correct
3 Correct 34 ms 6112 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 8 ms 1372 KB Output is correct
6 Correct 54 ms 9384 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 71 ms 11316 KB Output is correct
9 Correct 82 ms 11552 KB Output is correct
10 Correct 109 ms 16968 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 110 ms 16792 KB Output is correct
15 Correct 65 ms 11296 KB Output is correct
16 Correct 127 ms 16472 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 600 KB Output is correct
20 Correct 121 ms 16736 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 548 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 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 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct

Subtask #5
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 68 ms 10424 KB Output is correct
3 Correct 63 ms 10736 KB Output is correct
4 Correct 153 ms 15516 KB Output is correct

Subtask #6
56.0 / 56.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 68 ms 10424 KB Output is correct
3 Correct 63 ms 10736 KB Output is correct
4 Correct 153 ms 15516 KB Output is correct
5 Correct 105 ms 16384 KB Output is correct
6 Correct 110 ms 16296 KB Output is correct
7 Correct 103 ms 16408 KB Output is correct
8 Correct 102 ms 16148 KB Output is correct
9 Correct 64 ms 10660 KB Output is correct
10 Correct 101 ms 16240 KB Output is correct
11 Correct 102 ms 15764 KB Output is correct
12 Correct 59 ms 10916 KB Output is correct
13 Correct 67 ms 11052 KB Output is correct
14 Correct 61 ms 11428 KB Output is correct
15 Correct 64 ms 11552 KB Output is correct
16 Correct 2 ms 604 KB Output is correct
17 Correct 78 ms 10720 KB Output is correct
18 Correct 63 ms 10680 KB Output is correct
19 Correct 61 ms 10912 KB Output is correct
20 Correct 104 ms 16068 KB Output is correct
21 Correct 141 ms 15760 KB Output is correct
22 Correct 105 ms 15956 KB Output is correct