# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1099088 | Fallout3691 | Snowball (JOI21_ho_t2) | C++17 | 2502 ms | 19540 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>
using namespace std;
#define int long long
signed main() {
int n, q;
cin >> n >> q;
vector<int> a(n + 2);
a[0] = -1e18, a[n + 1] = 1e18;
for (int i = 1; i <= n; i++)
cin >> a[i];
int mn = 0, mx = 0;
int cur = 0;
int x;
map<int, int> mp;
mp[0] = 0;
for (int i = 1; i <= q; i++) {
cin >> x;
cur += x;
if (cur < mn) {
mp[cur] = i;
mn = cur;
}
if (cur > mx) {
mp[cur] = i;
mx = cur;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |