結果
| 問題 | No.119 旅行のツアーの問題 |
| コンテスト | |
| ユーザー |
 zeta
|
| 提出日時 | 2026-02-21 02:53:30 |
| 言語 | C++23 (gcc 15.2.0 + boost 1.89.0) |
| 結果 |
AC
|
| 実行時間 | 3 ms / 5,000 ms |
| コード長 | 15,128 bytes |
| 記録 | |
| コンパイル時間 | 2,836 ms |
| コンパイル使用メモリ | 281,484 KB |
| 実行使用メモリ | 7,848 KB |
| 最終ジャッジ日時 | 2026-02-21 02:53:35 |
| 合計ジャッジ時間 | 4,163 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 4 |
| other | AC * 19 |
ソースコード
#line 1 "No_119_\u65c5\u884c\u306e\u30c4\u30a2\u30fc\u306e\u554f\u984c.cpp"
#define YRSD
#line 2 "YRS/all.hpp"
#line 2 "YRS/aa/head.hpp"
#include <iostream>
#include <algorithm>
#include <array>
#include <bitset>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <bit>
#include <chrono>
#include <functional>
#include <iomanip>
#include <utility>
#include <type_traits>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstring>
#include <ctime>
#include <limits>
#include <ranges>
#include <concepts>
#define TE template <typename T>
#define TES template <typename T, typename ...S>
#define Z auto
#define ep emplace_back
#define eb emplace
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define OV4(a, b, c, d, e, ...) e
#define FOR1(a) for (int _ = 0; _ < (a); ++_)
#define FOR2(i, a) for (int i = 0; i < (a); ++i)
#define FOR3(i, a, b) for (int i = (a); i < (b); ++i)
#define FOR4(i, a, b, c) for (int i = (a); i < (b); i += (c))
#define FOR(...) OV4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)
#define FOR1_R(a) for (int _ = (a) - 1; _ >= 0; --_)
#define FOR2_R(i, a) for (int i = (a) - 1; i >= 0; --i)
#define FOR3_R(i, a, b) for (int i = (b) - 1; i >= (a); --i)
#define FOR4_R(i, a, b, c) for (int i = (b) - 1; i >= (a); i -= (c))
#define FOR_R(...) OV4(__VA_ARGS__, FOR4_R, FOR3_R, FOR2_R, FOR1_R)(__VA_ARGS__)
#define FOR_subset(t, s) for (int t = (s); t > -1; t = (t == 0 ? -1 : (t - 1) & s))
#define sort ranges::sort
using namespace std;
TE using vc = vector<T>;
TE using vvc = vc<vc<T>>;
TE using T1 = tuple<T>;
TE using T2 = tuple<T, T>;
TE using T3 = tuple<T, T, T>;
TE using T4 = tuple<T, T, T, T>;
TE using max_heap = priority_queue<T>;
TE using min_heap = priority_queue<T, vc<T>, greater<T>>;
using u8 = unsigned char; using uint = unsigned int; using ll = long long; using ull = unsigned long long;
using ld = long double; using i128 = __int128; using u128 = __uint128_t; using f128 = __float128;
using u16 = uint16_t;
using PII = pair<int, int>; using PLL = pair<ll, ll>;
#ifdef YRSD
constexpr bool dbg = 1;
#else
constexpr bool dbg = 0;
#endif
#line 2 "YRS/IO/IO.hpp"
istream &operator>>(istream &I, i128 &x) {
static string s;
I >> s;
int f = s[0] == '-';
x = 0;
const int N = (int)s.size();
FOR(i, f, N) x = x * 10 + s[i] - '0';
if (f) x = -x;
return I;
}
ostream &operator<<(ostream &O, i128 x) {
static string s;
s.clear();
bool f = x < 0;
if (f) x = -x;
while (x) s += '0' + x % 10, x /= 10;
if (s.empty()) s += '0';
if (f) s += '-';
reverse(all(s));
return O << s;
}
istream &operator>>(istream &I, f128 &x) {
static string s;
I >> s, x = stold(s);
return I;
}
ostream &operator<<(ostream &O, const f128 x) { return O << ld(x); }
template <typename... S>
istream &operator>>(istream &I, tuple<S...> &t) {
return apply([&I](Z &...s) { ((I >> s), ...); }, t), I;
}
template <typename T, typename U>
istream &operator>>(istream &I, pair<T, U> &x) {
return I >> x.fi >> x.se;
}
template <typename T, typename U>
ostream &operator<<(ostream &O, const pair<T, U> &x) {
return O << x.fi << ' ' << x.se;
}
TE requires requires(T &c) { begin(c); end(c); } and
(not is_same_v<decay_t<T>, string>)
istream &operator>>(istream &I, T &c) {
for (Z &e : c) I >> e;
return I;
}
TE requires requires(const T &c) { begin(c); end(c); } and
(not is_same_v<decay_t<T>, const char*>) and
(not is_same_v<decay_t<T>, string>) and
(not is_array_v<remove_reference_t<T>> or
not is_same_v<remove_extent_t<remove_reference_t<T>>, char>)
ostream &operator<<(ostream &O, const T &a) {
if (a.empty()) return O;
Z i = a.begin();
O << *i++;
for (; i != a.end(); ++i) O << ' ' << *i;
return O;
}
void IN() {}
TE void IN(T &x, Z &...s) { cin >> x, IN(s...); }
void print() { cout << '\n'; }
TES void print(T &&x, S &&...y) {
cout << x;
if constexpr (sizeof...(S)) cout << ' ';
print(forward<S>(y)...);
}
void put() { cout << ' '; }
TES void put(T &&x, S &&...y) {
cout << x;
if constexpr (sizeof...(S)) cout << ' ';
put(forward<S>(y)...);
}
#define INT(...) int __VA_ARGS__; IN(__VA_ARGS__)
#define UINT(...) uint __VA_ARGS__; IN(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__; IN(__VA_ARGS__)
#define ULL(...) ull __VA_ARGS__; IN(__VA_ARGS__)
#define I128(...) i128 __VA_ARGS__; IN(__VA_ARGS__)
#define STR(...) string __VA_ARGS__; IN(__VA_ARGS__)
#define CH(...) char __VA_ARGS__; IN(__VA_ARGS__)
#define REAL(...) re __VA_ARGS__; IN(__VA_ARGS__)
#define VEC(T, a, n) vc<T> a(n); IN(a)
void YES(bool o = 1) { print(o ? "YES" : "NO"); }
void Yes(bool o = 1) { print(o ? "Yes" : "No"); }
void yes(bool o = 1) { print(o ? "yes" : "no"); }
void NO(bool o = 1) { YES(not o); }
void No(bool o = 1) { Yes(not o); }
void no(bool o = 1) { yes(not o); }
void ALICE(bool o = 1) { print(o ? "ALICE" : "BOB"); }
void Alice(bool o = 1) { print(o ? "Alice" : "Bob"); }
void alice(bool o = 1) { print(o ? "alice" : "bob"); }
void BOB(bool o = 1) { ALICE(not o); }
void Bob(bool o = 1) { Alice(not o); }
void bob(bool o = 1) { alice(not o); }
void POSSIBLE(bool o = 1) { print(o ? "POSSIBLE" : "IMPOSSIBLE"); }
void Possible(bool o = 1) { print(o ? "Possible" : "Impossible"); }
void possible(bool o = 1) { print(o ? "possible" : "impossible"); }
void IMPOSSIBLE(bool o = 1) { POSSIBLE(not o); }
void Impossible(bool o = 1) { Possible(not o); }
void impossible(bool o = 1) { possible(not o); }
void TAK(bool o = 1) { print(o ? "TAK" : "NIE"); }
void NIE(bool o = 1) { TAK(not o); }
#line 5 "YRS/all.hpp"
#if (__cplusplus >= 202002L)
#include <numbers>
constexpr ld pi = numbers::pi;
#endif
TE constexpr T inf = numeric_limits<T>::max();
template <> constexpr i128 inf<i128> = i128(inf<ll>) * 2'000'000'000'000'000'000;
template <typename T, typename U>
constexpr pair<T, U> inf<pair<T, U>> = {inf<T>, inf<U>};
TE constexpr static inline int pc(T x) { return popcount(make_unsigned_t<T>(x)); }
constexpr static inline ll len(const Z &a) { return a.size(); }
void reverse(Z &a) { reverse(all(a)); }
void unique(Z &a) {
sort(a);
a.erase(unique(all(a)), a.end());
}
TE vc<int> inverse(const vc<T> &a) {
int N = len(a);
vc<int> b(N, -1);
FOR(i, N) if (a[i] != -1) b[a[i]] = i;
return b;
}
Z QMAX(const Z &a) { return *max_element(all(a)); }
Z QMIN(const Z &a) { return *min_element(all(a)); }
constexpr bool chmax(Z &a, const Z &b) { return (a < b ? a = b, 1 : 0); }
constexpr bool chmin(Z &a, const Z &b) { return (a > b ? a = b, 1 : 0); }
vc<int> argsort(const Z &a) {
vc<int> I(len(a));
iota(all(I), 0);
sort(I, [&](int i, int k) { return a[i] < a[k] or (a[i] == a[k] and i < k); });
return I;
}
TE vc<T> rearrange(const vc<T> &a, const vc<int> &I) {
int N = len(I);
vc<T> b(N);
FOR(i, N) b[i] = a[I[i]];
return b;
}
template <int of = 1, typename T>
vc<T> pre_sum(const vc<T> &a) {
int N = len(a);
vc<T> c(N + 1);
FOR(i, N) c[i + 1] = c[i] + a[i];
if (of == 0) c.erase(c.begin());
return c;
}
TE constexpr static int topbit(T x) {
if (x == 0) return - 1;
if constexpr (sizeof(T) <= 4) return 31 - __builtin_clz(x);
else return 63 - __builtin_clzll(x);
}
TE constexpr static int lowbit(T x) {
if (x == 0) return -1;
if constexpr (sizeof(T) <= 4) return __builtin_ctz(x);
else return __builtin_ctzll(x);
}
TE constexpr T floor(T x, T y) { return x / y - (x % y and (x ^ y) < 0); }
TE constexpr T ceil(T x, T y) { return floor(x + y - 1, y); }
TE constexpr T bmod(T x, T y) { return x - floor(x, y) * y; }
TE constexpr pair<T, T> divmod(T x, T y) {
T q = floor(x, y);
return pair{q, x - q * y};
}
template <typename T = ll>
T SUM(const Z &v) {
return accumulate(all(v), T(0));
}
int lb(const Z &a, Z x) { return lower_bound(all(a), x) - a.begin(); }
int lb(Z l, Z r, Z x) requires(is_same_v<decltype(l), decltype(r)>) { return lower_bound(l, r, x) - l; }
int ub(const Z &a, Z x) { return upper_bound(all(a), x) - a.begin(); }
int ub(Z l, Z r, Z x) requires(is_same_v<decltype(l), decltype(r)>) { return upper_bound(l, r, x) - l; }
template <bool ck = 1>
ll bina(Z f, ll l, ll r) {
if constexpr (ck) assert(f(l));
while (abs(l - r) > 1) {
ll x = (r + l) >> 1;
(f(x) ? l : r) = x;
}
return l;
}
TE T bina_real(Z f, T l, T r, int c = 100) {
while (c--) {
T x = (l + r) / 2;
(f(x) ? l : r) = x;
}
return (l + r) / 2;
}
Z pop(Z &s) {
if constexpr (requires { s.pop_back(); }) {
Z x = s.back();
return s.pop_back(), x;
} else if constexpr (requires { s.top(); }) {
Z x = s.top();
return s.pop(), x;
} else {
Z x = s.front();
return s.pop(), x;
}
}
void setp(int x) { cout << fixed << setprecision(x); }
TE inline void sh(vc<T> &a, int N, T b = {}) {
a.resize(N, b);
}
#line 1 "YRS/debug.hpp"
#ifdef YRSD
void DBG() { cerr << "]" << endl; }
TES void DBG(T &&x, S &&...y) {
cerr << x;
if constexpr (sizeof...(S)) cerr << ", ";
DBG(forward<S>(y)...);
}
#define debug(...) cerr << "[" << __LINE__ << "]: [" #__VA_ARGS__ "] = [", DBG(__VA_ARGS__)
void ERR() { cerr << endl; }
TES void ERR(T &&x, S &&...y) {
cerr << x;
if constexpr (sizeof...(S)) cerr << ", ";
ERR(forward<S>(y)...);
}
#define err(...) cerr << "[" << __LINE__ << "]: ", ERR(__VA_ARGS__)
#define asser assert
#else
#define debug(...) void(0721)
#define err(...) void(0721)
#define asser(...) void(0721)
#endif
#line 4 "No_119_\u65c5\u884c\u306e\u30c4\u30a2\u30fc\u306e\u554f\u984c.cpp"
// #include "YRS/IO/fast_io.hpp"
// #include "YRS/random/rng.hpp"
// #include "YRS/mod/mint.hpp"
#line 2 "YRS/flow/max_flow.hpp"
template <typename T = ll>
struct max_flow {
struct E {
int to, rev;
T c, f = 0;
};
int N, ss, tt;
vc<vc<E>> es;
vc<PII> pos;
vc<int> pr, le, q;
bool ok;
T ans;
max_flow(int N, int ss, int tt)
: N(N), ss(ss), tt(tt), es(N), ok(0), ans(0) {}
void add(int f, int t, T c, T cc = 0) {
ok = 0;
assert(0 <= f and f < N);
assert(0 <= t and t < N);
assert(T(0) <= c);
int a = len(es[f]);
int b = f == t ? a + 1 : len(es[t]);
pos.ep(f, a);
es[f].ep(E{t, b, c, 0});
es[t].ep(E{f, a, cc, 0});
}
bool set() {
q.resize(N);
le.assign(N, -1);
le[ss] = 0;
int l = 0, r = 0;
q[r++] = ss;
while (l < r) {
int x = q[l++];
for (Z &&e : es[x]) {
if (e.c > 0 and le[e.to] == -1) {
le[e.to] = le[x] + 1;
if (e.to == tt) return 1;
q[r++] = e.to;
}
}
}
return 0;
}
T dfs(int x, T lm) {
if (x == tt) return lm;
T res = 0;
for (int &i = pr[x]; i < len(es[x]); ++i) {
Z &e = es[x][i];
if (e.c > 0 and le[e.to] == le[x] + 1) {
T a = dfs(e.to, min(lm, e.c));
if (a > 0) {
e.c -= a, e.f += a;
es[e.to][e.rev].c += a, es[e.to][e.rev].f -= a;
res += a;
lm -= a;
if (lm == 0) break;
}
}
}
return res;
}
T flow() {
if (ok) return ans;
ok = 1;
while (set()) {
pr.assign(N, 0);
while (1) {
T x = dfs(ss, inf<T>);
if (x == 0) break;
ans += x;
chmin(ans, inf<T>);
if (ans == inf<T>) return ans;
}
}
return ans;
}
// 最小カットの値および、カットを表す 01 列を返す
pair<T, vc<int>> cut() {
flow();
vc<int> r(N);
FOR(i, N) r[i] = (le[i] >= 0 ? 0 : 1);
return {ans, r};
}
// f, to, flow
vc<tuple<int, int, T>> get_flow_edges() {
vc<tuple<int, int, T>> res;
FOR(f, N) {
for (Z &&e : es[f]) {
if (e.f <= 0) continue;
res.ep(f, e.to, e.f);
}
}
return res;
}
// https://onlinejudge.u-aizu.ac.jp/problems/2251
// O(F(N+M)) 把流分解成若干条 s-t 路径
vc<vc<int>> path_decomposition() {
flow();
Z es = get_flow_edges();
vc<vc<int>> v(N), res;
for (Z &&[f, t, fl] : es)
for (int i = fl; i--;) v[f].ep(t);
vc<int> vis(N);
for (int i = ans; i--;) {
vc<int> pa{ss};
vis[ss] = 1;
while (pa.back() != tt) {
int to = pop(v[pa.back()]);
while (vis[to]) vis[pop(pa)] = 0;
pa.ep(to), vis[to] = 1;
}
for (int i : pa) vis[i] = 0;
res.ep(pa);
}
return res;
}
vc<u8> vis;
void flow_push_back(E& e) {
Z &re = es[e.to][e.rev];
int a = re.to, b = e.to;
Z find_path = [&](int s, int t, T lm) -> T {
vc<bool> vis(N);
pr.assign(N, 0);
Z dfs = [&](Z &dfs, int v, T f) -> T {
if (v == t) return f;
for (int &i = pr[v]; i < len(es[v]); ++i) {
Z &e = es[v][i];
if (vis[e.to] or e.c <= T(0)) continue;
vis[e.to] = 1;
T a = dfs(dfs, e.to, min(f, e.c));
assert(a >= 0);
if (a == T(0)) continue;
e.c -= a, e.f += a;
es[e.to][e.rev].c += a, es[e.to][e.rev].f -= a;
return a;
}
return 0;
};
return dfs(dfs, s, lm);
};
while (e.c < 0) {
T x = find_path(a, b, -e.c);
if (x == T(0)) break;
e.c += x, e.f -= x;
re.c -= x, re.f += x;
}
T c = -e.c;
while (c > 0 and a != ss) {
T x = find_path(a, ss, c);
assert(x > 0);
c -= x;
}
c = -e.c;
while (c > 0 and b != tt) {
T x = find_path(tt, b, c);
assert(x > 0);
c -= x;
}
c = -e.c;
e.c += c, e.f -= c;
re.c -= c, re.f += c;
ans -= c;
}
// 修改残量网络某条边的容量
void change_capacity(int i, T upd) {
Z [f, id] = pos[i];
Z &e = es[f][id];
T pr = e.c + e.f;
if (pr < upd) {
ok = (e.c > 0);
e.c += upd - pr;
return;
}
e.c = upd - e.f;
if (e.c < 0) flow_push_back(e);
}
template <int upd>
void change_capacity(int i) {
Z [f, id] = pos[i];
Z &e = es[f][id];
T pr = e.c + e.f;
if (pr < upd) {
ok = (e.c > 0);
e.c += upd - pr;
return;
}
e.c = upd - e.f;
if (e.c < 0) flow_push_back(e);
}
void println() {
debug(ss);
debug(tt);
FOR(i, N) {
for (Z &&e : es[i]) {
if (e.c == 0 && e.f == 0) continue;
debug(i, e.to, e.c, e.f);
}
}
}
};
#line 8 "No_119_\u65c5\u884c\u306e\u30c4\u30a2\u30fc\u306e\u554f\u984c.cpp"
#define tests 0
#define fl 0
#define DB 10
void Yorisou() {
INT(N);
VEC(PII, a, N);
INT(M);
VEC(PII, e, M);
int s = 2 * N, t = s + 1;
max_flow<int> g(t + 1, s, t);
FOR(i, N) g.add(i, i + N, inf<int>);
FOR(i, N) g.add(s, i, a[i].fi);
FOR(i, N) g.add(i + N, t, a[i].se);
for (Z [x, y] : e) g.add(x, y + N, inf<int>);
int al = 0;
for (Z [x, y] : a) al += x + y;
print(al - g.flow());
}
#line 1 "YRS/aa/main.hpp"
int main() {
cin.tie(nullptr)->sync_with_stdio(0);
int T = 1;
if (fl) cerr.tie(0);
if (tests and not fl) IN(T);
for (int i = 0; i < T or fl; ++i) {
Yorisou();
if (fl and i % DB == 0) cerr << "Case: " << i << '\n';
}
return 0;
}
#line 29 "No_119_\u65c5\u884c\u306e\u30c4\u30a2\u30fc\u306e\u554f\u984c.cpp"