# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
317801 | MahdiBahramian | Bali Sculptures (APIO15_sculpture) | C++11 | 136 ms | 11160 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 pb push_back
#define ins insert
#define var auto
#define F first
#define S second
#define mp make_pair
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int LOG = 40;
const int Max = 2e3 + 10;
const int INF = 1000000000;
int n , a , b;
bool dp[Max][Max];
bool ok[Max][Max];
int Y[Max];
int dist[Max];
vector<int> N[Max];
bool Check(ll selected , ll newCheck)
{
if(a > 1)
{
for(int i = 1; i <= n ; i++)
{
ll sum = 0;
for(int j = i; j <= n ; j++)
{
sum += Y[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... |