# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
683616 | rainboy | Arranging Tickets (JOI17_arranging_tickets) | C11 | 113 ms | 340 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 300
#define M 300
#define INF 0x3f3f3f3f
int min(int a, int b) { return a < b ? a : b; }
int max(int a, int b) { return a > b ? a : b; }
int main() {
static int xx[N], yy[N], cc[N], dd[M], ll[N], rr[N];
static char flip[N];
int n, m, i, i_, a, b, tmp, upd, ans;
scanf("%d%d", &m, &n);
for (i = 0; i < n; i++)
scanf("%d%d%d", &xx[i], &yy[i], &cc[i]), xx[i]--, yy[i]--;
ans = INF;
for (a = 0; a < m; a++) {
for (i = 0; i < n; i++) {
ll[i] = (xx[i] - a + m) % m, rr[i] = (yy[i] - a + m) % m;
if (ll[i] > rr[i])
tmp = ll[i], ll[i] = rr[i], rr[i] = tmp;
}
memset(flip, 0, n * sizeof *flip);
while (1) {
memset(dd, 0, m * sizeof *dd);
for (i = 0; i < n; i++)
if (!flip[i])
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... |