QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#523322 | #4207. Uplifting Excursion | ModyKachef | 0 | 16ms | 400112kb | C++23 | 824b | 2024-08-18 06:32:21 | 2024-08-18 06:32:21 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define int long long
int dp[201][101*50*50] ;
int m , L;
int a[201];
int brute(int i , int s){
if (i == m+1) {
if (s == L) return 0;
else return -1e18;
}
if (dp[i+100][s + 100*100] != -1) return dp[i+100][s + 50*50*50];
int ans = -1e18;
for (int j = 0 ; j <= a[i+100] ; j++){
ans = max(ans , brute(i+1 , s + j * i) + j);
}
return dp[i+100][s + 50*50*50] = ans;
}
void doWork(){
cin >> m >> L;
for (int i = -m ; i <= m ; i++){
cin >> a[i+100];
}
int x = brute(-m , 0);
if (x < 0) {cout << "impossible";}
else cout << x ;
}
signed main(){
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
memset(dp , -1 , sizeof dp);
doWork();
}
詳細信息
Subtask #1:
score: 0
Time Limit Exceeded
Test #1:
score: 5
Accepted
time: 16ms
memory: 400052kb
input:
1 5 0 0 6
output:
5
result:
ok single line: '5'
Test #2:
score: 5
Accepted
time: 11ms
memory: 400112kb
input:
50 2303 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 3 5 25 50 0
output:
47
result:
ok single line: '47'
Test #3:
score: 0
Time Limit Exceeded
input:
50 -17964 18 21 8 47 11 30 0 34 11 22 10 29 14 39 25 42 16 47 6 39 0 4 28 5 4 39 43 47 14 49 24 37 22 47 23 31 18 28 43 14 44 26 46 40 27 17 41 7 13 25 27 20 17 13 23 30 9 16 5 25 46 22 35 44 34 39 19 19 33 11 30 30 41 20 1 9 39 34 31 26 28 13 13 21 45 11 32 30 35 37 22 31 1 9 43 18 31 41 34 39 2
output:
result:
Subtask #2:
score: 0
Skipped
Dependency #1:
0%
Subtask #3:
score: 0
Time Limit Exceeded
Test #19:
score: 0
Time Limit Exceeded
input:
30 38887954194235 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 444113827766 26 511237030935 22 696666627923 315938808146 20 952560827478 924020644151 850666790939 23 587888300072 23 797812801251 911390834853 677171102320 4 2 22 950650764450 278888113729 23 15 15 13 9 637120041802 20 1...
output:
result:
Subtask #4:
score: 0
Skipped
Dependency #3:
0%
Subtask #5:
score: 0
Skipped
Dependency #3:
0%
Subtask #6:
score: 0
Skipped
Dependency #5:
0%
Subtask #7:
score: 0
Skipped
Dependency #5:
0%
Subtask #8:
score: 0
Skipped
Dependency #6:
0%
Subtask #9:
score: 0
Skipped
Dependency #7:
0%
Subtask #10:
score: 0
Skipped
Dependency #1:
0%