제출 #203298

#제출 시각아이디문제언어결과실행 시간메모리
203298abra_stoneMeetings (JOI19_meetings)C++14
0 / 100
8 ms1144 KiB
#include "meetings.h" #include <cstring> #define N 55 int v[N][N][N]; int query(int p, int q, int r) { if (v[p][q][r] != -1) return v[p][q][r]; v[p][q][r] = v[p][r][q] = v[q][p][r] = v[q][r][p] = v[r][p][q] = v[r][q][p] = Query(p, q, r); } void Solve(int n) { int i, j, k, t; memset(v, -1, sizeof(v)); for (i = 0; i < n; i++) { for (j = i + 1; j < n; j++) { for (k = 0; k < n; k++) { if (k == i || k == j) continue; t = query(i, j, k); if (t != i && t != j) break; } if (k == n) Bridge(i, j); } } }

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

meetings.cpp: In function 'int query(int, int, int)':
meetings.cpp:10:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...