#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int,int>
#define OK puts("OK");
#define NO puts("NO");
#define YES puts("YES");
#define fr first
#define sc second
#define ret return
#define scan1(a) scanf("%lld",&a);
#define scan2(a,b) scanf("%lld %lld",&a, &b);
#define scan3(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);
#define all(s) s.begin(),s.end()
#define allr(s) s.rbegin(),s.rend()
#define pb push_back
#define sz(v) (int)v.size()
#define endi puts("");
const int N = 1e6+11,INF=1e9+7;
int q[N],n,dp[304][201][201],vis[305][201][201];
int rec(int j,int x,int y){
if (j > n)ret 0;
if (vis[j][x][y])ret dp[j][x][y];
vis[j][x][y]=1;
if (x == 0){
dp[j][x][y] = rec(j+1,y,q[j+2]);
}
else {
dp[j][x][y] = rec(j,x-1,y)+3;
if (y > 0){
dp[j][x][y] = min(dp[j][x][y],rec(j,x-1,y-1)+5);
}
if (x <= y && x <= q[j+2]){
dp[j][x][y] = min(dp[j][x][y],rec(j+1,y-x,q[j+2]-x)+7*x);
}
}
ret dp[j][x][y];
}
main(){
int i,j;
scan1(n)
for (i=1;i<=n;++i)
scan1(q[i])
cout <<rec(1,q[1],q[2]);
}
Compilation message
skyline.cpp:43:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
43 | main(){
| ^
skyline.cpp: In function 'int main()':
skyline.cpp:44:11: warning: unused variable 'j' [-Wunused-variable]
44 | int i,j;
| ^
skyline.cpp:11:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
11 | #define scan1(a) scanf("%lld",&a);
| ~~~~~^~~~~~~~~~~
skyline.cpp:45:5: note: in expansion of macro 'scan1'
45 | scan1(n)
| ^~~~~
skyline.cpp:11:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
11 | #define scan1(a) scanf("%lld",&a);
| ~~~~~^~~~~~~~~~~
skyline.cpp:47:9: note: in expansion of macro 'scan1'
47 | scan1(q[i])
| ^~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
364 KB |
Output is correct |
2 |
Correct |
1 ms |
364 KB |
Output is correct |
3 |
Correct |
1 ms |
364 KB |
Output is correct |
4 |
Correct |
2 ms |
3072 KB |
Output is correct |
5 |
Correct |
1 ms |
620 KB |
Output is correct |
6 |
Correct |
1 ms |
1024 KB |
Output is correct |
7 |
Correct |
1 ms |
1280 KB |
Output is correct |
8 |
Correct |
2 ms |
1772 KB |
Output is correct |
9 |
Correct |
4 ms |
3948 KB |
Output is correct |
10 |
Correct |
7 ms |
8448 KB |
Output is correct |
11 |
Correct |
39 ms |
45164 KB |
Output is correct |
12 |
Correct |
10 ms |
11136 KB |
Output is correct |
13 |
Correct |
43 ms |
50680 KB |
Output is correct |
14 |
Correct |
63 ms |
70892 KB |
Output is correct |
15 |
Correct |
167 ms |
152684 KB |
Output is correct |
16 |
Correct |
156 ms |
141548 KB |
Output is correct |
17 |
Correct |
221 ms |
193900 KB |
Output is correct |
18 |
Correct |
215 ms |
190316 KB |
Output is correct |
19 |
Correct |
204 ms |
179564 KB |
Output is correct |
20 |
Correct |
222 ms |
193900 KB |
Output is correct |