oj.uz

답안 #1101535

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1101535 2024-10-16T09:36:00 Z thanhhoang K개의 묶음 (IZhO14_blocks) C++14
0 / 100
 6 ms 43524 KB 
#include<bits/stdc++.h>
using namespace std;
const int N=1e5+53;
int n,k,a[N][20],b[102][N],c[N],e[N],f[N][20];
stack<int>d;
void build()
{
    for(int i=0;i<=n;i++) f[i][0]=e[i];
    for(int i=1;(1 << i) <= n;i++)
        for(int j=0;j+(1<<i)-1<=n;j++)
            f[j][i]=min(f[j][i-1],f[j+(1<<i-1)][i-1]);
}
int get(int l,int r)
{
    int o=__lg(r-l+1);
    return min(f[l][o],f[r-(1<<o)+1][o]);
}
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    if(fopen("cc.inp","r"))
    {
        freopen("cc.inp","r",stdin);
        freopen("cc.out","w",stdout);
    }
    cin>>n>>k;
    a[0][0]=1e9;
    d.push(0);
    for(int i=1;i<=n;i++)
    {
        cin>>a[i][0];
        while(a[d.top()][0]<=a[i][0]) d.pop();
        c[i]=d.top();
        d.push(i);
    }
    memset(b,0x3f,sizeof b);
    b[0][0]=0;
    for (int i = 0; i <= n; i++) e[i] = b[0][i];
    for(int i=1;i<=k;i++)
    {
        build();
        for(int j=1;j<=n;j++)
        {
            b[i][j]=min(b[i][c[j]],get(c[j],j-1)+a[j][0]);
            e[j]=b[i][j];
        }
    }

    cout<<b[k][n];
    return 0;
}

Compilation message

blocks.cpp: In function 'void build()':
blocks.cpp:11:44: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   11 |             f[j][i]=min(f[j][i-1],f[j+(1<<i-1)][i-1]);
      |                                           ~^~
blocks.cpp: In function 'int main()':
blocks.cpp:24:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   24 |         freopen("cc.inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~
blocks.cpp:25:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   25 |         freopen("cc.out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 43344 KB Output is correct
2 Correct 6 ms 43344 KB Output is correct
3 Correct 6 ms 43524 KB Output is correct
4 Incorrect 6 ms 43344 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 43344 KB Output is correct
2 Correct 6 ms 43344 KB Output is correct
3 Correct 6 ms 43344 KB Output is correct
4 Incorrect 6 ms 43344 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 43344 KB Output is correct
2 Correct 6 ms 43344 KB Output is correct
3 Correct 6 ms 43524 KB Output is correct
4 Incorrect 6 ms 43344 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 43344 KB Output is correct
2 Correct 6 ms 43344 KB Output is correct
3 Correct 6 ms 43524 KB Output is correct
4 Incorrect 6 ms 43344 KB Output isn't correct
5 Halted 0 ms 0 KB -