제출 #983068

#제출 시각아이디문제언어결과실행 시간메모리
983068Muhammad_AneeqGame (APIO22_game)C++17
0 / 100
4 ms14424 KiB
// #include "game.h" #include <vector> #include <set> using namespace std; int N,K; int const MAXN=300000+10; set<int>nei[MAXN]={}; bool vis[MAXN]={}; int cur=1; void init(int n, int k) { N=n,K=k; for (int i=0;i<k-1;i++) nei[i].insert(i+1); } bool check_cycle(int n) { vis[n]=1; for (auto i:nei[n]) { if (vis[i]==cur&&i<K) return 1; if (vis[i]) continue; if (check_cycle(i)) return 1; } return 0; } int add_teleporter(int u, int v) { nei[u].insert(v); for (int i=0;i<K;i++) { if (vis[i]==0&&check_cycle) return 1; cur++; } return 0; }

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

game.cpp: In function 'int add_teleporter(int, int)':
game.cpp:35:20: warning: the address of 'bool check_cycle(int)' will never be NULL [-Waddress]
   35 |     if (vis[i]==0&&check_cycle)
      |                    ^~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...