# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1075507 | qwerasdfzxcl | Cultivation (JOI17_cultivation) | C++17 | 1688 ms | 4800 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;
constexpr ll INF = 4e18;
pair<ll, ll> P[303];
ll a[303], S[707], E[707], X[3][707], dp[303][303], FUCK[2][303][303], L, U;
int dq[3][707], n;
pair<ll, int> V[303];
int f[303], g[303];
ll solve(ll len){
int sz = 0;
for (int i=1,j=1;i<=n||j<=n;){
ll s = min(a[i], a[j]+len);
while(a[i]==s || a[j]+len==s){
if (a[i]==s) i++;
if (a[j]+len==s) j++;
}
if (j > n) break;
ll e = min(a[i], a[j]+len);
assert(j < i);
++sz;
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |