# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
44772 | 2018-04-06T06:54:59 Z | choikiwon | Skyline (IZhO11_skyline) | C++17 | 43 ms | 48876 KB |
#include<bits/stdc++.h> using namespace std; int N; int H[302]; int cc[302][202][202]; int dp(int n, int c1, int c2) { int &ret = cc[n][c1][c2]; if(ret != -1) return ret; ret = 1e9; int add = c1 > c2? (c1 - c2) * 3 : 0; for(int i = 0; i <= min(min(c1, c2), H[n + 2]); i++) { int j = min(c1, c2) - i; ret = min(ret, add + 7 * i + 5 * j + dp(n + 1, c2 - i - j, H[n + 2] - i)); } return ret; } int main() { scanf("%d", &N); for(int i = 0; i < N; i++) { scanf("%d", &H[i]); } memset(cc, -1, sizeof(cc)); printf("%d", dp(0, H[0], H[1])); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 43 ms | 48632 KB | Output is correct |
2 | Correct | 41 ms | 48876 KB | Output is correct |
3 | Incorrect | 37 ms | 48876 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |