답안 #290662

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
290662	2020-09-04T09:43:41 Z	infinite_iq	자동 인형 (IOI18_doll)	C++14	16 / 100	141 ms	33824 KB

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 ;
        C .resize ( n + 1 , 0 ) ;
        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 ) ;
        }
        int num = -1 ;
        for ( int i = 0 ; i <= n ; i ++ ) {
                if ( ! v [i] .size () ) C ;
                if ( v [i] .size () == 1 ) {
                        C [i] = v [i][0] ;
                }
                if ( v [i] .size () == 2 ) {
                        C [i] = num -- ;
                        X .pb ( v [i][0] ) ;
                        Y .pb ( v [i][1] ) ;
                }
                if ( v [i] .size () == 3 ) {
                        C [i] = num -- ;
                        X .pb ( num -- ) ;
                        Y .pb ( num -- ) ;
                        X .pb ( v [i][0] ) ;
                        Y .pb ( v [i][1] ) ;
                        X .pb ( C [i] ) ;
                        Y .pb ( v [i][2] ) ;
                }
                if ( v [i] .size () == 4 ) {
                        C [i] = num -- ;
                        X .pb ( num -- ) ;
                        Y .pb ( num -- ) ;
                        X .pb ( v [i][0] ) ;
                        Y .pb ( v [i][2] ) ;
                        X .pb ( v [i][1] ) ;
                        Y .pb ( v [i][3] ) ;
                }
        }
        answer ( C , X , Y ) ;
}

Compilation message

doll.cpp: In function 'void create_circuit(int, vi)':
doll.cpp:50:41: warning: statement has no effect [-Wunused-value]
   50 |                 if ( ! v [i] .size () ) C ;
      |                                         ^

Subtask #1
2.0 / 2.0

#	결과	실행 시간	메모리	Grader output
1	Correct	18 ms	23756 KB	Output is correct
2	Correct	46 ms	27756 KB	Output is correct
3	Correct	49 ms	27348 KB	Output is correct
4	Correct	20 ms	23756 KB	Output is correct
5	Correct	28 ms	24924 KB	Output is correct
6	Correct	59 ms	29244 KB	Output is correct
7	Correct	16 ms	23756 KB	Output is correct

Subtask #2
4.0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	18 ms	23756 KB	Output is correct
2	Correct	46 ms	27756 KB	Output is correct
3	Correct	49 ms	27348 KB	Output is correct
4	Correct	20 ms	23756 KB	Output is correct
5	Correct	28 ms	24924 KB	Output is correct
6	Correct	59 ms	29244 KB	Output is correct
7	Correct	16 ms	23756 KB	Output is correct
8	Correct	77 ms	30168 KB	Output is correct
9	Correct	80 ms	30412 KB	Output is correct
10	Correct	107 ms	33824 KB	Output is correct
11	Correct	17 ms	23756 KB	Output is correct
12	Correct	17 ms	23704 KB	Output is correct
13	Correct	17 ms	23764 KB	Output is correct

Subtask #3
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	18 ms	23756 KB	Output is correct
2	Correct	46 ms	27756 KB	Output is correct
3	Correct	49 ms	27348 KB	Output is correct
4	Correct	20 ms	23756 KB	Output is correct
5	Correct	28 ms	24924 KB	Output is correct
6	Correct	59 ms	29244 KB	Output is correct
7	Correct	16 ms	23756 KB	Output is correct
8	Correct	77 ms	30168 KB	Output is correct
9	Correct	80 ms	30412 KB	Output is correct
10	Correct	107 ms	33824 KB	Output is correct
11	Correct	17 ms	23756 KB	Output is correct
12	Correct	17 ms	23704 KB	Output is correct
13	Correct	17 ms	23764 KB	Output is correct
14	Correct	141 ms	33688 KB	Output is correct
15	Correct	77 ms	30004 KB	Output is correct
16	Correct	100 ms	31716 KB	Output is correct
17	Correct	15 ms	23756 KB	Output is correct
18	Correct	14 ms	23676 KB	Output is correct
19	Correct	14 ms	23728 KB	Output is correct
20	Correct	114 ms	33044 KB	Output is correct
21	Correct	16 ms	23756 KB	Output is correct
22	Correct	16 ms	23756 KB	Output is correct