# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1023505 | avighna | Solar Storm (NOI20_solarstorm) | C++17 | 392 ms | 209592 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 <iostream>
#include <numeric>
#include <vector>
typedef long long ll;
const ll N = 1e6 + 1;
ll d[N], v[N], left[N], right[N], psum[N];
ll lift[N][20];
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(nullptr);
ll n, s, k;
std::cin >> n >> s >> k;
for (ll i = 0; i < n - 1; ++i) {
std::cin >> d[i];
}
for (ll i = 0; i < n; ++i) {
std::cin >> v[i];
}
for (ll i = n - 1, j = n - 1, dist = 0; i >= 0; --i) {
if (i != n - 1) {
dist += d[i];
}
// j is the last index satisfying dist[i...j] <= k
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |