oj.uz

답안 #115178

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
115178 2019-06-05T21:13:51 Z MladenP 자동 인형 (IOI18_doll) C++17
100 / 100
 235 ms 26636 KB 
#include "doll.h"
#include <bits/stdc++.h>
#define MAXN (1<<20)
#define MAXM 200010
#define PRINT(x) cerr<<#x<<' '<<x<<endl;
#define mid (l+r)/2
#define pb push_back
using namespace std;
vector<int> X, Y, C;
int x[MAXN], y[MAXN], stdva, idxx[MAXN];
int N, idx;
set<int> nodes;
void ubaci(int node, int put, int kraj, int dub) {
    if(dub == stdva) {
        if(put == 0) x[node] = kraj;
        if(put == 1) y[node] = kraj;
        return;
    }
    if(!(put&1)) {
        if(x[node] == -1) x[node] = --idx;
        ubaci(-x[node], put>>1, kraj, dub+1);
    } else {
        if(y[node] == -1) y[node] = --idx;
        ubaci(-y[node], put>>1, kraj, dub+1);
    }
}
void nadji(int put, int kraj, int l, int r) {
    if(l == r) {
        idxx[l] = kraj;
        return;
    }
    if(!(put&1)) nadji(put>>1, kraj, l, mid);
    else nadji(put>>1, kraj, mid+1, r);
}
void create_circuit(int M, std::vector<int> A) {
    N = A.size();
    C.resize(M+1);
    for(int i = 1; i <= M; i++) C[i] = -1;
    C[0] = -1;
    idx = -1;
    for(int i = 0; i < 20; i++) {
        if((1<<i) > N) {
            stdva = i;
            break;
        }
    }
    for(int i = 0; i < (1<<stdva); i++) {
        nadji(i, i, 0, (1<<stdva)-1);
    }
    for(int i = 0; i < (1<<(stdva-1)); i++) {
        nodes.insert(idxx[i]);
    }
    //nodes.insert(idxx[(1<<(stdva))-1]);
    int xx = N-(1<<(stdva-1));
    int yy = (1<<stdva)-2- xx;
    for(int i = (1<<(stdva))-2; i > yy; i--) {
        nodes.insert(idxx[i]);
        //PRINT(idxx[i]);
    }
    //PRINT(nodes.size());
    fill(x, x+MAXN, -1);
    fill(y, y+MAXN, -1);
    int ii = 0;
    for(auto x : nodes) {
        //PRINT(x);
        ubaci(1, x, A[ii], 1);
        ii++;
    }
    ubaci(1, (1<<stdva)-1, 0, 1);
    idx = -idx;
    X.resize(idx);
    Y.resize(idx);
    for(int i = 1; i <= idx; i++) {
        X[i-1] = x[i];
        Y[i-1] = y[i];
    }
    answer(C, X, Y);
}

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 8392 KB Output is correct
2 Correct 82 ms 15420 KB Output is correct
3 Correct 81 ms 14880 KB Output is correct
4 Correct 6 ms 8396 KB Output is correct
5 Correct 19 ms 9620 KB Output is correct
6 Correct 118 ms 18004 KB Output is correct
7 Correct 5 ms 8396 KB Output is correct

Subtask #2
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 8392 KB Output is correct
2 Correct 82 ms 15420 KB Output is correct
3 Correct 81 ms 14880 KB Output is correct
4 Correct 6 ms 8396 KB Output is correct
5 Correct 19 ms 9620 KB Output is correct
6 Correct 118 ms 18004 KB Output is correct
7 Correct 5 ms 8396 KB Output is correct
8 Correct 163 ms 20672 KB Output is correct
9 Correct 145 ms 21056 KB Output is correct
10 Correct 235 ms 26636 KB Output is correct
11 Correct 5 ms 8396 KB Output is correct
12 Correct 5 ms 8396 KB Output is correct
13 Correct 6 ms 8396 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 8392 KB Output is correct
2 Correct 82 ms 15420 KB Output is correct
3 Correct 81 ms 14880 KB Output is correct
4 Correct 6 ms 8396 KB Output is correct
5 Correct 19 ms 9620 KB Output is correct
6 Correct 118 ms 18004 KB Output is correct
7 Correct 5 ms 8396 KB Output is correct
8 Correct 163 ms 20672 KB Output is correct
9 Correct 145 ms 21056 KB Output is correct
10 Correct 235 ms 26636 KB Output is correct
11 Correct 5 ms 8396 KB Output is correct
12 Correct 5 ms 8396 KB Output is correct
13 Correct 6 ms 8396 KB Output is correct
14 Correct 209 ms 26140 KB Output is correct
15 Correct 139 ms 20276 KB Output is correct
16 Correct 204 ms 25968 KB Output is correct
17 Correct 5 ms 8396 KB Output is correct
18 Correct 5 ms 8388 KB Output is correct
19 Correct 6 ms 8396 KB Output is correct
20 Correct 201 ms 26480 KB Output is correct
21 Correct 6 ms 8396 KB Output is correct
22 Correct 6 ms 8480 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 8396 KB Output is correct
2 Correct 6 ms 8396 KB Output is correct
3 Correct 5 ms 8396 KB Output is correct
4 Correct 5 ms 8396 KB Output is correct
5 Correct 5 ms 8396 KB Output is correct
6 Correct 6 ms 8396 KB Output is correct
7 Correct 8 ms 8396 KB Output is correct
8 Correct 5 ms 8440 KB Output is correct

Subtask #5
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 8396 KB Output is correct
2 Correct 116 ms 19788 KB Output is correct
3 Correct 125 ms 19864 KB Output is correct
4 Correct 213 ms 25156 KB Output is correct

Subtask #6
56.0 / 56.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 8396 KB Output is correct
2 Correct 116 ms 19788 KB Output is correct
3 Correct 125 ms 19864 KB Output is correct
4 Correct 213 ms 25156 KB Output is correct
5 Correct 218 ms 25964 KB Output is correct
6 Correct 219 ms 25740 KB Output is correct
7 Correct 201 ms 25796 KB Output is correct
8 Correct 182 ms 25480 KB Output is correct
9 Correct 116 ms 19780 KB Output is correct
10 Correct 197 ms 25360 KB Output is correct
11 Correct 213 ms 25080 KB Output is correct
12 Correct 144 ms 19792 KB Output is correct
13 Correct 150 ms 20000 KB Output is correct
14 Correct 141 ms 20084 KB Output is correct
15 Correct 200 ms 20248 KB Output is correct
16 Correct 8 ms 8896 KB Output is correct
17 Correct 129 ms 19280 KB Output is correct
18 Correct 167 ms 19780 KB Output is correct
19 Correct 121 ms 19780 KB Output is correct
20 Correct 234 ms 25292 KB Output is correct
21 Correct 208 ms 25164 KB Output is correct
22 Correct 232 ms 25156 KB Output is correct