제출 #1274657

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

game

#include "game.h"
#include <bits/stdc++.h>
using namespace std;
#define name "game"
#define MAXN 1503
#define pb push_back
#define pf push_front
#define ll long long
#define ii pair<int, int>
#define fs first
#define sc second
#define ill pair<int, ll>
#define lli pair<ll, int>
#define llll pair<ll, ll>
#define all(v) v.begin(),v.end()
#define uni(v) v.erase(unique(all(v)),v.end())
#define bit(n,i) (((n)>>(i))&1)
#define FOR(i,a,b) for (int i=(a),_b=(b); i<=_b; i++)
#define FORD(i,a,b) for (int i=(a),_b=(b); i>=_b; i--)
#define MASK(i) (1LL<<(i))
const int INF=1e9;
const int MOD=1e9+7;
void add(int &u, int v){
    u+=v;
    if (u>=MOD) u-=MOD;
}
void sub(int &u, int v){
    u-=v;
    if (u<0) u+=MOD;
}
void minimize(int &u, int v){
    u=min(u,v);
}
void maximize(int &u, int v){
    u=max(u,v);
}
long long Rand(long long l, long long r){
    ll tmp=0;
    FOR(i,1,4) tmp=((tmp<<15)^(((1<<15)-1)&rand()));
    return l+tmp%(r-l+1);
}
int deg[MAXN];
int _n;
int hasEdge(int u, int v){
    ++deg[u];
    ++deg[v];
    int res=0;
    if (deg[u]==_n-2||deg[v]==_n-2) res=1;
    return res;
}
void initialize(int n){
    FOR(i,0,n-1) deg[i]=0;
    _n=n;
    //vector<ii> res;
    FOR(times,1,n*(n-1)/2){
        int u,v;
        cin>>u>>v;
        if (u>v) swap(u,v);
        int x=hasEdge(u,v);
    //    if (x==1) res.pb({u,v});
    }
    //for (ii &tmp: res) cout<<tmp.fs<<" "<<tmp.sc<<"\n";
}

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