oj.uz

답안 #968304

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
968304 2024-04-23T09:51:41 Z berr 조교 (CEOI16_popeala) C++17
26 / 100
 2000 ms 245100 KB 
#include <bits/stdc++.h>
using namespace std;
const int N = 2e4+30;

int r[N][N];
int gh[57][57];
vector<vector<int>> upd(N);

#define int long long
void solve(){
    int n, t, s; cin >> n >> t >> s;
    vector<int> v(t);
    vector dis(t+2, vector(s+1, (int)1e10)) ;

    for(auto &i: v) cin >> i;

    vector<string> se(n);

    for(auto &i: se){
        cin >> i;
        int k=i[0]-'0';

        for(int l=1; l<t; l++){
            if(i[l]=='0'){
                if(k)
                for(int j=l-k; j<l; j++){
                    for(int g=j; g<l; g++){
                        r[j][g]++;
                    }
                }
                k=0;
            }
            else k++;
        }

        if(k){
            for(int j=t-k; j<t; j++){
                for(int g=j; g<t; g++){
                    r[j][g]++;
                }
            }        
        }
    } 

    for(int i=1; i<t; i++) v[i] += v[i-1];

    int h=0;

    for(int i=0; i<n; i++){
        int k=0;
        for(int l=0; l<t; l++){
            if(se[i][l]=='0'){
                for(int j=l-k; j<l; j++){
                    h++;
                    upd[l].push_back(j);
                }
                k = 0;
            }
            else k++;
        }
    }

    for(int i=0; i<55; i++){
        for(int l=0; l<55; l++){
            gh[i][l]=-1;
        }
    }

    assert((h < 55*t));
    gh[0][0]=0;
    dis[0][0]=0;

    auto calc=[&](int ri, int l, int s){
        if(dis[l][s]==1e10) return (int)1e10;
        int h = dis[l][s];
        int gh = v[ri];
        if(l) gh-=v[l-1];
        int kac = r[l][ri];

        return h+kac*gh;
    };

    for(int i=0; i<=t; i++){
        //hah;

        for(int j=0; j<50; j++){
            for(int el=0; el<=50; el++){
                if(gh[j][el]!=-1){
                    if(i!=0)
                    dis[i][j+1] = min(dis[i][j+1], calc(i-1, gh[j][el], j));
                    if(i!=t)
                    upd[i].push_back(gh[j][el]);
                    gh[j][el] = -1;
                }
            }
        }
        if(i<t)
        upd[i].push_back(i);

        if(i<t)
        for(auto l: upd[i]){
            if(l<0) continue;
            int el = r[l][i];// kaç tane


            for(int k=0; k<s; k++){
                if(gh[k][el]==-1) gh[k][el]=l;
                else{

                    int val_new = calc(i, l, k);
                    int val_old = calc(i, gh[k][el], k);
                    if(val_new < val_old){
                        gh[k][el] = l;  
                    }
                }
            }
        }
    }

    for(int i=1; i<=s; i++) cout<<dis[t][i]<<"\n";
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    /*freopen("popeala.in", "r", stdin);
    freopen("popeala.out", "w", stdout);
*/
    solve();
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 860 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 171 ms 44104 KB Output is correct
2 Correct 167 ms 44140 KB Output is correct
3 Correct 173 ms 44496 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 760 ms 138128 KB Output is correct
2 Correct 1176 ms 150844 KB Output is correct
3 Correct 1683 ms 187012 KB Output is correct

Subtask #4
0 / 74.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 860 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 171 ms 44104 KB Output is correct
4 Correct 167 ms 44140 KB Output is correct
5 Correct 173 ms 44496 KB Output is correct
6 Correct 760 ms 138128 KB Output is correct
7 Correct 1176 ms 150844 KB Output is correct
8 Correct 1683 ms 187012 KB Output is correct
9 Execution timed out 2057 ms 245100 KB Time limit exceeded
10 Halted 0 ms 0 KB -