oj.uz

Submission #97065

# Submission time Handle Problem Language Result Execution time Memory
97065 2019-02-13T16:57:45 Z dlalswp25 Mechanical Doll (IOI18_doll) C++14
84 / 100
 143 ms 12404 KB 
#include "doll.h"
#include <bits/stdc++.h>

using namespace std;

vector<int> C, X, Y, A;
int N, M;
int id;

int x[202020];
int y[202020];
int s[202020];

int mid = 0;

int build2k(int b) {
    int now = ++id;
    if(b == 2) {
        x[now] = y[now] = -1; return now;
    }
    x[now] = build2k(b / 2);
    y[now] = build2k(b / 2);
    return now;
}

int build(int n, int b) {
    //printf("%d %d\n", n, b);
    int now = ++id;
    
    if(n == 1 && b == 1) {
        x[now] = 1;
        y[now] = -1;
        return now;
    }
    if(n == b) {
        x[now] = 1;
        y[now] = build2k(b);
        return now;
    }
    if(n < b) {
        x[now] = 1;
        y[now] = build(n, b / 2);
        return now;
    }
    x[now] = build2k(b);
    y[now] = build(n - b, b / 2);
    return now;
}

void simu() {
    int now = 1;
    while(1) {
        s[now] = !s[now];
        if(!s[now]) { /// y
            if(y[now] == -1) {
                --mid;
                if(mid < -N + 1) { y[now] = 0; return; }
                else y[now] = -A[-mid - 1];
                now = 1;
            }
            else now = y[now];
        }
        else { /// x
            if(x[now] == -1) {
                --mid;
                if(mid < -N + 1) { x[now] = 0; return; }
                else x[now] = -A[-mid - 1];
                now = 1;
            }
            else now = x[now];
        }
    }
}

void create_circuit(int _M, std::vector<int> _A) {
    _A.push_back(0);
    A = _A;
    N = A.size();
    M = _M;
    
    int b = 1; while(b * 2 <= N) b <<= 1;
    build(N, b);
    simu();
    
    for(int i = 0; i <= M; i++) C.push_back(-1);
    for(int i = 1; i <= id; i++) {
        X.push_back(-x[i]);
        Y.push_back(-y[i]);
    }
    answer(C, X, Y);
}

Subtask #1
0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 47 ms 5280 KB Output is correct
3 Correct 47 ms 5176 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 12 ms 1604 KB Output is correct
6 Correct 71 ms 7496 KB Output is correct
7 Incorrect 1 ms 204 KB Output isn't correct

Subtask #2
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 47 ms 5280 KB Output is correct
3 Correct 47 ms 5176 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 12 ms 1604 KB Output is correct
6 Correct 71 ms 7496 KB Output is correct
7 Incorrect 1 ms 204 KB Output isn't correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 47 ms 5280 KB Output is correct
3 Correct 47 ms 5176 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 12 ms 1604 KB Output is correct
6 Correct 71 ms 7496 KB Output is correct
7 Incorrect 1 ms 204 KB Output isn't correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 2 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 2 ms 204 KB Output is correct
7 Correct 2 ms 204 KB Output is correct
8 Correct 2 ms 204 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 75 ms 7120 KB Output is correct
3 Correct 75 ms 7140 KB Output is correct
4 Correct 123 ms 10736 KB Output is correct

Subtask #6
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 75 ms 7120 KB Output is correct
3 Correct 75 ms 7140 KB Output is correct
4 Correct 123 ms 10736 KB Output is correct
5 Correct 135 ms 12404 KB Output is correct
6 Correct 143 ms 11892 KB Output is correct
7 Correct 121 ms 11892 KB Output is correct
8 Correct 120 ms 11816 KB Output is correct
9 Correct 87 ms 7140 KB Output is correct
10 Correct 136 ms 11520 KB Output is correct
11 Correct 118 ms 11160 KB Output is correct
12 Correct 85 ms 7412 KB Output is correct
13 Correct 80 ms 8256 KB Output is correct
14 Correct 80 ms 7932 KB Output is correct
15 Correct 83 ms 7936 KB Output is correct
16 Correct 3 ms 460 KB Output is correct
17 Correct 75 ms 7700 KB Output is correct
18 Correct 99 ms 7384 KB Output is correct
19 Correct 82 ms 7392 KB Output is correct
20 Correct 123 ms 11624 KB Output is correct
21 Correct 122 ms 11160 KB Output is correct
22 Correct 117 ms 11172 KB Output is correct