# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
119088 | Bruteforceman | Cambridge (info1cup18_cambridge) | C++11 | 132 ms | 10232 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 "bits/stdc++.h"
using namespace std;
typedef pair <int, int> pii;
int t[100010], d[100010];
int opt[100010];
int order[100010];
int pos[100010];
long long sum[100010 * 4];
long long ans[100010 * 4];
const long long inf = 1e18;
int n;
bool cmp(int p, int q) {
if(d[p] == d[q]) {
return t[p] < t[q];
}
return d[p] < d[q];
}
void add(int x, int c = 1, int b = 1, int e = n) {
if(b == e) {
sum[c] = t[order[b]];
ans[c] = d[order[b]] - t[order[b]];
return ;
}
int m = (b + e) >> 1;
int l = c << 1;
int r = l + 1;
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... |