답안 #46535 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
46535	2018-04-21T10:45:47 Z	ikura355	Cultivation (JOI17_cultivation)	C++14	5 / 100	27 ms	680 KB

cultivation

#include<bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define X first
#define Y second
const int maxn = 300 + 5;
const int inf = 1e9;
int n,R,C;
pii p[maxn];
vector<int> forup, fordown;
int sz;
map<int,int> mp;
vector<int> have[maxn*2];
int main() {
	scanf("%d%d%d",&R,&C,&n);
	for(int i=1;i<=n;i++) scanf("%d%d",&p[i].X,&p[i].Y);
	int 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(1,p[x].X-up)];
				mp[min(R,p[x].X+down)];
			}
			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(1,p[x].X-up)];i<=mp[min(R,p[x].X+down)];i++) {
					have[i].push_back(p[x].Y);
				}
			}
			for(int row=1;row<=sz;row++) sort(have[row].begin(), have[row].end());
			int left = 0, right = 0, gap = 0;
            for(int row=1;row<=sz;row++) {
                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);
            }
        	int 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("%d",ans);
}

Compilation message

cultivation.cpp: In function 'int main()':
cultivation.cpp:45: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:15:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d",&R,&C,&n);
  ~~~~~^~~~~~~~~~~~~~~~~~~
cultivation.cpp:16: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("%d%d",&p[i].X,&p[i].Y);
                        ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	488 KB	Output is correct
3	Correct	2 ms	488 KB	Output is correct
4	Correct	2 ms	488 KB	Output is correct
5	Correct	2 ms	488 KB	Output is correct
6	Correct	2 ms	488 KB	Output is correct
7	Correct	2 ms	488 KB	Output is correct
8	Correct	2 ms	680 KB	Output is correct
9	Correct	2 ms	680 KB	Output is correct
10	Correct	2 ms	680 KB	Output is correct
11	Correct	2 ms	680 KB	Output is correct
12	Correct	2 ms	680 KB	Output is correct
13	Correct	2 ms	680 KB	Output is correct
14	Correct	2 ms	680 KB	Output is correct
15	Correct	2 ms	680 KB	Output is correct
16	Correct	2 ms	680 KB	Output is correct

Subtask #2
0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	488 KB	Output is correct
3	Correct	2 ms	488 KB	Output is correct
4	Correct	2 ms	488 KB	Output is correct
5	Correct	2 ms	488 KB	Output is correct
6	Correct	2 ms	488 KB	Output is correct
7	Correct	2 ms	488 KB	Output is correct
8	Correct	2 ms	680 KB	Output is correct
9	Correct	2 ms	680 KB	Output is correct
10	Correct	2 ms	680 KB	Output is correct
11	Correct	2 ms	680 KB	Output is correct
12	Correct	2 ms	680 KB	Output is correct
13	Correct	2 ms	680 KB	Output is correct
14	Correct	2 ms	680 KB	Output is correct
15	Correct	2 ms	680 KB	Output is correct
16	Correct	2 ms	680 KB	Output is correct
17	Correct	3 ms	680 KB	Output is correct
18	Correct	25 ms	680 KB	Output is correct
19	Correct	5 ms	680 KB	Output is correct
20	Correct	3 ms	680 KB	Output is correct
21	Incorrect	27 ms	680 KB	Output isn't correct
22	Halted	0 ms	0 KB	-

Subtask #3
0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	488 KB	Output is correct
3	Correct	2 ms	488 KB	Output is correct
4	Correct	2 ms	488 KB	Output is correct
5	Correct	2 ms	488 KB	Output is correct
6	Correct	2 ms	488 KB	Output is correct
7	Correct	2 ms	488 KB	Output is correct
8	Correct	2 ms	680 KB	Output is correct
9	Correct	2 ms	680 KB	Output is correct
10	Correct	2 ms	680 KB	Output is correct
11	Correct	2 ms	680 KB	Output is correct
12	Correct	2 ms	680 KB	Output is correct
13	Correct	2 ms	680 KB	Output is correct
14	Correct	2 ms	680 KB	Output is correct
15	Correct	2 ms	680 KB	Output is correct
16	Correct	2 ms	680 KB	Output is correct
17	Correct	3 ms	680 KB	Output is correct
18	Correct	25 ms	680 KB	Output is correct
19	Correct	5 ms	680 KB	Output is correct
20	Correct	3 ms	680 KB	Output is correct
21	Incorrect	27 ms	680 KB	Output isn't correct
22	Halted	0 ms	0 KB	-

Subtask #4
0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	680 KB	Output is correct
2	Correct	9 ms	680 KB	Output is correct
3	Correct	13 ms	680 KB	Output is correct
4	Incorrect	9 ms	680 KB	Output isn't correct
5	Halted	0 ms	0 KB	-

Subtask #5
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	680 KB	Output is correct
2	Correct	9 ms	680 KB	Output is correct
3	Correct	13 ms	680 KB	Output is correct
4	Incorrect	9 ms	680 KB	Output isn't correct
5	Halted	0 ms	0 KB	-

Subtask #6
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	488 KB	Output is correct
3	Correct	2 ms	488 KB	Output is correct
4	Correct	2 ms	488 KB	Output is correct
5	Correct	2 ms	488 KB	Output is correct
6	Correct	2 ms	488 KB	Output is correct
7	Correct	2 ms	488 KB	Output is correct
8	Correct	2 ms	680 KB	Output is correct
9	Correct	2 ms	680 KB	Output is correct
10	Correct	2 ms	680 KB	Output is correct
11	Correct	2 ms	680 KB	Output is correct
12	Correct	2 ms	680 KB	Output is correct
13	Correct	2 ms	680 KB	Output is correct
14	Correct	2 ms	680 KB	Output is correct
15	Correct	2 ms	680 KB	Output is correct
16	Correct	2 ms	680 KB	Output is correct
17	Correct	3 ms	680 KB	Output is correct
18	Correct	25 ms	680 KB	Output is correct
19	Correct	5 ms	680 KB	Output is correct
20	Correct	3 ms	680 KB	Output is correct
21	Incorrect	27 ms	680 KB	Output isn't correct
22	Halted	0 ms	0 KB	-

답안 #46535

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 0 / 10.0

Subtask #3 0 / 15.0

Subtask #4 0 / 30.0

Subtask #5 0 / 20.0

Subtask #6 0 / 20.0

Subtask #1
5.0 / 5.0

Subtask #2
0 / 10.0

Subtask #3
0 / 15.0

Subtask #4
0 / 30.0

Subtask #5
0 / 20.0

Subtask #6
0 / 20.0