제출 #291142

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
291142		infinite_iq	자동 인형 (IOI18_doll)	C++14	0 / 100	168 ms	262148 KiB

doll

#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#include <bits/stdc++.h>
using namespace std;
#define sqr 100
#define mp make_pair
#define mid (l+r)/2
#define le node * 2 
#define ri node * 2 + 1 
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ins insert
#define era erase
//#define C continue
#define mem(dp,i) memset(dp,i,sizeof(dp))
#define mset multiset
#define all(x) x.begin(), x.end()
#define gc getchar_unlocked
typedef long long ll;
typedef short int si;
typedef double ld;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
typedef pair<double,ll>pdi;
const ll inf=2e18;
const ll mod=32;
const ld Pi=acos(-1) ;
#include "doll.h"
int n ;
vi ord , C , X , Y ;
//
vi v [100009] ;
int crnt [100009] ;
void Build ( int node ) {
        int a = node * 2 ;
        int b = node * 2 + 1 ;
        if ( a < 16 && b < 16 ) {
                v [node] .pb ( a ) ;
                v [node] .pb ( b ) ;
                Build ( a ) ;
                Build ( b ) ;
        }
}
void dfs ( int node , int goal ) {
        if ( v [node] .size () == 0 ) {
                v [node] .pb ( goal ) ;
                return ;
        }
        dfs ( v [node][crnt[node]] , goal ) ;
        crnt [node] = ! crnt [node] ;
}
void create_circuit ( int M , vi A ) {
        C .resize ( M + 1 , 0 ) ;
        n = A .size () ;
        Build ( 1 ) ;
  		C [0] = A [0] ; 
        for ( int i = 0 ; i < n ; i ++ ) {
                int nxt = ( i == n -1 ? 0 : A [i+1] ) ;
                C [A[i]] = -1 ;
                dfs ( 1 , - nxt ) ;
        }
        for ( int i = 1 ; i < 16 ; i ++ ) {
                X .pb ( - v [i][0] ) ;
                Y .pb ( - v [i][1] ) ;
        }
        answer ( C , X , Y ) ;
}

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