# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
488520 | rainboy | Ljeto (COCI21_ljeto) | C11 | 0 ms | 276 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 8
#define T 10
int main() {
static int tt[N], ss[2];
int m, i;
scanf("%d", &m);
for (i = 0; i < N; i++)
tt[i] = -T - 1;
while (m--) {
int t;
scanf("%d%d%*d", &t, &i), i--;
ss[i / 4] += 100 + (t - tt[i] <= 10 ? 50 : 0);
tt[i] = t;
}
printf("%d %d\n", ss[0], ss[1]);
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... |