oj.uz

Submission #588647

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

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

long long m;
long long l;

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

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 >= MAXN * MAXN * MAXN || l + HALF < 0){
		printf("impossible\n");
		return 0;
	} 
	
	for(long long j = 0; j < MAXN * MAXN * MAXN; 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++){
			for(long long j = 0; j < MAXN * MAXN * MAXN; j++)
				dp[0][j] = dp[1][j];
			for(long long j = 0; j < MAXN * MAXN * MAXN; j++){
				dp[1][j] = dp[0][j];
				if(j - (i - m - 1) < MAXN * MAXN * MAXN && 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:16:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 |  scanf("%lld %lld", &m, &l);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~
vault.cpp:20:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   20 |   scanf("%lld", &v[i + m]);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 16468 KB Output is correct
2 Correct 26 ms 16324 KB Output is correct
3 Correct 23 ms 16340 KB Output is correct
4 Correct 163 ms 16404 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Execution timed out 5084 ms 16340 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 16468 KB Output is correct
2 Correct 26 ms 16324 KB Output is correct
3 Correct 23 ms 16340 KB Output is correct
4 Correct 163 ms 16404 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Execution timed out 5084 ms 16340 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #3-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 164 ms 16404 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 164 ms 16404 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 164 ms 16404 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 36 ms 16468 KB Output is correct
2 Correct 26 ms 16324 KB Output is correct
3 Correct 23 ms 16340 KB Output is correct
4 Correct 163 ms 16404 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Execution timed out 5084 ms 16340 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #5-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 164 ms 16404 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 36 ms 16468 KB Output is correct
2 Correct 26 ms 16324 KB Output is correct
3 Correct 23 ms 16340 KB Output is correct
4 Correct 163 ms 16404 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Execution timed out 5084 ms 16340 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #6-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 164 ms 16404 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 36 ms 16468 KB Output is correct
2 Correct 26 ms 16324 KB Output is correct
3 Correct 23 ms 16340 KB Output is correct
4 Correct 163 ms 16404 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Execution timed out 5084 ms 16340 KB Time limit exceeded
7 Halted 0 ms 0 KB -