# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
152022 | 2019-09-06T02:12:38 Z | EntityIT | Homecoming (BOI18_homecoming) | C++14 | 0 ms | 0 KB |
#include<bits/stdc++.h> #include<homecoming.h> using namespace std; using ll = long long; ll solve(int n, int K, vector<int> a, vector<int> b) { ll ret = 0; vector<ll> prefB; for (int i = 0; i < (n << 1); ++i) prefB.push_back( (i ? prefB[i - 1] : 0) + (b[i % n]) ); for (int i = 0; i < n; ++i) { ret += max( (ll)0, a[i] - prefB[i + K - 1] + (i ? prefB[i - 1] : 0) ); } return ret; }