제출 #436142

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
436142		infinite_iq	사육제 (CEOI14_carnival)	C++14	20 / 100	154 ms	320 KiB

carnival

#include <bits/stdc++.h>
using namespace std;
#define sqr 500
//#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()
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=1e18;
const ll mod=1e9+7;
const ld Pi=acos(-1);
const ll Mx = 2e5+9 ;
int n ;
vi v [209] ;
int done [209] , a [209] ;
int main () {
    cin >> n ;
    for ( int i = 1 ; i <= n ; i ++ ) {
        if ( done [i] ) continue ;
        v [i] .pb (i) ;
        for ( int j = i + 1 ; j <= n ; j ++ ) {
            cout << 2 << " " << i << " " << j << endl ;
            int ans ;
            cin >> ans ;
            if ( ans == 1 ) {
                 done [j] = 1 ;
                 v [i] .pb (j) ;
            }
        }
    }

    int timer = 1 ;
    for ( int i = 1 ; i <= n ; i ++ ) {
        if ( v [i] .size () ) {
            for ( auto u : v [i] ) {
                a [u] = timer ;
            }
            timer ++ ;
        }
    }
    cout << 0 << " " ;
    for ( int i = 1 ; i <= n ; i ++ ) cout << a [i] << " " ;
    cout << endl ;
}

• Subtask 1: 4 / 20
• Subtask 2: 4 / 20
• Subtask 3: 4 / 20
• Subtask 4: 4 / 20
• Subtask 5: 4 / 20