#include <bits/stdc++.h>
#define z exit(0)
typedef long long ll;
using namespace std;
const int N = 2555;
const ll inf = 1e15;
char s[N];
ll dp[N][N];
int A, B, C, n, vis[N][N];
signed main(){
scanf("%d %s %d %d %d", &n, s, &A, &B, &C);
for(int i = 0; i<=n; ++i) fill(dp[i], dp[i]+n+1, inf);
using T = tuple<ll,int,int>;
priority_queue<T, vector<T>, greater<T>> pq;
pq.emplace(dp[0][0] = 0, 0, 0);
while(!pq.empty()){
ll dis; int i, j; tie(dis, i, j) = pq.top(); pq.pop();
if(vis[i][j]) continue; vis[i][j] = 1;
if(dp[i+1][j] > dp[i][j] + A) pq.emplace(dp[i+1][j] = dp[i][j] + A, i+1, j);
if(dp[0][i+j] > dp[i][j] + B) pq.emplace(dp[0][i+j] = dp[i][j] + B, 0, i+j);
if(dp[i+j][j] > dp[i][j] + C) pq.emplace(dp[i+j][j] = dp[i][j] + C, i+j, j);
}
printf("%lld", *min_element(dp[n], dp[n]+n+1)) ;
}
Compilation message
copypaste3.cpp: In function 'int main()':
copypaste3.cpp:18:9: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
18 | if(vis[i][j]) continue; vis[i][j] = 1;
| ^~
copypaste3.cpp:18:33: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
18 | if(vis[i][j]) continue; vis[i][j] = 1;
| ^~~
copypaste3.cpp:11:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
11 | scanf("%d %s %d %d %d", &n, s, &A, &B, &C);
| ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
336 KB |
Output is correct |
2 |
Correct |
1 ms |
336 KB |
Output is correct |
3 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
592 KB |
Output is correct |
2 |
Correct |
1 ms |
336 KB |
Output is correct |
3 |
Runtime error |
267 ms |
99740 KB |
Execution killed with signal 11 |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
336 KB |
Output is correct |
2 |
Correct |
1 ms |
336 KB |
Output is correct |
3 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
336 KB |
Output is correct |
2 |
Correct |
1 ms |
336 KB |
Output is correct |
3 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
336 KB |
Output is correct |
2 |
Correct |
1 ms |
336 KB |
Output is correct |
3 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
336 KB |
Output is correct |
2 |
Correct |
1 ms |
336 KB |
Output is correct |
3 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |