# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
445506 | keta_tsimakuridze | Zoltan (COCI16_zoltan) | C++14 | 564 ms | 23336 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 f first
#define s second
#define pii pair<int,int>
using namespace std;
const int N=2e5+5,mod=1e9+7;
int t,a[N],b[N],n,pwr[N];
pair<int,int> tree[4*N][2],l[N][2];
map<int,int> ind;
void upd(pii &a,pii b){
if(a.f == b.f) {
a.s = (a.s + b.s)%mod;
}
else if(a.f < b.f) {
a.s = b.s;
a.f = b.f;
}
}
void update(int u,int ind,int l,int r,int val1,int val2,int t) {
if(l>ind || r<ind) return;
if(l==r) {
upd(tree[u][t],{val1,val2});
return;
}
int mid = (l+r)/2;
update(2*u,ind,l,mid,val1,val2,t);
update(2*u+1,ind,mid+1,r,val1,val2,t);
tree[u][t] = {0,0};
upd(tree[u][t],tree[2*u][t]);
upd(tree[u][t],tree[2*u+1][t]);
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |