Submission #46532

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
46532	2018-04-21T10:30:24 Z	ikura355	Cultivation (JOI17_cultivation)	C++14	30 / 100	504 ms	1112 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> have[45];
vector<int> forup, fordown;
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());
	for(auto up : forup) {
		for(auto down : fordown) {
			for(int row=1;row<=R;row++) have[row].clear();
			for(int x=1;x<=n;x++) {
				for(int i=max(1,p[x].X-up);i<=min(R,p[x].X+down);i++) {
					have[i].push_back(p[x].Y);
				}
			}
			for(int row=1;row<=R;row++) sort(have[row].begin(), have[row].end());
			int left = 0, right = 0, gap = 0;
			int gaprow = 0, con = 0;
            for(int row=1;row<=R;row++) {
                if(have[row].size()==0) {
                    con++;
                    gaprow = max(gaprow, con);
                }
                else {
                    con = 0;
                    left = max(left, *have[row].begin()-1);
                    right = max(right, C-*have[row].rbegin());
                }
            }
            for(int row=1;row<=R;row++) {
            	for(int i=1;i<have[row].size();i++) gap = max(gap, have[row][i]-have[row][i-1]-1-left-right);
            }
			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:44: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:13: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:14: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

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	248 KB	Output is correct
2	Correct	2 ms	356 KB	Output is correct
3	Correct	2 ms	432 KB	Output is correct
4	Correct	2 ms	476 KB	Output is correct
5	Correct	2 ms	484 KB	Output is correct
6	Correct	2 ms	492 KB	Output is correct
7	Correct	2 ms	492 KB	Output is correct
8	Correct	2 ms	656 KB	Output is correct
9	Correct	2 ms	656 KB	Output is correct
10	Correct	2 ms	656 KB	Output is correct
11	Correct	2 ms	656 KB	Output is correct
12	Correct	2 ms	656 KB	Output is correct
13	Correct	2 ms	656 KB	Output is correct
14	Correct	2 ms	656 KB	Output is correct
15	Correct	2 ms	656 KB	Output is correct
16	Correct	2 ms	656 KB	Output is correct

Subtask #2
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	248 KB	Output is correct
2	Correct	2 ms	356 KB	Output is correct
3	Correct	2 ms	432 KB	Output is correct
4	Correct	2 ms	476 KB	Output is correct
5	Correct	2 ms	484 KB	Output is correct
6	Correct	2 ms	492 KB	Output is correct
7	Correct	2 ms	492 KB	Output is correct
8	Correct	2 ms	656 KB	Output is correct
9	Correct	2 ms	656 KB	Output is correct
10	Correct	2 ms	656 KB	Output is correct
11	Correct	2 ms	656 KB	Output is correct
12	Correct	2 ms	656 KB	Output is correct
13	Correct	2 ms	656 KB	Output is correct
14	Correct	2 ms	656 KB	Output is correct
15	Correct	2 ms	656 KB	Output is correct
16	Correct	2 ms	656 KB	Output is correct
17	Correct	2 ms	656 KB	Output is correct
18	Correct	13 ms	656 KB	Output is correct
19	Correct	5 ms	656 KB	Output is correct
20	Correct	2 ms	656 KB	Output is correct
21	Correct	23 ms	656 KB	Output is correct
22	Correct	121 ms	656 KB	Output is correct
23	Correct	4 ms	656 KB	Output is correct
24	Correct	246 ms	764 KB	Output is correct
25	Correct	175 ms	764 KB	Output is correct
26	Correct	445 ms	808 KB	Output is correct
27	Correct	434 ms	808 KB	Output is correct
28	Correct	238 ms	808 KB	Output is correct
29	Correct	376 ms	912 KB	Output is correct
30	Correct	425 ms	916 KB	Output is correct
31	Correct	444 ms	916 KB	Output is correct
32	Correct	456 ms	916 KB	Output is correct

Subtask #3
15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	248 KB	Output is correct
2	Correct	2 ms	356 KB	Output is correct
3	Correct	2 ms	432 KB	Output is correct
4	Correct	2 ms	476 KB	Output is correct
5	Correct	2 ms	484 KB	Output is correct
6	Correct	2 ms	492 KB	Output is correct
7	Correct	2 ms	492 KB	Output is correct
8	Correct	2 ms	656 KB	Output is correct
9	Correct	2 ms	656 KB	Output is correct
10	Correct	2 ms	656 KB	Output is correct
11	Correct	2 ms	656 KB	Output is correct
12	Correct	2 ms	656 KB	Output is correct
13	Correct	2 ms	656 KB	Output is correct
14	Correct	2 ms	656 KB	Output is correct
15	Correct	2 ms	656 KB	Output is correct
16	Correct	2 ms	656 KB	Output is correct
17	Correct	2 ms	656 KB	Output is correct
18	Correct	13 ms	656 KB	Output is correct
19	Correct	5 ms	656 KB	Output is correct
20	Correct	2 ms	656 KB	Output is correct
21	Correct	23 ms	656 KB	Output is correct
22	Correct	121 ms	656 KB	Output is correct
23	Correct	4 ms	656 KB	Output is correct
24	Correct	246 ms	764 KB	Output is correct
25	Correct	175 ms	764 KB	Output is correct
26	Correct	445 ms	808 KB	Output is correct
27	Correct	434 ms	808 KB	Output is correct
28	Correct	238 ms	808 KB	Output is correct
29	Correct	376 ms	912 KB	Output is correct
30	Correct	425 ms	916 KB	Output is correct
31	Correct	444 ms	916 KB	Output is correct
32	Correct	456 ms	916 KB	Output is correct
33	Correct	2 ms	916 KB	Output is correct
34	Correct	460 ms	980 KB	Output is correct
35	Correct	468 ms	980 KB	Output is correct
36	Correct	504 ms	980 KB	Output is correct
37	Correct	318 ms	980 KB	Output is correct
38	Correct	473 ms	980 KB	Output is correct
39	Correct	448 ms	980 KB	Output is correct
40	Correct	489 ms	980 KB	Output is correct
41	Correct	107 ms	980 KB	Output is correct
42	Correct	293 ms	980 KB	Output is correct
43	Correct	420 ms	980 KB	Output is correct
44	Correct	471 ms	1112 KB	Output is correct

Subtask #4
0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	3 ms	1112 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
2	Halted	0 ms	0 KB	-

Subtask #5
0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	3 ms	1112 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
2	Halted	0 ms	0 KB	-

Subtask #6
0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	248 KB	Output is correct
2	Correct	2 ms	356 KB	Output is correct
3	Correct	2 ms	432 KB	Output is correct
4	Correct	2 ms	476 KB	Output is correct
5	Correct	2 ms	484 KB	Output is correct
6	Correct	2 ms	492 KB	Output is correct
7	Correct	2 ms	492 KB	Output is correct
8	Correct	2 ms	656 KB	Output is correct
9	Correct	2 ms	656 KB	Output is correct
10	Correct	2 ms	656 KB	Output is correct
11	Correct	2 ms	656 KB	Output is correct
12	Correct	2 ms	656 KB	Output is correct
13	Correct	2 ms	656 KB	Output is correct
14	Correct	2 ms	656 KB	Output is correct
15	Correct	2 ms	656 KB	Output is correct
16	Correct	2 ms	656 KB	Output is correct
17	Correct	2 ms	656 KB	Output is correct
18	Correct	13 ms	656 KB	Output is correct
19	Correct	5 ms	656 KB	Output is correct
20	Correct	2 ms	656 KB	Output is correct
21	Correct	23 ms	656 KB	Output is correct
22	Correct	121 ms	656 KB	Output is correct
23	Correct	4 ms	656 KB	Output is correct
24	Correct	246 ms	764 KB	Output is correct
25	Correct	175 ms	764 KB	Output is correct
26	Correct	445 ms	808 KB	Output is correct
27	Correct	434 ms	808 KB	Output is correct
28	Correct	238 ms	808 KB	Output is correct
29	Correct	376 ms	912 KB	Output is correct
30	Correct	425 ms	916 KB	Output is correct
31	Correct	444 ms	916 KB	Output is correct
32	Correct	456 ms	916 KB	Output is correct
33	Correct	2 ms	916 KB	Output is correct
34	Correct	460 ms	980 KB	Output is correct
35	Correct	468 ms	980 KB	Output is correct
36	Correct	504 ms	980 KB	Output is correct
37	Correct	318 ms	980 KB	Output is correct
38	Correct	473 ms	980 KB	Output is correct
39	Correct	448 ms	980 KB	Output is correct
40	Correct	489 ms	980 KB	Output is correct
41	Correct	107 ms	980 KB	Output is correct
42	Correct	293 ms	980 KB	Output is correct
43	Correct	420 ms	980 KB	Output is correct
44	Correct	471 ms	1112 KB	Output is correct
45	Runtime error	3 ms	1112 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
46	Halted	0 ms	0 KB	-

Submission #46532

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 10.0 / 10.0

Subtask #3 15.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
10.0 / 10.0

Subtask #3
15.0 / 15.0

Subtask #4
0 / 30.0

Subtask #5
0 / 20.0

Subtask #6
0 / 20.0