Submission #219266

#TimeUsernameProblemLanguageResultExecution timeMemory
219266summitwei게임 (IOI14_game)C++17
15 / 100
6 ms512 KiB
#include <bits/stdc++.h> #include <game.h> using namespace std; typedef vector<int> vi; typedef vector<pair<int, int> > vpii; typedef pair<int, int> pii; typedef long long ll; typedef pair<ll, ll> pll; typedef pair<double, double> pdd; typedef vector<ll> vll; #define INF 0x3f3f3f3f #define MOD 1000000009LL #define EPSILON 0.00001 #define f first #define s second #define pb push_back #define mp make_pair #define FOR(i, a, b) for (ll i=(a); i<=(signed)(b); i++) #define F0R(i, a) for (ll i=0; i<(signed)(a); i++) #define RFOR(i, a, b) for (ll i=(a); i >= b; i--) #define MN 1505 int nn; int deg[MN]; bool used[MN][MN]; void initialize(int n){ nn = n; F0R(i, n){ used[i][i] = true; deg[i] = n-1; } } void dfs(int cn){ //cout << "exp " << cn << "\n"; F0R(i, nn){ if(!used[i][cn]){ //cout << i << " " << cn << " nec\n"; used[i][cn] = used[cn][i] = true; --deg[i]; --deg[cn]; //cout << "degs " << deg[cn] << " " << deg[i] << "\n"; if(deg[i] == 1){ //cout << "time to exp " << i << "\n"; dfs(i); //cout << "ok done\n"; } else{ //cout << "wtmoo\n"; } return; } } } int hasEdge(int u, int v){ if(used[u][v]) return 1; used[u][v] = used[v][u] = true; --deg[u]; --deg[v]; if(deg[u] == 1){ dfs(u); } //cout << "bruh moment\n"; if(deg[v] == 1){ dfs(v); } return 0; } /*int main(){ //ios_base::sync_with_stdio(false); //cin.tie(0); int n; cin >> n; initialize(n); F0R(_, n*(n-1)/2){ int u, v; cin >> u >> v; cout << hasEdge(u, v) << endl; cout.flush(); } return 0; }*/
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...