#771864 (C++17) No.1984 [Cherry 4th Tune *] Dilemma

提出ソース

結果

問題	No.1984 [Cherry 4th Tune *] Dilemma
ユーザー	heno239
提出日時	2022-06-17 22:13:04
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	13 ms / 2,000 ms
コード長	7,828 bytes
コンパイル時間	2,762 ms
コンパイル使用メモリ	167,960 KB
実行使用メモリ	12,160 KB
最終ジャッジ日時	2024-11-08 14:00:20
合計ジャッジ時間	8,949 ms
ジャッジサーバーID （参考情報）	judge1 / judge4

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

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

権限があれば一括ダウンロードができます

ソースコード

raw source code

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
#include<chrono>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 998244353;
//constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;

#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;

template<typename T>
void chmin(T& a, T b) {
	a = min(a, b);
}
template<typename T>
void chmax(T& a, T b) {
	a = max(a, b);
}
template<typename T>
void cinarray(vector<T>& v) {
	rep(i, v.size())cin >> v[i];
}
template<typename T>
void coutarray(vector<T>& v) {
	rep(i, v.size()) {
		if (i > 0)cout << " "; cout << v[i];
	}
	cout << "\n";
}
ll mod_pow(ll x, ll n, ll m = mod) {
	if (n < 0) {
		ll res = mod_pow(x, -n, m);
		return mod_pow(res, m - 2, m);
	}
	if (abs(x) >= m)x %= m;
	if (x < 0)x += m;
	//if (x == 0)return 0;
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
struct modint {
	int n;
	modint() :n(0) { ; }
	modint(ll m) {
		if (m < 0 || mod <= m) {
			m %= mod; if (m < 0)m += mod;
		}
		n = m;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
bool operator<(modint a, modint b) { return a.n < b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 20;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}
modint combP(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[a - b];
}

ll gcd(ll a, ll b) {
	a = abs(a); b = abs(b);
	if (a < b)swap(a, b);
	while (b) {
		ll r = a % b; a = b; b = r;
	}
	return a;
}
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-8;
const ld pi = acosl(-1.0);
template<typename T>
void addv(vector<T>& v, int loc, T val) {
	if (loc >= v.size())v.resize(loc + 1, 0);
	v[loc] += val;
}
/*const int mn = 100005;
bool isp[mn];
vector<int> ps;
void init() {
	fill(isp + 2, isp + mn, true);
	for (int i = 2; i < mn; i++) {
		if (!isp[i])continue;
		ps.push_back(i);
		for (int j = 2 * i; j < mn; j += i) {
			isp[j] = false;
		}
	}
}*/

//[,val)
template<typename T>
auto prev_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	if (res == st.begin())return st.end();
	res--; return res;
}

//[val,)
template<typename T>
auto next_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	return res;
}
using mP = pair<modint, modint>;
mP operator+(mP a, mP b) {
	return { a.first + b.first,a.second + b.second };
}
mP operator+=(mP& a, mP b) {
	a = a + b; return a;
}
mP operator-(mP a, mP b) {
	return { a.first - b.first,a.second - b.second };
}
mP operator-=(mP& a, mP b) {
	a = a - b; return a;
}

mt19937 mt(time(0));

const string drul = "DRUL";
string senw = "SENW";
//DRUL,or SENW
int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };
//-----------------------------------------

struct edge { int to; ll cap; int rev; };
struct Dinic {
//private:
	int n;
	vector<vector<edge>> v;
	vector<int> dist, iter;
//public:
	Dinic(int sz) :n(sz), v(sz), dist(sz), iter(sz) {}

	void addedge(int from, int to, ll cap) {
		int x = v[to].size(), y = v[from].size();
		v[from].push_back({ to,cap,x });
		v[to].push_back({ from,0,y });
	}

