# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
620852 | MKopchev | Distributing Candies (IOI21_candies) | C++17 | 1400 ms | 63900 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 "candies.h"
#include<bits/stdc++.h>
using namespace std;
const int nmax=2e5+42;
struct info
{
long long sum;
long long maxi_subarray,maxi_pref,maxi_suff;
int id_maxi_pref;
long long mini_subarray,mini_pref,mini_suff;
int id_mini_pref;
};
info tree[4*nmax];
info my_merge(info LHS,info RHS)
{
info ret;
ret.sum=LHS.sum+RHS.sum;
ret.maxi_pref=max(LHS.maxi_pref,LHS.sum+RHS.maxi_pref);
if(LHS.maxi_pref>LHS.sum+RHS.maxi_pref)ret.id_maxi_pref=LHS.id_maxi_pref;
else ret.id_maxi_pref=RHS.id_maxi_pref;
ret.maxi_suff=max(RHS.maxi_suff,RHS.sum+LHS.maxi_suff);
# | 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... |