# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
944499 | rainboy | 올림픽 (KOI13_olympic) | C11 | 1 ms | 436 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 <stdio.h>
#define N 1000
int main() {
static int gg[N], ss[N], bb[N];
int n, h, i, i_, r;
scanf("%d%d", &n, &i_), i_--;
for (h = 0; h < n; h++) {
scanf("%d", &i), i--;
scanf("%d%d%d", &gg[i], &ss[i], &bb[i]);
}
r = 1;
for (i = 0; i < n; i++)
if (gg[i] > gg[i_] || gg[i] == gg[i_] && (ss[i] > ss[i_] || ss[i] == ss[i_] && bb[i] > bb[i_]))
r++;
printf("%d\n", r);
return 0;
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |