# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
91577 | Mercenary | Bali Sculptures (APIO15_sculpture) | C++11 | 76 ms | 1932 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;
#define taskname "TEST"
#define pb push_back
typedef long double ld;
typedef long long ll;
const int maxn1 = 105;
const int maxn2 = 2e3 + 5;
int n , a , b , y[maxn2];
ll s[maxn2];
void enter()
{
cin >> n >> a >> b;
for(int i = 1 ; i <= n ; ++i){
cin >> y[i];
s[i] = s[i - 1] + y[i];
}
}
ll get(int i , int j)
{
return s[j] - s[i - 1];
}
bool ok(ll x , ll y)
{
return !(x & y);
}
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... |