제출 #384996

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
384996		AmineWeslati	게임 (IOI14_game)	C++14	100 / 100	511 ms	25452 KiB

game

//Never stop trying
#include "bits/stdc++.h"
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef long long ll;
typedef string str;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<pi> vpi;
#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)

const int MOD = 1e9 + 7; //998244353
const ll INF = 1e18;
const int MX = 1500 + 10;
const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0}; //right left down up

template<class T> using V = vector<T>;
template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } // divide a by b rounded up
//constexpr int log2(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
//mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
ll random(ll a, ll b){
    return a + rng() % (b - a + 1);
}
#ifndef LOCAL  
#define cerr if(false) cerr
#endif
#define dbg(x) cerr << #x << " : " << x << endl; 
#define dbgs(x,y) cerr << #x << " : " << x << " / " << #y << " : " << y << endl;
#define dbgv(v) cerr << #v << " : " << "[ "; for(auto it : v) cerr << it << ' '; cerr << ']' << endl;
#define here() cerr << "here" << endl;

void IO() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin); 
    freopen("output.txt", "w", stdout);
#endif
}
/////////////////////////ONLY CLEAN CODES ALLOWED/////////////////////////

//full solution

#ifndef LOCAL
#include "game.h"
#endif

int N; 
int R[MX]; //Representative
vi vec[MX]; //Sets
int S[MX][MX]; // #Connections

void initialize(int N){
	::N=N;
	FOR(i,0,N){
        R[i]=i; 
        vec[i].pb(i);
        FOR(j,0,N) S[i][j]=1;
    }
}

void join(int u, int v){
	if(sz(vec[v])>sz(vec[u])) swap(u,v);
    for(auto i: vec[v]){
        vec[u].pb(i);
        R[i]=u;
    }
    FOR(i,0,N) S[u][i]=S[i][u]=S[u][i]+S[v][i];
}

int hasEdge(int u, int v){
    v=R[v]; u=R[u];
    assert(u!=v);

    if(S[u][v]>1){
        S[u][v]--;
        S[v][u]--;
        return 0;
    } 

    join(u,v);
    return 1;
}


#ifdef LOCAL
int main() {
    boost; IO();

    cin>>N;
    vpi vec;
    FOR(i,0,N) FOR(j,i+1,N) vec.eb(i,j);
    random_shuffle(all(vec));

    initialize(N);
    for(auto x: vec) 
    	cout << x.fi << ' ' << x.se << ' ' << hasEdge(x.fi,x.se) << endl;

    return 0;
}
#endif
//Change your approach 

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