oj.uz

답안 #911471

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
911471 2024-01-19T01:36:54 Z biank 자동 인형 (IOI18_doll) C++14
84 / 100
 108 ms 16660 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(l>r) {
        v[u]=-1;
        return;
    }
    if(skip>0 && r-l+1<=skip) {
        v[u]=-1;
        skip-=r-l+1;
        return;
    }
    if(l==r) return;
    v[u] = s--;
    int m=(l+r)/2;
    L[u] = t++;
    build(L[u], l, m);
    R[u] = t++;
    build(R[u], m+1, 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,1,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;
    int mini=-1;
    forn(i,SIZE(v)) {
        if(L[i] && R[i]) {
            x.pb(v[L[i]]);
            y.pb(v[R[i]]);
            mini=min({mini,v[L[i]],v[R[i]]});
        }
    }
    if(SIZE(x)<-mini) {
        x.resize(-mini,-1);
        y.resize(-mini,-1);
    }
    answer(c,x,y);
}

Subtask #1
0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 37 ms 6352 KB Output is correct
3 Correct 35 ms 6344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 7 ms 1368 KB Output is correct
6 Correct 55 ms 9388 KB Output is correct
7 Incorrect 0 ms 348 KB over 20000000 inversions
8 Halted 0 ms 0 KB -

Subtask #2
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 37 ms 6352 KB Output is correct
3 Correct 35 ms 6344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 7 ms 1368 KB Output is correct
6 Correct 55 ms 9388 KB Output is correct
7 Incorrect 0 ms 348 KB over 20000000 inversions
8 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 37 ms 6352 KB Output is correct
3 Correct 35 ms 6344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 7 ms 1368 KB Output is correct
6 Correct 55 ms 9388 KB Output is correct
7 Incorrect 0 ms 348 KB over 20000000 inversions
8 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 0 ms 348 KB Output is correct
6 Correct 1 ms 344 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 344 KB Output is correct
2 Correct 65 ms 10452 KB Output is correct
3 Correct 59 ms 10720 KB Output is correct
4 Correct 104 ms 15440 KB Output is correct

Subtask #6
56.0 / 56.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 65 ms 10452 KB Output is correct
3 Correct 59 ms 10720 KB Output is correct
4 Correct 104 ms 15440 KB Output is correct
5 Correct 100 ms 16464 KB Output is correct
6 Correct 102 ms 16388 KB Output is correct
7 Correct 106 ms 16404 KB Output is correct
8 Correct 98 ms 16144 KB Output is correct
9 Correct 71 ms 10820 KB Output is correct
10 Correct 103 ms 16660 KB Output is correct
11 Correct 108 ms 15960 KB Output is correct
12 Correct 62 ms 10920 KB Output is correct
13 Correct 65 ms 11016 KB Output is correct
14 Correct 74 ms 11296 KB Output is correct
15 Correct 63 ms 11552 KB Output is correct
16 Correct 2 ms 604 KB Output is correct
17 Correct 64 ms 10680 KB Output is correct
18 Correct 62 ms 10712 KB Output is correct
19 Correct 60 ms 10912 KB Output is correct
20 Correct 106 ms 15968 KB Output is correct
21 Correct 102 ms 15776 KB Output is correct
22 Correct 99 ms 15956 KB Output is correct