Submission #1101408

# Submission time Handle Problem Language Result Execution time Memory
1101408 2024-10-16T08:15:15 Z thanhhoang K blocks (IZhO14_blocks) C++14
18 / 100
7 ms 41716 KB
#include<bits/stdc++.h>
using namespace std;
const int N=1e5+53;
int n,k,a[N][20],b[N][102];
int get(int l,int r)
{
    int o=log2(r-l+1);
    return max(a[l][o],a[r-(1<<o)+1][o]);
}
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    if(fopen("blocks.inp","r"))
    {
        freopen("blocks.inp","r",stdin);
        freopen("blocks.out","w",stdout);
    }
    cin>>n>>k;

    for(int i=1;i<=n;i++)
        cin>>a[i][0];

    for(int i=1;i<=log2(n);i++)
        for(int j=0;j+(1<<i)-1<=n;j++)
            a[j][i]=max(a[j][i-1],a[j+(1<<i-1)][i-1]);

    memset(b,0x3f,sizeof b);
    b[0][0]=0;
    for(int i=1;i<=k;i++)
        for(int j=i;j<=n;j++)
            for(int o=max(i,j-10);o<=j;o++)
                b[i][j]=min(b[i][j],b[i-1][o-1]+get(o,j));
    cout<<b[k][n];
    return 0;
}

Compilation message

blocks.cpp: In function 'int main()':
blocks.cpp:26:44: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   26 |             a[j][i]=max(a[j][i-1],a[j+(1<<i-1)][i-1]);
      |                                           ~^~
blocks.cpp:16:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 |         freopen("blocks.inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
blocks.cpp:17:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 |         freopen("blocks.out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 6 ms 41716 KB Output is correct
2 Correct 6 ms 41552 KB Output is correct
3 Correct 6 ms 41552 KB Output is correct
4 Correct 6 ms 41552 KB Output is correct
5 Correct 6 ms 41552 KB Output is correct
6 Correct 6 ms 41552 KB Output is correct
7 Correct 6 ms 41552 KB Output is correct
8 Correct 5 ms 41552 KB Output is correct
9 Correct 5 ms 41604 KB Output is correct
10 Correct 6 ms 41552 KB Output is correct
11 Correct 5 ms 41688 KB Output is correct
12 Incorrect 6 ms 41552 KB Output isn't correct
13 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 6 ms 41552 KB Output is correct
2 Correct 6 ms 41552 KB Output is correct
3 Correct 6 ms 41552 KB Output is correct
4 Correct 6 ms 41552 KB Output is correct
5 Correct 6 ms 41552 KB Output is correct
6 Correct 6 ms 41552 KB Output is correct
7 Correct 6 ms 41640 KB Output is correct
8 Correct 6 ms 41552 KB Output is correct
9 Correct 5 ms 41552 KB Output is correct
10 Correct 6 ms 41612 KB Output is correct
11 Correct 6 ms 41552 KB Output is correct
12 Correct 6 ms 41552 KB Output is correct
13 Correct 6 ms 41672 KB Output is correct
14 Correct 6 ms 41552 KB Output is correct
15 Correct 6 ms 41684 KB Output is correct
16 Correct 7 ms 41568 KB Output is correct
17 Correct 6 ms 41552 KB Output is correct
18 Correct 5 ms 41552 KB Output is correct
19 Correct 7 ms 41684 KB Output is correct
20 Correct 7 ms 41552 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 6 ms 41716 KB Output is correct
2 Correct 6 ms 41552 KB Output is correct
3 Correct 6 ms 41552 KB Output is correct
4 Correct 6 ms 41552 KB Output is correct
5 Correct 6 ms 41552 KB Output is correct
6 Correct 6 ms 41552 KB Output is correct
7 Correct 6 ms 41552 KB Output is correct
8 Correct 5 ms 41552 KB Output is correct
9 Correct 5 ms 41604 KB Output is correct
10 Correct 6 ms 41552 KB Output is correct
11 Correct 5 ms 41688 KB Output is correct
12 Incorrect 6 ms 41552 KB Output isn't correct
13 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 6 ms 41716 KB Output is correct
2 Correct 6 ms 41552 KB Output is correct
3 Correct 6 ms 41552 KB Output is correct
4 Correct 6 ms 41552 KB Output is correct
5 Correct 6 ms 41552 KB Output is correct
6 Correct 6 ms 41552 KB Output is correct
7 Correct 6 ms 41552 KB Output is correct
8 Correct 5 ms 41552 KB Output is correct
9 Correct 5 ms 41604 KB Output is correct
10 Correct 6 ms 41552 KB Output is correct
11 Correct 5 ms 41688 KB Output is correct
12 Incorrect 6 ms 41552 KB Output isn't correct
13 Halted 0 ms 0 KB -