# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
113199 | ansol4328 | Bali Sculptures (APIO15_sculpture) | C++11 | 91 ms | 768 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<stdio.h>
#include<algorithm>
using namespace std;
typedef long long ll;
int n, a, b;
ll m[2005], s[2005];
int dp[2005][2005];
const int INF=1e9;
int main()
{
scanf("%d %d %d",&n,&a,&b);
for(int i=1 ; i<=n ; i++)
{
scanf("%lld",&m[i]);
s[i]=s[i-1]+m[i];
}
ll res=1, idx=1;
while(res<s[n]) idx<<=1, (res<<=1)+=1;
if(a==1)
{
while(idx!=0)
{
for(int i=1 ; i<=n ; i++) dp[1][i]=INF;
(res&=~idx);
for(int i=1 ; i<=n ; i++)
{
for(int j=i-1 ; j>=0 ; j--)
Compilation message (stderr)
# | 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... |