제출 #290645

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
290645		infinite_iq	자동 인형 (IOI18_doll)	C++14	6 / 100	110 ms	34392 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 , sz ;
vi ord , v [1000009] ;
void create_circuit ( int N , vi A ) {
        n = N , sz = A .size () ;
        vi C , X , Y , out ;
        for ( int i = 0 ; i < sz ; i ++ ) ord .pb ( A [i] ) ;
        v [0] .pb ( ord [0] ) ;
        for ( int i = 0 ; i < sz ; i ++ ) {
                int nxt = ( i < sz -1 ? ord [i+1] : 0 ) ;
                v [ord[i]] .pb ( nxt ) ;
        }
        for ( int i = 0 ; i <= n ; i ++ ) {
                if ( v [i] .size () == 0 ) {
                        v [i] .pb ( 0 ) ;
                }
        }
        for ( int i = 0 ; i <= n ; i ++ ) {
                if ( v [i] .size () == 1 ) {
                        out .pb ( v [i][0] ) ;
                }
                else {
                        X .pb ( v [i][0] ) ;
                        Y .pb ( v [i][1] ) ;
                        out .pb ( - X.size () ) ;
                }
        }
        C = out ;
        answer ( C , X , Y ) ;
}

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