# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1087414 | pokmui9909 | Cultivation (JOI17_cultivation) | C++17 | 1859 ms | 4856 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;
using ll = long long;
const ll INF = 1e18;
#define x first
#define y second
ll H, W, N, F[3][305][305];
pair<ll, ll> A[305];
struct Data{
ll l, r, c[3];
};
ll Add[605], Del[605];
ll Solve(ll len){
for(ll i = 0; i <= 2 * N; i++){
Add[i] = Del[i] = 0;
}
vector<ll> Num;
A[N + 1].x = 1e18;
for(ll i = 1, j = 1; j <= N;){
if(A[i].x < A[j].x + len + 1){
Num.push_back(A[i].x);
i++;
} else {
Num.push_back(A[j].x + len + 1);
j++;
}
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... |