oj.uz

답안 #244907

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
244907 2020-07-05T09:11:50 Z maximath_1 Collecting Stamps 3 (JOI20_ho_t3) C++11
15 / 100
 87 ms 66168 KB 
#include <bits/stdc++.h>
using namespace std;

const int inf = 2e9 + 69;
int dpcw[205][205][205], dpccw[205][205][205];
int n, l, x[205], t[205];

int main(){
	scanf("%d%d", &n, &l);
	for(int i = 1; i <= n; i ++) scanf("%d", &x[i]);
	for(int i = 1; i <= n; i ++) scanf("%d", &t[i]);
	x[0] = 0; x[n + 1] = l;
	
	for(int i = 0; i <= n; i ++) for(int j = 0; j <= n; j ++) for(int k = 0; k <= n; k ++)
		dpcw[i][j][k] = dpccw[i][j][k] = inf;

	dpcw[0][0][0] = 0;
	for(int tim, i = 0; i < n; i ++) for(int j = 0; i + j < n; j ++) for(int k = 0; k <= i + j; k ++){
		if(dpcw[i][j][k] < inf){
			tim = dpcw[i][j][k] + (x[i + 1] - x[i]);
			dpcw[i + 1][j][k + (t[i + 1] >= tim)] = min(dpcw[i + 1][j][k + (t[i + 1] >= tim)], tim);
			tim = dpcw[i][j][k] + (x[i] + l - x[n - j]);
			dpccw[i][j + 1][k + (t[n - j] >= tim)] = min(dpccw[i][j + 1][k + (t[n - j] >= tim)], tim);
		}
		if(dpccw[i][j][k] < inf){
			tim = dpccw[i][j][k] + (x[n - j + 1] - x[n - j]);
			dpccw[i][j + 1][k + (t[n - j] >= tim)] = min(dpccw[i][j + 1][k + (t[n - j] >= tim)], tim);
			tim = dpccw[i][j][k] + (l - x[n - j + 1] + x[i + 1]);
			dpcw[i + 1][j][k + (t[i + 1] >= tim)] = min(dpcw[i + 1][j][k + (t[i + 1] >= tim)], tim);
		}
	}

	int ans = 0;
	for(int i = 0; i <= n; i ++) for(int j = 0; i + j <= n; j ++) for(int k = 0; k <= i + j; k ++){
		if(min(dpcw[i][j][k], dpccw[i][j][k]) < inf)
			ans = max(ans, k);
	}

	printf("%d\n", ans);
	return 0;
}

Compilation message

ho_t3.cpp: In function 'int main()':
ho_t3.cpp:9:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &n, &l);
  ~~~~~^~~~~~~~~~~~~~~~
ho_t3.cpp:10:36: 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", &x[i]);
                               ~~~~~^~~~~~~~~~~~~
ho_t3.cpp:11:36: 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", &t[i]);
                               ~~~~~^~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 4 ms 512 KB Output is correct
5 Correct 5 ms 512 KB Output is correct
6 Correct 5 ms 768 KB Output is correct
7 Correct 5 ms 512 KB Output is correct
8 Correct 5 ms 640 KB Output is correct
9 Correct 5 ms 640 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 768 KB Output is correct
13 Correct 5 ms 640 KB Output is correct
14 Correct 5 ms 512 KB Output is correct
15 Correct 4 ms 512 KB Output is correct
16 Correct 5 ms 640 KB Output is correct
17 Correct 5 ms 640 KB Output is correct
18 Incorrect 5 ms 768 KB Output isn't correct
19 Halted 0 ms 0 KB -

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 4 ms 512 KB Output is correct
5 Correct 5 ms 512 KB Output is correct
6 Correct 5 ms 768 KB Output is correct
7 Correct 5 ms 512 KB Output is correct
8 Correct 5 ms 640 KB Output is correct
9 Correct 5 ms 640 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 768 KB Output is correct
13 Correct 5 ms 640 KB Output is correct
14 Correct 5 ms 512 KB Output is correct
15 Correct 4 ms 512 KB Output is correct
16 Correct 5 ms 640 KB Output is correct
17 Correct 5 ms 640 KB Output is correct
18 Correct 57 ms 53760 KB Output is correct
19 Correct 37 ms 32896 KB Output is correct
20 Correct 20 ms 17792 KB Output is correct
21 Correct 37 ms 30976 KB Output is correct
22 Correct 47 ms 40064 KB Output is correct
23 Correct 18 ms 15232 KB Output is correct
24 Correct 13 ms 12032 KB Output is correct
25 Correct 18 ms 14976 KB Output is correct
26 Correct 9 ms 5888 KB Output is correct
27 Correct 22 ms 15488 KB Output is correct
28 Correct 14 ms 11264 KB Output is correct
29 Correct 18 ms 15872 KB Output is correct
30 Correct 13 ms 12544 KB Output is correct
31 Correct 19 ms 14976 KB Output is correct
32 Correct 10 ms 8064 KB Output is correct
33 Correct 17 ms 14976 KB Output is correct
34 Correct 8 ms 5632 KB Output is correct
35 Correct 15 ms 14592 KB Output is correct
36 Correct 9 ms 7168 KB Output is correct
37 Correct 15 ms 15488 KB Output is correct
38 Correct 12 ms 8704 KB Output is correct
39 Correct 18 ms 16128 KB Output is correct
40 Correct 11 ms 9728 KB Output is correct
41 Correct 86 ms 66040 KB Output is correct
42 Correct 34 ms 44800 KB Output is correct
43 Correct 86 ms 66168 KB Output is correct
44 Correct 33 ms 44288 KB Output is correct
45 Correct 87 ms 66168 KB Output is correct
46 Correct 33 ms 44792 KB Output is correct

Subtask #4
0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 4 ms 512 KB Output is correct
5 Correct 5 ms 512 KB Output is correct
6 Correct 5 ms 768 KB Output is correct
7 Correct 5 ms 512 KB Output is correct
8 Correct 5 ms 640 KB Output is correct
9 Correct 5 ms 640 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 768 KB Output is correct
13 Correct 5 ms 640 KB Output is correct
14 Correct 5 ms 512 KB Output is correct
15 Correct 4 ms 512 KB Output is correct
16 Correct 5 ms 640 KB Output is correct
17 Correct 5 ms 640 KB Output is correct
18 Incorrect 5 ms 768 KB Output isn't correct
19 Halted 0 ms 0 KB -