# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
203298 | 2020-02-20T07:21:51 Z | abra_stone | Meetings (JOI19_meetings) | C++14 | 8 ms | 1144 KB |
#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); } } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 5 ms | 1016 KB | Wrong Answer [6] |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 5 ms | 1016 KB | Wrong Answer [6] |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 5 ms | 1016 KB | Wrong Answer [6] |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 8 ms | 1144 KB | DO NOT PRINT ANYTHING TO STANDARD OUTPUT |
2 | Halted | 0 ms | 0 KB | - |