oj.uz

답안 #920353

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
920353 2024-02-02T13:32:20 Z Cookie 조교 (CEOI16_popeala) C++14
100 / 100
 227 ms 111220 KB 
#include<bits/stdc++.h>
#include<fstream>
using namespace std;

#define sz(a) (int)a.size()
#define ALL(v) v.begin(), v.end()
#define ALLR(v) v.rbegin(), v.rend()
#define ll long long
#define pb push_back
#define forr(i, a, b) for(int i = a; i < b; i++)
#define dorr(i, a, b) for(int i = a; i >= b; i--)
#define ld long double
#define vt vector
#include<fstream>
#define fi first
#define se second
#define pll pair<ll, ll>
#define pii pair<int, int>
#define mpp make_pair
const ld PI = 3.14159265359, prec = 1e-9;;
using u128 = __uint128_t;
//const int x[4] = {1, 0, -1, 0};
//const int y[4] = {0, -1, 0, 1};
const ll mod = 1e6 + 3;
const int mxn = 2e5 + 69, mxq = 1e5 + 5, sq = 500, mxv = 1e6 + 5;
//const int base = (1 <<18);
const ll inf = 2e9 + 5, neg = -69420;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
//const int x[9] = {0, 1, 1, -1, -1, 2, -2, 2, -2};
//const inty[9] = {0, 2, -2, 2, -2, 1, 1, -1, -1};


int n, t, s;
ll p[mxn + 1], prefp[mxn + 1], pref[51][mxn + 1], dp[mxn + 1][51], prefmn[51][mxn + 1];
int last[51][mxn + 1];
vt<int>comp[50005];
bool ok[mxn + 1][51];
void ckmin(ll &a, ll b){
    a = min(a, b);
}

void build(int s){
    for(int i = 0; i <= n; i++){
        prefmn[i][0] = inf;
        for(int j = 1; j <= t; j++){
            prefmn[i][j] = min(prefmn[i][j - 1], dp[j - 1][s] - i * prefp[j - 1]);
        }
    }
}
void solve(){
    cin >> n >> t >> s;
    for(int i = 1; i <= t; i++){
        cin >> p[i]; prefp[i] = prefp[i - 1] + p[i];
    }
    for(int i = 1; i <= t; i++)comp[i].pb(0);
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= t; j++){
            char c; cin >> c;
            ok[i][j] = (c - '0');
        }
        for(int j = 1; j <= t; j++){
            if(!ok[i][j])last[i][j] = j;
            else last[i][j] = last[i][j - 1];
            comp[j].pb(last[i][j]);
        }
    }
    for(int i = 1; i <= t; i++)sort(ALLR(comp[i]));
    for(int i = 0; i <= t; i++){
        for(int j = 0; j <= s; j++){
            dp[i][j] = inf;
        }
    }
    dp[0][0] = 0;
    build(0);
    for(int i = 1; i <= s; i++){
        for(int j = 1; j <= t; j++){
            int last = j, alive = n;
            for(int k = 0; k < sz(comp[j]); k++){

                ckmin(dp[j][i], prefmn[alive][last] + alive * prefp[j]);

                last = comp[j][k]; alive--;
            }
        }
        build(i);
    }

    for(int i = 1; i <= s; i++){
        cout << dp[t][i] << "\n";
    }
}
signed main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    //freopen("COLLEGE.INP", "r", stdin);
    //freopen("COLLEGE.OUT", "w", stdout);
    int tt; tt = 1;
    while(tt--){
        solve();

    }
    return(0);
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 14680 KB Output is correct
2 Correct 15 ms 66296 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 91224 KB Output is correct
2 Correct 16 ms 87128 KB Output is correct
3 Correct 16 ms 87128 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 91992 KB Output is correct
2 Correct 39 ms 94424 KB Output is correct
3 Correct 44 ms 92760 KB Output is correct

Subtask #4
74.0 / 74.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 14680 KB Output is correct
2 Correct 15 ms 66296 KB Output is correct
3 Correct 17 ms 91224 KB Output is correct
4 Correct 16 ms 87128 KB Output is correct
5 Correct 16 ms 87128 KB Output is correct
6 Correct 29 ms 91992 KB Output is correct
7 Correct 39 ms 94424 KB Output is correct
8 Correct 44 ms 92760 KB Output is correct
9 Correct 68 ms 96080 KB Output is correct
10 Correct 93 ms 100972 KB Output is correct
11 Correct 216 ms 109112 KB Output is correct
12 Correct 218 ms 109484 KB Output is correct
13 Correct 224 ms 109392 KB Output is correct
14 Correct 227 ms 109648 KB Output is correct
15 Correct 220 ms 111220 KB Output is correct