제출 #405457

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
405457		rocks03	게임 (IOI14_game)	C++14	0 / 100	1 ms	332 KiB

game

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ff first
#define ss second
#define pb push_back
#define SZ(x) ((int)(x).size())
#define all(x) x.begin(), x.end()
#define debug(x) cout << #x << ": " << x << " "
#define nl cout << "\n"
#define rep(i, a, b) for(int i = (a); i <= (b); i++)
#define per(i, a, b) for(int i = (a); i >= (b); i--)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int MAXN = 1e3+100;
int N;

vector<int> comp[MAXN];
void initialize(int n){
    N = n;
    rep(i, 0, N - 1){
        rep(j, 0, N - 1){
            if(i != j) comp[i].pb(j);
        }
    }
}

bool vis[MAXN];
int hasEdge(int u, int v){
    int i = 0, j = 0;
    while(i < SZ(comp[u]) && j < SZ(comp[v])){
        if(comp[u][i] == comp[v][j]){
            comp[u].erase(find(all(comp[u]), v));
            comp[v].erase(find(all(comp[v]), u));
            return 0;
        } else if(comp[u][i] > comp[v][j]) j++;
        else i++;
    }
    return 1;
}

• Subtask 1: 0 / 15
• Subtask 2: 0 / 27
• Subtask 3: 0 / 58