# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
916373 | owoovo | Two Currencies (JOI23_currencies) | C++17 | 787 ms | 37612 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 ll long long
#define F first
#define S second
using namespace std;
struct bit{
ll ori[200050]={};
void modify(int x,int pos){
while(pos<200030){
ori[pos]+=x;
pos+=pos&(-pos);
}
return;
}
ll q(int x){
ll ans=0;
while(x){
ans+=ori[x];
x-=x&(-x);
}
return ans;
}
ll query(int l,int r){
return q(r)-q(l);
}
}cont,sum;
struct query{
ll u,v,x,y,id;
}qu[100010];
vector<int> e[100010];
# | 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... |