Submission #312078

#	Time	Username	Problem	Language	Result	Execution time	Memory
312078		talant117408	Mechanical Doll (IOI18_doll)	C++17	100 / 100	134 ms	13212 KiB

doll

#include "doll.h"
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef pair <ll, ll> pii;
 
#define precision(n) fixed << setprecision(n)
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define mp make_pair
#define eps (double)1e-9
#define PI 2*acos(0.0)
#define endl "\n"
#define sz(v) (int)(v).size()
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define do_not_disturb ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);

int generate(vector <int> &after, int &s, vector <int> &x, vector <int> &y){
    int saizu = sz(after);
    if(!saizu){
        return 0;
    }
    else if(saizu == 1){
        return after[0];
    }
    else{
        int j, k = 1, K = 0;
        while(k < saizu) {
            k *= 2;
            K++;
        }
        
        vector <int> rev(k);
        for(j = 0; j < k; j++){
            rev[j] = rev[j/2]/2 | ((j&1) << (K-1));
        }
        
        int id = --s;
        for(int lvl = 0; lvl < K-1; lvl++){
            for(j = 0; j < (1 << lvl); j++){
                if((j << (K-lvl)) + (1 << (K-lvl)) <= (k-saizu)){
                    
                }
                else if((j << (K-lvl)) + (1 << (K-lvl-1)) <= (k-saizu)){
                    x.pb(id);
                    y.pb(--s);
                }
                else{
                    x.pb(--s);
                    y.pb(--s);
                }
            }
        }
        
        vector <int> go(k);
        int ptr = 0;
        for(j = 0; j < k; j++){
            if(rev[j] < (k-saizu)){
                
            }
            else{
                go[rev[j]] = after[ptr++];
            }
        }
        
        for(j = 0; j < k/2; j++){
            if(j*2+2 <= (k-saizu)){
                
            }
            else if(j*2+1 <= (k-saizu)){
                x.pb(id);
                y.pb(go[j*2+1]);
            }
            else{
                x.pb(go[j*2]);
                y.pb(go[j*2+1]);
            }
        }
        
        return id;
    }
}

void create_circuit(int M, vector<int> A){
    int i;
    vector <vector <int>> after(M+1);
    vector <int> connected(M+1), x, y;
    A.pb(0);
    
    int n = sz(A);
    
    for(i = 0; i < n; i++){
        after[A[i]].pb(A[(i+1)%n]);
    }
    
    int s = 0;
    int id = generate(A, s, x, y);
    
    for(i = 0; i <= M; i++){
        connected[i] = id;
    }
    
    /*
    for(auto to : connected) cout << to << ' ';
    cout << endl;
    for(i = 0; i < sz(x); i++) cout << x[i] << ' ' << y[i] << endl;
    */
    answer(connected, x, y);
}

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