結果

問題 No.1288 yuki collection
ユーザー tokusakuraitokusakurai
提出日時 2020-11-14 09:45:13
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 182 ms / 5,000 ms
コード長 6,939 bytes
コンパイル時間 2,733 ms
コンパイル使用メモリ 222,736 KB
実行使用メモリ 5,376 KB
最終ジャッジ日時 2024-07-22 22:43:21
合計ジャッジ時間 6,789 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 2 ms
5,376 KB
testcase_04 AC 2 ms
5,376 KB
testcase_05 AC 2 ms
5,376 KB
testcase_06 AC 2 ms
5,376 KB
testcase_07 AC 2 ms
5,376 KB
testcase_08 AC 2 ms
5,376 KB
testcase_09 AC 2 ms
5,376 KB
testcase_10 AC 2 ms
5,376 KB
testcase_11 AC 3 ms
5,376 KB
testcase_12 AC 2 ms
5,376 KB
testcase_13 AC 141 ms
5,376 KB
testcase_14 AC 140 ms
5,376 KB
testcase_15 AC 112 ms
5,376 KB
testcase_16 AC 111 ms
5,376 KB
testcase_17 AC 141 ms
5,376 KB
testcase_18 AC 143 ms
5,376 KB
testcase_19 AC 146 ms
5,376 KB
testcase_20 AC 141 ms
5,376 KB
testcase_21 AC 130 ms
5,376 KB
testcase_22 AC 131 ms
5,376 KB
testcase_23 AC 131 ms
5,376 KB
testcase_24 AC 146 ms
5,376 KB
testcase_25 AC 144 ms
5,376 KB
testcase_26 AC 143 ms
5,376 KB
testcase_27 AC 71 ms
5,376 KB
testcase_28 AC 77 ms
5,376 KB
testcase_29 AC 60 ms
5,376 KB
testcase_30 AC 6 ms
5,376 KB
testcase_31 AC 8 ms
5,376 KB
testcase_32 AC 9 ms
5,376 KB
testcase_33 AC 118 ms
5,376 KB
testcase_34 AC 171 ms
5,376 KB
testcase_35 AC 159 ms
5,376 KB
testcase_36 AC 182 ms
5,376 KB
testcase_37 AC 172 ms
5,376 KB
testcase_38 AC 47 ms
5,376 KB
testcase_39 AC 46 ms
5,376 KB
testcase_40 AC 3 ms
5,376 KB
testcase_41 AC 2 ms
5,376 KB
testcase_42 AC 2 ms
5,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define each(e, v) for(auto &e: v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
#define pq(type, name) priority_queue<type> name
#define iq(type, name) priority_queue<type, vector<type>, greater<type>> name
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
const double pi = acos(-1.0);
const double EPS = 1e-10;
template<typename T> bool chmax(T &x, const T &y){
    if(x < y) {x = y; return true;}
    return false;
}
template<typename T> bool chmin(T &x, const T &y){
    if(x > y) {x = y; return true;}
    return false;
}
void in() {}
template<typename Head, typename ...Tail> void in(Head &&head, Tail &&...tail){
    cin >> head;
    in(forward<Tail>(tail)...);
}
void out() {cout << '\n';}
template<typename Head, typename ...Tail> void out(Head &&head, Tail &&...tail){
    cout << head << ' ';
    out(forward<Tail>(tail)...);
}
void outn() {}
template<typename Head, typename ...Tail> void outn(Head &&head, Tail &&...tail){
    cout << head << '\n';
    outn(forward<Tail>(tail)...);
}
template<typename T, typename U> void in(pair<T, U> &p){
    cin >> p.first >> p.second;
}
template<typename T, typename U> void out(pair<T, U> p){
    cout << p.first << ' ' << p.second << '\n';
}
using vi = vector<int>;
using vll = vector<ll>;
#define vec1(type, name, ...) vector<type> name(__VA_ARGS__)
#define VEC1(type, ...) vector<type>(__VA_ARGS__)
#define vec2(type, name, a, ...) vector<vector<type>> name(a, VEC1(type, __VA_ARGS__))
#define VEC2(type, a, ...) vector<vector<type>>(a, VEC1(type, __VA_ARGS__))
#define vec3(type, name, a, b, ...) vector<vector<vector<type>>> name(a, VEC2(type, b, __VA_ARGS__))
#define VEC3(type, a, b, ...) vector<vector<vector<type>>>(a, VEC2(type, b, __VA_ARGS__))
#define vec4(type, name, a, b, c, ...) vector<vector<vector<vector<type>>>> name(a, VEC3(type, b, c, __VA_ARGS__))
#define VEC4(type, a, b, c, ...) vector<vector<vector<vector<type>>>>(a, VEC3(type, b, c, __VA_ARGS__))
#define vec5(type, name, a, b, c, d, ...) vector<vector<vector<vector<vector<type>>>>> name(a, VEC4(type, b, c, d, __VA_ARGS__))
#define VEC5(type, a, b, c, d, ...) vector<vector<vector<vector<vector<type>>>>>(a, VEC4(type, b, c, d, __VA_ARGS__))
template<typename T> void vin(vector<T> &a){
    rep(i, sz(a)) cin >> a[i];
}
template<typename T> void vout(const vector<T> &a){
    for(auto &e: a) cout << e << ' ';
    cout << '\n';
}
template<typename T> void voutn(const vector<T> &a){
    for(auto &e: a) cout << e << '\n';
}
template<typename T> void unique(vector<T> &a){
    sort(all(a)), a.erase(unique(all(a)), a.end());
}
vector<int> iota(int n){
    vector<int> ret(n);
    iota(all(ret), 0);
    return ret;
}
template<typename T> vector<int> iota(const vector<T> &a, bool greater = false){
    vector<int> ret = iota(sz(a));
    sort(all(ret), [&](int i, int j){
        return (a[i] < a[j])^greater;
    });
    return ret;
}
struct io_setup{
    io_setup(){
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout << fixed << setprecision(15);
    }
} io_setup;
#define VEC(type, name, n) vector<type> name(n); vin(name)
#define INT(...) int __VA_ARGS__; in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__; in(__VA_ARGS__)
#define CHAR(...) char __VA_ARGS__; in(__VA_ARGS__)
#define STR(...) string __VA_ARGS__; in(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__; in(__VA_ARGS__)
const int MOD = 1000000007;
//const int MOD = 998244353;

template<typename T>
struct Min_Cost_Flow{
    struct edge{
        int to; T cap, cost; int rev;
        edge(int to, T cap, T cost, int rev) : to(to), cap(cap), cost(cost), rev(rev) {}
    };

    vector<vector<edge>> es;
    vector<T> d, h;
    vector<int> pre_v, pre_e;
    const T INF_T;
    const int n;

    Min_Cost_Flow(int n) : INF_T(numeric_limits<T>::max()), n(n){
        es.resize(n), d.resize(n), h.resize(n), pre_v.resize(n), pre_e.resize(n);
    }

    void add_edge(int from, int to, T cap, T cost){
        es[from].eb(to, cap, cost, sz(es[to]));
        es[to].eb(from, 0, -cost, sz(es[from])-1);
    }

    void bellman_ford(int s){
        fill(all(h), INF_T);
        h[s] = 0;
        while(true){
            bool update = false;
            rep(i, n){
                if(h[i] == INF_T) continue;
                for(auto &e: es[i]){
                    if(e.cap > 0 && chmin(h[e.to], h[i]+e.cost)){
                        update = true;
                    }
                }
            }
            if(!update) break;
        }
    }

    void dijkstra(int s){
        fill(all(d), INF_T);
        using P = pair<T, int>;
        priority_queue<P, vector<P>, greater<P> > que;
        que.emplace(d[s] = 0, s);
        while(!que.empty()){
            T p; int i;
            tie(p, i) = que.top(); que.pop();
            if(p > d[i]) continue;
            rep(j, sz(es[i])){
                edge &e = es[i][j];
                if(e.cap > 0 && chmin(d[e.to], d[i]+e.cost+h[i]-h[e.to])){
                    pre_v[e.to] = i, pre_e[e.to] = j;
                    que.emplace(d[e.to], e.to);
                }
            }
        }
    }

    T min_cost_flow(int s, int t, T flow){
        T ret = 0;
        bellman_ford(s);
        while(flow > 0){
            dijkstra(s);
            if(d[t] == INF_T) return -1;
            rep(i, sz(es)){
                if(h[i] == INF_T || d[i] == INF_T) h[i] = INF_T;
                else h[i] += d[i];
            }
            T f = flow;
            for(int now = t; now != s; now = pre_v[now]){
                chmin(f, es[pre_v[now]][pre_e[now]].cap);
            }
            ret += f*h[t], flow -= f;
            for(int now = t; now != s; now = pre_v[now]){
                edge &e = es[pre_v[now]][pre_e[now]];
                e.cap -= f, es[now][e.rev].cap += f;
            }
        }
        return ret;
    }
};

int main(){
    INT(N); STR(S);
    VEC(ll, V, N);
    Min_Cost_Flow<ll> G(N+2);
    int s = N, t = N+1;
    G.add_edge(s, t, 2000, 0);
    vi id[26];
    rep(i, N){
        if(S[i] == 'y') G.add_edge(s, i, INF, 0);
        if(S[i] == 'i') G.add_edge(i, t, 1, -V[i]);
        id[S[i]-'a'].eb(i);
    }
    rep(i, 26){
        rep(j, sz(id[i])-1){
            G.add_edge(id[i][j], id[i][j+1], INF, 0);
        }
    }
    string T = "yuki";
    rep(i, 3){
        each(e, id[T[i]-'a']){
            if(id[T[i+1]-'a'].empty() || e > id[T[i+1]-'a'].back()) break;
            int u = *upper_bound(all(id[T[i+1]-'a']), e);
            G.add_edge(e, u, 1, -V[e]);
        }
    }
    out(-G.min_cost_flow(s, t, 2000));
}
0