# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
386693 | jjang36524 | Bali Sculptures (APIO15_sculpture) | C++14 | 123 ms | 512 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 <iostream>
#include <algorithm>
#include <string.h>
using namespace std;
#define int long long
int dp[2001];
int dp2[101][101];
int psum[2001];
signed main()
{
int N,a,b;
cin >> N >> a >> b;
int i;
for(i=0;i<N;i++)
{
int v;
cin >> v;
psum[i+1]=psum[i]+v;
}
if(a==1)
{
int cu=(1LL<<42)-1;
for(i=41;i>=0;i--)
{
cu-=1LL<<i;
int j;
memset(dp,1,sizeof(dp));
dp[0]=0;
for(j=1;j<=N;j++)
{
# | 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... |