# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
18866 | 2016-02-16T05:55:30 Z | choyi0521 | 라멘 (JOI14_ramen) | C++14 | 0 ms | 1124 KB |
#include "ramen.h" bool a[400], b[400],flag; void query(int i,int j) { if (!a[i] && !a[j] || !b[i] && !b[j]) { flag = true; int c = Compare(i, j); if (c == 1) b[j] = a[i] = true; else b[i] = a[j] = true; } } void Ramen(int N) { for (int i = 1; i < N; i += 2) query(i - 1, i); do { flag = false; for (int i = 0; i < N - 1; i++) for (int j = i + 1; j < N; j++) query(i, j); } while (flag); int p1, p2; for (int i = 0; i < N; i++) { if (!a[i]) p1 = i; if (!b[i]) p2 = i; } Answer(p1, p2); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 1124 KB | Output is correct |
2 | Correct | 0 ms | 1124 KB | Output is correct |
3 | Correct | 0 ms | 1124 KB | Output is correct |
4 | Correct | 0 ms | 1124 KB | Output is correct |
5 | Correct | 0 ms | 1124 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 1124 KB | Output is correct |
2 | Correct | 0 ms | 1124 KB | Output is correct |
3 | Correct | 0 ms | 1124 KB | Output is correct |
4 | Correct | 0 ms | 1124 KB | Output is correct |
5 | Correct | 0 ms | 1124 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 1124 KB | Output is correct |
2 | Correct | 0 ms | 1124 KB | Output is correct |
3 | Correct | 0 ms | 1124 KB | Output is correct |
4 | Correct | 0 ms | 1124 KB | Output is correct |
5 | Correct | 0 ms | 1124 KB | Output is correct |