Submission #115150

#	Time	Username	Problem	Language	Result	Execution time	Memory
115150		MladenP	Mechanical Doll (IOI18_doll)	C++17	0 / 100	7 ms	8464 KiB

doll

#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);
    int neparnih = N-(1<<(stdva-1)), cnt = 0, idxx = 0;
    for(int i = 0; i < N; i++) {
        if(idxx&1) {
            neparnih--;
            if(neparnih >= 0) ubaci(1, idxx, A[i], 1);
        } else {
            ubaci(1, idxx, A[i], 1);
        }
        idxx++;
    }
    nadji(1);
    idx = -idx;
    X.resize(idx);
    Y.resize(idx);
    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);
}

Compilation message (stderr)

doll.cpp: In function 'void create_circuit(int, std::vector<int>)':
doll.cpp:49:38: warning: unused variable 'cnt' [-Wunused-variable]
   49 |     int neparnih = N-(1<<(stdva-1)), cnt = 0, idxx = 0;
      |                                      ^~~

• Subtask 1: 0 / 2
• Subtask 2: 0 / 4
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 18
• Subtask 6: 0 / 56