제출 #30411

#제출 시각아이디문제언어결과실행 시간메모리
30411inqr게임 (IOI14_game)C++14
0 / 100
0 ms10812 KiB
#include "game.h" #include <bits/stdc++.h> #define pb push_back #define mp make_pair #define rt insert #define st first #define nd second #define ll long long #define pii pair < int , int > #define DB printf("debug\n"); #define umax( x , y ) x = max( x , (y) ) #define umin( x , y ) x = min( x , (y) ) #define all(x) x.begin() , x.end() using namespace std; int nonode[1505]; int N,totno,maxque,maxyes,maxno; void initialize(int n) { N=n; maxque=(n)*(n-1)/(2); maxyes=n-1; maxno=maxque-maxyes; } int hasEdge(int u, int v) { if(nonode[u]<N-2&&nonode[v]<N-2&&totno<maxno){ return 0; nonode[u]++; nonode[v]++; totno++; } return 1; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...