# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
79790 | aquablitz11 | trapezoid (balkan11_trapezoid) | C++14 | 563 ms | 66560 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;
using pii = pair<int, int>;
using piipii = pair<pii, pii>;
using pipii = pair<int, pii>;
#define all(x) x.begin(), x.end()
#define mp make_pair
#define F first
#define S second
pii comb(pii a, pii b) {
if (a.F == b.F)
return pii(a.F, a.S+b.S);
else
return max(a, b);
}
const int N = 1<<17;
int n;
piipii A[N];
vector<pii> coord;
vector<int> seg[N<<1];
vector<pii> val[N<<1];
void build(int p=1, int b=0, int e=n-1) {
val[p].resize(e-b+2, pii(0, 0));
if (b == e) {
seg[p].push_back(A[coord[b].S].F.S);
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |