Submission #46554

#	Time	Username	Problem	Language	Result	Execution time	Memory
46554		ikura355	Cultivation (JOI17_cultivation)	C++14	30 / 100	570 ms	1160 KiB

cultivation

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<ll,ll>
#define X first
#define Y second
const int maxn = 300 + 5;
const ll inf = 2e16;
int n;
ll R,C;
pii p[maxn];
vector<int> forup, fordown;
int sz;
map<ll,int> mp;
vector<ll> have[maxn*2];
int main() {
//    freopen("try.txt","w",stdout);
	scanf("%lld%lld%d",&R,&C,&n);
	for(int i=1;i<=n;i++) scanf("%lld%lld",&p[i].X,&p[i].Y);
	ll ans = inf;
	for(int i=1;i<=n;i++) forup.push_back(p[i].X-1), fordown.push_back(R-p[i].X);
	sort(forup.begin(),forup.end());
	sort(fordown.begin(),fordown.end());
	forup.erase(unique(forup.begin(),forup.end()),forup.end());
	fordown.erase(unique(fordown.begin(),fordown.end()),fordown.end());
	sort(&p[1],&p[n+1]);
	for(auto up : forup) {
		for(auto down : fordown) {
			mp.clear(); sz = 0;
			for(int x=1;x<=n;x++) {
				mp[max(1LL,p[x].X-up)];
				mp[min(R,p[x].X+down)+1];
			}
			for(auto &t : mp) t.second = ++sz;
			for(int i=1;i<=sz;i++) have[i].clear();
			for(int x=1;x<=n;x++) {
				for(int i=mp[max(1LL,p[x].X-up)];i<=mp[min(R,p[x].X+down)+1]-1;i++) {
					have[i].push_back(p[x].Y);
				}
			}
			for(int row=1;row<=sz;row++) if(have[row].size()>0) sort(have[row].begin(), have[row].end());
			ll left = 0, right = 0, gap = 0;
            for(int row=1;row<=sz;row++) {
                if(have[row].size()==0) continue;
//                printf("\trow = %d : ",rec[row]);
//                for(auto x : have[row]) printf("%d ",x);
//                printf("\n");
                left = max(left, *have[row].begin()-1);
                right = max(right, C-*have[row].rbegin());
            }
            for(int row=1;row<=sz;row++) {
            	for(int i=1;i<have[row].size();i++) gap = max(gap, have[row][i]-have[row][i-1]-1-left-right);
            }
        	ll gaprow = 0;
        	for(int i=2;i<=n;i++) gaprow = max(gaprow, p[i].X-p[i-1].X-1-up-down);
			ans = min(ans, up + down + left + right + gap + gaprow);
//			printf("up = %d down = %d (%d) : use %d %d %d\n",up,down,gaprow,left,right,gap);
		}
	}
	printf("%lld",ans);
}

Compilation message (stderr)

cultivation.cpp: In function 'int main()':
cultivation.cpp:52:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
              for(int i=1;i<have[row].size();i++) gap = max(gap, have[row][i]-have[row][i-1]-1-left-right);
                          ~^~~~~~~~~~~~~~~~~
cultivation.cpp:18:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld%lld%d",&R,&C,&n);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~
cultivation.cpp:19:29: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=1;i<=n;i++) scanf("%lld%lld",&p[i].X,&p[i].Y);
                        ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 5 / 5
• Subtask 2: 10 / 10
• Subtask 3: 15 / 15
• Subtask 4: 0 / 30
• Subtask 5: 0 / 20
• Subtask 6: 0 / 20