# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
934133 | alexander707070 | Candies (JOI18_candies) | C++14 | 13 ms | 2908 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 MAXN 500007
using namespace std;
const long long inf=1e17;
int n,best;
long long a[MAXN],sum,maxs,curr;
bool used[MAXN];
long long calc(int x){
long long res=a[x];
for(int i=x-1;used[i] and i>=1;i-=2){
res-=a[i]; res+=a[i-1];
}
for(int i=x+1;used[i] and i<=n;i+=2){
res-=a[i]; res+=a[i+1];
}
return res;
}
void mark(int x){
used[x]=true;
for(int i=x-1;used[i] and i>=1;i-=2){
used[i]=false;
used[i-1]=true;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |