# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
172655 | 2020-01-02T09:41:33 Z | Swan | K blocks (IZhO14_blocks) | C++14 | 41 ms | 41596 KB |
#include<bits/stdc++.h> using namespace std; int dp[105][100005]; int a[100005]; int n,k; int main(){ scanf("%d %d",&n,&k); int maxv = 0; memset(dp,0x3f,sizeof(dp)); for (int i=1; i<=n; i++) { scanf("%d",&a[i]); maxv = max(maxv,a[i]); dp[1][i] = maxv; } for (int i=2; i<=k; i++) { stack<int> s1,s2; for (int j=1; j<=n; j++) { //cout << j << ' ' << s1.size() << endl; //if(s1.size())cout << s1.top() << endl; int my_dp = dp[i-1][j-1]; while (!s1.empty() && s1.top() < a[j]) { my_dp = min(my_dp,s2.top()); s1.pop(); s2.pop(); } s1.push(a[j]); s2.push(my_dp); if(j >= i) dp[i][j] = s1.top() + s2.top(); } } printf("%d",dp[k][n]); } /* 6 2 1 2 3 4 5 6 */
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 36 ms | 41464 KB | Output is correct |
2 | Correct | 36 ms | 41468 KB | Output is correct |
3 | Correct | 36 ms | 41464 KB | Output is correct |
4 | Correct | 36 ms | 41464 KB | Output is correct |
5 | Correct | 36 ms | 41440 KB | Output is correct |
6 | Correct | 37 ms | 41464 KB | Output is correct |
7 | Correct | 36 ms | 41464 KB | Output is correct |
8 | Correct | 36 ms | 41464 KB | Output is correct |
9 | Correct | 36 ms | 41452 KB | Output is correct |
10 | Correct | 36 ms | 41464 KB | Output is correct |
11 | Incorrect | 36 ms | 41596 KB | Output isn't correct |
12 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 36 ms | 41464 KB | Output is correct |
2 | Correct | 36 ms | 41460 KB | Output is correct |
3 | Correct | 36 ms | 41356 KB | Output is correct |
4 | Correct | 36 ms | 41464 KB | Output is correct |
5 | Correct | 36 ms | 41464 KB | Output is correct |
6 | Correct | 36 ms | 41464 KB | Output is correct |
7 | Correct | 36 ms | 41340 KB | Output is correct |
8 | Correct | 36 ms | 41468 KB | Output is correct |
9 | Correct | 36 ms | 41464 KB | Output is correct |
10 | Correct | 36 ms | 41460 KB | Output is correct |
11 | Incorrect | 36 ms | 41464 KB | Output isn't correct |
12 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 36 ms | 41452 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 41 ms | 41592 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |