#698565 (C++14) No.1678 Coin Trade (Multiple)

• 問題: No.1678 Coin Trade (Multiple)
• ユーザー: kiyoshi0205
• 提出日時: 2021-09-10 23:15:07
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 180 ms / 5,000 ms
• コード長: 3,793 bytes
• コンパイル時間: 3,551 ms
• コンパイル使用メモリ: 214,240 KB
• 実行使用メモリ: 17,792 KB
• 最終ジャッジ日時: 2023-09-02 21:32:43
• 合計ジャッジ時間: 8,786 ms
• ジャッジサーバーID （参考情報）: judge15 / judge14

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 4,368 KB
testcase_01	AC	1 ms; 4,372 KB
testcase_02	AC	2 ms; 4,368 KB
testcase_03	AC	28 ms; 9,996 KB
testcase_04	AC	90 ms; 13,852 KB
testcase_05	AC	53 ms; 16,876 KB
testcase_06	AC	46 ms; 15,728 KB
testcase_07	AC	81 ms; 10,712 KB
testcase_08	AC	60 ms; 11,588 KB
testcase_09	AC	59 ms; 16,536 KB
testcase_10	AC	27 ms; 6,592 KB
testcase_11	AC	72 ms; 13,152 KB
testcase_12	AC	24 ms; 6,852 KB
testcase_13	AC	142 ms; 15,760 KB
testcase_14	AC	51 ms; 9,684 KB
testcase_15	AC	61 ms; 12,876 KB
testcase_16	AC	28 ms; 12,760 KB
testcase_17	AC	60 ms; 17,124 KB
testcase_18	AC	2 ms; 4,372 KB
testcase_19	AC	1 ms; 4,372 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,376 KB
testcase_26	AC	2 ms; 4,372 KB
testcase_27	AC	2 ms; 4,372 KB
testcase_28	AC	2 ms; 4,372 KB
testcase_29	AC	2 ms; 4,368 KB
testcase_30	AC	2 ms; 4,368 KB
testcase_31	AC	2 ms; 4,372 KB
testcase_32	AC	1 ms; 4,368 KB
testcase_33	AC	2 ms; 4,372 KB
testcase_34	AC	2 ms; 4,368 KB
testcase_35	AC	2 ms; 4,368 KB
testcase_36	AC	1 ms; 4,372 KB
testcase_37	AC	1 ms; 4,368 KB
testcase_38	AC	2 ms; 4,368 KB
testcase_39	AC	2 ms; 4,372 KB
testcase_40	AC	2 ms; 4,368 KB
testcase_41	AC	2 ms; 4,372 KB
testcase_42	AC	2 ms; 4,368 KB
testcase_43	AC	2 ms; 4,368 KB
testcase_44	AC	2 ms; 4,368 KB
testcase_45	AC	2 ms; 4,372 KB
testcase_46	AC	2 ms; 4,368 KB
testcase_47	AC	1 ms; 4,372 KB
testcase_48	AC	179 ms; 17,064 KB
testcase_49	AC	180 ms; 17,448 KB
testcase_50	AC	168 ms; 17,248 KB
testcase_51	AC	168 ms; 17,208 KB
testcase_52	AC	164 ms; 17,348 KB
testcase_53	AC	171 ms; 17,792 KB
testcase_54	AC	167 ms; 17,116 KB
testcase_55	AC	162 ms; 16,940 KB
testcase_56	AC	162 ms; 17,228 KB
testcase_57	AC	170 ms; 17,504 KB
testcase_58	AC	127 ms; 17,000 KB

コンパイルメッセージ

