# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
55271 | ksun48 | Cultivation (JOI17_cultivation) | C++14 | 1075 ms | 1284 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;;
LL r, c, n;
vector<pair<LL,LL> > seeds;
const LL INF = 3100100100;
LL best = INF;
set<pair<LL,LL> > tried;
void tryx(LL x, LL startx){
if(x < 0 || tried.find({x,startx}) != tried.end()){
return;
}
tried.insert({x,startx});
vector<LL> stuff[r + x];
for(pair<LL,LL> z : seeds){
for(LL j = 0; j <= x; j++){
stuff[j + z.first].push_back(z.second);
}
}
vector<LL> up(r+x, 0);
vector<LL> down(r+x, 0);
vector<LL> tot(r+x, 0);
for(LL j = 0; j < r+x; j++){
vector<LL> grass = stuff[j];
sort(grass.begin(), grass.end());
if(grass.size() == 0){
up[j] = down[j] = tot[j] = INF;
} else {
up[j] = grass[0] - 0;
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... |