# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
948914 | rainboy | Inspector (POI13_ins) | C11 | 555 ms | 35676 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 100000
int min(int a, int b) { return a < b ? a : b; }
int max(int a, int b) { return a > b ? a : b; }
int solve(int *tt, int *ii, int *cc, int n, int m, int k) {
static int ll[N], rr[N], hh[M], dd0[M + 1], dd1[M + 1];
int m_, h, i, t, c, d, d0, d1;
memset(dd0, 0, m * sizeof *dd0);
for (i = 0; i < n; i++)
ll[i] = m, rr[i] = -1;
for (h = 0; h < k; h++) {
i = ii[h], t = tt[h];
ll[i] = min(ll[i], t), rr[i] = max(rr[i], t);
if (dd0[t] == 0)
dd0[t] = cc[h];
else if (dd0[t] != cc[h])
return 0;
}
m_ = 0;
for (t = 0; t < m; t++)
if (dd0[t] != 0)
dd0[hh[t] = m_++] = dd0[t];
dd0[m_] = 0;
for (h = m_; h > 0; h--)
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |