oj.uz

답안 #682955

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
682955 2023-01-17T11:05:21 Z Rafi22 조교 (CEOI16_popeala) C++14
0 / 100
 2000 ms 1276 KB 
#include <bits/stdc++.h>

using namespace std;

#define int long long
#define endl '\n'
#define st first
#define nd second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define ll long long
#define ld long double
ll mod=1000000007;
int inf=1000000007;
ll infl=1000000000000000007;

const int N=20007,M=57;

int DP[N][M];
char is[M][N];
int a[N];
bool act[M];

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int m,n,s;
    cin>>m>>n>>s;
    for(int i=1;i<=n;i++) cin>>a[i];
    for(int i=1;i<=n;i++) a[i]+=a[i-1];
    for(int i=1;i<=m;i++) for(int j=1;j<=n;j++) cin>>is[i][j];
    for(int i=1;i<=s;i++) DP[0][i]=infl;
    for(int i=1;i<=n;i++)
    {
        DP[i][0]=infl;
        for(int j=1;j<=s;j++)
        {
            int c=0;
            for(int l=1;l<=m;l++)
            {
                if(is[l][i]=='1')
                {
                    act[l]=1;
                    c++;
                }
                else act[l]=0;
            }
            DP[i][j]=infl;
            for(int l=i-1;l>=0;l--)
            {
                DP[i][j]=min(DP[i][j],DP[l][j-1]+(a[i]-a[l])*c);
                for(int k=1;k<=m;k++)
                {
                    if(act[k]&&is[k][l]=='0')
                    {
                        act[k]=0;
                        c--;
                    }
                }
            }
        }
    }
    for(int i=1;i<=n;i++) cout<<DP[n][i]<<endl;


    return 0;
}

Subtask #1
0 / 8.0

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

Subtask #2
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 382 ms 1052 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2081 ms 1276 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 74.0

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