제출 #587446

#제출 시각아이디문제언어결과실행 시간메모리
587446definitelynotmee자동 인형 (IOI18_doll)C++17
10 / 100
1 ms304 KiB
#include "doll.h"
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define all(x) x.begin(),x.end()
using ll = long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
template<typename T>
using matrix = vector<vector<T>>;

void create_circuit(int M, std::vector<int> A) {
    int N = A.size();
    if(N == 1){
        vector<int> C(M+1), X, Y;
        C[0] = A[0];
        C[A[0]] = 0;
        answer(C,X,Y);
        return;
    }
    A.push_back(0);
    std::vector<int> C(M + 1);
    C[0] = A[0];
    for (int i = 1; i <= M; ++i) {
        C[i] = -1;
    }
    A.erase(A.begin());

    array<vector<int>,2> to;
    auto create =[&](){
        int ret = to[0].size();
        for(int i = 0; i < 2; i++)
            to[i].push_back(-1);
        return ret; 
    };
    auto parse =[&](int id){
        return id*-1-1;
    };

    auto gen =[&](int id, int level, auto gen)->int{        
        if(id+(1<<level) >= N)
            return -1;
        
        int arrid = create();
        array<int,2> ret = {gen(id,level+1,gen),gen(id+(1<<level),level+1,gen)};
        for(int i = 0; i < 2; i++){
            if(ret[i] >= 0){
                to[i][arrid] = parse(ret[i]);
            } else {
                to[i][arrid] = A[id+(1<<level)*i];
            }
        }
        return arrid;
    };
    gen(0,0,gen);

    answer(C, to[0], to[1]);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...