# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
95909 | 314rate | Split the sequence (APIO14_sequence) | C++14 | 2064 ms | 22216 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;
typedef long long ll;
typedef long double ld;
const int N=200+7;
int n,k;
int p[N];
int s(int l,int r)
{
return p[r]-p[l-1];
}
int dp[N][N][N];
int f[N][N][N];
int split[N][N][N];
bool viz[N];
void go(int cnt,int l,int r)
{
if(cnt>0)
{
cout<<split[cnt][l][r]<<" ";
go(f[cnt][l][r],l,split[cnt][l][r]);
go(cnt-1-f[cnt][l][r],split[cnt][l][r]+1,r);
# | 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... |