# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1092260 | DangKhoizzzz | Split the sequence (APIO14_sequence) | C++14 | 2061 ms | 118100 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 int long long
#define fi first
#define se second
using namespace std;
typedef pair<int,int> pii;
const int maxn = 2e5 + 7;
int N , K , a[205] , ps[205] , f[205][205][205];
bool vis[205][205][205];
pair <int ,pair<int ,int>> trace[205][205][205];
int sum(int l , int r)
{
return ps[r] - ps[l-1];
}
int solve(int l , int r , int k)
{
if(k == 0) return 0ll;
if(l > r) return -1e15;
if(l == r) return -1e15;
# | 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... |