Submission #677566

#TimeUsernameProblemLanguageResultExecution timeMemory
677566ThegeekKnight16Rice Hub (IOI11_ricehub)C++17
17 / 100
1088 ms1740 KiB
#include <bits/stdc++.h> #include "ricehub.h" using namespace std; int besthub(int R, int L, int X[], long long B) { int resp = 0; for (int i = 1; i <= R; i++) { int p = i; int q = i+1; int sum = 0; int respi = 0; while (p >= 1 && q <= R) { int desq = abs(X[i] - X[p]); int ddir = abs(X[q] - X[i]); if (desq < ddir) { if (sum + desq > B) break; sum += desq; p--; respi++; } else { if (sum + ddir > B) break; sum += ddir; q++; respi++; } } // cerr << i << " " << sum << " " << respi << '\n'; resp = max(resp, respi); } return resp; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...