제출 #564145

#제출 시각아이디문제언어결과실행 시간메모리
564145myrcella게임 (IOI14_game)C++17
0 / 100
1 ms256 KiB
//by szh
#include "game.h"
#include<bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define pii pair<int,int>
#define pll pair<long long,long long>
#define pb push_back
#define debug(x) cerr<<#x<<"="<<x<<endl
#define pq priority_queue
#define inf 0x3f
#define rep(i,a,b) for (int i=a;i<(b);i++)
#define MP make_pair
#define SZ(x) (int(x.size()))
#define ll long long
#define mod 1000000007
#define ALL(x) x.begin(),x.end()
void inc(int &a,int b) {a=(a+b)%mod;}
void dec(int &a,int b) {a=(a-b+mod)%mod;}
int lowbit(int x) {return x&(-x);}
ll p0w(ll base,ll p) {ll ret=1;while(p>0){if (p%2ll==1ll) ret=ret*base%mod;base=base*base%mod;p/=2ll;}return ret;}

const int maxn = 1555;

int n;
bitset <maxn> s[maxn];

void initialize(int N) {
	n = N;
	rep(i,0,n)
		rep(j,0,n) {
			if (i==j) s[i][i]=0;
			else s[i][j]=1;
		}
	return;
}

int hasEdge(int u,int v) {
	if ((s[u]&s[v]).count()) {
		s[u][v]=0;
		s[v][u]=0;
		return 0;
	}
	else return 1;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...