oj.uz

Submission #588651

# Submission time Handle Problem Language Result Execution time Memory
588651 2022-07-03T19:09:36 Z peuch Uplifting Excursion (BOI22_vault) C++17
0 / 100
 5000 ms 8204 KB 
#include<bits/stdc++.h>
using namespace std;

#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")

const long long MAXN = 101;
const long long MAXA = 101 * 50 * 100;
const long long INF = 1e18;
const long long HALF = MAXA / 2;

long long m;
long long l;

long long v[2 * MAXN];
long long dp[2][MAXA];

int main(){
	
	scanf("%lld %lld", &m, &l);
	long long sum = 0;
	long long cnt = 0;
	for(long long i = -m; i <= m; i++){
		scanf("%lld", &v[i + m]);
		sum += v[i + m] * i;
		cnt += v[i + m];
	}
	
	if(l + HALF >= MAXA || l + HALF < 0){
		printf("impossible\n");
		return 0;
	} 
	
	for(long long j = 0; j < MAXA; j++)
		dp[1][j] = INF;
	
	dp[1][HALF] = 0;
	for(long long i = 0; i <= 2 * m; i++){
		for(long long k = 0; k < v[i]; k++){
			swap(dp[1], dp[0]);
			for(long long j = 0; j < MAXA; j++){
				dp[1][j] = dp[0][j];
				if(j - (i - m - 1) < MAXA && j - (i - m) >= 0) dp[1][j] = min(dp[1][j], dp[0][j - (i - m)] + 1);
			}
		}
	}
	
	if(dp[1][sum - l + HALF] == INF) printf("impossible\n");
	else printf("%lld\n", cnt - dp[1][sum - l + HALF]);
}

Compilation message

vault.cpp: In function 'int main()':
vault.cpp:20:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   20 |  scanf("%lld %lld", &m, &l);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~
vault.cpp:24:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   24 |   scanf("%lld", &v[i + m]);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 8148 KB Output is correct
2 Correct 16 ms 8204 KB Output is correct
3 Correct 12 ms 8148 KB Output is correct
4 Correct 98 ms 8148 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 3853 ms 8196 KB Output is correct
7 Correct 1498 ms 8148 KB Output is correct
8 Correct 3598 ms 8192 KB Output is correct
9 Execution timed out 5065 ms 8080 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 8148 KB Output is correct
2 Correct 16 ms 8204 KB Output is correct
3 Correct 12 ms 8148 KB Output is correct
4 Correct 98 ms 8148 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 3853 ms 8196 KB Output is correct
7 Correct 1498 ms 8148 KB Output is correct
8 Correct 3598 ms 8192 KB Output is correct
9 Execution timed out 5065 ms 8080 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #3-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 8184 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 8184 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 8184 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 8148 KB Output is correct
2 Correct 16 ms 8204 KB Output is correct
3 Correct 12 ms 8148 KB Output is correct
4 Correct 98 ms 8148 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 3853 ms 8196 KB Output is correct
7 Correct 1498 ms 8148 KB Output is correct
8 Correct 3598 ms 8192 KB Output is correct
9 Execution timed out 5065 ms 8080 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #5-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 8184 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 8148 KB Output is correct
2 Correct 16 ms 8204 KB Output is correct
3 Correct 12 ms 8148 KB Output is correct
4 Correct 98 ms 8148 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 3853 ms 8196 KB Output is correct
7 Correct 1498 ms 8148 KB Output is correct
8 Correct 3598 ms 8192 KB Output is correct
9 Execution timed out 5065 ms 8080 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #6-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 8184 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 8148 KB Output is correct
2 Correct 16 ms 8204 KB Output is correct
3 Correct 12 ms 8148 KB Output is correct
4 Correct 98 ms 8148 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 3853 ms 8196 KB Output is correct
7 Correct 1498 ms 8148 KB Output is correct
8 Correct 3598 ms 8192 KB Output is correct
9 Execution timed out 5065 ms 8080 KB Time limit exceeded
10 Halted 0 ms 0 KB -