# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
528810 | Lobo | Worst Reporter 3 (JOI18_worst_reporter3) | C++17 | 514 ms | 25188 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>
using namespace std;
const long long inf = (long long) 1e18 + 10;
const int inf1 = (int) 1e9 + 10;
#define int long long
#define dbl long double
#define endl '\n'
#define sc second
#define fr first
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()
#define maxn 510000
int n, q, d[maxn];
void solve() {
cin >> n >> q;
for(int i = 1; i <= n; i++) {
cin >> d[i];
}
for(int i = 2; i <= n; i++) {
d[i] = d[i-1]*((d[i]+d[i-1]-1)/d[i-1]);
}
while(q--) {
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |