結果
| 問題 |
No.3201 Corporate Synergy
|
| ユーザー |
 coindarw
|
| 提出日時 | 2025-07-11 22:18:22 |
| 言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 3 ms / 2,000 ms |
| コード長 | 10,450 bytes |
| コンパイル時間 | 6,099 ms |
| コンパイル使用メモリ | 335,696 KB |
| 実行使用メモリ | 7,844 KB |
| 最終ジャッジ日時 | 2025-07-11 22:18:29 |
| 合計ジャッジ時間 | 7,058 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 20 |
ソースコード
#ifdef ONLINE_JUDGE
#include <bits/stdc++.h>
#include <atcoder/all>
#else
#include <mylibs/all.h>
#endif
using ll = long long;
using lll = __int128_t;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; --i)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define repc2(i, s, n) for (int i = (s); i <= (int)(n); i++)
#define length(v) ((int)(v).size())
constexpr int inf = 2'000'000'000;
constexpr ll linf = 4'000'000'000'000'000'000, M7 = 1'000'000'007, M9 = 998'244'353;
#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)
using namespace std;
using namespace atcoder;
// clang-format off
using vint = vector<int>;using vvint = vector<vector<int>>;using vvvint = vector<vector<vector<int>>>;
using vll = vector<ll>;using vvll = vector<vector<ll>>;using vvvll = vector<vector<vector<ll>>>;
using vlll = vector<lll>;using vvlll = vector<vector<lll>>;using vvvlll = vector<vector<vector<lll>>>;
using vchar = vector<char>;using vvchar = vector<vector<char>>;using vvvchar = vector<vector<vector<char>>>;
using vstr = vector<string>;using vvstr = vector<vector<string>>;using vvvstr = vector<vector<vector<string>>>;
using vpi = vector<pair<int, int>>;using vvpi = vector<vector<pair<int, int>>>;using vvpint = vector<vector<pair<int, int>>>;
using vpl = vector<pair<ll, ll>>;using vvpl = vector<vector<pair<ll, ll>>>;using vvplint = vector<vector<pair<ll, int>>>;
using vbool = vector<bool>;using vvbool = vector<vector<bool>>;using vvvbool = vector<vector<vector<bool>>>;
#define Vec(type, ...) __make_vec<type>(__VA_ARGS__)
template <class T> vector<T> __make_vec(size_t a) {return vector<T>(a);}template <class T, class... Ts>
auto __make_vec(size_t a, Ts... ts) {return vector<decltype(__make_vec<T>(ts...))>(a, __make_vec<T>(ts...));}
#define VecI(init, type, ...) __make_vecI<type, init>(__VA_ARGS__)
template <class T, T init>vector<T> __make_vecI(size_t a) {return vector<T>(a, init);}
template <class T, T init, class... Ts>
auto __make_vecI(size_t a, Ts... ts) {return vector<decltype(__make_vecI<T, init>(ts...))>(a, __make_vecI<T, init>(ts...));}
template <typename T, typename U>inline ostream& operator<<(ostream& os, const pair<T, U>& p) noexcept {return os << p.first << " " << p.second;}
inline ostream& operator<<(ostream& os, const modint& m) noexcept { return os << m.val(); }
template <int M>inline ostream& operator<<(ostream& os, const static_modint<M>& m) noexcept { return os << m.val(); }
template <typename T> struct is_static_modint : std::false_type {}; template <int MOD> struct is_static_modint<static_modint<MOD>> : std::true_type {};
template <template <typename...> typename C, typename Number>concept MyContainer = std::is_same_v<C<Number>, std::vector<Number>> || std::is_same_v<C<Number>, std::deque<Number>> || std::is_same_v<C<Number>, std::set<Number>> || std::is_same_v<C<Number>, std::unordered_set<Number>> || std::is_same_v<C<Number>, std::unordered_multiset<Number>> || std::is_same_v<C<Number>, std::multiset<Number>>;
template <typename Number>concept MyNumber = std::is_same_v<Number, int> || std::is_same_v<Number, ll> || std::is_same_v<Number, char> || std::is_same_v<Number, modint> || is_static_modint<Number>::value;
template <template <typename...> typename C, typename Number>concept MyContainerNumber = MyContainer<C, Number> && MyNumber<Number>;
template <template <typename...> typename OutCon, template <typename...> typename InCon, typename Number>concept MyNestedContainerNumber = MyContainer<OutCon, InCon<Number>> && MyContainerNumber<InCon, Number>;
template <template <typename...> typename C, typename Number>requires MyContainerNumber<C, Number>std::ostream& operator<<(std::ostream& os, const C<Number>& t) {auto itr = t.begin();auto end = t.end();if (itr != end) {os << *itr++;for (; itr != end; ++itr) os << ' ' << *itr;}return os;}
template <template <typename...> typename OutCon, template <typename...> typename InCon, typename Number>requires MyNestedContainerNumber<OutCon, InCon, Number>std::ostream& operator<<(std::ostream& os, const OutCon<InCon<Number>>& t) {auto itr = t.begin();auto end = t.end();if (itr != end) {os << *itr++;for (; itr != end; ++itr) os << '\n' << *itr;}return os;}
template <typename T, typename U>istream& operator>>(istream& is, pair<T, U>& p) {return is >> p.first >> p.second;}
template <typename T>istream& operator>>(istream& is, vector<T>& v) {for (auto& e : v) is >> e;return is;}
void inp() {}
template <typename T, typename... Args>void inp(T& a, Args&... args) {cin >> a, inp(args...);}
template <typename T>void inp1(vector<T>& v, int offset = 1, int len = -1) {if (len == -1) len = int(v.size()) - offset;assert(offset >= 0 && len >= 0);for (int i = offset; i < offset + len; ++i) cin >> v[i];}
template <typename T>void oup(const T& a) {cout << a << "\n";}
template <typename T, typename... Args>void oup(const T& a, const Args&... args) {cout << a << " ", oup(args...);}
inline string YesNo(bool cond) { return cond ? "Yes" : "No"; }
inline auto add1(auto vec, ll offset = 1) {for (auto& e : vec) e += offset;return vec;}
#ifdef ONLINE_JUDGE
#define debug(...)
#else
#define debug(...) cerr << "<" << #__VA_ARGS__ << ">: ", debug_out(__VA_ARGS__)
template <typename T>void debug_out(T t) {cerr << t << "\n";}
template <typename T, typename... Args>void debug_out(T t, Args... args) {cerr << t << ", ";debug_out(args...);}
#endif
#ifdef ONLINE_JUDGE
#define todo(...) static_assert(false)
#else
#define todo(...)
#endif
// clang-format on
template <typename Cap>
class max_flow {
private:
int V;
std::vector<std::pair<int, int>> pos;
struct _edge {
int to;
Cap cap;
int rev;
Cap flow;
_edge(int _to, Cap _cap, int _rev) : to(_to), cap(_cap), rev(_rev), flow(Cap(0)) {}
};
void bfs(int s, int t) {
std::fill(level.begin(), level.end(), -1);
level[s] = 0;
std::queue<int> q;
q.push(s);
while (!q.empty()) {
int v = q.front();
q.pop();
for (int i = 0; i < int(G[v].size()); ++i) {
const _edge& e = G[v][i];
if (e.cap > 0 && level[e.to] == -1) {
level[e.to] = level[v] + 1;
q.push(e.to);
if (e.to == t) return; // tに辿り着いた時点で探索終了
}
}
}
}
Cap dfs(int v, int s, Cap f) { // tからsに逆順にDFS
if (v == s) return f;
Cap res = 0;
for (int& i = iter[v]; i < int(G[v].size()); ++i) {
_edge &e = G[v][i], &re = G[e.to][e.rev];
if (re.cap > Cap(0) && level[v] > level[e.to]) {
Cap d = dfs(e.to, s, std::min(f - res, re.cap));
if (d > 0) {
e.cap += d;
re.cap -= d;
res += d;
if (res == f) return res;
}
}
}
level[v] = V;
return res;
}
std::vector<std::vector<_edge>> G;
std::vector<int> iter, level;
public:
struct edge {
int from, to;
Cap cap, flow;
};
edge get_edge(int i) {
int m = int(pos.size());
assert(0 <= i && i < m);
_edge _e = G[pos[i].first][pos[i].second];
_edge _re = G[_e.to][_e.rev];
return edge(pos[i].first, _e.to, _e.cap + _re.cap, _re.cap);
}
std::vector<edge> edges() {
int m = int(pos.size());
std::vector<edge> res;
for (int i = 0; i < m; ++i) {
res.push_back(get_edge(i));
}
return res;
}
max_flow(int v) : V(v) {
G = std::vector<std::vector<_edge>>(v);
iter = std::vector<int>(v);
level = std::vector<int>(v);
}
Cap flow(int s, int t, Cap limit) {
assert(0 <= s && s < V);
assert(0 <= t && t < V);
assert(limit >= Cap(0));
Cap _flow = Cap(0);
Cap _limit = limit;
while (true) {
bfs(s, t);
if (level[t] < 0) return _flow;
std::fill(iter.begin(), iter.end(), 0);
Cap f = dfs(t, s, _limit);
if (f == 0) return _flow;
_flow += f;
_limit -= f;
if (limit == _flow) return _flow;
}
}
Cap flow(int s, int t) { return flow(s, t, std::numeric_limits<Cap>::max()); }
int add_edge(int from, int to, Cap cap) {
assert(0 <= from && from < V);
assert(0 <= to && to < V);
assert(cap >= Cap(0));
int m = int(pos.size());
int from_id = int(G[from].size()), to_id = int(G[to].size()) + (from == to);
pos.push_back(std::make_pair(from, from_id));
G[from].push_back(_edge(to, cap, to_id));
G[to].push_back(_edge(from, Cap(0), from_id));
return m;
}
std::vector<bool> min_cut(int s) {
std::vector<bool> seen(V);
std::queue<int> que;
que.push(s);
seen[s] = true;
while (!que.empty()) {
int v = que.front();
que.pop();
for (int i = 0; i < int(G[v].size()); ++i) {
const _edge& e = G[v][i];
if (e.cap > 0 && !seen[e.to]) {
seen[e.to] = true;
que.push(e.to);
}
}
}
return seen;
}
};
#pragma GCC diagnostic push
#pragma GCC diagnostic error "-Wshadow"
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
inp(n);
ll ans = 0;
max_flow<ll> mf(n + 200 + 2);
const int s = n + 200, t = s + 1;
rep(i, n) {
ll p;
inp(p);
if (p > 0) {
ans += p;
mf.add_edge(s, i, p);
} else {
mf.add_edge(i, t, -p);
}
}
ll m;
inp(m);
rep(i, m) {
ll u, v;
inp(u, v);
u--, v--;
mf.add_edge(v, u, linf);
}
ll k;
inp(k);
rep(i, k) {
ll a, b, p;
inp(a, b, p);
a--, b--;
ans += p;
ll w = n + i;
mf.add_edge(s, w, p);
mf.add_edge(w, a, linf);
mf.add_edge(w, b, linf);
}
ans -= mf.flow(s, t);
oup(ans);
}
#pragma GCC diagnostic pop