# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
503412 | rainboy | Akcija (COCI21_akcija) | C11 | 2546 ms | 47472 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.
/* https://codeforces.com/blog/entry/97754#comment-866029 (errorgorn) */
#include <stdio.h>
#define N 2000
#define K 2000
#define S 2000000000002LL
unsigned int X = 12345;
int rand_() {
return (X *= 3) >> 1;
}
int ww[N], tt[N], ii[N];
int cc[K], hh[K], k, k_; long long ss[K];
int compare_t(int i, int j) {
return tt[i] - tt[j];
}
int compare_cs(int h1, int h2) {
return cc[h1] != cc[h2] ? cc[h2] - cc[h1] : (ss[h1] == ss[h2] ? 0 : (ss[h1] < ss[h2] ? -1 : 1));
}
int (*compare)(int, int);
void sort(int *ii, int l, int r) {
while (l < r) {
int i = l, j = l, k = r, i_ = ii[l + rand_() % (r - l)], tmp;
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |