# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1000580 | PurpleCrayon | Fish 3 (JOI24_fish3) | C++17 | 456 ms | 118456 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 sz(v) int(v.size())
#define ar array
typedef long long ll;
const int N = 3e5+10, MOD = 1e9+7;
const ll INF = 1e18+10;
const int L = 19;
pair<int, ll> anc[N][L];
ll ceil_div(ll x, ll y) {
return (x + y - 1) / y;
}
void solve() {
int n; ll k; cin >> n >> k;
vector<ll> a(n); for (auto& x : a) cin >> x;
vector<ll> diff(n-1);
for (int i = 0; i < n-1; i++) {
if (a[i] <= a[i+1])
diff[i] = max(0LL, (a[i+1] - a[i]) / k);
else
diff[i] = -ceil_div(a[i] - a[i+1], k);
}
vector<ll> ps_diff = diff;
for (int i = 1; i < n-1; i++) {
ps_diff[i] += ps_diff[i-1];
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |