제출 #1308635

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1308635		Tymond	조교 (CEOI16_popeala)	C++20	100 / 100	511 ms	25536 KiB

popeala

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define vi vector<int>
#define vll vector<long long>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
mt19937_64 rng64(chrono::high_resolution_clock::now().time_since_epoch().count());
inline int rand(int l,int r){return uniform_int_distribution<int>(l, r)(rng);}
inline ll rand(ll l,ll r){return uniform_int_distribution<ll>(l, r)(rng64);}
#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif

struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};

struct pair_hash{
  size_t operator()(const pair<int,int>&x)const{
    return hash<long long>()(((long long)x.first)^(((long long)x.second)<<32));
  }
};

const int MAXT = 20007;
const int MAXN = 52;
const int INF = 2e9 + 1;
const int BASE = (1 << 15);
int dp[MAXT][MAXN];
string S[MAXN];
int A[MAXT];
int pref[MAXT];
int lst[MAXN];
int f0[MAXT];
int mn[MAXT][MAXN];
vector<pair<pii, int>> intervals[MAXT];
int n, t, s;

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);

    cin >> n >> t >> s;
    for(int i = 1; i <= t; i++){
        cin >> A[i];
        pref[i] = pref[i - 1] + A[i];
    }

    for(int i = 1; i <= n; i++){
        cin >> S[i];
        f0[0]++;
    }

    for(int j = 1; j <= s; j++){
        dp[0][j] = INF;
    }

    for(int i = 1; i <= t; i++){
        dp[i][0] = INF;
    }

    for(int i = 1; i <= t; i++){
        set<int> pos;
        for(int j = 1; j <= n; j++){
            if(S[j][i - 1] == '0'){
                f0[lst[j]]--;
                lst[j] = i;
                f0[i]++;
            }

            if(lst[j] > 0){
                pos.insert(lst[j]);
            }
        }

        vi vec = {};
        for(auto ele : pos){
            vec.pb(ele);
        }
        reverse(all(vec));

        intervals[i] = {};
        int curr = n;
        int l = i;
        for(int j = 0; j < sz(vec); j++){
            intervals[i].pb(mp(mp(vec[j] + 1, l), curr));
            l = vec[j];
            curr -= f0[vec[j]];
        }
        intervals[i].pb(mp(mp(1, l), curr));
    }

    for(int k = 1; k <= s; k++){
     //   cerr << "===== " << k << '\n';
        for(int x = 0; x <= n; x++){
            mn[0][x] = INF;
            for(int i = 1; i <= t; i++){
                mn[i][x] = mn[i - 1][x];
                if(dp[i - 1][k - 1] != INF){
                    mn[i][x] = min(mn[i][x], dp[i - 1][k - 1] - x * pref[i - 1]);
                }
                //cerr << i << ' ' << x << ' ' << mn[i][x] << '\n';
            }
        }

        for(int i = 1; i <= t; i++){
            dp[i][k] = INF;
            for(auto& [range, cnt] : intervals[i]){
                if(mn[range.se][cnt] == INF || range.fi > range.se){
                    continue;
                }

                dp[i][k] = min(dp[i][k], pref[i] * cnt + mn[range.se][cnt]);
             //   cerr << i << ' ' << k << ' ' << mn[range.se][cnt] << ' ' << cnt << ' ' << range << '\n';
              //  cerr << dp[i][k] << '\n';
            }
        }
    }

    for(int k = 1; k <= s; k++){
        cout << dp[t][k] << '\n';
    }

    return 0;
}

• Subtask 1: 8 / 8
• Subtask 2: 9 / 9
• Subtask 3: 9 / 9
• Subtask 4: 74 / 74