oj.uz

답안 #745223

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
745223 2023-05-19T15:07:43 Z 박상훈(#9964) Uplifting Excursion (BOI22_vault) C++17
45 / 100
 5000 ms 9412 KB 
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
constexpr int SFT = 90090;
int n;
ll L, a[1010], b[1010];
bitset<180180> dp[2][606];

ll getmin(ll v, bool flag = 0){
	ll ret = 0;
	for (int i=-n;i<=n;i++){
		ret += (ll)i * min(v, a[i+n]);
		if (flag) b[i+n] = min(v, a[i+n]);
		v -= min(v, a[i+n]);
	}
	return ret;
}

ll getmax(ll v, bool flag = 0){
	ll ret = 0;
	for (int i=n;i>=-n;i--){
		ret += (ll)i * min(v, a[i+n]);
		if (flag) b[i+n] = min(v, a[i+n]);
		v -= min(v, a[i+n]);
	}
	return ret;
}

void NO(){
	printf("impossible\n");
	exit(0);
}

void solve(ll v){
	ll mn = getmin(v), mx = getmax(v);
	if (abs(mn-L) > n && abs(mx-L) > n) assert(0);
	if (abs(mn-L) <= n){
		reverse(a, a+n*2+1);
		L = -L;
		mn = getmin(v), mx = getmax(v);
		if (abs(mn-L) > n && abs(mx-L) > n) assert(0);
	}
	getmax(v, 1);

	int z = 0;
	ll r = n*2+2;
	
	//init
	dp[0][0][0+SFT] = 1;

	for (int i=n;i>=-n;i--){
		if (b[i+n] > 0){
			for (int j=1;j<=min(b[i+n], r);j++){
				z ^= 1;
				for (int p=-1;p<r;p++){
					
					if (p+1 < j) dp[z][p+1] = dp[z^1][p+1];
					else if (i>=0) dp[z][p+1] = dp[z^1][p+1] | (dp[z^1][p] << i);
					else dp[z][p+1] = dp[z^1][p+1] | (dp[z^1][p] >> (-i));
					
				}
			}
		}

		if (b[i+n] < a[i+n]){
			for (int j=1;j<=min(a[i+n]-b[i+n], r);j++){
				z ^= 1;
				for (int p=1;p<=r+1;p++){
					
					if (r-p+1 < j) dp[z][p-1] = dp[z^1][p-1];
					else if (i>=0) dp[z][p-1] = dp[z^1][p-1] | (dp[z^1][p] >> i);
					else dp[z][p-1] = dp[z^1][p-1] | (dp[z^1][p] << (-i));
					
				}
			}
		}
	}

	ll need = mx - L;
	for (int i=0;i<=r;i++) if (dp[z][i][need+SFT]){
		printf("%lld\n", v-i);
		return;
	}
	NO();
}

int main(){
	scanf("%d %lld", &n, &L);

	ll mS = 0, pS = 0, S = 0;
	for (int i=0;i<=n*2;i++){
		scanf("%lld", a+i);
		S += a[i];
		if (i-n < 0) mS += a[i];
		else if (i-n > 0) pS += a[i];
	} 

	// printf("%lld %lld %lld %lld\n", mS, pS, getmin(mS), getmax(pS));
	if (L < getmin(mS)) NO();
	if (L > getmax(pS)) NO();

	ll l = mS, r = S, vmn = mS;
	while(l<=r){
		ll mid = (l+r)/2;
		if (getmin(mid) <= L) vmn = mid, l = mid+1;
		else r = mid-1;
	}

	l = pS, r = S;
	ll vmx = pS;
	while(l<=r){
		ll mid = (l+r)/2;
		if (getmax(mid) >= L) vmx = mid, l = mid+1;
		else r = mid-1;
	}

	ll v = min(vmn, vmx); // [v+1, S]는 불가능
	// printf("%lld(%lld, %lld) -> %lld %lld\n", v, vmn, vmx, getmin(v), getmax(v));
	if (!(getmin(v) <= L) || !(getmax(v) >= L)) NO();
	solve(v);
}

Compilation message

vault.cpp: In function 'int main()':
vault.cpp:89:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   89 |  scanf("%d %lld", &n, &L);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~
vault.cpp:93:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   93 |   scanf("%lld", a+i);
      |   ~~~~~^~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 724 KB Output is correct
2 Correct 1 ms 724 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 10 ms 1364 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1646 ms 4948 KB Output is correct
7 Correct 651 ms 4960 KB Output is correct
8 Correct 1410 ms 4948 KB Output is correct
9 Correct 2472 ms 4948 KB Output is correct
10 Correct 64 ms 4948 KB Output is correct
11 Correct 51 ms 4948 KB Output is correct

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 724 KB Output is correct
2 Correct 1 ms 724 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 10 ms 1364 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1646 ms 4948 KB Output is correct
7 Correct 651 ms 4960 KB Output is correct
8 Correct 1410 ms 4948 KB Output is correct
9 Correct 2472 ms 4948 KB Output is correct
10 Correct 64 ms 4948 KB Output is correct
11 Correct 51 ms 4948 KB Output is correct
12 Correct 1 ms 724 KB Output is correct
13 Correct 1 ms 724 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 8 ms 1364 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1465 ms 4964 KB Output is correct
18 Correct 611 ms 5068 KB Output is correct
19 Correct 1516 ms 4952 KB Output is correct
20 Correct 2560 ms 4948 KB Output is correct
21 Correct 67 ms 4968 KB Output is correct
22 Correct 63 ms 4948 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Execution timed out 5059 ms 9300 KB Time limit exceeded
25 Halted 0 ms 0 KB -

Subtask #3-1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 1364 KB Output is correct
2 Correct 287 ms 3188 KB Output is correct
3 Correct 73 ms 3184 KB Output is correct
4 Correct 324 ms 3184 KB Output is correct
5 Correct 334 ms 3184 KB Output is correct
6 Correct 237 ms 3276 KB Output is correct
7 Correct 60 ms 3184 KB Output is correct
8 Correct 38 ms 3156 KB Output is correct
9 Correct 109 ms 3156 KB Output is correct
10 Correct 210 ms 3156 KB Output is correct

Subtask #3-2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 1364 KB Output is correct
2 Correct 287 ms 3188 KB Output is correct
3 Correct 73 ms 3184 KB Output is correct
4 Correct 324 ms 3184 KB Output is correct
5 Correct 334 ms 3184 KB Output is correct
6 Correct 237 ms 3276 KB Output is correct
7 Correct 60 ms 3184 KB Output is correct
8 Correct 38 ms 3156 KB Output is correct
9 Correct 109 ms 3156 KB Output is correct
10 Correct 210 ms 3156 KB Output is correct
11 Correct 1 ms 724 KB Output is correct
12 Correct 1 ms 724 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 8 ms 1364 KB Output is correct
15 Correct 258 ms 3156 KB Output is correct
16 Correct 73 ms 3156 KB Output is correct
17 Correct 309 ms 3184 KB Output is correct
18 Correct 322 ms 3184 KB Output is correct
19 Correct 223 ms 3156 KB Output is correct
20 Correct 49 ms 3188 KB Output is correct
21 Correct 35 ms 3156 KB Output is correct
22 Correct 112 ms 3188 KB Output is correct
23 Correct 177 ms 3124 KB Output is correct
24 Correct 529 ms 3188 KB Output is correct
25 Correct 205 ms 3156 KB Output is correct
26 Correct 646 ms 3184 KB Output is correct
27 Correct 441 ms 3244 KB Output is correct
28 Correct 522 ms 3188 KB Output is correct

Subtask #4-1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 1364 KB Output is correct
2 Correct 287 ms 3188 KB Output is correct
3 Correct 73 ms 3184 KB Output is correct
4 Correct 324 ms 3184 KB Output is correct
5 Correct 334 ms 3184 KB Output is correct
6 Correct 237 ms 3276 KB Output is correct
7 Correct 60 ms 3184 KB Output is correct
8 Correct 38 ms 3156 KB Output is correct
9 Correct 109 ms 3156 KB Output is correct
10 Correct 210 ms 3156 KB Output is correct
11 Correct 8 ms 1364 KB Output is correct
12 Correct 251 ms 3156 KB Output is correct
13 Correct 73 ms 3184 KB Output is correct
14 Correct 294 ms 3156 KB Output is correct
15 Correct 347 ms 3188 KB Output is correct
16 Correct 211 ms 3184 KB Output is correct
17 Correct 47 ms 3120 KB Output is correct
18 Correct 34 ms 3156 KB Output is correct
19 Correct 111 ms 3156 KB Output is correct
20 Correct 174 ms 3156 KB Output is correct
21 Correct 75 ms 4948 KB Output is correct
22 Correct 54 ms 4948 KB Output is correct
23 Correct 1143 ms 4952 KB Output is correct
24 Correct 604 ms 4948 KB Output is correct
25 Correct 1352 ms 4948 KB Output is correct
26 Correct 1810 ms 4952 KB Output is correct
27 Correct 1431 ms 4948 KB Output is correct
28 Correct 1169 ms 4952 KB Output is correct

Subtask #4-2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 724 KB Output is correct
2 Correct 1 ms 724 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 10 ms 1364 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1646 ms 4948 KB Output is correct
7 Correct 651 ms 4960 KB Output is correct
8 Correct 1410 ms 4948 KB Output is correct
9 Correct 2472 ms 4948 KB Output is correct
10 Correct 64 ms 4948 KB Output is correct
11 Correct 51 ms 4948 KB Output is correct
12 Correct 8 ms 1364 KB Output is correct
13 Correct 287 ms 3188 KB Output is correct
14 Correct 73 ms 3184 KB Output is correct
15 Correct 324 ms 3184 KB Output is correct
16 Correct 334 ms 3184 KB Output is correct
17 Correct 237 ms 3276 KB Output is correct
18 Correct 60 ms 3184 KB Output is correct
19 Correct 38 ms 3156 KB Output is correct
20 Correct 109 ms 3156 KB Output is correct
21 Correct 210 ms 3156 KB Output is correct
22 Correct 1 ms 724 KB Output is correct
23 Correct 1 ms 724 KB Output is correct
24 Correct 1 ms 596 KB Output is correct
25 Correct 8 ms 1364 KB Output is correct
26 Correct 258 ms 3156 KB Output is correct
27 Correct 73 ms 3156 KB Output is correct
28 Correct 309 ms 3184 KB Output is correct
29 Correct 322 ms 3184 KB Output is correct
30 Correct 223 ms 3156 KB Output is correct
31 Correct 49 ms 3188 KB Output is correct
32 Correct 35 ms 3156 KB Output is correct
33 Correct 112 ms 3188 KB Output is correct
34 Correct 177 ms 3124 KB Output is correct
35 Correct 529 ms 3188 KB Output is correct
36 Correct 205 ms 3156 KB Output is correct
37 Correct 646 ms 3184 KB Output is correct
38 Correct 441 ms 3244 KB Output is correct
39 Correct 522 ms 3188 KB Output is correct
40 Correct 8 ms 1364 KB Output is correct
41 Correct 251 ms 3156 KB Output is correct
42 Correct 73 ms 3184 KB Output is correct
43 Correct 294 ms 3156 KB Output is correct
44 Correct 347 ms 3188 KB Output is correct
45 Correct 211 ms 3184 KB Output is correct
46 Correct 47 ms 3120 KB Output is correct
47 Correct 34 ms 3156 KB Output is correct
48 Correct 111 ms 3156 KB Output is correct
49 Correct 174 ms 3156 KB Output is correct
50 Correct 75 ms 4948 KB Output is correct
51 Correct 54 ms 4948 KB Output is correct
52 Correct 1143 ms 4952 KB Output is correct
53 Correct 604 ms 4948 KB Output is correct
54 Correct 1352 ms 4948 KB Output is correct
55 Correct 1810 ms 4952 KB Output is correct
56 Correct 1431 ms 4948 KB Output is correct
57 Correct 1169 ms 4952 KB Output is correct
58 Correct 1 ms 724 KB Output is correct
59 Correct 1 ms 724 KB Output is correct
60 Correct 1 ms 596 KB Output is correct
61 Correct 11 ms 1444 KB Output is correct
62 Correct 1 ms 212 KB Output is correct
63 Correct 1598 ms 4964 KB Output is correct
64 Correct 799 ms 4948 KB Output is correct
65 Correct 1480 ms 4952 KB Output is correct
66 Correct 2544 ms 4948 KB Output is correct
67 Correct 60 ms 4948 KB Output is correct
68 Correct 51 ms 4964 KB Output is correct
69 Correct 255 ms 3192 KB Output is correct
70 Correct 72 ms 3156 KB Output is correct
71 Correct 350 ms 3184 KB Output is correct
72 Correct 337 ms 3188 KB Output is correct
73 Correct 217 ms 3156 KB Output is correct
74 Correct 49 ms 3184 KB Output is correct
75 Correct 35 ms 3156 KB Output is correct
76 Correct 114 ms 3184 KB Output is correct
77 Correct 177 ms 3184 KB Output is correct
78 Correct 501 ms 3188 KB Output is correct
79 Correct 202 ms 3156 KB Output is correct
80 Correct 626 ms 3184 KB Output is correct
81 Correct 468 ms 3184 KB Output is correct
82 Correct 537 ms 3188 KB Output is correct
83 Correct 1037 ms 4952 KB Output is correct
84 Correct 560 ms 4960 KB Output is correct
85 Correct 1122 ms 5068 KB Output is correct
86 Correct 1541 ms 4952 KB Output is correct
87 Correct 1206 ms 4948 KB Output is correct
88 Correct 1012 ms 4948 KB Output is correct
89 Correct 1977 ms 4952 KB Output is correct
90 Correct 3008 ms 4948 KB Output is correct
91 Correct 2023 ms 4952 KB Output is correct
92 Correct 2425 ms 4948 KB Output is correct

Subtask #5-1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 1364 KB Output is correct
2 Correct 287 ms 3188 KB Output is correct
3 Correct 73 ms 3184 KB Output is correct
4 Correct 324 ms 3184 KB Output is correct
5 Correct 334 ms 3184 KB Output is correct
6 Correct 237 ms 3276 KB Output is correct
7 Correct 60 ms 3184 KB Output is correct
8 Correct 38 ms 3156 KB Output is correct
9 Correct 109 ms 3156 KB Output is correct
10 Correct 210 ms 3156 KB Output is correct
11 Correct 8 ms 1364 KB Output is correct
12 Correct 251 ms 3156 KB Output is correct
13 Correct 73 ms 3184 KB Output is correct
14 Correct 294 ms 3156 KB Output is correct
15 Correct 347 ms 3188 KB Output is correct
16 Correct 211 ms 3184 KB Output is correct
17 Correct 47 ms 3120 KB Output is correct
18 Correct 34 ms 3156 KB Output is correct
19 Correct 111 ms 3156 KB Output is correct
20 Correct 174 ms 3156 KB Output is correct
21 Correct 75 ms 4948 KB Output is correct
22 Correct 54 ms 4948 KB Output is correct
23 Correct 1143 ms 4952 KB Output is correct
24 Correct 604 ms 4948 KB Output is correct
25 Correct 1352 ms 4948 KB Output is correct
26 Correct 1810 ms 4952 KB Output is correct
27 Correct 1431 ms 4948 KB Output is correct
28 Correct 1169 ms 4952 KB Output is correct
29 Correct 8 ms 1364 KB Output is correct
30 Correct 256 ms 3188 KB Output is correct
31 Correct 74 ms 3128 KB Output is correct
32 Correct 300 ms 3156 KB Output is correct
33 Correct 338 ms 3156 KB Output is correct
34 Correct 227 ms 3180 KB Output is correct
35 Correct 49 ms 3184 KB Output is correct
36 Correct 37 ms 3120 KB Output is correct
37 Correct 112 ms 3188 KB Output is correct
38 Correct 192 ms 3188 KB Output is correct
39 Correct 72 ms 4948 KB Output is correct
40 Correct 62 ms 4948 KB Output is correct
41 Correct 1104 ms 4948 KB Output is correct
42 Correct 590 ms 4948 KB Output is correct
43 Correct 1085 ms 4948 KB Output is correct
44 Correct 1552 ms 4948 KB Output is correct
45 Correct 1305 ms 4948 KB Output is correct
46 Correct 1069 ms 5068 KB Output is correct
47 Correct 348 ms 9412 KB Output is correct
48 Correct 308 ms 9352 KB Output is correct
49 Execution timed out 5050 ms 9300 KB Time limit exceeded
50 Halted 0 ms 0 KB -

Subtask #5-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 724 KB Output is correct
2 Correct 1 ms 724 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 10 ms 1364 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1646 ms 4948 KB Output is correct
7 Correct 651 ms 4960 KB Output is correct
8 Correct 1410 ms 4948 KB Output is correct
9 Correct 2472 ms 4948 KB Output is correct
10 Correct 64 ms 4948 KB Output is correct
11 Correct 51 ms 4948 KB Output is correct
12 Correct 1 ms 724 KB Output is correct
13 Correct 1 ms 724 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 8 ms 1364 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1465 ms 4964 KB Output is correct
18 Correct 611 ms 5068 KB Output is correct
19 Correct 1516 ms 4952 KB Output is correct
20 Correct 2560 ms 4948 KB Output is correct
21 Correct 67 ms 4968 KB Output is correct
22 Correct 63 ms 4948 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Execution timed out 5059 ms 9300 KB Time limit exceeded
25 Halted 0 ms 0 KB -

Subtask #6-1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 1364 KB Output is correct
2 Correct 287 ms 3188 KB Output is correct
3 Correct 73 ms 3184 KB Output is correct
4 Correct 324 ms 3184 KB Output is correct
5 Correct 334 ms 3184 KB Output is correct
6 Correct 237 ms 3276 KB Output is correct
7 Correct 60 ms 3184 KB Output is correct
8 Correct 38 ms 3156 KB Output is correct
9 Correct 109 ms 3156 KB Output is correct
10 Correct 210 ms 3156 KB Output is correct
11 Correct 8 ms 1364 KB Output is correct
12 Correct 251 ms 3156 KB Output is correct
13 Correct 73 ms 3184 KB Output is correct
14 Correct 294 ms 3156 KB Output is correct
15 Correct 347 ms 3188 KB Output is correct
16 Correct 211 ms 3184 KB Output is correct
17 Correct 47 ms 3120 KB Output is correct
18 Correct 34 ms 3156 KB Output is correct
19 Correct 111 ms 3156 KB Output is correct
20 Correct 174 ms 3156 KB Output is correct
21 Correct 75 ms 4948 KB Output is correct
22 Correct 54 ms 4948 KB Output is correct
23 Correct 1143 ms 4952 KB Output is correct
24 Correct 604 ms 4948 KB Output is correct
25 Correct 1352 ms 4948 KB Output is correct
26 Correct 1810 ms 4952 KB Output is correct
27 Correct 1431 ms 4948 KB Output is correct
28 Correct 1169 ms 4952 KB Output is correct
29 Correct 8 ms 1364 KB Output is correct
30 Correct 256 ms 3188 KB Output is correct
31 Correct 74 ms 3128 KB Output is correct
32 Correct 300 ms 3156 KB Output is correct
33 Correct 338 ms 3156 KB Output is correct
34 Correct 227 ms 3180 KB Output is correct
35 Correct 49 ms 3184 KB Output is correct
36 Correct 37 ms 3120 KB Output is correct
37 Correct 112 ms 3188 KB Output is correct
38 Correct 192 ms 3188 KB Output is correct
39 Correct 72 ms 4948 KB Output is correct
40 Correct 62 ms 4948 KB Output is correct
41 Correct 1104 ms 4948 KB Output is correct
42 Correct 590 ms 4948 KB Output is correct
43 Correct 1085 ms 4948 KB Output is correct
44 Correct 1552 ms 4948 KB Output is correct
45 Correct 1305 ms 4948 KB Output is correct
46 Correct 1069 ms 5068 KB Output is correct
47 Correct 348 ms 9412 KB Output is correct
48 Correct 308 ms 9352 KB Output is correct
49 Execution timed out 5050 ms 9300 KB Time limit exceeded
50 Halted 0 ms 0 KB -

Subtask #6-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 724 KB Output is correct
2 Correct 1 ms 724 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 10 ms 1364 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1646 ms 4948 KB Output is correct
7 Correct 651 ms 4960 KB Output is correct
8 Correct 1410 ms 4948 KB Output is correct
9 Correct 2472 ms 4948 KB Output is correct
10 Correct 64 ms 4948 KB Output is correct
11 Correct 51 ms 4948 KB Output is correct
12 Correct 1 ms 724 KB Output is correct
13 Correct 1 ms 724 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 8 ms 1364 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1465 ms 4964 KB Output is correct
18 Correct 611 ms 5068 KB Output is correct
19 Correct 1516 ms 4952 KB Output is correct
20 Correct 2560 ms 4948 KB Output is correct
21 Correct 67 ms 4968 KB Output is correct
22 Correct 63 ms 4948 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Execution timed out 5059 ms 9300 KB Time limit exceeded
25 Halted 0 ms 0 KB -