# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
799719 | ttamx | Progression (NOI20_progression) | C++14 | 976 ms | 98468 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 long long ll;
typedef pair<ll,ll> p2;
const int N=3e5+5;
const int K=1<<20;
int n,q;
ll a[N],b[N];
struct segtree{
struct node{
ll sz,ans,all,sum;
p2 pre,suf;
node(ll x=0):sz(1),pre(p2(1,x)),suf(p2(1,x)),all(1),ans(1),sum(x){}
friend node operator+(node a,node b){
node c;
bool ok=(a.suf.second==b.pre.second);
bool oka=(a.suf.first==a.sz);
bool okb=(b.pre.first==b.sz);
c.sz=a.sz+b.sz;
c.sum=a.sum+b.sum;
if(ok&&oka){
c.pre=b.pre;
c.pre.first+=a.sz;
}else{
c.pre=a.pre;
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |