# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
732118 | Trunkty | Toll (BOI17_toll) | C++14 | 1367 ms | 35212 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/extc++.h>
using namespace std;
typedef long long ll;
#define int ll
int k,n,m,q;
vector<vector<int>> roads[50005],rev[50005],query[200005];
int best[50005],ans[10005];
bool check[50005];
void update(int node, int l, int r, int a, int b, int ind){
int mid = (l+r)/2;
if(a/k<=mid and mid<=b/k){
query[node].push_back({a,b,ind});
}
else if(b/k<=mid){
update(node*2,l,mid,a,b,ind);
}
else{
update(node*2+1,mid+1,r,a,b,ind);
}
}
void walk(int node, int l, int r){
int mid = (l+r)/2;
if(l!=r){
walk(node*2,l,mid);
walk(node*2+1,mid+1,r);
}
int lef=l*k,rit=r*k+k-1;
# | 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... |