Submission #742076

#TimeUsernameProblemLanguageResultExecution timeMemory
742076PagodePaiva쌀 창고 (IOI11_ricehub)C++14
0 / 100
2 ms468 KiB
#include<bits/stdc++.h> #include "ricehub.h" using namespace std; int besthub(int R, int L, int X[], long long B){ int n = R, M = L; int v[n]; for(int i = 0;i < n;i++){ v[i] = X[i]; } int b = B; int l = 1, r = n; int pref[n]; pref[0] = 0; for(int i = 0;i < n;i++){ pref[i+1] = pref[i] + v[i]; } while(l < r){ int mid = (l+r)/2; int t = mid/2; bool aux = true; for(int i = 0;i < n-mid+1;i++){ int p = v[i + t]; // int val = pref[i+mid-1] - pref[i+t]; int val = pref[i+mid] - pref[i+t] + pref[i] - pref[i+t]; if(val <= b){ l = mid+1; aux = false; break; } } if(aux){ r = mid; } } return l; }

Compilation message (stderr)

ricehub.cpp: In function 'int besthub(int, int, int*, long long int)':
ricehub.cpp:30:11: warning: unused variable 'p' [-Wunused-variable]
   30 |       int p = v[i + t];
      |           ^
ricehub.cpp:7:14: warning: unused variable 'M' [-Wunused-variable]
    7 |   int n = R, M = L;
      |              ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...