Submission #421842

#TimeUTC-0UsernameProblemLanguageResultExecution timeMemory
4218422021-06-09 12:55:18arayiRice Hub (IOI11_ricehub)C++17
100 / 100
220 ms2524 KiB
#include "ricehub.h"
#include <bits/stdc++.h>
#define lli long long
using namespace std;
const int N = 1e6 + 30;
int n;
lli pr[N];
lli s(int l, int r)
{
lli ret = pr[r];
if(l) ret -= pr[l-1];
return ret;
}
int besthub(int N, int L, int X[], long long B)
{
n = N;
for (int i = 0; i < n; i++)
{
pr[i] = X[i];
if(i) pr[i] += pr[i - 1];
}
int ret = 0;
for (int i = 0; i < n; i++)
{
int l = 0, r = i, ans = 0;
while(l <= r)
{
int mid = (l + r) / 2;
lli sm = (lli)mid * 1LL * X[i] - s(i - mid, i - 1);
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...