# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
205470 | anonymous | Palembang Bridges (APIO15_bridge) | C++14 | 1115 ms | 204152 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<iostream>
#include<utility>
#include<algorithm>
#define MAXN 100005
#define MAXD ((int) 1e9+5)
#define LL long long
#define fi first
#define se second
using namespace std;
int N, K, P, xi, yi;
LL ans, best=1LL<<60;
char s1, s2;
pair <LL, LL> Pt[MAXN];
class LazyCreate {
LL Sum[MAXN * 140];
int ST[MAXN*140][3], P=2; //sum, num, l, r
public:
void upd(int ind, int val, bool b, int l, int r, int cur) {
if (l > ind || ind > r) {return;}
if (l == r) {
if (b) { //true means add
Sum[cur]+=val;
ST[cur][0]++;
} else {
Sum[cur]-=val;
ST[cur][0]--;
}
} else {
int mid=(l+r)>>1;
if (!ST[cur][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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |