# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1164447 | fzyzzz_z | Worst Reporter 3 (JOI18_worst_reporter3) | C++20 | 355 ms | 15180 KiB |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, q;
cin >> n >> q;
vector<ll> d(n + 1);
for (int i = 1; i <= n; ++i) {
cin >> d[i];
}
vector<ll> dist(n + 1), time(n + 1);
dist[0] = 1;
time[0] = 1;
for (int i = 1; i <= n; ++i) {
// if (dist[i - 1] >= d[i]) {
// dist[i] = dist[i - 1];
// time[i] = time[i - 1];
// continue;
// }
ll need = (d[i] + dist[i - 1] - 1) / dist[i - 1];
dist[i] = dist[i - 1] * need;
time[i] = time[i - 1] * need;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |