#772076 (C++23(draft)) No.1984 [Cherry 4th Tune *] Dilemma

• 問題: No.1984 [Cherry 4th Tune *] Dilemma
• ユーザー: kiyoshi0205
• 提出日時: 2022-06-17 23:11:06
• 言語: C++23(draft) (gcc 13.2.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 2 ms / 2,000 ms
• コード長: 4,015 bytes
• コンパイル時間: 5,616 ms
• コンパイル使用メモリ: 289,160 KB
• 実行使用メモリ: 4,388 KB
• 最終ジャッジ日時: 2023-08-08 08:20:35
• 合計ジャッジ時間: 13,391 ms
• ジャッジサーバーID （参考情報）: judge15 / judge14

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 4,380 KB
testcase_01	AC	2 ms; 4,376 KB
testcase_02	AC	2 ms; 4,380 KB
testcase_03	AC	2 ms; 4,376 KB
testcase_04	AC	2 ms; 4,384 KB
testcase_05	AC	1 ms; 4,376 KB
testcase_06	AC	1 ms; 4,380 KB
testcase_07	AC	1 ms; 4,376 KB
testcase_08	AC	2 ms; 4,376 KB
testcase_09	AC	2 ms; 4,380 KB
testcase_10	AC	2 ms; 4,384 KB
testcase_11	AC	1 ms; 4,380 KB
testcase_12	AC	1 ms; 4,380 KB
testcase_13	AC	2 ms; 4,380 KB
testcase_14	AC	2 ms; 4,380 KB
testcase_15	AC	1 ms; 4,380 KB
testcase_16	AC	2 ms; 4,380 KB
testcase_17	AC	2 ms; 4,380 KB
testcase_18	AC	2 ms; 4,380 KB
testcase_19	AC	2 ms; 4,380 KB
testcase_20	AC	1 ms; 4,380 KB
testcase_21	AC	2 ms; 4,380 KB
testcase_22	AC	2 ms; 4,376 KB
testcase_23	AC	2 ms; 4,376 KB
testcase_24	AC	2 ms; 4,380 KB
testcase_25	AC	2 ms; 4,380 KB
testcase_26	AC	2 ms; 4,376 KB
testcase_27	AC	2 ms; 4,376 KB
testcase_28	AC	2 ms; 4,380 KB
testcase_29	AC	2 ms; 4,380 KB
testcase_30	AC	2 ms; 4,380 KB
testcase_31	AC	2 ms; 4,380 KB
testcase_32	AC	2 ms; 4,380 KB
testcase_33	AC	2 ms; 4,384 KB
testcase_34	AC	1 ms; 4,376 KB
testcase_35	AC	2 ms; 4,380 KB
testcase_36	AC	2 ms; 4,380 KB
testcase_37	AC	2 ms; 4,376 KB
testcase_38	AC	2 ms; 4,376 KB
testcase_39	AC	2 ms; 4,380 KB
testcase_40	AC	2 ms; 4,380 KB
testcase_41	AC	2 ms; 4,380 KB
testcase_42	AC	2 ms; 4,380 KB
testcase_43	AC	2 ms; 4,376 KB
testcase_44	AC	2 ms; 4,388 KB
testcase_45	AC	2 ms; 4,380 KB
testcase_46	AC	1 ms; 4,380 KB
testcase_47	AC	2 ms; 4,380 KB
testcase_48	AC	2 ms; 4,380 KB
testcase_49	AC	2 ms; 4,380 KB
testcase_50	AC	2 ms; 4,380 KB
testcase_51	AC	2 ms; 4,376 KB
testcase_52	AC	2 ms; 4,384 KB
testcase_53	AC	2 ms; 4,380 KB
testcase_54	AC	2 ms; 4,380 KB
testcase_55	AC	2 ms; 4,376 KB
testcase_56	AC	2 ms; 4,380 KB
testcase_57	AC	2 ms; 4,384 KB
testcase_58	AC	2 ms; 4,380 KB
testcase_59	AC	2 ms; 4,380 KB
testcase_60	AC	2 ms; 4,384 KB
testcase_61	AC	2 ms; 4,380 KB
testcase_62	AC	2 ms; 4,380 KB
testcase_63	AC	2 ms; 4,376 KB
testcase_64	AC	2 ms; 4,380 KB
testcase_65	AC	2 ms; 4,380 KB
testcase_66	AC	1 ms; 4,380 KB
testcase_67	AC	2 ms; 4,376 KB

ソースコード

#ifdef DEBUG
#include"stdlibrary.h"
#else
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
#endif
// #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 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)->sync_with_stdio(0);
}
#include<atcoder/maxflow>

ll ans;
int main(){
  startupcpp();
  int i,N,M,K,P;
  cin>>N>>M>>K>>P;
  atcoder::mf_graph<ll> g(N+M+K+2);
  rep(i,N){
    int E;
    cin>>E;
    ans+=E;
    g.add_edge(i,N+M+K+1,E);
  }
  rep(i,M){
    int F;
    cin>>F;
    ans+=F;
    g.add_edge(N+M+K,N+i,F);
  }
  rep(i,K){
    int V;
    cin>>V;
    g.add_edge(N+M+K,i+N+M,V);
  }
  rep(i,N){
    int L;
    cin>>L;
    while(L--){
      int j;
      cin>>j;
      --j;
      g.add_edge(j+N+M,i,inf);
    }
  }
  while(P--){
    int I,J;
    cin>>I>>J;
    --I;--J;
    g.add_edge(J+N,I,inf);
  }
  print(ans-g.flow(N+M+K,N+M+K+1));
  auto v=g.min_cut(N+M+K);
  ll cnt=0;
  string p;
  rep(i,K){
    if(!v[i+N+M]){
      ++cnt;
      p+="Preparation "+to_string(i+1)+'\n';
    }
  }
  rep(i,N){
    if(!v[i]){
      ++cnt;
      p+="Goal "+to_string(i+1)+'\n';
    }
  }
  rep(i,M){
    if(v[i+N]){
      ++cnt;
      p+="Action "+to_string(i+1)+'\n';
    }
  }
  print(cnt);
  cout<<p;
}