# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
438695 | peijar | Worst Reporter 3 (JOI18_worst_reporter3) | C++17 | 824 ms | 33092 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>
#define int long long
using namespace std;
const int INF = 2e9;
signed main(void) {
ios_base::sync_with_stdio(false);
cin.tie(0);
int nbPersonnes, nbRequetes;
cin >> nbPersonnes >> nbRequetes;
vector<int> lenteurs(nbPersonnes + 1);
for (int iPersonne = 1; iPersonne <= nbPersonnes; ++iPersonne)
cin >> lenteurs[iPersonne];
vector<int> frequency(nbPersonnes + 1), delta(nbPersonnes + 1);
frequency[0] = 1, delta[0] = 1;
for (int iPersonne = 1; iPersonne <= nbPersonnes; ++iPersonne) {
int nbFois =
(lenteurs[iPersonne] + delta[iPersonne - 1] - 1) / delta[iPersonne - 1];
frequency[iPersonne] = nbFois * frequency[iPersonne - 1];
if (frequency[iPersonne] > INF) {
frequency[iPersonne] = delta[iPersonne] = INF;
continue;
}
delta[iPersonne] = delta[iPersonne - 1] * nbFois;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |