# |
제출 시각 |
아이디 |
문제 |
언어 |
결과 |
실행 시간 |
메모리 |
52943 |
2018-06-27T08:24:25 Z |
노영훈(#1382) |
조교 (CEOI16_popeala) |
C++11 |
|
2 ms |
352 KB |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int MX=20010, inf=2e9+10;
int n, t, s;
int P[MX];
bool R[51][MX];
ll D[51][MX];
int score[MX][MX];
void init(){
for(int i=0; i<=s; i++)
for(int j=0; j<=t; j++)
D[i][j]=-1;
for(int i=0; i<=s; i++) D[i][0]=inf;
for(int i=1; i<=t; i++)
D[0][i]=inf;
D[0][0]=0;
for(int l=1; l<=t; l++){
bool B[51]; int sum=0;
fill(B+1, B+n+1, true);
for(int r=l; r<=t; r++){
sum+=P[r];
int cnt=0;
for(int i=1; i<=n; i++) B[i]&=R[i][r], cnt+=B[i];
score[l][r]=cnt*sum;
}
}
}
ll d(int k, int r){
ll &res=D[k][r];
if(res>=0) return res;
res=inf;
for(int x=r; x>=1; x--){
ll now=d(k-1, x-1) + score[x][r];
if(now<=res) res=now;
}
return res;
}
int main(){
ios::sync_with_stdio(0); cin.tie(0);
cin>>n>>t>>s;
for(int i=1; i<=t; i++)
cin>>P[i];
for(int i=1; i<=n; i++)
for(int j=1; j<=t; j++){
char c; cin>>c;
R[i][j]=(c=='1');
}
init();
/*
for(int i=0; i<=s; i++, cout<<'\n')
for(int j=0; j<=t; j++)
cout<<d(i,j)<<' ';
for(int i=1; i<=s; i++)
cout<<D[i][t]<<'\n';
*/
for(int i=1; i<=s; i++)
cout<<d(i,t)<<'\n';
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
1 ms |
128 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
2 ms |
352 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
2 ms |
352 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
1 ms |
128 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |