oj.uz

답안 #1101409

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1101409 2024-10-16T08:15:19 Z nguyhoangphu K개의 묶음 (IZhO14_blocks) C++17
18 / 100
 7 ms 41840 KB 
#include <bits/stdc++.h>
using namespace std;
#define mask(i) (1<<i)
const int N=1e5;
int n,k,res=1e9;
int a[N+2],mx[N+2][21],dp[N+2][102];
int get(int l,int r)
{
  int k=__lg(r-l+1);
  return max(mx[l][k],mx[r-mask(k)+1][k]);
}
int main() 
{
  ios_base::sync_with_stdio(0);
  cin.tie(0);cout.tie(0);
  cin>>n>>k;
  for (int i=1;i<=n;i++) cin>>a[i],mx[i][0]=a[i],a[i]+=a[i-1];
  for (int j=1;mask(j)<=n;j++)
  for (int i=1;i+mask(j)-1<=n;i++)
  mx[i][j]=max(mx[i][j-1],mx[i+mask(j-1)][j-1]);
  memset(dp,0x3f,sizeof dp);
  dp[0][0]=0;
  for (int j=1;j<=k;j++)
  for (int i=j;i<=n;i++)
  {
    for (int p=j;p<=min(j+40,i);p++) dp[i][j]=min(dp[i][j],dp[p-1][j-1]+get(p,i));
  }
  cout<<dp[n][k];
}

Compilation message

blocks.cpp: In function 'int main()':
blocks.cpp:20:38: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   20 |   mx[i][j]=max(mx[i][j-1],mx[i+mask(j-1)][j-1]);
      |                                     ~^~
blocks.cpp:3:21: note: in definition of macro 'mask'
    3 | #define mask(i) (1<<i)
      |                     ^

Subtask #1
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 41552 KB Output is correct
2 Correct 6 ms 41552 KB Output is correct
3 Correct 6 ms 41680 KB Output is correct
4 Correct 7 ms 41552 KB Output is correct
5 Correct 6 ms 41552 KB Output is correct
6 Correct 7 ms 41660 KB Output is correct
7 Correct 7 ms 41552 KB Output is correct
8 Correct 5 ms 41552 KB Output is correct
9 Correct 6 ms 41552 KB Output is correct
10 Correct 6 ms 41552 KB Output is correct
11 Correct 6 ms 41552 KB Output is correct
12 Correct 6 ms 41724 KB Output is correct
13 Incorrect 6 ms 41552 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 41552 KB Output is correct
2 Correct 6 ms 41640 KB Output is correct
3 Correct 6 ms 41552 KB Output is correct
4 Correct 6 ms 41664 KB Output is correct
5 Correct 6 ms 41552 KB Output is correct
6 Correct 7 ms 41552 KB Output is correct
7 Correct 6 ms 41552 KB Output is correct
8 Correct 6 ms 41552 KB Output is correct
9 Correct 6 ms 41652 KB Output is correct
10 Correct 6 ms 41552 KB Output is correct
11 Correct 6 ms 41664 KB Output is correct
12 Correct 6 ms 41552 KB Output is correct
13 Correct 6 ms 41552 KB Output is correct
14 Correct 6 ms 41632 KB Output is correct
15 Correct 6 ms 41552 KB Output is correct
16 Correct 6 ms 41552 KB Output is correct
17 Correct 5 ms 41624 KB Output is correct
18 Correct 5 ms 41644 KB Output is correct
19 Correct 7 ms 41840 KB Output is correct
20 Correct 6 ms 41552 KB Output is correct

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 41552 KB Output is correct
2 Correct 6 ms 41552 KB Output is correct
3 Correct 6 ms 41680 KB Output is correct
4 Correct 7 ms 41552 KB Output is correct
5 Correct 6 ms 41552 KB Output is correct
6 Correct 7 ms 41660 KB Output is correct
7 Correct 7 ms 41552 KB Output is correct
8 Correct 5 ms 41552 KB Output is correct
9 Correct 6 ms 41552 KB Output is correct
10 Correct 6 ms 41552 KB Output is correct
11 Correct 6 ms 41552 KB Output is correct
12 Correct 6 ms 41724 KB Output is correct
13 Incorrect 6 ms 41552 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #4
0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 41552 KB Output is correct
2 Correct 6 ms 41552 KB Output is correct
3 Correct 6 ms 41680 KB Output is correct
4 Correct 7 ms 41552 KB Output is correct
5 Correct 6 ms 41552 KB Output is correct
6 Correct 7 ms 41660 KB Output is correct
7 Correct 7 ms 41552 KB Output is correct
8 Correct 5 ms 41552 KB Output is correct
9 Correct 6 ms 41552 KB Output is correct
10 Correct 6 ms 41552 KB Output is correct
11 Correct 6 ms 41552 KB Output is correct
12 Correct 6 ms 41724 KB Output is correct
13 Incorrect 6 ms 41552 KB Output isn't correct
14 Halted 0 ms 0 KB -