# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
371039 | valerikk | Snowball (JOI21_ho_t2) | C++17 | 1333 ms | 10020 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>
typedef long long ll;
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, q;
cin >> n >> q;
vector <ll> x(n);
for (int i = 0; i < n; i++) cin >> x[i];
vector <ll> w(q);
for (int i = 0; i < q; i++) cin >> w[i];
vector <ll> pref_mn(q + 1), pref_mx(q + 1);
pref_mn[0] = pref_mx[0] = 0;
ll sum = 0;
for (int i = 0; i < q; i++) {
sum += w[i];
pref_mn[i + 1] = min(pref_mn[i], sum);
pref_mx[i + 1] = max(pref_mx[i], sum);
}
auto get_mn = [&](ll val) {
int l = -1, r = q + 1;
while (r - l > 1) {
int m = (l + r) / 2;
if (pref_mn[m] <= val) r = m; else l = m;
}
return r;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |