Submission #219259

#TimeUsernameProblemLanguageResultExecution timeMemory
219259summitweiGame (IOI14_game)C++17
0 / 100
5 ms384 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]; void initialize(int n){ nn = n; } int hasEdge(int u, int v){ ++deg[u]; ++deg[v]; if(deg[u] == nn-1 || deg[v] == nn-1) return 1; 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...