# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
875248 | NintsiChkhaidze | Split the sequence (APIO14_sequence) | C++17 | 69 ms | 71596 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 ll long long
#define pb push_back
#define s second
#define f first
#define left t[id][h].l,l,(l + r)/2
#define right t[id][h].r,(l + r)/2 + 1,r
#define pii pair <int,int>
#define int ll
using namespace std;
const int N = 1e3 + 3,inf = 1e8;
int p[N],lst[N][203];
ll dp[N][203];
int cnt[203];
struct {
int k,b,l = 0,r = 0,vis=0;
} t[203][4*N];
ll f(int k,int b,int x){
return x * k + b;
}
void upd(int id,int h,int l,int r,int K,int B,int idx){
if (!t[id][h].vis){
t[id][h].vis = idx;
t[id][h].k = K;
# | 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... |