# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
287459 | TadijaSebez | Cultivation (JOI17_cultivation) | C++11 | 136 ms | 2680 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 pii pair<int,int>
#define ll long long
void ckmn(ll&a,ll b){a=min(a,b);}
void ckmx(int&a,int b){a=max(a,b);}
const int N=305;
const int inf=1e9+7;
int sz[N],SWX[N][N],SWU[N][N],SWD[N][N],SWR[N][N],x[N],y[N],n,H,W;
int L[N],lsz,T[N],tsz,SM[N*N],U[N*N],D[N*N],R[N*N],ssz,esz;
pii evs[N];
void unq(int*a,int&n){sort(a+1,a+1+n);n=unique(a+1,a+1+n)-a-1;}
int main(){
scanf("%i %i %i",&H,&W,&n);
for(int i=1;i<=n;i++){
scanf("%i %i",&x[i],&y[i]);
L[++lsz]=y[i]-1;
if(y[i]>1)T[++tsz]=y[i]-1;
}
T[++tsz]=W;unq(T,tsz);
for(int i=1;i<=tsz;i++){
esz=0;
for(int j=1;j<=n;j++){
if(y[j]<=T[i]){
SM[++ssz]=T[i]-y[j];
evs[++esz]={T[i]-y[j],x[j]};
}
}
multiset<int> dif,pts;
pts.insert(0);pts.insert(H+1);
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... |