# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
651486 | pauloamed | Split the sequence (APIO14_sequence) | C++17 | 1305 ms | 102576 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;
#define int long long
const int MAXN = 100010;
const int MAXK = 250;
int S[MAXN], wS[MAXN];
int query(int l, int r){
int a = S[r];
int b = S[r] - ((l == 0)? 0 : S[l - 1]);
int c = wS[r] - ((l == 0)? 0 : wS[l - 1]);
return a * b - c;
}
int last_dp[MAXN];
int curr_dp[MAXN];
signed ans[MAXN][MAXK];
int get_dp(int i){
if(i < 0) return 0;
else return last_dp[i];
}
int K;
void solve(int l, int r, int searchL, int searchR){
if(l > r) return;
# | 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... |