# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
741192 | rainboy | Interval Collection (CCO20_day2problem2) | C11 | 1166 ms | 83140 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 500000
#define N_ (1 << 20) /* N_ = pow2(ceil(log2(N))) */
#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; }
unsigned int Z = 12345;
int rand_() {
return (Z *= 3) >> 1;
}
char type[N]; int xx[N * 2], xx_[N * 2], prev[N];
int compare_lr(int i, int j) {
if (xx[i << 1 | 0] != xx[j << 1 | 0])
return xx[i << 1 | 0] - xx[j << 1 | 0];
if (xx[i << 1 | 1] != xx[j << 1 | 1])
return xx[i << 1 | 1] - xx[j << 1 | 1];
return i - j;
}
int compare_x(int i, int j) {
return xx[i] != xx[j] ? xx[i] - xx[j] : (j & 1) - (i & 1);
}
int (*compare)(int, int);
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... |