# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
99608 | ae04071 | Palembang Bridges (APIO15_bridge) | C++11 | 311 ms | 11580 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>
#define fi first
#define se second
#define sz(x) ((int)(x).size())
using namespace std;
using lli = long long;
using pii = pair<int,int>;
int k,n;
vector<pii> arr;
lli ta[100001];
const int MAX=1<<18;
struct seg_tr{
int cnt[MAX<<1];
lli val[MAX<<1];
void init() {for(int i=0;i<MAX+MAX;i++) val[i]=cnt[i]=0;}
void upd(int cur,int s,int f,int idx,int v) {
if(f<idx || s>idx) return;
else if(s==f) {
cnt[cur]++; val[cur]+=v;
}
else {
int nx=cur<<1,md=(s+f)>>1;
upd(nx,s,md,idx,v); upd(nx+1,md+1,f,idx,v);
cnt[cur] = cnt[nx] + cnt[nx+1];
val[cur] = val[nx] + val[nx+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... |