# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
399934 | GioChkhaidze | Worst Reporter 3 (JOI18_worst_reporter3) | C++14 | 357 ms | 23500 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 ll long long
#define pb push_back
#define f first
#define s second
using namespace std;
const int N = 5e5 + 5;
int n, q, d[N];
vector < pair < int , int > > v;
main () {
ios::sync_with_stdio(false);
cin.tie(NULL), cout.tie(NULL);
cin >> n >> q;
for (int i = 1; i <= n; ++i) {
cin >> d[i];
}
int x = 1;
for (int i = 1; i <= n; ++i) {
if (!v.size() || x < d[i]) {
v.pb({x * ((d[i] - 1) / x + 1), 1});
x = v.back().f;
}
else
if (d[i] <= x) {
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |