結果

問題 No.1678 Coin Trade (Multiple)
ユーザー 👑 PCTprobabilityPCTprobability
提出日時 2021-09-10 22:02:24
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,395 ms / 5,000 ms
コード長 7,832 bytes
コンパイル時間 7,810 ms
コンパイル使用メモリ 314,900 KB
実行使用メモリ 15,080 KB
最終ジャッジ日時 2023-09-02 17:40:55
合計ジャッジ時間 27,735 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,372 KB
testcase_01 AC 2 ms
4,372 KB
testcase_02 AC 1 ms
4,368 KB
testcase_03 AC 103 ms
10,292 KB
testcase_04 AC 606 ms
12,972 KB
testcase_05 AC 246 ms
14,492 KB
testcase_06 AC 184 ms
13,940 KB
testcase_07 AC 527 ms
11,116 KB
testcase_08 AC 351 ms
11,652 KB
testcase_09 AC 278 ms
14,664 KB
testcase_10 AC 118 ms
7,244 KB
testcase_11 AC 425 ms
12,748 KB
testcase_12 AC 101 ms
7,396 KB
testcase_13 AC 906 ms
14,296 KB
testcase_14 AC 302 ms
10,192 KB
testcase_15 AC 316 ms
12,468 KB
testcase_16 AC 75 ms
12,440 KB
testcase_17 AC 280 ms
14,764 KB
testcase_18 AC 2 ms
4,368 KB
testcase_19 AC 1 ms
4,368 KB
testcase_20 AC 2 ms
4,372 KB
testcase_21 AC 2 ms
4,368 KB
testcase_22 AC 2 ms
4,372 KB
testcase_23 AC 2 ms
4,368 KB
testcase_24 AC 2 ms
4,372 KB
testcase_25 AC 2 ms
4,368 KB
testcase_26 AC 1 ms
4,368 KB
testcase_27 AC 2 ms
4,368 KB
testcase_28 AC 2 ms
4,368 KB
testcase_29 AC 2 ms
4,368 KB
testcase_30 AC 2 ms
4,372 KB
testcase_31 AC 2 ms
4,372 KB
testcase_32 AC 2 ms
4,372 KB
testcase_33 AC 2 ms
4,368 KB
testcase_34 AC 2 ms
4,372 KB
testcase_35 AC 1 ms
4,368 KB
testcase_36 AC 2 ms
4,368 KB
testcase_37 AC 2 ms
4,368 KB
testcase_38 AC 1 ms
4,368 KB
testcase_39 AC 2 ms
4,372 KB
testcase_40 AC 2 ms
4,372 KB
testcase_41 AC 2 ms
4,372 KB
testcase_42 AC 2 ms
4,368 KB
testcase_43 AC 2 ms
4,372 KB
testcase_44 AC 2 ms
4,368 KB
testcase_45 AC 2 ms
4,368 KB
testcase_46 AC 2 ms
4,368 KB
testcase_47 AC 2 ms
4,368 KB
testcase_48 AC 1,282 ms
15,016 KB
testcase_49 AC 1,208 ms
14,880 KB
testcase_50 AC 1,268 ms
14,948 KB
testcase_51 AC 1,268 ms
14,868 KB
testcase_52 AC 1,355 ms
15,080 KB
testcase_53 AC 1,291 ms
15,016 KB
testcase_54 AC 1,274 ms
15,020 KB
testcase_55 AC 1,395 ms
14,888 KB
testcase_56 AC 1,215 ms
14,948 KB
testcase_57 AC 1,227 ms
14,892 KB
testcase_58 AC 438 ms
12,136 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <unistd.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using ll = long long;
using ld = long double;
using ull = unsigned long long;
#define endl "\n"
typedef pair<int, int> Pii;
#define REP3(i, m, n) for (int i = (m); (i) < int(n); ++ (i))
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define ALL(x) begin(x), end(x)
#define all(s) (s).begin(),(s).end()
//#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
//#define rep(i, n) rep2(i, 0, n)
#define PB push_back 
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)
#define rever(vec) reverse(vec.begin(), vec.end())
#define sor(vec) sort(vec.begin(), vec.end())
//#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define fi first
#define se second
#define pb push_back
#define P pair<ll,ll>
#define NP next_permutation
//const ll mod = 1000000009;
const ll mod = 998244353;
//const ll mod = 1000000007;
const ll inf = 4100000000000000000ll;
const ld eps = ld(0.00000000001);
//static const long double pi = 3.141592653589793;
template<class T>void vcin(vector<T> &n){for(int i=0;i<int(n.size());i++) cin>>n[i];}
template<class T,class K>void vcin(vector<T> &n,vector<K> &m){for(int i=0;i<int(n.size());i++) cin>>n[i]>>m[i];}
template<class T>void vcout(vector<T> &n){for(int i=0;i<int(n.size());i++){cout<<n[i]<<" ";}cout<<endl;}
template<class T>void vcin(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cin>>n[i][j];}}}
template<class T>void vcout(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cout<<n[i][j]<<" ";}cout<<endl;}cout<<endl;}
void yes(bool a){cout<<(a?"yes":"no")<<endl;}
void YES(bool a){cout<<(a?"YES":"NO")<<endl;}
void Yes(bool a){cout<<(a?"Yes":"No")<<endl;}
void possible(bool a){ cout<<(a?"possible":"impossible")<<endl; }
void Possible(bool a){ cout<<(a?"Possible":"Impossible")<<endl; }
void POSSIBLE(bool a){ cout<<(a?"POSSIBLE":"IMPOSSIBLE")<<endl; }
template<class T>auto min(const T& a){ return *min_element(all(a)); }
template<class T>auto max(const T& a){ return *max_element(all(a)); }
template<class T,class F>void print(pair<T,F> a){cout<<a.fi<<" "<<a.se<<endl;}
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0;}
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0;}
template<class T> void ifmin(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}
template<class T> void ifmax(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}
template<typename T,typename ...Args>auto make_vector(T x,int arg,Args ...args){if constexpr(sizeof...(args)==0)return vector<T>(arg,x);else return vector(arg,make_vector<T>(x,args...));}
ll fastgcd(ll u,ll v){ll shl=0;while(u&&v&&u!=v){bool eu=!(u&1);bool ev=!(v&1);if(eu&&ev){++shl;u>>=1;v>>=1;}else if(eu&&!ev){u>>=1;}else if(!eu&&ev){v>>=1;}else if(u>=v){u=(u-v)>>1;}else{ll tmp=u;u=(v-u)>>1;v=tmp;}}return !u?v<<shl:u<<shl;}
ll modPow(ll a, ll n, ll mod) { if(mod==1) return 0;ll ret = 1; ll p = a % mod; while (n) { if (n & 1) ret = ret * p % mod; p = p * p % mod; n >>= 1; } return ret; }
vector<ll> divisor(ll x){ vector<ll> ans; for(ll i = 1; i * i <= x; i++){ if(x % i == 0) {ans.push_back(i); if(i*i!=x){ ans.push_back(x / ans[i]);}}}sor(ans); return ans; }
ll pop(ll x){return __builtin_popcountll(x);}
ll poplong(ll x){ll y=-1;while(x){x/=2;y++;}return y;}
template<class T>
struct Sum{
  vector<T> data;
  Sum(const vector<T>& v):data(v.size()+1){
    for(ll i=0;i<v.size();i++) data[i+1]=data[i]+v[i];
  }
  T get(ll l,ll r) const {
    return data[r]-data[l];
  }
};
template<class T>
struct Sum2{
  vector<vector<T>> data;
  Sum2(const vector<vector<T>> &v):data(v.size()+1,vector<T>(v[0].size()+1)){
    for(int i=0;i<v.size();i++) for(int j=0;j<v[i].size();j++) data[i+1][j+1]=data[i][j+1]+v[i][j];
    for(int i=0;i<v.size();i++) for(int j=0;j<v[i].size();j++) data[i+1][j+1]+=data[i+1][j];
  }
  T get(ll x1,ll y1,ll x2,ll y2) const {
    return data[x2][y2]+data[x1][y1]-data[x1][y2]-data[x2][y1];
  }
};

