oj.uz

답안 #536830

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
536830 2022-03-14T05:36:56 Z zaneyu 조교 (CEOI16_popeala) C++14
0 / 100
 3 ms 2900 KB 
/*input
2 3 3
4 3 5
101
110
*/
#include<bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<n;i++)
#define MNTO(x,y) x=min(x,y)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define ll long long
const int maxn=2e4+5;
int dp[maxn][55];
bool ok[maxn];
int arr[maxn];
string s[maxn];
int main(){
    ios::sync_with_stdio(false),cin.tie(0);
    int n,m,S;
    cin>>n>>m>>S;
    REP1(i,m) cin>>arr[i];
    REP(i,n) cin>>s[i],s[i]="0"+s[i];
    REP(i,m+1) REP(j,S+1) dp[i][j]=INT_MAX;
    dp[0][0]=0;
    REP1(i,m){
        int cnt=n;
        int sum=0;
        REP(a,n) ok[a]=1;
        for(int j=i;j>=0;j--){
            if(j!=i){
                REP1(k,S){
                    if(dp[j][k-1]==INT_MAX) continue;
                    MNTO(dp[i][k],dp[j][k-1]+cnt*sum);
                }
            }
            sum+=arr[j];
            cnt=0;
            REP(a,n){
                if(s[a][j]=='0') ok[a]=0;
                if(ok[a]) ++cnt;
            }
        }
        REP1(j,S) assert(dp[i][j]<=dp[i-1][j]);
    }
    REP1(j,S) cout<<dp[m][j]<<'\n';
}

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 852 KB Output is correct
2 Runtime error 2 ms 1772 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 2 ms 2004 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 3 ms 2900 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #4
0 / 74.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 852 KB Output is correct
2 Runtime error 2 ms 1772 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -