# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
737751 | Shinori | Split the sequence (APIO14_sequence) | C++17 | 786 ms | 13548 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 MAXN 201010
#define INF 987654321
using namespace std;
struct dat{
int w,cnt;
bool operator<(const dat &r)const{
if(w!=r.w)return w<r.w;
return cnt<r.cnt;
}
}tree[MAXN<<2];
int lazy[MAXN<<2];
dat dp[MAXN];
vector<int>v[MAXN];
int a[MAXN],pre[MAXN],n,k;
long long int ans;
void prop(int no,int ns,int ne){
if(ns!=ne){
lazy[no<<1]+=lazy[no];
lazy[no<<1|1]+=lazy[no];
}
tree[no].w+=lazy[no];
lazy[no]=0;
}
void update1(int no,int ns,int ne,int an,dat val){
if(an>ne || an<ns)return;
if(ns==ne){
tree[no]=val;
return;
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... |