void cincout(){
  ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
  cout<< fixed << setprecision(10);
}
template<typename CapType, typename CostType> class MinCostFlowDAG {
public:
    using Cat = CapType;
    using Cot = CostType;
    using pti = pair<Cot, int>;
    struct edge {
        int to, rev;
        Cat cap;
        Cot cost;
    };
    const int V;
    const Cot inf;
    vector<vector<edge> > G;
    vector<Cot> h, dist;
    vector<int> deg, ord, prevv, preve;
    MinCostFlowDAG(const int node_size) : V(node_size), inf(numeric_limits<Cot>::max()),
        G(V), h(V, inf), dist(V), deg(V, 0), prevv(V), preve(V){}
    void add_edge(const int from, const int to, const Cat cap, const Cot cost){
        if(cap == 0) return;
        G[from].push_back((edge){to, (int)G[to].size(), cap, cost});
        G[to].push_back((edge){from, (int)G[from].size() - 1, 0, -cost});
        ++deg[to];
    }
    bool tsort(){
        queue<int> que;
        for(int i = 0; i < V; ++i){
            if(deg[i] == 0) que.push(i);
        }
        while(!que.empty()){
            const int p = que.front();
            que.pop();
            ord.push_back(p);
            for(auto& e : G[p]){
                if(e.cap > 0 && --deg[e.to] == 0) que.push(e.to);
            }
        }
        return (*max_element(deg.begin(), deg.end()) == 0);
    }
    void calc_potential(const int s){
        h[s] = 0;
        for(const int v : ord){
            if(h[v] == inf) continue;
            for(const edge& e : G[v]){
                if(e.cap > 0) h[e.to] = min(h[e.to], h[v] + e.cost);
            }
        }
    }
    void Dijkstra(const int s){
        priority_queue<pti,vector<pti>,greater<pti> > que;
        fill(dist.begin(), dist.end(), inf);
        dist[s] = 0;
        que.push(pti(0, s));
        while(!que.empty()){
            pti p = que.top();
            que.pop();
            const int v = p.second;
            if(dist[v] < p.first) continue;
            for(int i = 0; i < (int)G[v].size(); ++i){
                edge& e = G[v][i];
                if(e.cap > 0 && dist[e.to] > dist[v] + e.cost + h[v] - h[e.to]){
                    dist[e.to] = dist[v] + e.cost + h[v] - h[e.to];
                    prevv[e.to] = v, preve[e.to] = i;
                    que.push(pti(dist[e.to], e.to));
                }
            }
        }
    }
    void update(const int s, const int t, Cat& f, Cot& res){
        for(int i = 0; i < V; i++){
            if(dist[i] != inf) h[i] += dist[i];
        }
        Cat d = f;
        for(int v = t; v != s; v = prevv[v]){
            d = min(d, G[prevv[v]][preve[v]].cap);
        }
        f -= d;
        res += h[t] * d;
        for(int v = t; v != s; v = prevv[v]){
            edge& e = G[prevv[v]][preve[v]];
            e.cap -= d;
            G[v][e.rev].cap += d;
        }
    }
    Cot solve(const int s, const int t, Cat f){
        if(!tsort()) assert(false); // not DAG
        calc_potential(s);
        Cot res = 0;
        while(f > 0){
            Dijkstra(s);
            if(dist[t] == inf) return -inf;
            update(s, t, f, res);
        }
        return res;
    }
};
int main() {
  cincout();
  ll n,k;
  cin>>n>>k;
  MinCostFlowDAG<ll,ll> mcf(n);
  vector<ll> now(n);
  for(int i=0;i<n;i++){
    ll x,y;
    cin>>x>>y;
    now[i]=x;
    for(int j=0;j<y;j++){
      ll z;
      cin>>z;
      z--;
      mcf.add_edge(z,i,1,-(now[i]-now[z]));
    }
    if(i) mcf.add_edge(i-1,i,inf,0);
  }
  cout<<-mcf.solve(0,n-1,k)<<endl;
}
0