# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
171868 | arnold518 | Worst Reporter 3 (JOI18_worst_reporter3) | C++14 | 606 ms | 39008 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;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 5e5;
struct Query
{
ll t, l, r;
};
int N, Q;
ll D[MAXN+10];
Query A[MAXN+10];
int ans[MAXN+10];
int main()
{
int i, j;
scanf("%d%d", &N, &Q);
D[0]=1;
for(i=1; i<=N; i++) scanf("%lld", &D[i]);
for(i=1; i<=N; i++) D[i]=(D[i]+D[i-1]-1)/D[i-1]*D[i-1];
for(i=1; i<=Q; i++) scanf("%lld%lld%lld", &A[i].t, &A[i].l, &A[i].r);
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... |