# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
45540 | dqhungdl | Palembang Bridges (APIO15_bridge) | C++17 | 2081 ms | 39660 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;
int64_t k,n,Count=1;
ii tree1[200005],tree2[200005];
vector<int64_t> V,VV,mind,maxd,g[200005];
vector<ii> gg[200005];
map<int64_t,int64_t> F;
void Update1(int64_t idx,int64_t data)
{
while(idx<=Count)
{
tree1[idx].first+=data;
tree1[idx].second++;
idx+=idx&-idx;
}
}
ii Query1(int64_t idx)
{
ii rs=ii(0,0);
while(idx>0)
{
rs.first+=tree1[idx].first;
rs.second+=tree1[idx].second;
idx-=idx&-idx;
}
return rs;
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... |