제출 #228705

#제출 시각아이디문제언어결과실행 시간메모리
228705DodgeBallMan자동 인형 (IOI18_doll)C++14
0 / 100
1 ms204 KiB
#include "doll.h"
#include <bits/stdc++.h>
using namespace std;
 
const int len = 3e5+5;
int le[len], ri[len], arr[len], vis[len], cnt, pos;
 
int build( int l, int r ) {
    if( l == r ) return l;
    int mid = l + r >> 1, cur = ++cnt;
    le[cur] = build( l, mid );
    ri[cur] = build( mid+1, r );
    //printf("build: l = %d, r = %d\n", l, r);
    //printf("switch = %d, le = %d, ri = %d\n", -cur, le[cur], ri[cur]);
    return -cur;
}
 
int fix( int num, int lim, int j ) {
    int cur = ++cnt;
    if ( num & ( 1<<j ) ) le[cur] = build(lim+1, lim+(1<<j)), num -= (1<<j), lim += (1<<j);
    else le[cur] = -1;
    if( j == 0 ) ri[cur] = 0;
    else ri[cur] = fix( num, lim, j-1 );
    //printf("fix: j = %d\n", j);
    //printf("cur = %d, le = %d, ri = %d\n", -cur, le[cur], ri[cur]);
    return -cur;
}
 
void create_circuit( int m, vector<int> A ) {
    int n = A.size();
    for( int i = 1 ; i <= n ; i++ ) arr[i] = A[i-1];
    int j = 0;
    while ( ( 1 << j ) <= n ) j++;
    vector<int> C( m+1 );
    C[0] = fix( n, 0, j-1 );
    for( int i = 1 ; i <= m ; i++ ) C[i] = C[0];
    int cur = -1;
    while( cur != 0 ){
        if( !vis[-cur] ){
            vis[-cur] ^= 1;
            if( le[-cur] >= 1 ) le[-cur] = arr[++pos], cur = C[0];
            else cur = le[-cur];
        }
        else{
            vis[-cur] ^= 1;
            if( ri[-cur] >= 1 ) ri[-cur] = arr[++pos], cur = C[0];
            else cur = ri[-cur];
        }
    }

    vector<int> X( cnt ), Y( cnt );
    for ( int i = 0; i < cnt; i++ ) X.emplace_back( le[i+1] ), Y.emplace_back( ri[i+1] );
    answer(C, X, Y);
}

컴파일 시 표준 에러 (stderr) 메시지

doll.cpp: In function 'int build(int, int)':
doll.cpp:10:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   10 |     int mid = l + r >> 1, cur = ++cnt;
      |               ~~^~~
#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...