제출 #386662

#제출 시각아이디문제언어결과실행 시간메모리
386662ismoilov게임 (IOI14_game)C++14
15 / 100
2 ms384 KiB
#include "game.h" #include<bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<int, int> pii; typedef pair<ll, ll> pll; #define IOS ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); #define all(x) (x).begin(), (x).end() #define rall(x) (x).begin(), (x).end() #define fp(a,i,c) for(int (a) = (i); (a) < (c); (a)++) #define fpp(a,i,c) for(int (a) = (i); (a) <= (c); (a)++) #define fv(c) for(int (a) = (1); (a) <= (c); (a)++) #define fz(c) for(int (a) = (0); (a) < (c); (a)++) #define fm(a,i,c) for(int (a) = (i); (a) > (c); (a)--) #define fmm(a,i,c) for(int (a) = (i); (a) >= (c); (a)--) #define pb push_back #define in insert #define ss second #define ff first int ad = 0, nn; set <int> a, b; void initialize(int n) { nn = (n-1)*n/2; fp(i,0,n/2) a.in(i); fp(i,n/2,n) b.in(i); nn = nn - ((a.size()-1)*a.size()/2) - ((b.size()-1)*b.size()/2); } int hasEdge(int x, int y) { if((a.count(x) == 1 && a.count(y)) == 1 || (b.count(x) == 1 && b.count(y) == 1)){ return 1; } else{ if(ad == nn-1) return 1; ad ++; return 0; } }

컴파일 시 표준 에러 (stderr) 메시지

game.cpp: In function 'void initialize(int)':
game.cpp:10:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   10 | #define fp(a,i,c) for(int (a) = (i); (a) < (c); (a)++)
      |                           ^
game.cpp:24:2: note: in expansion of macro 'fp'
   24 |  fp(i,0,n/2)
      |  ^~
game.cpp:10:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   10 | #define fp(a,i,c) for(int (a) = (i); (a) < (c); (a)++)
      |                           ^
game.cpp:26:2: note: in expansion of macro 'fp'
   26 |  fp(i,n/2,n)
      |  ^~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...