# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1101444 | 2024-10-16T08:31:47 Z | thanhhoang | K개의 묶음 (IZhO14_blocks) | C++14 | 6 ms | 41720 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("cc.inp","r")) { freopen("cc.inp","r",stdin); freopen("cc.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=i;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
# | 결과 | 실행 시간 | 메모리 | 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 | 5 ms | 41624 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 | 6 ms | 41552 KB | Output is correct |
9 | Correct | 6 ms | 41720 KB | Output is correct |
10 | Incorrect | 6 ms | 41720 KB | Output isn't correct |
11 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 41552 KB | Output is correct |
2 | Correct | 6 ms | 41664 KB | Output is correct |
3 | Correct | 6 ms | 41552 KB | Output is correct |
4 | Correct | 6 ms | 41616 KB | Output is correct |
5 | Correct | 6 ms | 41552 KB | Output is correct |
6 | Correct | 5 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 | 41632 KB | Output is correct |
10 | Incorrect | 6 ms | 41552 KB | Output isn't correct |
11 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | 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 | 5 ms | 41624 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 | 6 ms | 41552 KB | Output is correct |
9 | Correct | 6 ms | 41720 KB | Output is correct |
10 | Incorrect | 6 ms | 41720 KB | Output isn't correct |
11 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | 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 | 5 ms | 41624 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 | 6 ms | 41552 KB | Output is correct |
9 | Correct | 6 ms | 41720 KB | Output is correct |
10 | Incorrect | 6 ms | 41720 KB | Output isn't correct |
11 | Halted | 0 ms | 0 KB | - |