# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
683526 | rainboy | Arranging Tickets (JOI17_arranging_tickets) | C11 | 1 ms | 296 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>
#include <string.h>
#define N 100000
#define M 200000
int max(int a, int b) { return a > b ? a : b; }
int main() {
static int xx[N], yy[N], cc[N], dd[M];
int n, m, i, a, b, l, r, tmp, ans;
scanf("%d%d", &m, &n);
for (i = 0; i < n; i++)
scanf("%d%d%d", &xx[i], &yy[i], &cc[i]);
ans = 0;
for (a = 0; a < m; a++) {
memset(dd, 0, m * sizeof *dd);
for (i = 0; i < n; i++) {
l = (xx[i] - a + m) % m, r = (yy[i] - a + m) % m;
if (l > r)
tmp = l, l = r, r = tmp;
dd[l]++, dd[r]--;
}
for (b = 1; b < m; b++)
dd[b] += dd[b - 1];
for (b = 0; b < m; b++)
ans = max(ans, dd[b]);
}
printf("%d\n", (ans + 1) / 2);
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... |