oj.uz

Submission #115138

# Submission time Handle Problem Language Result Execution time Memory
115138 2019-06-05T12:05:06 Z MladenP Mechanical Doll (IOI18_doll) C++17
37 / 100
 149 ms 17144 KB 
#include "doll.h"
#include <bits/stdc++.h>
#define MAXN (1<<20)
#define MAXM 200010
#define PRINT(x) cerr<<#x<<' '<<x<<endl;
#define pb push_back
using namespace std;
vector<int> X, Y, C;
int x[MAXN], y[MAXN], stdva;
int N, idx;

void ubaci(int node, int put, int kraj, int dub) {
    //PRINT(node);
    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 node) {
    if(y[node] == -1) {
        y[node] = 0;
        return;
    }
    nadji(-y[node]);
}

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;
        }
    }
    fill(x, x+MAXN, -1);
    fill(y, y+MAXN, -1);
    for(int i = 0; i < N; i++) {
        ubaci(1, i, A[i], 1);
    }
    nadji(1);
    idx = -idx;
    X.resize(idx);
    Y.resize(idx);
    //if((1<<stdva) == N)
    //PRINT(idx);
    //C[A[N-1]] = 0;
    for(int i = 1; i <= idx; i++) {
        //PRINT(x[i]);
        //PRINT(y[i]);
        X[i-1] = x[i];
        Y[i-1] = y[i];
    }
    answer(C, X, Y);
}

Subtask #1
0 / 2.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 8400 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 8400 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 8400 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 8496 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
9.0 / 18.0

# Verdict Execution time Memory Grader output
1 Partially correct 7 ms 8396 KB Output is partially correct
2 Partially correct 94 ms 15684 KB Output is partially correct
3 Partially correct 91 ms 15676 KB Output is partially correct
4 Partially correct 104 ms 16208 KB Output is partially correct

Subtask #6
28.0 / 56.0

# Verdict Execution time Memory Grader output
1 Partially correct 7 ms 8396 KB Output is partially correct
2 Partially correct 94 ms 15684 KB Output is partially correct
3 Partially correct 91 ms 15676 KB Output is partially correct
4 Partially correct 104 ms 16208 KB Output is partially correct
5 Partially correct 109 ms 17144 KB Output is partially correct
6 Partially correct 122 ms 16988 KB Output is partially correct
7 Partially correct 115 ms 17068 KB Output is partially correct
8 Partially correct 101 ms 16684 KB Output is partially correct
9 Partially correct 85 ms 15784 KB Output is partially correct
10 Partially correct 105 ms 16684 KB Output is partially correct
11 Partially correct 149 ms 16292 KB Output is partially correct
12 Partially correct 88 ms 16032 KB Output is partially correct
13 Partially correct 88 ms 16420 KB Output is partially correct
14 Partially correct 94 ms 16460 KB Output is partially correct
15 Partially correct 104 ms 16576 KB Output is partially correct
16 Partially correct 7 ms 8780 KB Output is partially correct
17 Correct 73 ms 12592 KB Output is correct
18 Partially correct 83 ms 15936 KB Output is partially correct
19 Partially correct 86 ms 15944 KB Output is partially correct
20 Partially correct 109 ms 16540 KB Output is partially correct
21 Partially correct 108 ms 16300 KB Output is partially correct
22 Partially correct 104 ms 16292 KB Output is partially correct