# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
46751 | dqhungdl | Palembang Bridges (APIO15_bridge) | C++17 | 951 ms | 35232 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<int64_t,int64_t> ii;
typedef pair<int64_t,ii> iii;
int64_t T,n,res=0,Count=1,minn=1e18,Num[3],Pre[200005];
ii tree[3][800005];
vector<int64_t> VV;
vector<iii> V;
map<int64_t,int64_t> F;
void Update(int64_t t,int64_t k,int64_t l,int64_t r,int64_t pos,int64_t val,int64_t cnt)
{
if(l==r)
{
tree[t][k].first+=val;
tree[t][k].second+=cnt;
return;
}
int64_t mid=(l+r)/2;
if(pos<=mid)
Update(t,2*k,l,mid,pos,val,cnt);
else
Update(t,2*k+1,mid+1,r,pos,val,cnt);
tree[t][k].first=tree[t][2*k].first+tree[t][2*k+1].first;
tree[t][k].second=tree[t][2*k].second+tree[t][2*k+1].second;
}
int64_t Median(int64_t t,int64_t k,int64_t l,int64_t r,int64_t sum)
{
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... |