답안 #62999

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
62999 2018-07-31T07:57:17 Z gusfring Cultivation (JOI17_cultivation) C++14
30 / 100
562 ms 1176 KB
#include<bits/stdc++.h>

using namespace std;

#define pii pair<int,int>
#define X first
#define Y second

const int maxn = 305, inf = 1e9;
int n, R, C;
pii p[maxn];
vector<int> have[45];

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 up=0; up<=R; ++up)
		for(int down=0; down<=R; ++down){
			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, bad = 0;
      for(int row=1; row<=R; ++row){
        if(have[row].size()==0){ bad = 1; break; }
        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);
			if(!bad) ans = min(ans, up + down + left + right + gap);
		}
	printf("%d",ans);
	return 0;
}

Compilation message

cultivation.cpp: In function 'int main()':
cultivation.cpp:30:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
        for(int i=1; i<have[row].size(); ++i)
                     ~^~~~~~~~~~~~~~~~~
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:31: 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);
                          ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 4 ms 564 KB Output is correct
5 Correct 2 ms 600 KB Output is correct
6 Correct 3 ms 600 KB Output is correct
7 Correct 2 ms 600 KB Output is correct
8 Correct 2 ms 600 KB Output is correct
9 Correct 3 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Correct 3 ms 604 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 3 ms 604 KB Output is correct
16 Correct 2 ms 604 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 4 ms 564 KB Output is correct
5 Correct 2 ms 600 KB Output is correct
6 Correct 3 ms 600 KB Output is correct
7 Correct 2 ms 600 KB Output is correct
8 Correct 2 ms 600 KB Output is correct
9 Correct 3 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Correct 3 ms 604 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 3 ms 604 KB Output is correct
16 Correct 2 ms 604 KB Output is correct
17 Correct 3 ms 604 KB Output is correct
18 Correct 15 ms 620 KB Output is correct
19 Correct 14 ms 748 KB Output is correct
20 Correct 4 ms 748 KB Output is correct
21 Correct 36 ms 788 KB Output is correct
22 Correct 149 ms 832 KB Output is correct
23 Correct 28 ms 832 KB Output is correct
24 Correct 295 ms 832 KB Output is correct
25 Correct 217 ms 832 KB Output is correct
26 Correct 490 ms 948 KB Output is correct
27 Correct 446 ms 976 KB Output is correct
28 Correct 292 ms 976 KB Output is correct
29 Correct 400 ms 976 KB Output is correct
30 Correct 452 ms 988 KB Output is correct
31 Correct 452 ms 988 KB Output is correct
32 Correct 461 ms 988 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 4 ms 564 KB Output is correct
5 Correct 2 ms 600 KB Output is correct
6 Correct 3 ms 600 KB Output is correct
7 Correct 2 ms 600 KB Output is correct
8 Correct 2 ms 600 KB Output is correct
9 Correct 3 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Correct 3 ms 604 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 3 ms 604 KB Output is correct
16 Correct 2 ms 604 KB Output is correct
17 Correct 3 ms 604 KB Output is correct
18 Correct 15 ms 620 KB Output is correct
19 Correct 14 ms 748 KB Output is correct
20 Correct 4 ms 748 KB Output is correct
21 Correct 36 ms 788 KB Output is correct
22 Correct 149 ms 832 KB Output is correct
23 Correct 28 ms 832 KB Output is correct
24 Correct 295 ms 832 KB Output is correct
25 Correct 217 ms 832 KB Output is correct
26 Correct 490 ms 948 KB Output is correct
27 Correct 446 ms 976 KB Output is correct
28 Correct 292 ms 976 KB Output is correct
29 Correct 400 ms 976 KB Output is correct
30 Correct 452 ms 988 KB Output is correct
31 Correct 452 ms 988 KB Output is correct
32 Correct 461 ms 988 KB Output is correct
33 Correct 2 ms 988 KB Output is correct
34 Correct 562 ms 1176 KB Output is correct
35 Correct 503 ms 1176 KB Output is correct
36 Correct 523 ms 1176 KB Output is correct
37 Correct 325 ms 1176 KB Output is correct
38 Correct 537 ms 1176 KB Output is correct
39 Correct 502 ms 1176 KB Output is correct
40 Correct 514 ms 1176 KB Output is correct
41 Correct 292 ms 1176 KB Output is correct
42 Correct 392 ms 1176 KB Output is correct
43 Correct 487 ms 1176 KB Output is correct
44 Correct 527 ms 1176 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Runtime error 2 ms 1176 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Runtime error 2 ms 1176 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 4 ms 564 KB Output is correct
5 Correct 2 ms 600 KB Output is correct
6 Correct 3 ms 600 KB Output is correct
7 Correct 2 ms 600 KB Output is correct
8 Correct 2 ms 600 KB Output is correct
9 Correct 3 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Correct 3 ms 604 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 3 ms 604 KB Output is correct
16 Correct 2 ms 604 KB Output is correct
17 Correct 3 ms 604 KB Output is correct
18 Correct 15 ms 620 KB Output is correct
19 Correct 14 ms 748 KB Output is correct
20 Correct 4 ms 748 KB Output is correct
21 Correct 36 ms 788 KB Output is correct
22 Correct 149 ms 832 KB Output is correct
23 Correct 28 ms 832 KB Output is correct
24 Correct 295 ms 832 KB Output is correct
25 Correct 217 ms 832 KB Output is correct
26 Correct 490 ms 948 KB Output is correct
27 Correct 446 ms 976 KB Output is correct
28 Correct 292 ms 976 KB Output is correct
29 Correct 400 ms 976 KB Output is correct
30 Correct 452 ms 988 KB Output is correct
31 Correct 452 ms 988 KB Output is correct
32 Correct 461 ms 988 KB Output is correct
33 Correct 2 ms 988 KB Output is correct
34 Correct 562 ms 1176 KB Output is correct
35 Correct 503 ms 1176 KB Output is correct
36 Correct 523 ms 1176 KB Output is correct
37 Correct 325 ms 1176 KB Output is correct
38 Correct 537 ms 1176 KB Output is correct
39 Correct 502 ms 1176 KB Output is correct
40 Correct 514 ms 1176 KB Output is correct
41 Correct 292 ms 1176 KB Output is correct
42 Correct 392 ms 1176 KB Output is correct
43 Correct 487 ms 1176 KB Output is correct
44 Correct 527 ms 1176 KB Output is correct
45 Runtime error 2 ms 1176 KB Execution killed with signal 11 (could be triggered by violating memory limits)
46 Halted 0 ms 0 KB -