結果
| 問題 |
No.1984 [Cherry 4th Tune *] Dilemma
|
| コンテスト | |
| ユーザー |
 xyz2606
|
| 提出日時 | 2022-06-17 22:49:34 |
| 言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 3 ms / 2,000 ms |
| コード長 | 6,351 bytes |
| コンパイル時間 | 2,301 ms |
| コンパイル使用メモリ | 148,808 KB |
| 実行使用メモリ | 5,248 KB |
| 最終ジャッジ日時 | 2024-11-08 14:03:43 |
| 合計ジャッジ時間 | 7,396 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 68 |
ソースコード
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<string>
#include<algorithm>
#include<iostream>
#include<bitset>
#include<functional>
#include<chrono>
#include<numeric>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cassert>
#include<cmath>
#include<iomanip>
#include<random>
#include<ctime>
#include<complex>
#include<type_traits>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long LL;
typedef double D;
#define all(v) (v).begin(), (v).end()
mt19937 gene(chrono::system_clock::now().time_since_epoch().count());
typedef complex<double> Complex;
#define fi first
#define se second
#define ins insert
#define pb push_back
inline char GET_CHAR(){
const int maxn = 131072;
static char buf[maxn],*p1=buf,*p2=buf;
return p1==p2&&(p2=(p1=buf)+fread(buf,1,maxn,stdin),p1==p2)?EOF:*p1++;
}
inline int getInt() {
int res(0);
char c = getchar();
while(c < '0') c = getchar();
while(c >= '0') {
res = res * 10 + (c - '0');
c = getchar();
}
return res;
}
inline LL fastpo(LL x, LL n, LL mod) {
LL res(1);
while(n) {
if(n & 1) {
res = res * (LL)x % mod;
}
x = x * (LL) x % mod;
n /= 2;
}
return res;
}
template<LL mod> struct Num {
LL a;
Num operator + (const Num & b) { return Num{(a + b.a) % mod}; }
Num operator - (const Num & b) { return Num{(a - b.a + mod) % mod}; }
Num operator * (const Num & b) { return Num{a * b.a % mod}; }
Num operator / (const Num & b) { return Num{a * fastpo(b.a, mod - 2, mod) % mod}; }
void operator += (const Num & b) {if((a += b.a) >= mod) a -= mod;}
void operator -= (const Num & b) {if((a -= b.a) < 0) a += mod;}
void operator *= (const Num & b) { a = a * b.a % mod; }
void operator /= (const Num & b) { a = a * fastpo(b.a, mod - 2, mod) % mod; }
void operator = (const Num & b) { a = b.a; }
void operator = (const LL & b) { a = b; }
};
template<LL mod> ostream & operator << (ostream & os, const Num<mod> & a) {
os << a.a;
return os;
}
LL gcd(LL a, LL b) { return b ? gcd(b, a % b) : a; }
inline string itoa(LL x, int width = 0) {
string res;
if(x == 0) res.push_back('0');
while(x) {
res.push_back('0' + x % 10);
x /= 10;
}
while((int)res.size() < width) res.push_back('0');
reverse(res.begin(), res.end());
return res;
}
const int _B = 131072;
char buf[_B];
int _bl = 0;
inline void flush() {
fwrite(buf, 1, _bl, stdout);
_bl = 0;
}
__inline void _putchar(char c) {
if(_bl == _B) flush();
buf[_bl++] = c;
}
inline void print(LL x, char c) {
static char tmp[20];
int l = 0;
if(!x) tmp[l++] = '0';
else {
while(x) {
tmp[l++] = x % 10 + '0';
x /= 10;
}
}
for(int i = l - 1; i >= 0; i--) _putchar(tmp[i]);
_putchar(c);
}
typedef double C;
struct P {
C x, y;
void scan() {
double _x, _y;
scanf("%lf%lf", &_x, &_y);
x = _x; y = _y;
}
void print() {
cout << '(' << x << ' ' << y << ')' << endl;
}
P operator + (const P & b) const { return P{x + b.x, y + b.y}; }
P operator - (const P & b) const { return P{x - b.x, y - b.y}; }
C operator * (const P & b) const { return x * b.y - y * b.x; }
C operator % (const P & b) const { return x * b.x + y * b.y; }
};
P operator * (const C & x, const P & b) { return P{x * b.x, x * b.y}; }
const int N = 300033;
const int LOG = 20;
const int mod = 1e9 + 7;
const int inf = 1e9 + 7;
int n, m;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int rela[N];
int getr(int x) {
int p = x;
while(rela[p] != p) p = rela[p];
int p1 = p; p = x;
while(rela[p] != p) {
int p2 = rela[p];
rela[p] = p1;
p = p2;
}
return p1;
}
struct E {
int y, next;
LL f;
} e[N];
int idx[N], dis[N], l;
void build(int x, int y, LL z) {
e[++l].y = y;
e[l].f = z;
e[l].next = idx[x];
idx[x] = l;
}
void cnnt(int x, int y, LL z) {
//cout << x << ' ' << y << ' ' << z << endl;
build(x, y, z);
build(y, x, 0);
}
int S, T;
int cur[N];
bool bfs() {
fill(dis + 1, dis + T + 1, -1);
dis[S] = 0;
vector<int> q;
q.pb(S);
//cout << "??" << endl;
for(int op = 0; op < (int)q.size(); op++) {
int v = q[op];
for(int p = idx[v]; p; p = e[p].next) {
int y = e[p].y;
if(dis[y] == -1 && e[p].f) {
dis[y] = dis[v] + 1;
q.pb(y);
}
}
}
for(int i = 1; i <= T; i++) cur[i] = idx[i];
//cout << dis[T] << endl;
return dis[T] != -1;
}
LL dfs(int v, LL flow) {
if(v == T) return flow;
LL flow1 = flow;
for(int & p = cur[v]; p; p = e[p].next) {
int y = e[p].y;
if(dis[v] + 1 == dis[y] && e[p].f) {
LL flow2 = dfs(y, min(flow1, e[p].f));
//cout << v << ' ' << y << ' ' << flow2 << endl;
flow1 -= flow2;
e[p].f -= flow2;
e[p ^ 1].f += flow2;
}
if(flow1 == 0) break;
}
//cout << v << ' ' << flow - flow1 << endl;
return flow - flow1;
}
bool vst[N];
void dd(int v) {
vst[v] = true;
for(int p = idx[v]; p; p = e[p].next) {
if(e[p].f != 0 && !vst[e[p].y]) {
dd(e[p].y);
}
}
}
int main() {
int n, m, k, p;
scanf("%d%d%d%d", &n, &m, &k, &p);
LL ans = 0;
l = 1;
S = n + m + k + 1;
T = S + 1;
for(int i = 1; i <= n; i++) {
int x;
scanf("%d", &x);
ans += x;
cnnt(i, T, x);
}
for(int i = 1; i <= m; i++) {
int x;
scanf("%d", &x);
cnnt(S, i + n, x);
ans += x;
}
//cout << ans << endl;
for(int i = 1; i <= k; i++) {
int x;
scanf("%d", &x);
cnnt(S, i + n + m, x);
}
for(int i = 1; i <= n; i++) {
int x;
scanf("%d", &x);
for(int j = 0; j < x; j++) {
int y;
scanf("%d", &y);
cnnt(y + n + m, i, (LL)inf * inf);
}
}
for(int i = 1; i <= p; i++) {
int x, y;
scanf("%d%d", &x, &y);
cnnt(y + n,x, (LL)inf * inf);
}
//cout << ans << endl;
while(bfs()) {
ans -= dfs(S, (LL)inf * inf);
}
cout << ans << endl;
fill(vst + 1, vst + 1 + n, false);
dd(S);
int cnt = 0;
for(int i = 1; i <= n + m + k; i++) {
if(i > n + m) cnt += !vst[i];
else if(i > n) cnt += vst[i];
else cnt += !vst[i];
}
cout << cnt << endl;
for(int i = 1; i <= k; i++) {
if(!vst[i + n + m]) {
printf("Preparation %d\n", i);
}
}
for(int i = 1; i <= m; i++) {
if(vst[i + n]) printf("Action %d\n", i);
}
for(int i = 1; i <= n; i++) if(!vst[i]) printf("Goal %d\n", i);
}