	void bfs(int s) {
		fill(dist.begin(), dist.end(), -1);
		queue<int> q;
		dist[s] = 0;
		q.push(s);
		while (q.size()) {
			int x = q.front(); q.pop();
			rep(i, v[x].size()) {
				edge& e = v[x][i];
				if (e.cap > 0 && dist[e.to] < 0) {
					dist[e.to] = dist[x] + 1;
					q.push(e.to);
				}
			}
		}
	}

	ll dfs(int x, int t, ll f) {
		if (x == t)return f;
		for (int& i = iter[x]; i < (int)v[x].size(); ++i) {
			edge& e = v[x][i];
			if (e.cap > 0 && dist[x] < dist[e.to]) {
				ll d = dfs(e.to, t, min(f, e.cap));
				if (d > 0) {
					e.cap -= d;
					v[e.to][e.rev].cap += d;
					return d;
				}
			}
		}
		return 0;
	}

	ll max_flow(int s, int t) {
		ll flow = 0;
		while (1) {
			bfs(s);
			if (dist[t] < 0)return flow;
			fill(iter.begin(), iter.end(), 0);
			ll f;
			while ((f = dfs(s, t, 1LL << 62)) > 0)flow += f;
		}
	}
};
void solve() {
	int n, m, k, p; cin >> n >> m >> k >> p;
	vector<int> e(n); rep(i, n)cin >> e[i];
	vector<int> f(m); rep(i, m)cin >> f[i];
	vector<int> v(k); rep(i, k)cin >> v[i];
	int sta = n + m + k;
	int goa = sta + 1;
	Dinic dc(goa + 1);
	ll sum = 0;
	rep(i, n) {
		sum += e[i];
		dc.addedge(i, goa, e[i]);
	}
	rep(i, m) {
		sum += f[i];
		dc.addedge(sta, i + n, f[i]);
	}
	rep(i, k) {
		dc.addedge(sta, n + m + i, v[i]);
	}
	rep(i, n) {
		int len; cin >> len;
		rep(j, len) {
			int a; cin >> a; a--;
			dc.addedge(a + n + m, i, INF);
		}
	}
	rep(i, p) {
		int x, y; cin >> x >> y; x--; y--;
		dc.addedge(y + n, x, INF);
	}
	sum -= dc.max_flow(sta, goa);
	cout << sum << "\n";
	vector<bool> isleft(goa + 1);
	queue<int> q;
	q.push(sta);
	isleft[sta] = true;
	while (!q.empty()) {
		int id = q.front(); q.pop();
		for (edge e : dc.v[id]) {
			if (e.cap > 0) {
				if (!isleft[e.to]) {
					isleft[e.to] = true;
					q.push(e.to);
				}
			}
		}
	}
	vector<int> res;
	rep(i, k) {
		if (!isleft[i + n + m]) {
			res.push_back(i + n + m);
		}
		/*for (edge e : dc.v[i+n+m]) {
			if (e.cap > 0 && e.to == sta) {
				res.push_back(i + n + m);
			}
		}*/
	}
	rep(i, m) {
		if (isleft[i + n]) {
			res.push_back(i + n);
		}
		/*for (edge e : dc.v[i + n]) {
			if (e.to == sta) {
				cout << "?? " << e.cap << "\n";
			}
			if (e.cap == 0 && e.to == sta) {
				res.push_back(i + n);
			}
		}*/
	}
	rep(i, n) {
		if (!isleft[i]) {
			res.push_back(i);
		}
		/*for (edge e : dc.v[i]) {
			if (e.cap > 0 && e.to == goa) {
				res.push_back(i);
			}
		}*/
	}
	cout << res.size() << "\n";
	for (int id : res) {
		if (id >= n + m) {
			cout << "Preparation " << id - (n + m) + 1 << "\n";
		}
		else if (id >= n) {
			cout << "Action " << id - n + 1 << "\n";
		}
		else {
			cout << "Goal " << id + 1 << "\n";
		}
	}
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//init_f();
	//init();
	//while(true)
	//expr();
	//int t; cin >> t; rep(i, t)
	solve();
	return 0;
}

yukicoder

結果

テストケース

ソースコード