oj.uz

답안 #920330

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
920330 2024-02-02T13:04:24 Z Cookie 조교 (CEOI16_popeala) C++14
8 / 100
 171 ms 9304 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], up[mxn + 1][16];
int last[mxn + 1][51];
vt<int>comp[50005];
bool ok[mxn + 1][51];
void ckmin(ll &a, ll b){
    a = min(a, b);
}
ll getmn(int l, int r){
    if(l > r)return(inf);
    int lg = __lg(r - l + 1);
 
    return(min(up[l][lg], up[r - (1 << lg) + 1][lg]));
}
 
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;
 
    for(int i = 1; i <= s; i++){
        for(int j = 1; j <= t; j++){
            ll last = j, alive = n;
            for(int k = 0; k < sz(comp[j]); k++){
                for(int l = last; l > comp[j][k]; l--){
                    ckmin(dp[j][i], dp[l - 1][i - 1] + alive * (prefp[j] - prefp[l - 1]));
                }
                last = comp[j][k]; alive--;
            }
        }
    }
 
    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 2 ms 8792 KB Output is correct
2 Correct 2 ms 8536 KB Output is correct

Subtask #2
0 / 9.0

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

Subtask #3
0 / 9.0

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

Subtask #4
0 / 74.0

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