# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1023930 | ttamx | Popeala (CEOI16_popeala) | C++17 | 2060 ms | 8676 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;
using ll = long long;
const int T=20005;
const int N=55;
const int S=55;
const int K=1<<16;
const ll INF=LLONG_MAX/2;
int m,n,s;
ll p[T],qs[T];
string a[N];
ll dp[T][S];
int ptr[N];
struct Segtree{
ll t[K],lz[K];
void apply(int i,ll v){
t[i]+=v,lz[i]+=v;
}
void push(int i){
apply(i*2,lz[i]);
apply(i*2+1,lz[i]);
lz[i]=0;
}
void pull(int i){
t[i]=min(t[i*2],t[i*2+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... |