# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1117209 | vjudge1 | trapezoid (balkan11_trapezoid) | C++17 | 242 ms | 27208 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;
#define F first
#define S second
pair<int,int> operator+=(pair<int,int> &a,pair<int,int> b){
if(a.F<b.F)
return a=b;
if(a.F>b.F)
return a;
a.S+=b.S;
if(a.S>=30013)
a.S-=30013;
return a;
}
struct {
pair<int,int> trrre[200100];
pair<int,int>query(int x){
pair<int,int>res;
while(x)
res+=trrre[x],x-=x&-x;
return res;
}
void upd(int x,pair<int,int> c){
c.first++;
while(x<=2e5)
trrre[x]+=c,x+=x&-x;
}
} fenwick;
pair<int,int> vals[100100];
map<int,int>mp2;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |