# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
367945 | denkendoemeer | Cultivation (JOI17_cultivation) | C++14 | 180 ms | 2536 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>
typedef long long ll;
#define inf (0x3f3f3f3f)
using namespace std;
vector<int>gx[305],gu[305],gd[305],gs[305];
int vu[90005],vd[90005],vs[90005];
vector<int>aux,aux2,v2;
int a[305],b[305];
int h,w,n,k,l,ans=inf*2;
void calc(vector<pair<int,int>>&auxi,vector<int>&x,vector<int>&u,vector<int>&d,vector<int>&s)
{
sort(auxi.begin(),auxi.end());
multiset<int> st1,st2;
st1.insert(0);
st1.insert(h+1);
st2.insert(h+1);
int i,j,n=auxi.size(),px,py,k;
for(i=0;i<n;i=j){
px=auxi[i].first;
for(j=i+1;j<n && auxi[j].first==px;j++);
for(k=i;k<j;k++){
py=auxi[k].second;
auto it=st1.insert(py);
if (st1.begin()!=it && st1.end()!=next(it))
st2.erase(st2.find(*next(it)-*prev(it)));
if (st1.begin()!=it)
st2.insert(py-*prev(it));
if (st1.end()!=next(it))
st2.insert(*next(it)-py);
}
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... |