# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
18863 | choyi0521 | 라멘 (JOI14_ramen) | C++14 | 0 ms | 1124 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "ramen.h"
bool a[400], b[400];
void Ramen(int N) {
bool flag;
do {
flag = false;
for (int i = 0; i < N - 1; i++) {
for (int j = i + 1; j < N; 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;
}
}
}
} 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 (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |