# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
461920 | Jasiekstrz | Cigle (COI21_cigle) | C++17 | 966 ms | 67572 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 fi first
#define se second
using namespace std;
const int N=5e3;
const int PP=82e2;;
int tab[N+10];
int dp[N+10][N+10];
int pot;
int tree[2*PP+10];
int lazy[2*PP+10];
void add(int i,int l,int r,int ls,int rs,int c)
{
if(r<ls || rs<l)
return;
if(ls<=l && r<=rs)
{
lazy[i]+=c;
return;
}
int mid=(l+r)/2;
add(2*i,l,mid,ls,rs,c);
add(2*i+1,mid+1,r,ls,rs,c);
tree[i]=max(tree[2*i]+lazy[2*i],tree[2*i+1]+lazy[2*i+1]);
return;
}
int read()
{
return tree[1]+lazy[1];
}
# | 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... |