# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
198025 | AMO5 | Worst Reporter 3 (JOI18_worst_reporter3) | C++98 | 1852 ms | 29340 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;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define MOD 1000000007
typedef long long ll;
typedef pair <int, int> ii;
typedef pair <ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef long double ld;
long long INF=LLONG_MAX;
ll n,q,d[511111],per[511111];
ll md=0;
vector < pair<ll, pll> > seg;
void upd(){
ll cur = d[1], pre = 1;
per[1] = d[1];
for(ll i = 2; i <= n; i++){
ll tm = (cur>=d[i]?1:d[i]/cur+(d[i]%cur?1:0));
per[i] = tm*cur;
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... |