main.cpp: 関数 ‘int main()’ 内:
main.cpp:114:11: 警告: structured bindings only available with ‘-std=c++17’ or ‘-std=gnu++17’ [-Wc++17-extensions]
  114 |   for(auto[from,to,cap,cost]:edge){
      |           ^

ソースコード

#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
// #include<ext/pb_ds/assoc_container.hpp>
// #include<ext/pb_ds/tree_policy.hpp>
// #include<ext/pb_ds/tag_and_trait.hpp>
// using namespace __gnu_pbds;
// #include<boost/multiprecision/cpp_int.hpp>
// namespace multiprecisioninteger = boost::multiprecision;
// using cint=multiprecisioninteger::cpp_int;
using namespace std;
using ll=long long;
using datas=pair<ll,ll>;
using ddatas=pair<long double,long double>;
using tdata=pair<ll,datas>;
using vec=vector<ll>;
using mat=vector<vec>;
using pvec=vector<datas>;
using pmat=vector<pvec>;
// using llset=tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>;
#define For(i,a,b) for(i=a;i<(ll)b;++i)
#define bFor(i,b,a) for(i=b,--i;i>=(ll)a;--i)
#define rep(i,N) For(i,0,N)
#define rep1(i,N) For(i,1,N)
#define brep(i,N) bFor(i,N,0)
#define brep1(i,N) bFor(i,N,1)
#define all(v) (v).begin(),(v).end()
#define allr(v) (v).rbegin(),(v).rend()
#define vsort(v) sort(all(v))
#define vrsort(v) sort(allr(v))
#define uniq(v) vsort(v),(v).erase(unique(all(v)),(v).end())
#define endl "\n"
#define popcount __builtin_popcountll
#define eb emplace_back
#define print(x) cout<<x<<endl
#define printyes print("Yes")
#define printno print("No")
#define printYES print("YES")
#define printNO print("NO")
#define output(v) do{bool f=0;for(auto outi:v){cout<<(f?" ":"")<<outi;f=1;}cout<<endl;}while(0)
#define matoutput(v) do{for(auto outimat:v)output(outimat);}while(0)
constexpr ll mod=1000000007;
// constexpr ll mod=998244353;
constexpr ll inf=1LL<<60;
constexpr long double eps=1e-9;
const long double PI=acosl(-1);
template<class T,class E> ostream& operator<<(ostream& os,const pair<T,E>& p){return os<<"("<<p.first<<","<<p.second<<")";}
template<class T> ostream& operator<<(ostream& os,const vector<T>& v){
  os<<"{";bool f=false;
  for(auto& x:v){if(f)os<<",";os<<x;f=true;}
  os<<"}";
  return os;
}
template<class T> ostream& operator<<(ostream& os,const set<T>& v){
  os<<"{";bool f=false;
  for(auto& x:v){if(f)os<<",";os<<x;f=true;}
  os<<"}";
  return os;
}
template<class T> ostream& operator<<(ostream& os,const multiset<T>& v){
  os<<"{";bool f=false;
  for(auto& x:v){if(f)os<<",";os<<x;f=true;}
  os<<"}";
  return os;
}
template<class T,class E> ostream& operator<<(ostream& os,const map<T,E>& v){
  os<<"{";bool f=false;
  for(auto& x:v){if(f)os<<",";os<<x;f=true;}
  os<<"}";
  return os;
}
template<class T> inline bool chmax(T& a,const T b){bool x=a<b;if(x)a=b;return x;}
template<class T> inline bool chmin(T& a,const T b){bool x=a>b;if(x)a=b;return x;}
#ifdef DEBUG
void debugg(){cout<<endl;}
template<class T,class... Args>void debugg(const T& x,const Args&... args){cout<<" "<<x;debugg(args...);}
#define debug(...) cout<<__LINE__<<" ["<<#__VA_ARGS__<<"]:",debugg(__VA_ARGS__)
#else
#define debug(...) (void(0))
#endif

inline void startupcpp(void) noexcept{
  cin.tie(0);
  ios::sync_with_stdio(false);
}
#include<atcoder/mincostflow>
int main(){
  startupcpp();
  int N,K;
  cin>>N>>K;
  atcoder::mcf_graph<int,ll> fl(N);
  vector<int> a(N);
  vector<tuple<int,int,int,ll>> edge;
  vec dp(N,0);
  for(int i=0;i<N;++i){
    int M;
    cin>>a[i]>>M;
    while(M--){
      int x;
      cin>>x;
      if(a[--x]>=a[i])continue;
      edge.emplace_back(x,i,1,a[x]-a[i]);
      chmin(dp[i],dp[x]+a[x]-a[i]);
      // fl.add_edge(x,i,1,a[x]-a[i]);
    }
    if(i){
      chmin(dp[i],dp[i-1]);
      edge.emplace_back(i-1,i,K,0);
    }
    // if(i)fl.add_edge(i-1,i,K,0);
  }
  debug(dp);
  for(auto[from,to,cap,cost]:edge){
    debug(from,to,cap,dp[from]-dp[to]+cost);
    fl.add_edge(from,to,cap,dp[from]-dp[to]+cost);
  }
  auto ans=fl.flow(0,N-1,K);
  debug(ans);
  print(-ans.second-dp[N-1]*K);
}