Submission #1077138

# Submission time Handle Problem Language Result Execution time Memory
1077138 2024-08-27T01:38:10 Z duyhoanho K blocks (IZhO14_blocks) C++14
0 / 100
30 ms 80284 KB
#include <bits/stdc++.h>
#define task ""
#define int long long
#define forinc(i,a,b) for(int i=a;i<=b;i++)
using namespace std;
const int N=1e5+10;
int n,a[N],dp[N][102],k;
int32_t main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    if (fopen ("blocks.in", "r"))
    {
        freopen ("blocks.in", "r", stdin);
        freopen ("blocks.out", "w", stdout);
    }
    cin>>n>>k;
    memset(dp,99,sizeof dp);
    int mx=0;
    forinc(i,1,n)
    {
        cin>>a[i];
        mx=max(mx,a[i]);
        dp[i][1] = mx;
        dp[i][0]=0;
    }
    dp[0][0]=0;
    for(int i=2;i<=n;i++)
    {
      for(int j=2;j<=k;j++)
      {
        int mx=a[i];
        for(int tt=i-1;tt>=1;tt--)
        {
          dp[i][j] = min(dp[i][j],dp[tt][j-1] + mx);
          mx=max(mx,tt);
        }
      }
    }
  cout<<dp[n][k];
}

Compilation message

blocks.cpp: In function 'int32_t main()':
blocks.cpp:15:17: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 |         freopen ("blocks.in", "r", stdin);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
blocks.cpp:16:17: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 |         freopen ("blocks.out", "w", stdout);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 24 ms 80216 KB Output is correct
2 Correct 23 ms 80220 KB Output is correct
3 Correct 24 ms 80196 KB Output is correct
4 Correct 20 ms 80232 KB Output is correct
5 Correct 23 ms 80220 KB Output is correct
6 Correct 23 ms 80176 KB Output is correct
7 Correct 25 ms 80220 KB Output is correct
8 Correct 23 ms 80072 KB Output is correct
9 Correct 22 ms 80212 KB Output is correct
10 Incorrect 28 ms 80220 KB Output isn't correct
11 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 21 ms 80216 KB Output is correct
2 Correct 22 ms 80208 KB Output is correct
3 Correct 24 ms 80284 KB Output is correct
4 Correct 23 ms 80220 KB Output is correct
5 Correct 22 ms 80220 KB Output is correct
6 Correct 30 ms 80208 KB Output is correct
7 Correct 22 ms 80220 KB Output is correct
8 Correct 23 ms 80284 KB Output is correct
9 Correct 24 ms 80076 KB Output is correct
10 Incorrect 23 ms 80080 KB Output isn't correct
11 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 24 ms 80216 KB Output is correct
2 Correct 23 ms 80220 KB Output is correct
3 Correct 24 ms 80196 KB Output is correct
4 Correct 20 ms 80232 KB Output is correct
5 Correct 23 ms 80220 KB Output is correct
6 Correct 23 ms 80176 KB Output is correct
7 Correct 25 ms 80220 KB Output is correct
8 Correct 23 ms 80072 KB Output is correct
9 Correct 22 ms 80212 KB Output is correct
10 Incorrect 28 ms 80220 KB Output isn't correct
11 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 24 ms 80216 KB Output is correct
2 Correct 23 ms 80220 KB Output is correct
3 Correct 24 ms 80196 KB Output is correct
4 Correct 20 ms 80232 KB Output is correct
5 Correct 23 ms 80220 KB Output is correct
6 Correct 23 ms 80176 KB Output is correct
7 Correct 25 ms 80220 KB Output is correct
8 Correct 23 ms 80072 KB Output is correct
9 Correct 22 ms 80212 KB Output is correct
10 Incorrect 28 ms 80220 KB Output isn't correct
11 Halted 0 ms 0 KB -