backup
This commit is contained in:
parent
8a624618e1
commit
573bb5c6ca
SSH Key Fingerprint:
SHA256:dFPFi68d8C87YkFkEBU4TkcrYRySWpekRR1hbnDWUCw
BIN
src/bin/a.out
BIN
src/bin/a.out
Binary file not shown.
32
src/bin/b.cc
32
src/bin/b.cc
|
|
@ -429,7 +429,7 @@ vector<pair<T, U>> zip(Iterator_T a_first, Iterator_T a_last, Iterator_U b_first
|
|||
vector<pair<T, U>> res;
|
||||
auto a_it = a_first;
|
||||
auto b_it = b_first;
|
||||
for (; a_it != a_last and b_it != b_last; ++a_it, ++b_it) {
|
||||
for (; not (a_it == a_last) and not (b_it == b_last); ++a_it, ++b_it) {
|
||||
res.emplace_back(*a_it, *b_it);
|
||||
}
|
||||
return res;
|
||||
|
|
@ -459,9 +459,12 @@ public:
|
|||
ArithmeticIterator<T>& operator--() { --value; return *this; }
|
||||
bool operator==(const ArithmeticIterator<T>& rhs) const { return value == rhs.value; }
|
||||
};
|
||||
template <typename T> vector<pair<int, T>> enumerate(const vector<T>& container) {
|
||||
return zip<int, T>(ArithmeticIterator<int>(0), ArithmeticIterator<int>(INT_MAX), container.begin(), container.end());
|
||||
}
|
||||
/////////////////////////////////////////////////////////
|
||||
|
||||
// #define SINGLE_TEST_CASE
|
||||
#define SINGLE_TEST_CASE
|
||||
// #define DUMP_TEST_CASE 7219
|
||||
// #define TOT_TEST_CASE 10000
|
||||
|
||||
|
|
@ -474,23 +477,16 @@ void prep() {
|
|||
|
||||
void solve() {
|
||||
read(int, n);
|
||||
readvec(int, a, n);
|
||||
int mn_l = 1;
|
||||
for (int b = 0; b < 20; ++b) {
|
||||
int max_dist = 0;
|
||||
int prev_1 = -1;
|
||||
for (int i = 0; i < n; ++i) {
|
||||
if (a[i] >> b & 1) {
|
||||
max_dist = max(max_dist, i - prev_1);
|
||||
prev_1 = i;
|
||||
}
|
||||
}
|
||||
if (prev_1 != -1) {
|
||||
max_dist = max(max_dist, n - prev_1);
|
||||
mn_l = max(mn_l, max_dist);
|
||||
}
|
||||
ll sum = 0;
|
||||
vector<string> a;
|
||||
for (int i = 0; i < n; ++i) {
|
||||
read(string, s);
|
||||
read(int, c);
|
||||
a.emplace_back(s);
|
||||
sum += c;
|
||||
}
|
||||
cout << mn_l << '\n';
|
||||
sort(a.begin(), a.end());
|
||||
cout << a[sum % n] << '\n';
|
||||
}
|
||||
|
||||
int main() {
|
||||
|
|
|
|||
48
src/bin/c.cc
48
src/bin/c.cc
|
|
@ -429,7 +429,7 @@ vector<pair<T, U>> zip(Iterator_T a_first, Iterator_T a_last, Iterator_U b_first
|
|||
vector<pair<T, U>> res;
|
||||
auto a_it = a_first;
|
||||
auto b_it = b_first;
|
||||
for (; a_it != a_last and b_it != b_last; ++a_it, ++b_it) {
|
||||
for (; not (a_it == a_last) and not (b_it == b_last); ++a_it, ++b_it) {
|
||||
res.emplace_back(*a_it, *b_it);
|
||||
}
|
||||
return res;
|
||||
|
|
@ -459,9 +459,12 @@ public:
|
|||
ArithmeticIterator<T>& operator--() { --value; return *this; }
|
||||
bool operator==(const ArithmeticIterator<T>& rhs) const { return value == rhs.value; }
|
||||
};
|
||||
template <typename T> vector<pair<int, T>> enumerate(const vector<T>& container) {
|
||||
return zip<int, T>(ArithmeticIterator<int>(0), ArithmeticIterator<int>(INT_MAX), container.begin(), container.end());
|
||||
}
|
||||
/////////////////////////////////////////////////////////
|
||||
|
||||
// #define SINGLE_TEST_CASE
|
||||
#define SINGLE_TEST_CASE
|
||||
// #define DUMP_TEST_CASE 7219
|
||||
// #define TOT_TEST_CASE 10000
|
||||
|
||||
|
|
@ -474,30 +477,29 @@ void prep() {
|
|||
|
||||
void solve() {
|
||||
read(int, n);
|
||||
readvec(int, a, n);
|
||||
vector<int> pos;
|
||||
for (int i = 1; i < n; i += 2) {
|
||||
if (a[i] == 1) {
|
||||
i += 1;
|
||||
}
|
||||
if (i == n) break;
|
||||
pos.emplace_back(i);
|
||||
}
|
||||
int target = n;
|
||||
vector<int> res(n);
|
||||
sort_by_key(pos.begin(), pos.end(), [&] (int i) { return a[i]; });
|
||||
for (auto&& i : pos) {
|
||||
res[i] = target--;
|
||||
}
|
||||
vector<int> rem;
|
||||
vector<tiii> a;
|
||||
for (int i = 0; i < n; ++i) {
|
||||
if (not res[i]) rem.emplace_back(i);
|
||||
read(int, x, y);
|
||||
a.emplace_back(x, y, i);
|
||||
}
|
||||
sort_by_key(rem.begin(), rem.end(), [&] (int i) { return a[i]; });
|
||||
for (auto&& i : rem) {
|
||||
res[i] = target--;
|
||||
sort(a.begin(), a.end());
|
||||
vector<bool> has(n, 1);
|
||||
set<pii, greater<>> st;
|
||||
for (int i = 0; i < n; ++i) {
|
||||
auto [x, y, j] = a[i];
|
||||
while (st.size() and st.begin()->first > y) {
|
||||
has[st.begin()->second] = 0;
|
||||
st.erase(st.begin());
|
||||
}
|
||||
st.emplace(y, j);
|
||||
}
|
||||
putvec(res);
|
||||
cout << count(has.begin(), has.end(), 1) << '\n';
|
||||
for (int i = 0; i < n; ++i) {
|
||||
if (has[i]) {
|
||||
cout << i + 1 << ' ';
|
||||
}
|
||||
}
|
||||
cout << endl;
|
||||
}
|
||||
|
||||
int main() {
|
||||
|
|
|
|||
|
|
@ -0,0 +1,622 @@
|
|||
#pragma GCC optimize("Ofast")
|
||||
/////////////////////////////////////////////////////////
|
||||
/**
|
||||
* Useful Macros
|
||||
* by subcrip
|
||||
* (requires C++17)
|
||||
*/
|
||||
|
||||
#include<bits/stdc++.h>
|
||||
using namespace std;
|
||||
|
||||
/* macro helpers */
|
||||
#define __NARGS(...) std::tuple_size<decltype(std::make_tuple(__VA_ARGS__))>::value
|
||||
#define __DECOMPOSE_S(a, x) auto x = a;
|
||||
#define __DECOMPOSE_N(a, ...) auto [__VA_ARGS__] = a;
|
||||
constexpr void __() {}
|
||||
#define __AS_PROCEDURE(...) __(); __VA_ARGS__; __()
|
||||
#define __as_typeof(container) remove_reference<decltype(container)>::type
|
||||
|
||||
/* type aliases */
|
||||
#if LONG_LONG_MAX != INT64_MAX
|
||||
using ll = int64_t;
|
||||
using ull = uint64_t;
|
||||
#else
|
||||
using ll = long long;
|
||||
using ull = unsigned long long;
|
||||
using ld = long double;
|
||||
#endif
|
||||
using int128 = __int128_t;
|
||||
using uint128 = __uint128_t;
|
||||
using ld = long double;
|
||||
using pii = pair<int, int>;
|
||||
using pil = pair<int, ll>;
|
||||
using pli = pair<ll, int>;
|
||||
using pll = pair<ll, ll>;
|
||||
using pid = pair<int, ld>;
|
||||
using pdi = pair<ld, int>;
|
||||
using pld = pair<ll, ld>;
|
||||
using pdl = pair<ld, ll>;
|
||||
using pdd = pair<ld, ld>;
|
||||
using tlll = tuple<ll, ll, ll>;
|
||||
using tlld = tuple<ll, ll, ld>;
|
||||
using tlli = tuple<ll, ll, int>;
|
||||
using tldl = tuple<ll, ld, ll>;
|
||||
using tldd = tuple<ll, ld, ld>;
|
||||
using tldi = tuple<ll, ld, int>;
|
||||
using tlil = tuple<ll, int, ll>;
|
||||
using tlid = tuple<ll, int, ld>;
|
||||
using tlii = tuple<ll, int, int>;
|
||||
using tdll = tuple<ld, ll, ll>;
|
||||
using tdld = tuple<ld, ll, ld>;
|
||||
using tdli = tuple<ld, ll, int>;
|
||||
using tddl = tuple<ld, ld, ll>;
|
||||
using tddd = tuple<ld, ld, ld>;
|
||||
using tddi = tuple<ld, ld, int>;
|
||||
using tdil = tuple<ld, int, ll>;
|
||||
using tdid = tuple<ld, int, ld>;
|
||||
using tdii = tuple<ld, int, int>;
|
||||
using till = tuple<int, ll, ll>;
|
||||
using tild = tuple<int, ll, ld>;
|
||||
using tili = tuple<int, ll, int>;
|
||||
using tidl = tuple<int, ld, ll>;
|
||||
using tidd = tuple<int, ld, ld>;
|
||||
using tidi = tuple<int, ld, int>;
|
||||
using tiil = tuple<int, int, ll>;
|
||||
using tiid = tuple<int, int, ld>;
|
||||
using tiii = tuple<int, int, int>;
|
||||
template <typename T> using max_heap = priority_queue<T>;
|
||||
template <typename T> using min_heap = priority_queue<T, vector<T>, greater<>>;
|
||||
template <typename T> using oi = ostream_iterator<T>;
|
||||
template <typename T> using ii = istream_iterator<T>;
|
||||
|
||||
/* constants */
|
||||
constexpr int INF = 0x3f3f3f3f;
|
||||
constexpr ll INFLL = 0x3f3f3f3f3f3f3f3fLL;
|
||||
constexpr ll MDL = 1e9 + 7;
|
||||
constexpr ll PRIME = 998'244'353;
|
||||
constexpr ll MDL1 = 8784491;
|
||||
constexpr ll MDL2 = PRIME;
|
||||
constexpr int128 INT128_MAX = numeric_limits<int128>::max();
|
||||
constexpr uint128 UINT128_MAX = numeric_limits<uint128>::max();
|
||||
constexpr int128 INT128_MIN = numeric_limits<int128>::min();
|
||||
constexpr uint128 UINT128_MIN = numeric_limits<uint128>::min();
|
||||
|
||||
/* random */
|
||||
|
||||
mt19937 rd(chrono::duration_cast<chrono::milliseconds>(chrono::system_clock::now().time_since_epoch()).count());
|
||||
|
||||
/* bit-wise operations */
|
||||
#define lowbit(x) ((x) & -(x))
|
||||
#define popcount(x) (__builtin_popcountll(ll(x)))
|
||||
#define parity(x) (__builtin_parityll(ll(x)))
|
||||
#define msp(x) (63LL - __builtin_clzll(ll(x)))
|
||||
#define lsp(x) (__builtin_ctzll(ll(x)))
|
||||
|
||||
/* arithmetic operations */
|
||||
#define mod(x, y) ((((x) % (y)) + (y)) % (y))
|
||||
|
||||
/* fast pairs */
|
||||
#define upair ull
|
||||
#define umake(x, y) (ull(x) << 32 | (ull(y) & ((1ULL << 32) - 1)))
|
||||
#define u1(p) ((p) >> 32)
|
||||
#define u2(p) ((p) & ((1ULL << 32) - 1))
|
||||
#define ult std::less<upair>
|
||||
#define ugt std::greater<upair>
|
||||
|
||||
#define ipair ull
|
||||
#define imake(x, y) (umake(x, y))
|
||||
#define i1(p) (int(u1(ll(p))))
|
||||
#define i2(p) (ll(u2(p) << 32) >> 32)
|
||||
struct ilt {
|
||||
bool operator()(const ipair& a, const ipair& b) const {
|
||||
if (i1(a) == i1(b)) return i2(a) < i2(b);
|
||||
else return i1(a) < i1(b);
|
||||
}
|
||||
};
|
||||
struct igt {
|
||||
bool operator()(const ipair& a, const ipair& b) const {
|
||||
if (i1(a) == i1(b)) return i2(a) > i2(b);
|
||||
else return i1(a) > i1(b);
|
||||
}
|
||||
};
|
||||
|
||||
/* conditions */
|
||||
#define loop while (1)
|
||||
#define if_or(var, val) if (!(var == val)) var = val; else
|
||||
#define continue_or(var, val) __AS_PROCEDURE(if (var == val) continue; var = val;)
|
||||
#define break_or(var, val) __AS_PROCEDURE(if (var == val) break; var = val;)
|
||||
|
||||
/* hash */
|
||||
struct safe_hash {
|
||||
// https://codeforces.com/blog/entry/62393
|
||||
static uint64_t splitmix64(uint64_t x) {
|
||||
// http://xorshift.di.unimi.it/splitmix64.c
|
||||
x += 0x9e3779b97f4a7c15;
|
||||
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
|
||||
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
|
||||
return x ^ (x >> 31);
|
||||
}
|
||||
|
||||
size_t operator()(uint64_t x) const {
|
||||
static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
|
||||
return splitmix64(x + FIXED_RANDOM);
|
||||
}
|
||||
};
|
||||
|
||||
struct pair_hash {
|
||||
template <typename T, typename U>
|
||||
size_t operator()(const pair<T, U>& a) const {
|
||||
auto hash1 = safe_hash()(a.first);
|
||||
auto hash2 = safe_hash()(a.second);
|
||||
if (hash1 != hash2) {
|
||||
return hash1 ^ hash2;
|
||||
}
|
||||
return hash1;
|
||||
}
|
||||
};
|
||||
|
||||
uniform_int_distribution<mt19937::result_type> dist(PRIME);
|
||||
const size_t __array_hash_b = 31, __array_hash_mdl1 = dist(rd), __array_hash_mdl2 = dist(rd);
|
||||
struct array_hash {
|
||||
template <typename Sequence>
|
||||
size_t operator()(const Sequence& arr) const {
|
||||
size_t pw1 = 1, pw2 = 1;
|
||||
size_t res1 = 0, res2 = 0;
|
||||
for (auto&& x : arr) {
|
||||
res1 = (res1 + x * pw1) % __array_hash_mdl1;
|
||||
res2 = (res2 + x * pw2) % __array_hash_mdl2;
|
||||
pw1 = (pw1 * __array_hash_b) % __array_hash_mdl1;
|
||||
pw2 = (pw2 * __array_hash_b) % __array_hash_mdl2;
|
||||
}
|
||||
return res1 + res2;
|
||||
}
|
||||
};
|
||||
|
||||
/* build data structures */
|
||||
#define unordered_counter(from, to) __AS_PROCEDURE(unordered_map<__as_typeof(from), size_t, safe_hash> to; for (auto&& x : from) ++to[x];)
|
||||
#define counter(from, to, cmp) __AS_PROCEDURE(map<__as_typeof(from), size_t, cmp> to; for (auto&& x : from) ++to[x];)
|
||||
#define pa(a) __AS_PROCEDURE(__typeof(a) pa; pa.push_back({}); for (auto&&x : a) pa.push_back(pa.back() + x);)
|
||||
#define sa(a) __AS_PROCEDURE(__typeof(a) sa(a.size() + 1); {int n = a.size(); for (int i = n - 1; i >= 0; --i) sa[i] = sa[i + 1] + a[i];};)
|
||||
#define adj(ch, n) __AS_PROCEDURE(vector<vector<int>> ch((n) + 1);)
|
||||
#define edge(ch, u, v) __AS_PROCEDURE(ch[u].push_back(v), ch[v].push_back(u);)
|
||||
#define edgew(ch, u, v, w) __AS_PROCEDURE(ch[u].emplace_back(v, w), ch[v].emplace_back(u, w);)
|
||||
#define Edge(ch, u, v) __AS_PROCEDURE(ch[u].push_back(v);)
|
||||
#define Edgew(ch, u, v, w) __AS_PROCEDURE(ch[u].emplace_back(v, w);)
|
||||
template <typename T, typename Iterator> pair<size_t, map<T, size_t>> discretize(Iterator __first, Iterator __last) {
|
||||
set<T> st(__first, __last);
|
||||
size_t N = 0;
|
||||
map<T, size_t> mp;
|
||||
for (auto&& x : st) mp[x] = ++N;
|
||||
return {N, mp};
|
||||
}
|
||||
template <typename T, typename Iterator> pair<size_t, unordered_map<T, size_t, safe_hash>> unordered_discretize(Iterator __first, Iterator __last) {
|
||||
set<T> st(__first, __last);
|
||||
size_t N = 0;
|
||||
unordered_map<T, size_t, safe_hash> mp;
|
||||
for (auto&& x : st) mp[x] = ++N;
|
||||
return {N, mp};
|
||||
}
|
||||
|
||||
/* io */
|
||||
#define untie __AS_PROCEDURE(ios_base::sync_with_stdio(0), cin.tie(NULL))
|
||||
template<typename T> void __read(T& x) { cin >> x; }
|
||||
template<typename T, typename... U> void __read(T& x, U&... args) { cin >> x; __read(args...); }
|
||||
#define read(type, ...) __AS_PROCEDURE(type __VA_ARGS__; __read(__VA_ARGS__);)
|
||||
#define readvec(type, a, n) __AS_PROCEDURE(vector<type> a(n); for (auto& x : a) cin >> x;)
|
||||
#define readvec1(type, a, n) __AS_PROCEDURE(vector<type> a((n) + 1); copy_n(ii<type>(cin), (n), a.begin() + 1);)
|
||||
#define putvec(a) __AS_PROCEDURE(copy(a.begin(), a.end(), oi<__as_typeof(a)::value_type>(cout, " ")); cout << endl;)
|
||||
#define putvec1(a) __AS_PROCEDURE(copy(a.begin() + 1, a.end(), oi<__as_typeof(a)::value_type>(cout, " ")); cout << endl;)
|
||||
#define putvec_eol(a) __AS_PROCEDURE(copy(a.begin(), a.end(), oi<__as_typeof(a)::value_type>(cout, "\n"));)
|
||||
#define putvec1_eol(a) __AS_PROCEDURE(copy(a.begin() + 1, a.end(), oi<__as_typeof(a)::value_type>(cout, "\n"));)
|
||||
#define debug(x) __AS_PROCEDURE(cerr << #x" = " << (x) << endl;)
|
||||
#define debugvec(a) __AS_PROCEDURE(cerr << #a" = "; for (auto&& x : a) cerr << x << ' '; cerr << endl;)
|
||||
template<typename T, typename U> istream& operator>>(istream& in, pair<T, U>& p) {
|
||||
return in >> p.first >> p.second;
|
||||
}
|
||||
template<typename T, typename U> ostream& operator<<(ostream& out, const pair<T, U>& p) {
|
||||
out << "{" << p.first << ", " << p.second << "}";
|
||||
return out;
|
||||
}
|
||||
template<typename Char, typename Traits, typename Tuple, std::size_t... Index>
|
||||
void print_tuple_impl(std::basic_ostream<Char, Traits>& os, const Tuple& t, std::index_sequence<Index...>) {
|
||||
using swallow = int[]; // guaranties left to right order
|
||||
(void)swallow { 0, (void(os << (Index == 0 ? "" : ", ") << std::get<Index>(t)), 0)... };
|
||||
}
|
||||
template<typename Char, typename Traits, typename... Args>
|
||||
decltype(auto) operator<<(std::basic_ostream<Char, Traits>& os, const std::tuple<Args...>& t) {
|
||||
os << "{";
|
||||
print_tuple_impl(os, t, std::index_sequence_for<Args...>{});
|
||||
return os << "}";
|
||||
}
|
||||
template<typename T> ostream& operator<<(ostream& out, const vector<T>& vec) {
|
||||
for (auto&& i : vec) out << i << ' ';
|
||||
return out;
|
||||
}
|
||||
std::ostream& operator<<(std::ostream& dest, const int128& value) {
|
||||
// https://stackoverflow.com/a/25115163/23881100
|
||||
std::ostream::sentry s( dest );
|
||||
if ( s ) {
|
||||
uint128 tmp = value < 0 ? -value : value;
|
||||
char buffer[ 128 ];
|
||||
char* d = std::end( buffer );
|
||||
do {
|
||||
-- d;
|
||||
*d = "0123456789"[ tmp % 10 ];
|
||||
tmp /= 10;
|
||||
} while ( tmp != 0 );
|
||||
if ( value < 0 ) {
|
||||
-- d;
|
||||
*d = '-';
|
||||
}
|
||||
int len = std::end( buffer ) - d;
|
||||
if ( dest.rdbuf()->sputn( d, len ) != len ) {
|
||||
dest.setstate( std::ios_base::badbit );
|
||||
}
|
||||
}
|
||||
return dest;
|
||||
}
|
||||
|
||||
/* pops */
|
||||
#define poptop(q, ...) __AS_PROCEDURE(auto [__VA_ARGS__] = q.top(); q.pop();)
|
||||
#define popback(q, ...) __AS_PROCEDURE(auto [__VA_ARGS__] = q.back(); q.pop_back();)
|
||||
#define popfront(q, ...) __AS_PROCEDURE(auto [__VA_ARGS__] = q.front();q.pop_front();)
|
||||
|
||||
/* math */
|
||||
constexpr inline int lg2(ll x) { return x == 0 ? -1 : sizeof(ll) * 8 - 1 - __builtin_clzll(x); }
|
||||
|
||||
void __exgcd(ll a, ll b, ll& x, ll& y) {
|
||||
if (b == 0) {
|
||||
x = 1, y = 0;
|
||||
return;
|
||||
}
|
||||
__exgcd(b, a % b, y, x);
|
||||
y -= a / b * x;
|
||||
}
|
||||
|
||||
ll inverse(ll a, ll b) {
|
||||
ll x, y;
|
||||
__exgcd(a, b, x, y);
|
||||
return mod(x, b);
|
||||
}
|
||||
|
||||
vector<tuple<int, int, ll>> decompose(ll x) {
|
||||
// return (factor, count, factor ** count)
|
||||
vector<tuple<int, int, ll>> res;
|
||||
for (int i = 2; i * i <= x; i++) {
|
||||
if (x % i == 0) {
|
||||
int cnt = 0;
|
||||
ll pw = 1;
|
||||
while (x % i == 0) ++cnt, x /= i, pw *= i;
|
||||
res.emplace_back(i, cnt, pw);
|
||||
}
|
||||
}
|
||||
if (x != 1) {
|
||||
res.emplace_back(x, 1, x);
|
||||
}
|
||||
return res;
|
||||
}
|
||||
|
||||
vector<pii> decompose_prime(int N) {
|
||||
// return (factor, count)
|
||||
vector<pii> result;
|
||||
for (int i = 2; i * i <= N; i++) {
|
||||
if (N % i == 0) {
|
||||
int cnt = 0;
|
||||
while (N % i == 0) N /= i, ++cnt;
|
||||
result.emplace_back(i, cnt);
|
||||
}
|
||||
}
|
||||
if (N != 1) {
|
||||
result.emplace_back(N, 1);
|
||||
}
|
||||
return result;
|
||||
}
|
||||
|
||||
/* string algorithms */
|
||||
vector<int> calc_next(string t) { // pi function of t
|
||||
int n = (int)t.length();
|
||||
vector<int> pi(n);
|
||||
for (int i = 1; i < n; i++) {
|
||||
int j = pi[i - 1];
|
||||
while (j > 0 && t[i] != t[j]) j = pi[j - 1];
|
||||
if (t[i] == t[j]) j++;
|
||||
pi[i] = j;
|
||||
}
|
||||
return pi;
|
||||
}
|
||||
vector<int> calc_z(string t) { // z function of t
|
||||
int m = t.length();
|
||||
vector<int> z;
|
||||
z.push_back(m);
|
||||
pair<int, int> prev = {1, -1};
|
||||
for (int i = 1; i < m; ++i) {
|
||||
if (z[i - prev.first] + i <= prev.second) {
|
||||
z.push_back(z[i - prev.first]);
|
||||
} else {
|
||||
int j = max(i, prev.second + 1);
|
||||
while (j < m && t[j] == t[j - i]) ++j;
|
||||
z.push_back(j - i);
|
||||
prev = {i, j - 1};
|
||||
}
|
||||
}
|
||||
return z;
|
||||
}
|
||||
vector<int> kmp(string s, string t) { // find all t in s
|
||||
string cur = t + '#' + s;
|
||||
int sz1 = s.size(), sz2 = t.size();
|
||||
vector<int> v;
|
||||
vector<int> lps = calc_next(cur);
|
||||
for (int i = sz2 + 1; i <= sz1 + sz2; i++) {
|
||||
if (lps[i] == sz2) v.push_back(i - 2 * sz2);
|
||||
}
|
||||
return v;
|
||||
}
|
||||
int period(string s) { // find the length of shortest recurring period
|
||||
int n = s.length();
|
||||
auto z = calc_z(s);
|
||||
for (int i = 1; i <= n / 2; ++i) {
|
||||
if (n % i == 0 && z[i] == n - i) {
|
||||
return i;
|
||||
}
|
||||
}
|
||||
return n;
|
||||
}
|
||||
|
||||
/* modular arithmetic */
|
||||
template <ll mdl> struct MLL {
|
||||
ll val;
|
||||
MLL(ll v = 0) : val(mod(v, mdl)) {}
|
||||
MLL(const MLL<mdl>& other) : val(other.val) {}
|
||||
friend MLL operator+(const MLL& lhs, const MLL& rhs) { return mod(lhs.val + rhs.val, mdl); }
|
||||
friend MLL operator-(const MLL& lhs, const MLL& rhs) { return mod(lhs.val - rhs.val, mdl); }
|
||||
friend MLL operator*(const MLL& lhs, const MLL& rhs) { return mod(lhs.val * rhs.val, mdl); }
|
||||
friend MLL operator/(const MLL& lhs, const MLL& rhs) { return mod(lhs.val * mod(inverse(rhs.val, mdl), mdl), mdl); }
|
||||
friend MLL operator%(const MLL& lhs, const MLL& rhs) { return mod(lhs.val - (lhs / rhs).val, mdl); }
|
||||
friend bool operator==(const MLL& lhs, const MLL& rhs) { return lhs.val == rhs.val; }
|
||||
friend bool operator!=(const MLL& lhs, const MLL& rhs) { return lhs.val != rhs.val; }
|
||||
void operator+=(const MLL& rhs) { val = (*this + rhs).val; }
|
||||
void operator-=(const MLL& rhs) { val = (*this - rhs).val; }
|
||||
void operator*=(const MLL& rhs) { val = (*this * rhs).val; }
|
||||
void operator/=(const MLL& rhs) { val = (*this / rhs).val; }
|
||||
void operator%=(const MLL& rhs) { val = (*this % rhs).val; }
|
||||
};
|
||||
struct MLLd {
|
||||
ll val, mdl;
|
||||
MLLd(ll mdl, ll v = 0) : mdl(mdl), val(mod(v, mdl)) {}
|
||||
MLLd(const MLLd& other) : val(other.val) {}
|
||||
friend MLLd operator+(const MLLd& lhs, const MLLd& rhs) { return mod(lhs.val + rhs.val, lhs.mdl); }
|
||||
friend MLLd operator-(const MLLd& lhs, const MLLd& rhs) { return mod(lhs.val - rhs.val, lhs.mdl); }
|
||||
friend MLLd operator*(const MLLd& lhs, const MLLd& rhs) { return mod(lhs.val * rhs.val, lhs.mdl); }
|
||||
friend MLLd operator/(const MLLd& lhs, const MLLd& rhs) { return mod(lhs.val * mod(inverse(rhs.val, lhs.mdl), lhs.mdl), lhs.mdl); }
|
||||
friend MLLd operator%(const MLLd& lhs, const MLLd& rhs) { return mod(lhs.val - (lhs / rhs).val, lhs.mdl); }
|
||||
friend bool operator==(const MLLd& lhs, const MLLd& rhs) { return lhs.val == rhs.val; }
|
||||
friend bool operator!=(const MLLd& lhs, const MLLd& rhs) { return lhs.val != rhs.val; }
|
||||
void operator+=(const MLLd& rhs) { val = (*this + rhs).val; }
|
||||
void operator-=(const MLLd& rhs) { val = (*this - rhs).val; }
|
||||
void operator*=(const MLLd& rhs) { val = (*this * rhs).val; }
|
||||
void operator/=(const MLLd& rhs) { val = (*this / rhs).val; }
|
||||
void operator%=(const MLLd& rhs) { val = (*this % rhs).val; }
|
||||
};
|
||||
|
||||
template <ll mdl>
|
||||
ostream& operator<<(ostream& out, const MLL<mdl>& num) {
|
||||
return out << num.val;
|
||||
}
|
||||
|
||||
ostream& operator<<(ostream& out, const MLLd& num) {
|
||||
return out << num.val;
|
||||
}
|
||||
|
||||
template <ll mdl>
|
||||
istream& operator>>(istream& in, MLL<mdl>& num) {
|
||||
return in >> num.val;
|
||||
}
|
||||
|
||||
istream& operator>>(istream& in, MLLd& num) {
|
||||
return in >> num.val;
|
||||
}
|
||||
|
||||
// miscancellous
|
||||
template <typename Func, typename RandomIt> void sort_by_key(RandomIt first, RandomIt last, Func extractor) {
|
||||
std::sort(first, last, [&] (auto&& a, auto&& b) { return std::less<>()(extractor(a), extractor(b)); });
|
||||
}
|
||||
template <typename Func, typename RandomIt, typename Compare> void sort_by_key(RandomIt first, RandomIt last, Func extractor, Compare comp) {
|
||||
std::sort(first, last, [&] (auto&& a, auto&& b) { return comp(extractor(a), extractor(b)); });
|
||||
}
|
||||
template <typename T, typename U, typename Iterator_T, typename Iterator_U>
|
||||
vector<pair<T, U>> zip(Iterator_T a_first, Iterator_T a_last, Iterator_U b_first, Iterator_U b_last) {
|
||||
vector<pair<T, U>> res;
|
||||
auto a_it = a_first;
|
||||
auto b_it = b_first;
|
||||
for (; a_it != a_last and b_it != b_last; ++a_it, ++b_it) {
|
||||
res.emplace_back(*a_it, *b_it);
|
||||
}
|
||||
return res;
|
||||
}
|
||||
template <typename T, typename U, typename Iterator_T, typename Iterator_U>
|
||||
vector<pair<T, U>> zip_n(Iterator_T a_first, Iterator_U b_first, size_t n) {
|
||||
vector<pair<T, U>> res;
|
||||
if (n > 0) {
|
||||
res.emplace_back(*a_first, *b_first);
|
||||
for (size_t i = 1; i != n; ++i) {
|
||||
res.emplace_back(*++a_first, *++b_first);
|
||||
}
|
||||
}
|
||||
return res;
|
||||
}
|
||||
template <typename T>
|
||||
class ArithmeticIterator : bidirectional_iterator_tag {
|
||||
public:
|
||||
using difference_type = ptrdiff_t;
|
||||
using value_type = T;
|
||||
private:
|
||||
value_type value;
|
||||
public:
|
||||
ArithmeticIterator(const T& value) : value(value) {}
|
||||
value_type operator*() const { return value; }
|
||||
ArithmeticIterator<T>& operator++() { ++value; return *this; }
|
||||
ArithmeticIterator<T>& operator--() { --value; return *this; }
|
||||
bool operator==(const ArithmeticIterator<T>& rhs) const { return value == rhs.value; }
|
||||
};
|
||||
/////////////////////////////////////////////////////////
|
||||
|
||||
#define SINGLE_TEST_CASE
|
||||
// #define DUMP_TEST_CASE 7219
|
||||
// #define TOT_TEST_CASE 10000
|
||||
|
||||
void dump() {}
|
||||
|
||||
void dump_ignore() {}
|
||||
|
||||
void prep() {
|
||||
}
|
||||
|
||||
namespace Exgcd {
|
||||
template <typename T> T abs(T x) { return x < 0 ? -x : x; }
|
||||
template <typename T>
|
||||
struct exgcd_solution_t {
|
||||
T x, y, gcd;
|
||||
};
|
||||
template <typename T>
|
||||
struct diophantine_solution_t {
|
||||
exgcd_solution_t<T> x_min, y_min;
|
||||
T range;
|
||||
};
|
||||
// solve `ax + by = gcd(a, b)`
|
||||
template <typename T>
|
||||
optional<exgcd_solution_t<T>> exgcd(T a, T b) {
|
||||
if (a < 0 || b < 0 || a == 0 && b == 0) return nullopt;
|
||||
T x, y, g;
|
||||
function<void(T, T)> __exgcd = [&__exgcd, &x, &y, &g] (T a, T b) -> void {
|
||||
if (b == 0) {
|
||||
g = a, x = 1, y = 0;
|
||||
} else {
|
||||
__exgcd(b, a % b);
|
||||
swap(x, y);
|
||||
y -= a / b * x;
|
||||
}
|
||||
};
|
||||
__exgcd(a, b);
|
||||
return {{ x, y, g }};
|
||||
};
|
||||
template <typename T>
|
||||
optional<T> inverse(T a, T b) {
|
||||
auto raw = exgcd(a, b);
|
||||
if (raw == nullopt || raw.value().gcd != 1) {
|
||||
return nullopt;
|
||||
} else {
|
||||
return mod(raw.value().x, b);
|
||||
}
|
||||
}
|
||||
// solve { x = a_i (mod n_i) } if n_i's are coprime
|
||||
template <typename T>
|
||||
optional<T> crt(const vector<pair<T, T>>& equations) {
|
||||
T prod = 1;
|
||||
for (auto&& [a, n] : equations) {
|
||||
prod *= n;
|
||||
}
|
||||
T res = 0;
|
||||
for (auto&& [a, n] : equations) {
|
||||
T m = prod / n;
|
||||
auto m_rev = inverse(m, n);
|
||||
if (m_rev == nullopt) return nullopt;
|
||||
res = mod(res + a * mod(m * m_rev.value(), prod), prod);
|
||||
}
|
||||
return res;
|
||||
}
|
||||
// find minimal non-negative integral solutions of `ax + by = c`. It's not guaranteed that the other variable is non-negative.
|
||||
template <typename T>
|
||||
optional<diophantine_solution_t<T>> diophantine(T a, T b, T c, bool force_positive = false) {
|
||||
if (a < 0 || b < 0 || a == 0 && b == 0) return nullopt;
|
||||
auto raw = exgcd(a, b).value();
|
||||
if (c % raw.gcd) {
|
||||
return nullopt;
|
||||
} else {
|
||||
T x = raw.x * c / raw.gcd, y = raw.y * c / raw.gcd;
|
||||
T kx = force_positive ? (x <= 0 ? (-x) * raw.gcd / b + 1 : 1 - (x + b / raw.gcd - 1) * raw.gcd / b) : (x <= 0 ? ((-x) + b / raw.gcd - 1) * raw.gcd / b : (- x * raw.gcd / b));
|
||||
T ky = force_positive ? (y <= 0 ? (- 1 - (-y) * raw.gcd / a) : (y + a / raw.gcd - 1) * raw.gcd / a - 1) : (y <= 0 ? (- ((-y) + a / raw.gcd - 1) * raw.gcd / a) : y * raw.gcd / a);
|
||||
return {{ { x + b * kx / raw.gcd , y - a * kx / raw.gcd , raw.gcd }, { x + b * ky / raw.gcd , y - a * ky / raw.gcd, raw.gcd }, abs(kx - ky) + 1 }};
|
||||
}
|
||||
}
|
||||
// find the minimal non-negative integral solution of `ax = b (mod n)`
|
||||
template <typename T>
|
||||
optional<T> congruential(T a, T b, T n) {
|
||||
if (a == 0) {
|
||||
if (b != 0) return nullopt;
|
||||
return 0;
|
||||
}
|
||||
if (a < 0 && a != LLONG_MIN && b != LLONG_MIN) a = -a, b = -b;
|
||||
auto sol = diophantine(a, n, b);
|
||||
if (sol == nullopt) {
|
||||
return nullopt;
|
||||
} else {
|
||||
return sol.value().x_min.x;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
void solve() {
|
||||
read(ll, n);
|
||||
readvec(pll, a, n);
|
||||
sort_by_key(a.begin(), a.end(), [] (const pii& x) { return x.first - x.second; }, greater());
|
||||
ll tot = 0;
|
||||
for (int i = 0; i < n; ++i) {
|
||||
tot += a[i].second;
|
||||
}
|
||||
vector<ll> val(n + 1);
|
||||
val[0] = tot;
|
||||
for (int i = 0; i < n; ++i) {
|
||||
tot += a[i].first - a[i].second;
|
||||
val[i + 1] = tot;
|
||||
}
|
||||
read(int, m);
|
||||
while (m--) {
|
||||
read(ll, p, q);
|
||||
// xp+yq=n
|
||||
auto sol = Exgcd::diophantine(p, q, n);
|
||||
if (sol == nullopt or sol->x_min.y < 0) {
|
||||
cout << -1 << '\n';
|
||||
} else {
|
||||
ll x0 = sol->x_min.x, y0 = sol->x_min.y, g = sol->x_min.gcd;
|
||||
// binary search on k, s.t.
|
||||
// x=x0+k*q/gcd, y=y0-k*p/gcd
|
||||
ll l = 0, r = y0 * g / p;
|
||||
while (l < r) {
|
||||
ll mid = l + r + 1 >> 1;
|
||||
if (mid - 1 >= 0 and val[(x0 + (mid - 1) * q / g) * p] >= val[(x0 + mid * q / g) * p]) {
|
||||
r = mid - 1;
|
||||
} else {
|
||||
l = mid;
|
||||
}
|
||||
}
|
||||
cout << val[(x0 + l * q / g) * p] << '\n';
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
int main() {
|
||||
#if __cplusplus < 201703L || defined(_MSC_VER) && !defined(__clang__)
|
||||
assert(false && "incompatible compiler variant detected.");
|
||||
#endif
|
||||
untie, cout.tie(NULL);
|
||||
prep();
|
||||
#ifdef SINGLE_TEST_CASE
|
||||
solve();
|
||||
#else
|
||||
read(int, t);
|
||||
for (int i = 0; i < t; ++i) {
|
||||
#ifdef DUMP_TEST_CASE
|
||||
if (t != (TOT_TEST_CASE)) {
|
||||
solve();
|
||||
} else if (i + 1 == (DUMP_TEST_CASE)) {
|
||||
dump();
|
||||
} else {
|
||||
dump_ignore();
|
||||
}
|
||||
#else
|
||||
solve();
|
||||
#endif
|
||||
}
|
||||
#endif
|
||||
}
|
||||
|
|
@ -0,0 +1,545 @@
|
|||
#pragma GCC optimize("Ofast")
|
||||
/////////////////////////////////////////////////////////
|
||||
/**
|
||||
* Useful Macros
|
||||
* by subcrip
|
||||
* (requires C++17)
|
||||
*/
|
||||
|
||||
#include<bits/stdc++.h>
|
||||
using namespace std;
|
||||
|
||||
/* macro helpers */
|
||||
#define __NARGS(...) std::tuple_size<decltype(std::make_tuple(__VA_ARGS__))>::value
|
||||
#define __DECOMPOSE_S(a, x) auto x = a;
|
||||
#define __DECOMPOSE_N(a, ...) auto [__VA_ARGS__] = a;
|
||||
constexpr void __() {}
|
||||
#define __AS_PROCEDURE(...) __(); __VA_ARGS__; __()
|
||||
#define __as_typeof(container) remove_reference<decltype(container)>::type
|
||||
|
||||
/* type aliases */
|
||||
#if LONG_LONG_MAX != INT64_MAX
|
||||
using ll = int64_t;
|
||||
using ull = uint64_t;
|
||||
#else
|
||||
using ll = long long;
|
||||
using ull = unsigned long long;
|
||||
using ld = long double;
|
||||
#endif
|
||||
using int128 = __int128_t;
|
||||
using uint128 = __uint128_t;
|
||||
using ld = long double;
|
||||
using pii = pair<int, int>;
|
||||
using pil = pair<int, ll>;
|
||||
using pli = pair<ll, int>;
|
||||
using pll = pair<ll, ll>;
|
||||
using pid = pair<int, ld>;
|
||||
using pdi = pair<ld, int>;
|
||||
using pld = pair<ll, ld>;
|
||||
using pdl = pair<ld, ll>;
|
||||
using pdd = pair<ld, ld>;
|
||||
using tlll = tuple<ll, ll, ll>;
|
||||
using tlld = tuple<ll, ll, ld>;
|
||||
using tlli = tuple<ll, ll, int>;
|
||||
using tldl = tuple<ll, ld, ll>;
|
||||
using tldd = tuple<ll, ld, ld>;
|
||||
using tldi = tuple<ll, ld, int>;
|
||||
using tlil = tuple<ll, int, ll>;
|
||||
using tlid = tuple<ll, int, ld>;
|
||||
using tlii = tuple<ll, int, int>;
|
||||
using tdll = tuple<ld, ll, ll>;
|
||||
using tdld = tuple<ld, ll, ld>;
|
||||
using tdli = tuple<ld, ll, int>;
|
||||
using tddl = tuple<ld, ld, ll>;
|
||||
using tddd = tuple<ld, ld, ld>;
|
||||
using tddi = tuple<ld, ld, int>;
|
||||
using tdil = tuple<ld, int, ll>;
|
||||
using tdid = tuple<ld, int, ld>;
|
||||
using tdii = tuple<ld, int, int>;
|
||||
using till = tuple<int, ll, ll>;
|
||||
using tild = tuple<int, ll, ld>;
|
||||
using tili = tuple<int, ll, int>;
|
||||
using tidl = tuple<int, ld, ll>;
|
||||
using tidd = tuple<int, ld, ld>;
|
||||
using tidi = tuple<int, ld, int>;
|
||||
using tiil = tuple<int, int, ll>;
|
||||
using tiid = tuple<int, int, ld>;
|
||||
using tiii = tuple<int, int, int>;
|
||||
template <typename T> using max_heap = priority_queue<T>;
|
||||
template <typename T> using min_heap = priority_queue<T, vector<T>, greater<>>;
|
||||
template <typename T> using oi = ostream_iterator<T>;
|
||||
template <typename T> using ii = istream_iterator<T>;
|
||||
|
||||
/* constants */
|
||||
constexpr int INF = 0x3f3f3f3f;
|
||||
constexpr ll INFLL = 0x3f3f3f3f3f3f3f3fLL;
|
||||
constexpr ll MDL = 1e9 + 7;
|
||||
constexpr ll PRIME = 998'244'353;
|
||||
constexpr ll MDL1 = 8784491;
|
||||
constexpr ll MDL2 = PRIME;
|
||||
constexpr int128 INT128_MAX = numeric_limits<int128>::max();
|
||||
constexpr uint128 UINT128_MAX = numeric_limits<uint128>::max();
|
||||
constexpr int128 INT128_MIN = numeric_limits<int128>::min();
|
||||
constexpr uint128 UINT128_MIN = numeric_limits<uint128>::min();
|
||||
|
||||
/* random */
|
||||
|
||||
mt19937 rd(chrono::duration_cast<chrono::milliseconds>(chrono::system_clock::now().time_since_epoch()).count());
|
||||
|
||||
/* bit-wise operations */
|
||||
#define lowbit(x) ((x) & -(x))
|
||||
#define popcount(x) (__builtin_popcountll(ll(x)))
|
||||
#define parity(x) (__builtin_parityll(ll(x)))
|
||||
#define msp(x) (63LL - __builtin_clzll(ll(x)))
|
||||
#define lsp(x) (__builtin_ctzll(ll(x)))
|
||||
|
||||
/* arithmetic operations */
|
||||
#define mod(x, y) ((((x) % (y)) + (y)) % (y))
|
||||
|
||||
/* fast pairs */
|
||||
#define upair ull
|
||||
#define umake(x, y) (ull(x) << 32 | (ull(y) & ((1ULL << 32) - 1)))
|
||||
#define u1(p) ((p) >> 32)
|
||||
#define u2(p) ((p) & ((1ULL << 32) - 1))
|
||||
#define ult std::less<upair>
|
||||
#define ugt std::greater<upair>
|
||||
|
||||
#define ipair ull
|
||||
#define imake(x, y) (umake(x, y))
|
||||
#define i1(p) (int(u1(ll(p))))
|
||||
#define i2(p) (ll(u2(p) << 32) >> 32)
|
||||
struct ilt {
|
||||
bool operator()(const ipair& a, const ipair& b) const {
|
||||
if (i1(a) == i1(b)) return i2(a) < i2(b);
|
||||
else return i1(a) < i1(b);
|
||||
}
|
||||
};
|
||||
struct igt {
|
||||
bool operator()(const ipair& a, const ipair& b) const {
|
||||
if (i1(a) == i1(b)) return i2(a) > i2(b);
|
||||
else return i1(a) > i1(b);
|
||||
}
|
||||
};
|
||||
|
||||
/* conditions */
|
||||
#define loop while (1)
|
||||
#define if_or(var, val) if (!(var == val)) var = val; else
|
||||
#define continue_or(var, val) __AS_PROCEDURE(if (var == val) continue; var = val;)
|
||||
#define break_or(var, val) __AS_PROCEDURE(if (var == val) break; var = val;)
|
||||
|
||||
/* hash */
|
||||
struct safe_hash {
|
||||
// https://codeforces.com/blog/entry/62393
|
||||
static uint64_t splitmix64(uint64_t x) {
|
||||
// http://xorshift.di.unimi.it/splitmix64.c
|
||||
x += 0x9e3779b97f4a7c15;
|
||||
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
|
||||
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
|
||||
return x ^ (x >> 31);
|
||||
}
|
||||
|
||||
size_t operator()(uint64_t x) const {
|
||||
static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
|
||||
return splitmix64(x + FIXED_RANDOM);
|
||||
}
|
||||
};
|
||||
|
||||
struct pair_hash {
|
||||
template <typename T, typename U>
|
||||
size_t operator()(const pair<T, U>& a) const {
|
||||
auto hash1 = safe_hash()(a.first);
|
||||
auto hash2 = safe_hash()(a.second);
|
||||
if (hash1 != hash2) {
|
||||
return hash1 ^ hash2;
|
||||
}
|
||||
return hash1;
|
||||
}
|
||||
};
|
||||
|
||||
uniform_int_distribution<mt19937::result_type> dist(PRIME);
|
||||
const size_t __array_hash_b = 31, __array_hash_mdl1 = dist(rd), __array_hash_mdl2 = dist(rd);
|
||||
struct array_hash {
|
||||
template <typename Sequence>
|
||||
size_t operator()(const Sequence& arr) const {
|
||||
size_t pw1 = 1, pw2 = 1;
|
||||
size_t res1 = 0, res2 = 0;
|
||||
for (auto&& x : arr) {
|
||||
res1 = (res1 + x * pw1) % __array_hash_mdl1;
|
||||
res2 = (res2 + x * pw2) % __array_hash_mdl2;
|
||||
pw1 = (pw1 * __array_hash_b) % __array_hash_mdl1;
|
||||
pw2 = (pw2 * __array_hash_b) % __array_hash_mdl2;
|
||||
}
|
||||
return res1 + res2;
|
||||
}
|
||||
};
|
||||
|
||||
/* build data structures */
|
||||
#define unordered_counter(from, to) __AS_PROCEDURE(unordered_map<__as_typeof(from), size_t, safe_hash> to; for (auto&& x : from) ++to[x];)
|
||||
#define counter(from, to, cmp) __AS_PROCEDURE(map<__as_typeof(from), size_t, cmp> to; for (auto&& x : from) ++to[x];)
|
||||
#define pa(a) __AS_PROCEDURE(__typeof(a) pa; pa.push_back({}); for (auto&&x : a) pa.push_back(pa.back() + x);)
|
||||
#define sa(a) __AS_PROCEDURE(__typeof(a) sa(a.size() + 1); {int n = a.size(); for (int i = n - 1; i >= 0; --i) sa[i] = sa[i + 1] + a[i];};)
|
||||
#define adj(ch, n) __AS_PROCEDURE(vector<vector<int>> ch((n) + 1);)
|
||||
#define edge(ch, u, v) __AS_PROCEDURE(ch[u].push_back(v), ch[v].push_back(u);)
|
||||
#define edgew(ch, u, v, w) __AS_PROCEDURE(ch[u].emplace_back(v, w), ch[v].emplace_back(u, w);)
|
||||
#define Edge(ch, u, v) __AS_PROCEDURE(ch[u].push_back(v);)
|
||||
#define Edgew(ch, u, v, w) __AS_PROCEDURE(ch[u].emplace_back(v, w);)
|
||||
template <typename T, typename Iterator> pair<size_t, map<T, size_t>> discretize(Iterator __first, Iterator __last) {
|
||||
set<T> st(__first, __last);
|
||||
size_t N = 0;
|
||||
map<T, size_t> mp;
|
||||
for (auto&& x : st) mp[x] = ++N;
|
||||
return {N, mp};
|
||||
}
|
||||
template <typename T, typename Iterator> pair<size_t, unordered_map<T, size_t, safe_hash>> unordered_discretize(Iterator __first, Iterator __last) {
|
||||
set<T> st(__first, __last);
|
||||
size_t N = 0;
|
||||
unordered_map<T, size_t, safe_hash> mp;
|
||||
for (auto&& x : st) mp[x] = ++N;
|
||||
return {N, mp};
|
||||
}
|
||||
|
||||
/* io */
|
||||
#define untie __AS_PROCEDURE(ios_base::sync_with_stdio(0), cin.tie(NULL))
|
||||
template<typename T> void __read(T& x) { cin >> x; }
|
||||
template<typename T, typename... U> void __read(T& x, U&... args) { cin >> x; __read(args...); }
|
||||
#define read(type, ...) __AS_PROCEDURE(type __VA_ARGS__; __read(__VA_ARGS__);)
|
||||
#define readvec(type, a, n) __AS_PROCEDURE(vector<type> a(n); for (auto& x : a) cin >> x;)
|
||||
#define readvec1(type, a, n) __AS_PROCEDURE(vector<type> a((n) + 1); copy_n(ii<type>(cin), (n), a.begin() + 1);)
|
||||
#define putvec(a) __AS_PROCEDURE(copy(a.begin(), a.end(), oi<__as_typeof(a)::value_type>(cout, " ")); cout << endl;)
|
||||
#define putvec1(a) __AS_PROCEDURE(copy(a.begin() + 1, a.end(), oi<__as_typeof(a)::value_type>(cout, " ")); cout << endl;)
|
||||
#define putvec_eol(a) __AS_PROCEDURE(copy(a.begin(), a.end(), oi<__as_typeof(a)::value_type>(cout, "\n"));)
|
||||
#define putvec1_eol(a) __AS_PROCEDURE(copy(a.begin() + 1, a.end(), oi<__as_typeof(a)::value_type>(cout, "\n"));)
|
||||
#define debug(x) __AS_PROCEDURE(cerr << #x" = " << (x) << endl;)
|
||||
#define debugvec(a) __AS_PROCEDURE(cerr << #a" = "; for (auto&& x : a) cerr << x << ' '; cerr << endl;)
|
||||
template<typename T, typename U> istream& operator>>(istream& in, pair<T, U>& p) {
|
||||
return in >> p.first >> p.second;
|
||||
}
|
||||
template<typename T, typename U> ostream& operator<<(ostream& out, const pair<T, U>& p) {
|
||||
out << "{" << p.first << ", " << p.second << "}";
|
||||
return out;
|
||||
}
|
||||
template<typename Char, typename Traits, typename Tuple, std::size_t... Index>
|
||||
void print_tuple_impl(std::basic_ostream<Char, Traits>& os, const Tuple& t, std::index_sequence<Index...>) {
|
||||
using swallow = int[]; // guaranties left to right order
|
||||
(void)swallow { 0, (void(os << (Index == 0 ? "" : ", ") << std::get<Index>(t)), 0)... };
|
||||
}
|
||||
template<typename Char, typename Traits, typename... Args>
|
||||
decltype(auto) operator<<(std::basic_ostream<Char, Traits>& os, const std::tuple<Args...>& t) {
|
||||
os << "{";
|
||||
print_tuple_impl(os, t, std::index_sequence_for<Args...>{});
|
||||
return os << "}";
|
||||
}
|
||||
template<typename T> ostream& operator<<(ostream& out, const vector<T>& vec) {
|
||||
for (auto&& i : vec) out << i << ' ';
|
||||
return out;
|
||||
}
|
||||
std::ostream& operator<<(std::ostream& dest, const int128& value) {
|
||||
// https://stackoverflow.com/a/25115163/23881100
|
||||
std::ostream::sentry s( dest );
|
||||
if ( s ) {
|
||||
uint128 tmp = value < 0 ? -value : value;
|
||||
char buffer[ 128 ];
|
||||
char* d = std::end( buffer );
|
||||
do {
|
||||
-- d;
|
||||
*d = "0123456789"[ tmp % 10 ];
|
||||
tmp /= 10;
|
||||
} while ( tmp != 0 );
|
||||
if ( value < 0 ) {
|
||||
-- d;
|
||||
*d = '-';
|
||||
}
|
||||
int len = std::end( buffer ) - d;
|
||||
if ( dest.rdbuf()->sputn( d, len ) != len ) {
|
||||
dest.setstate( std::ios_base::badbit );
|
||||
}
|
||||
}
|
||||
return dest;
|
||||
}
|
||||
|
||||
/* pops */
|
||||
#define poptop(q, ...) __AS_PROCEDURE(auto [__VA_ARGS__] = q.top(); q.pop();)
|
||||
#define popback(q, ...) __AS_PROCEDURE(auto [__VA_ARGS__] = q.back(); q.pop_back();)
|
||||
#define popfront(q, ...) __AS_PROCEDURE(auto [__VA_ARGS__] = q.front();q.pop_front();)
|
||||
|
||||
/* math */
|
||||
constexpr inline int lg2(ll x) { return x == 0 ? -1 : sizeof(ll) * 8 - 1 - __builtin_clzll(x); }
|
||||
|
||||
void __exgcd(ll a, ll b, ll& x, ll& y) {
|
||||
if (b == 0) {
|
||||
x = 1, y = 0;
|
||||
return;
|
||||
}
|
||||
__exgcd(b, a % b, y, x);
|
||||
y -= a / b * x;
|
||||
}
|
||||
|
||||
ll inverse(ll a, ll b) {
|
||||
ll x, y;
|
||||
__exgcd(a, b, x, y);
|
||||
return mod(x, b);
|
||||
}
|
||||
|
||||
vector<tuple<int, int, ll>> decompose(ll x) {
|
||||
// return (factor, count, factor ** count)
|
||||
vector<tuple<int, int, ll>> res;
|
||||
for (int i = 2; i * i <= x; i++) {
|
||||
if (x % i == 0) {
|
||||
int cnt = 0;
|
||||
ll pw = 1;
|
||||
while (x % i == 0) ++cnt, x /= i, pw *= i;
|
||||
res.emplace_back(i, cnt, pw);
|
||||
}
|
||||
}
|
||||
if (x != 1) {
|
||||
res.emplace_back(x, 1, x);
|
||||
}
|
||||
return res;
|
||||
}
|
||||
|
||||
vector<pii> decompose_prime(int N) {
|
||||
// return (factor, count)
|
||||
vector<pii> result;
|
||||
for (int i = 2; i * i <= N; i++) {
|
||||
if (N % i == 0) {
|
||||
int cnt = 0;
|
||||
while (N % i == 0) N /= i, ++cnt;
|
||||
result.emplace_back(i, cnt);
|
||||
}
|
||||
}
|
||||
if (N != 1) {
|
||||
result.emplace_back(N, 1);
|
||||
}
|
||||
return result;
|
||||
}
|
||||
|
||||
/* string algorithms */
|
||||
vector<int> calc_next(string t) { // pi function of t
|
||||
int n = (int)t.length();
|
||||
vector<int> pi(n);
|
||||
for (int i = 1; i < n; i++) {
|
||||
int j = pi[i - 1];
|
||||
while (j > 0 && t[i] != t[j]) j = pi[j - 1];
|
||||
if (t[i] == t[j]) j++;
|
||||
pi[i] = j;
|
||||
}
|
||||
return pi;
|
||||
}
|
||||
vector<int> calc_z(string t) { // z function of t
|
||||
int m = t.length();
|
||||
vector<int> z;
|
||||
z.push_back(m);
|
||||
pair<int, int> prev = {1, -1};
|
||||
for (int i = 1; i < m; ++i) {
|
||||
if (z[i - prev.first] + i <= prev.second) {
|
||||
z.push_back(z[i - prev.first]);
|
||||
} else {
|
||||
int j = max(i, prev.second + 1);
|
||||
while (j < m && t[j] == t[j - i]) ++j;
|
||||
z.push_back(j - i);
|
||||
prev = {i, j - 1};
|
||||
}
|
||||
}
|
||||
return z;
|
||||
}
|
||||
vector<int> kmp(string s, string t) { // find all t in s
|
||||
string cur = t + '#' + s;
|
||||
int sz1 = s.size(), sz2 = t.size();
|
||||
vector<int> v;
|
||||
vector<int> lps = calc_next(cur);
|
||||
for (int i = sz2 + 1; i <= sz1 + sz2; i++) {
|
||||
if (lps[i] == sz2) v.push_back(i - 2 * sz2);
|
||||
}
|
||||
return v;
|
||||
}
|
||||
int period(string s) { // find the length of shortest recurring period
|
||||
int n = s.length();
|
||||
auto z = calc_z(s);
|
||||
for (int i = 1; i <= n / 2; ++i) {
|
||||
if (n % i == 0 && z[i] == n - i) {
|
||||
return i;
|
||||
}
|
||||
}
|
||||
return n;
|
||||
}
|
||||
|
||||
/* modular arithmetic */
|
||||
template <ll mdl> struct MLL {
|
||||
ll val;
|
||||
MLL(ll v = 0) : val(mod(v, mdl)) {}
|
||||
MLL(const MLL<mdl>& other) : val(other.val) {}
|
||||
friend MLL operator+(const MLL& lhs, const MLL& rhs) { return mod(lhs.val + rhs.val, mdl); }
|
||||
friend MLL operator-(const MLL& lhs, const MLL& rhs) { return mod(lhs.val - rhs.val, mdl); }
|
||||
friend MLL operator*(const MLL& lhs, const MLL& rhs) { return mod(lhs.val * rhs.val, mdl); }
|
||||
friend MLL operator/(const MLL& lhs, const MLL& rhs) { return mod(lhs.val * mod(inverse(rhs.val, mdl), mdl), mdl); }
|
||||
friend MLL operator%(const MLL& lhs, const MLL& rhs) { return mod(lhs.val - (lhs / rhs).val, mdl); }
|
||||
friend bool operator==(const MLL& lhs, const MLL& rhs) { return lhs.val == rhs.val; }
|
||||
friend bool operator!=(const MLL& lhs, const MLL& rhs) { return lhs.val != rhs.val; }
|
||||
void operator+=(const MLL& rhs) { val = (*this + rhs).val; }
|
||||
void operator-=(const MLL& rhs) { val = (*this - rhs).val; }
|
||||
void operator*=(const MLL& rhs) { val = (*this * rhs).val; }
|
||||
void operator/=(const MLL& rhs) { val = (*this / rhs).val; }
|
||||
void operator%=(const MLL& rhs) { val = (*this % rhs).val; }
|
||||
};
|
||||
struct MLLd {
|
||||
ll val, mdl;
|
||||
MLLd(ll mdl, ll v = 0) : mdl(mdl), val(mod(v, mdl)) {}
|
||||
MLLd(const MLLd& other) : val(other.val) {}
|
||||
friend MLLd operator+(const MLLd& lhs, const MLLd& rhs) { return mod(lhs.val + rhs.val, lhs.mdl); }
|
||||
friend MLLd operator-(const MLLd& lhs, const MLLd& rhs) { return mod(lhs.val - rhs.val, lhs.mdl); }
|
||||
friend MLLd operator*(const MLLd& lhs, const MLLd& rhs) { return mod(lhs.val * rhs.val, lhs.mdl); }
|
||||
friend MLLd operator/(const MLLd& lhs, const MLLd& rhs) { return mod(lhs.val * mod(inverse(rhs.val, lhs.mdl), lhs.mdl), lhs.mdl); }
|
||||
friend MLLd operator%(const MLLd& lhs, const MLLd& rhs) { return mod(lhs.val - (lhs / rhs).val, lhs.mdl); }
|
||||
friend bool operator==(const MLLd& lhs, const MLLd& rhs) { return lhs.val == rhs.val; }
|
||||
friend bool operator!=(const MLLd& lhs, const MLLd& rhs) { return lhs.val != rhs.val; }
|
||||
void operator+=(const MLLd& rhs) { val = (*this + rhs).val; }
|
||||
void operator-=(const MLLd& rhs) { val = (*this - rhs).val; }
|
||||
void operator*=(const MLLd& rhs) { val = (*this * rhs).val; }
|
||||
void operator/=(const MLLd& rhs) { val = (*this / rhs).val; }
|
||||
void operator%=(const MLLd& rhs) { val = (*this % rhs).val; }
|
||||
};
|
||||
|
||||
template <ll mdl>
|
||||
ostream& operator<<(ostream& out, const MLL<mdl>& num) {
|
||||
return out << num.val;
|
||||
}
|
||||
|
||||
ostream& operator<<(ostream& out, const MLLd& num) {
|
||||
return out << num.val;
|
||||
}
|
||||
|
||||
template <ll mdl>
|
||||
istream& operator>>(istream& in, MLL<mdl>& num) {
|
||||
return in >> num.val;
|
||||
}
|
||||
|
||||
istream& operator>>(istream& in, MLLd& num) {
|
||||
return in >> num.val;
|
||||
}
|
||||
|
||||
// miscancellous
|
||||
template <typename Func, typename RandomIt> void sort_by_key(RandomIt first, RandomIt last, Func extractor) {
|
||||
std::sort(first, last, [&] (auto&& a, auto&& b) { return std::less<>()(extractor(a), extractor(b)); });
|
||||
}
|
||||
template <typename Func, typename RandomIt, typename Compare> void sort_by_key(RandomIt first, RandomIt last, Func extractor, Compare comp) {
|
||||
std::sort(first, last, [&] (auto&& a, auto&& b) { return comp(extractor(a), extractor(b)); });
|
||||
}
|
||||
template <typename T, typename U, typename Iterator_T, typename Iterator_U>
|
||||
vector<pair<T, U>> zip(Iterator_T a_first, Iterator_T a_last, Iterator_U b_first, Iterator_U b_last) {
|
||||
vector<pair<T, U>> res;
|
||||
auto a_it = a_first;
|
||||
auto b_it = b_first;
|
||||
for (; a_it != a_last and b_it != b_last; ++a_it, ++b_it) {
|
||||
res.emplace_back(*a_it, *b_it);
|
||||
}
|
||||
return res;
|
||||
}
|
||||
template <typename T, typename U, typename Iterator_T, typename Iterator_U>
|
||||
vector<pair<T, U>> zip_n(Iterator_T a_first, Iterator_U b_first, size_t n) {
|
||||
vector<pair<T, U>> res;
|
||||
if (n > 0) {
|
||||
res.emplace_back(*a_first, *b_first);
|
||||
for (size_t i = 1; i != n; ++i) {
|
||||
res.emplace_back(*++a_first, *++b_first);
|
||||
}
|
||||
}
|
||||
return res;
|
||||
}
|
||||
template <typename T>
|
||||
class ArithmeticIterator : bidirectional_iterator_tag {
|
||||
public:
|
||||
using difference_type = ptrdiff_t;
|
||||
using value_type = T;
|
||||
private:
|
||||
value_type value;
|
||||
public:
|
||||
ArithmeticIterator(const T& value) : value(value) {}
|
||||
value_type operator*() const { return value; }
|
||||
ArithmeticIterator<T>& operator++() { ++value; return *this; }
|
||||
ArithmeticIterator<T>& operator--() { --value; return *this; }
|
||||
bool operator==(const ArithmeticIterator<T>& rhs) const { return value == rhs.value; }
|
||||
};
|
||||
/////////////////////////////////////////////////////////
|
||||
|
||||
// #define SINGLE_TEST_CASE
|
||||
// #define DUMP_TEST_CASE 7219
|
||||
// #define TOT_TEST_CASE 10000
|
||||
|
||||
void dump() {}
|
||||
|
||||
void dump_ignore() {}
|
||||
|
||||
void prep() {
|
||||
}
|
||||
|
||||
void solve() {
|
||||
using mll = MLL<MDL>;
|
||||
read(string, s);
|
||||
read(string, t);
|
||||
int n = s.size(), m = t.size();
|
||||
vector<bool> mark(n);
|
||||
for (int i = 0; i <= n - m; ++i) {
|
||||
mark[i] = 1;
|
||||
for (int j = 0; j < m; ++j) {
|
||||
if (t[j] != s[i + j]) {
|
||||
mark[i] = 0;
|
||||
break;
|
||||
}
|
||||
}
|
||||
}
|
||||
vector<array<pair<int, mll>, 2>> dp(n + 1, {make_pair(INF, 0), make_pair(INF, 0)});
|
||||
dp[n][0] = {0, 1};
|
||||
auto get = [] (const pair<int, mll>& a, const pair<int, mll>& b) -> pair<int, mll> {
|
||||
if (b.first < a.first) {
|
||||
return b;
|
||||
} else if (b.first == a.first) {
|
||||
return {a.first, a.second + b.second};
|
||||
} else {
|
||||
return a;
|
||||
}
|
||||
};
|
||||
for (int i = n - 1; ~i; --i) {
|
||||
if (mark[i]) {
|
||||
for (int j = 1; j < m; ++j) {
|
||||
dp[i][0] = get(dp[i][0], dp[i + j][1]);
|
||||
}
|
||||
dp[i][1] = get({1 + dp[i + m][1].first, dp[i + m][1].second}, {1 + dp[i + m][0].first, dp[i + m][0].second});
|
||||
} else {
|
||||
dp[i][0] = get(dp[i + 1][0], dp[i + 1][1]);
|
||||
}
|
||||
}
|
||||
if (dp[0][0].first < dp[0][1].first) {
|
||||
cout << dp[0][0].first << ' ' << dp[0][0].second << '\n';
|
||||
} else if (dp[0][0].first == dp[0][1].first) {
|
||||
cout << dp[0][0].first << ' ' << dp[0][0].second + dp[0][1].second << '\n';
|
||||
} else {
|
||||
cout << dp[0][1].first << ' ' << dp[0][1].second << '\n';
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
int main() {
|
||||
#if __cplusplus < 201703L || defined(_MSC_VER) && !defined(__clang__)
|
||||
assert(false && "incompatible compiler variant detected.");
|
||||
#endif
|
||||
untie, cout.tie(NULL);
|
||||
prep();
|
||||
#ifdef SINGLE_TEST_CASE
|
||||
solve();
|
||||
#else
|
||||
read(int, t);
|
||||
for (int i = 0; i < t; ++i) {
|
||||
#ifdef DUMP_TEST_CASE
|
||||
if (t != (TOT_TEST_CASE)) {
|
||||
solve();
|
||||
} else if (i + 1 == (DUMP_TEST_CASE)) {
|
||||
dump();
|
||||
} else {
|
||||
dump_ignore();
|
||||
}
|
||||
#else
|
||||
solve();
|
||||
#endif
|
||||
}
|
||||
#endif
|
||||
}
|
||||
|
|
@ -480,6 +480,7 @@ void solve() {
|
|||
vector<tlii> info;
|
||||
int zero_cnt_l = 0, zero_cnt_r = 0;
|
||||
for (int i = 0; i < n; ++i) {
|
||||
if (i >= r) break;
|
||||
if (a[i] == 0) {
|
||||
if (zero_cnt_l == 0) {
|
||||
while (a[r] == 0) {
|
||||
|
|
@ -509,6 +510,16 @@ void solve() {
|
|||
zero_cnt_l = 0;
|
||||
zero_cnt_r = 0;
|
||||
}
|
||||
int m = info.size();
|
||||
MLL<PRIME> res = 1;
|
||||
for (int i = 0; i < m; ++i) {
|
||||
auto [v, l, r] = info[i];
|
||||
if (v == 0) {
|
||||
if (i != 0 and i != m - 1) {
|
||||
res = (res * pw2[l] * pw2[r]) + (res * pw3[])
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
int main() {
|
||||
|
|
|
|||
|
|
@ -0,0 +1,700 @@
|
|||
#pragma GCC optimize("Ofast")
|
||||
/////////////////////////////////////////////////////////
|
||||
/**
|
||||
* Useful Macros
|
||||
* by subcrip
|
||||
* (requires C++17)
|
||||
*/
|
||||
|
||||
#include<bits/stdc++.h>
|
||||
using namespace std;
|
||||
|
||||
/* macro helpers */
|
||||
#define __NARGS(...) std::tuple_size<decltype(std::make_tuple(__VA_ARGS__))>::value
|
||||
#define __DECOMPOSE_S(a, x) auto x = a;
|
||||
#define __DECOMPOSE_N(a, ...) auto [__VA_ARGS__] = a;
|
||||
constexpr void __() {}
|
||||
#define __AS_PROCEDURE(...) __(); __VA_ARGS__; __()
|
||||
#define __as_typeof(container) remove_reference<decltype(container)>::type
|
||||
|
||||
/* type aliases */
|
||||
#if LONG_LONG_MAX != INT64_MAX
|
||||
using ll = int64_t;
|
||||
using ull = uint64_t;
|
||||
#else
|
||||
using ll = long long;
|
||||
using ull = unsigned long long;
|
||||
using ld = long double;
|
||||
#endif
|
||||
using int128 = __int128_t;
|
||||
using uint128 = __uint128_t;
|
||||
using ld = long double;
|
||||
using pii = pair<int, int>;
|
||||
using pil = pair<int, ll>;
|
||||
using pli = pair<ll, int>;
|
||||
using pll = pair<ll, ll>;
|
||||
using pid = pair<int, ld>;
|
||||
using pdi = pair<ld, int>;
|
||||
using pld = pair<ll, ld>;
|
||||
using pdl = pair<ld, ll>;
|
||||
using pdd = pair<ld, ld>;
|
||||
using tlll = tuple<ll, ll, ll>;
|
||||
using tlld = tuple<ll, ll, ld>;
|
||||
using tlli = tuple<ll, ll, int>;
|
||||
using tldl = tuple<ll, ld, ll>;
|
||||
using tldd = tuple<ll, ld, ld>;
|
||||
using tldi = tuple<ll, ld, int>;
|
||||
using tlil = tuple<ll, int, ll>;
|
||||
using tlid = tuple<ll, int, ld>;
|
||||
using tlii = tuple<ll, int, int>;
|
||||
using tdll = tuple<ld, ll, ll>;
|
||||
using tdld = tuple<ld, ll, ld>;
|
||||
using tdli = tuple<ld, ll, int>;
|
||||
using tddl = tuple<ld, ld, ll>;
|
||||
using tddd = tuple<ld, ld, ld>;
|
||||
using tddi = tuple<ld, ld, int>;
|
||||
using tdil = tuple<ld, int, ll>;
|
||||
using tdid = tuple<ld, int, ld>;
|
||||
using tdii = tuple<ld, int, int>;
|
||||
using till = tuple<int, ll, ll>;
|
||||
using tild = tuple<int, ll, ld>;
|
||||
using tili = tuple<int, ll, int>;
|
||||
using tidl = tuple<int, ld, ll>;
|
||||
using tidd = tuple<int, ld, ld>;
|
||||
using tidi = tuple<int, ld, int>;
|
||||
using tiil = tuple<int, int, ll>;
|
||||
using tiid = tuple<int, int, ld>;
|
||||
using tiii = tuple<int, int, int>;
|
||||
template <typename T> using max_heap = priority_queue<T>;
|
||||
template <typename T> using min_heap = priority_queue<T, vector<T>, greater<>>;
|
||||
template <typename T> using oi = ostream_iterator<T>;
|
||||
template <typename T> using ii = istream_iterator<T>;
|
||||
|
||||
/* constants */
|
||||
constexpr int INF = 0x3f3f3f3f;
|
||||
constexpr ll INFLL = 0x3f3f3f3f3f3f3f3fLL;
|
||||
constexpr ll MDL = 1e9 + 7;
|
||||
constexpr ll PRIME = 998'244'353;
|
||||
constexpr ll MDL1 = 8784491;
|
||||
constexpr ll MDL2 = PRIME;
|
||||
constexpr int128 INT128_MAX = numeric_limits<int128>::max();
|
||||
constexpr uint128 UINT128_MAX = numeric_limits<uint128>::max();
|
||||
constexpr int128 INT128_MIN = numeric_limits<int128>::min();
|
||||
constexpr uint128 UINT128_MIN = numeric_limits<uint128>::min();
|
||||
|
||||
/* random */
|
||||
|
||||
mt19937 rd(chrono::duration_cast<chrono::milliseconds>(chrono::system_clock::now().time_since_epoch()).count());
|
||||
|
||||
/* bit-wise operations */
|
||||
#define lowbit(x) ((x) & -(x))
|
||||
#define popcount(x) (__builtin_popcountll(ll(x)))
|
||||
#define parity(x) (__builtin_parityll(ll(x)))
|
||||
#define msp(x) (63LL - __builtin_clzll(ll(x)))
|
||||
#define lsp(x) (__builtin_ctzll(ll(x)))
|
||||
|
||||
/* arithmetic operations */
|
||||
#define mod(x, y) ((((x) % (y)) + (y)) % (y))
|
||||
|
||||
/* fast pairs */
|
||||
#define upair ull
|
||||
#define umake(x, y) (ull(x) << 32 | (ull(y) & ((1ULL << 32) - 1)))
|
||||
#define u1(p) ((p) >> 32)
|
||||
#define u2(p) ((p) & ((1ULL << 32) - 1))
|
||||
#define ult std::less<upair>
|
||||
#define ugt std::greater<upair>
|
||||
|
||||
#define ipair ull
|
||||
#define imake(x, y) (umake(x, y))
|
||||
#define i1(p) (int(u1(ll(p))))
|
||||
#define i2(p) (ll(u2(p) << 32) >> 32)
|
||||
struct ilt {
|
||||
bool operator()(const ipair& a, const ipair& b) const {
|
||||
if (i1(a) == i1(b)) return i2(a) < i2(b);
|
||||
else return i1(a) < i1(b);
|
||||
}
|
||||
};
|
||||
struct igt {
|
||||
bool operator()(const ipair& a, const ipair& b) const {
|
||||
if (i1(a) == i1(b)) return i2(a) > i2(b);
|
||||
else return i1(a) > i1(b);
|
||||
}
|
||||
};
|
||||
|
||||
/* conditions */
|
||||
#define loop while (1)
|
||||
#define if_or(var, val) if (!(var == val)) var = val; else
|
||||
#define continue_or(var, val) __AS_PROCEDURE(if (var == val) continue; var = val;)
|
||||
#define break_or(var, val) __AS_PROCEDURE(if (var == val) break; var = val;)
|
||||
|
||||
/* hash */
|
||||
struct safe_hash {
|
||||
// https://codeforces.com/blog/entry/62393
|
||||
static uint64_t splitmix64(uint64_t x) {
|
||||
// http://xorshift.di.unimi.it/splitmix64.c
|
||||
x += 0x9e3779b97f4a7c15;
|
||||
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
|
||||
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
|
||||
return x ^ (x >> 31);
|
||||
}
|
||||
|
||||
size_t operator()(uint64_t x) const {
|
||||
static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
|
||||
return splitmix64(x + FIXED_RANDOM);
|
||||
}
|
||||
};
|
||||
|
||||
struct pair_hash {
|
||||
template <typename T, typename U>
|
||||
size_t operator()(const pair<T, U>& a) const {
|
||||
auto hash1 = safe_hash()(a.first);
|
||||
auto hash2 = safe_hash()(a.second);
|
||||
if (hash1 != hash2) {
|
||||
return hash1 ^ hash2;
|
||||
}
|
||||
return hash1;
|
||||
}
|
||||
};
|
||||
|
||||
uniform_int_distribution<mt19937::result_type> dist(PRIME);
|
||||
const size_t __array_hash_b = 31, __array_hash_mdl1 = dist(rd), __array_hash_mdl2 = dist(rd);
|
||||
struct array_hash {
|
||||
template <typename Sequence>
|
||||
size_t operator()(const Sequence& arr) const {
|
||||
size_t pw1 = 1, pw2 = 1;
|
||||
size_t res1 = 0, res2 = 0;
|
||||
for (auto&& x : arr) {
|
||||
res1 = (res1 + x * pw1) % __array_hash_mdl1;
|
||||
res2 = (res2 + x * pw2) % __array_hash_mdl2;
|
||||
pw1 = (pw1 * __array_hash_b) % __array_hash_mdl1;
|
||||
pw2 = (pw2 * __array_hash_b) % __array_hash_mdl2;
|
||||
}
|
||||
return res1 + res2;
|
||||
}
|
||||
};
|
||||
|
||||
/* build data structures */
|
||||
#define unordered_counter(from, to) __AS_PROCEDURE(unordered_map<__as_typeof(from), size_t, safe_hash> to; for (auto&& x : from) ++to[x];)
|
||||
#define counter(from, to, cmp) __AS_PROCEDURE(map<__as_typeof(from), size_t, cmp> to; for (auto&& x : from) ++to[x];)
|
||||
#define pa(a) __AS_PROCEDURE(__typeof(a) pa; pa.push_back({}); for (auto&&x : a) pa.push_back(pa.back() + x);)
|
||||
#define sa(a) __AS_PROCEDURE(__typeof(a) sa(a.size() + 1); {int n = a.size(); for (int i = n - 1; i >= 0; --i) sa[i] = sa[i + 1] + a[i];};)
|
||||
#define adj(ch, n) __AS_PROCEDURE(vector<vector<int>> ch((n) + 1);)
|
||||
#define edge(ch, u, v) __AS_PROCEDURE(ch[u].push_back(v), ch[v].push_back(u);)
|
||||
#define edgew(ch, u, v, w) __AS_PROCEDURE(ch[u].emplace_back(v, w), ch[v].emplace_back(u, w);)
|
||||
#define Edge(ch, u, v) __AS_PROCEDURE(ch[u].push_back(v);)
|
||||
#define Edgew(ch, u, v, w) __AS_PROCEDURE(ch[u].emplace_back(v, w);)
|
||||
template <typename T, typename Iterator> pair<size_t, map<T, size_t>> discretize(Iterator __first, Iterator __last) {
|
||||
set<T> st(__first, __last);
|
||||
size_t N = 0;
|
||||
map<T, size_t> mp;
|
||||
for (auto&& x : st) mp[x] = ++N;
|
||||
return {N, mp};
|
||||
}
|
||||
template <typename T, typename Iterator> pair<size_t, unordered_map<T, size_t, safe_hash>> unordered_discretize(Iterator __first, Iterator __last) {
|
||||
set<T> st(__first, __last);
|
||||
size_t N = 0;
|
||||
unordered_map<T, size_t, safe_hash> mp;
|
||||
for (auto&& x : st) mp[x] = ++N;
|
||||
return {N, mp};
|
||||
}
|
||||
|
||||
/* io */
|
||||
#define untie __AS_PROCEDURE(ios_base::sync_with_stdio(0), cin.tie(NULL))
|
||||
template<typename T> void __read(T& x) { cin >> x; }
|
||||
template<typename T, typename... U> void __read(T& x, U&... args) { cin >> x; __read(args...); }
|
||||
#define read(type, ...) __AS_PROCEDURE(type __VA_ARGS__; __read(__VA_ARGS__);)
|
||||
#define readvec(type, a, n) __AS_PROCEDURE(vector<type> a(n); for (auto& x : a) cin >> x;)
|
||||
#define readvec1(type, a, n) __AS_PROCEDURE(vector<type> a((n) + 1); copy_n(ii<type>(cin), (n), a.begin() + 1);)
|
||||
#define putvec(a) __AS_PROCEDURE(copy(a.begin(), a.end(), oi<__as_typeof(a)::value_type>(cout, " ")); cout << endl;)
|
||||
#define putvec1(a) __AS_PROCEDURE(copy(a.begin() + 1, a.end(), oi<__as_typeof(a)::value_type>(cout, " ")); cout << endl;)
|
||||
#define putvec_eol(a) __AS_PROCEDURE(copy(a.begin(), a.end(), oi<__as_typeof(a)::value_type>(cout, "\n"));)
|
||||
#define putvec1_eol(a) __AS_PROCEDURE(copy(a.begin() + 1, a.end(), oi<__as_typeof(a)::value_type>(cout, "\n"));)
|
||||
#define debug(x) __AS_PROCEDURE(cerr << #x" = " << (x) << endl;)
|
||||
#define debugvec(a) __AS_PROCEDURE(cerr << #a" = "; for (auto&& x : a) cerr << x << ' '; cerr << endl;)
|
||||
template<typename T, typename U> istream& operator>>(istream& in, pair<T, U>& p) {
|
||||
return in >> p.first >> p.second;
|
||||
}
|
||||
template<typename T, typename U> ostream& operator<<(ostream& out, const pair<T, U>& p) {
|
||||
out << "{" << p.first << ", " << p.second << "}";
|
||||
return out;
|
||||
}
|
||||
template<typename Char, typename Traits, typename Tuple, std::size_t... Index>
|
||||
void print_tuple_impl(std::basic_ostream<Char, Traits>& os, const Tuple& t, std::index_sequence<Index...>) {
|
||||
using swallow = int[]; // guaranties left to right order
|
||||
(void)swallow { 0, (void(os << (Index == 0 ? "" : ", ") << std::get<Index>(t)), 0)... };
|
||||
}
|
||||
template<typename Char, typename Traits, typename... Args>
|
||||
decltype(auto) operator<<(std::basic_ostream<Char, Traits>& os, const std::tuple<Args...>& t) {
|
||||
os << "{";
|
||||
print_tuple_impl(os, t, std::index_sequence_for<Args...>{});
|
||||
return os << "}";
|
||||
}
|
||||
template<typename T> ostream& operator<<(ostream& out, const vector<T>& vec) {
|
||||
for (auto&& i : vec) out << i << ' ';
|
||||
return out;
|
||||
}
|
||||
std::ostream& operator<<(std::ostream& dest, const int128& value) {
|
||||
// https://stackoverflow.com/a/25115163/23881100
|
||||
std::ostream::sentry s( dest );
|
||||
if ( s ) {
|
||||
uint128 tmp = value < 0 ? -value : value;
|
||||
char buffer[ 128 ];
|
||||
char* d = std::end( buffer );
|
||||
do {
|
||||
-- d;
|
||||
*d = "0123456789"[ tmp % 10 ];
|
||||
tmp /= 10;
|
||||
} while ( tmp != 0 );
|
||||
if ( value < 0 ) {
|
||||
-- d;
|
||||
*d = '-';
|
||||
}
|
||||
int len = std::end( buffer ) - d;
|
||||
if ( dest.rdbuf()->sputn( d, len ) != len ) {
|
||||
dest.setstate( std::ios_base::badbit );
|
||||
}
|
||||
}
|
||||
return dest;
|
||||
}
|
||||
|
||||
/* pops */
|
||||
#define poptop(q, ...) __AS_PROCEDURE(auto [__VA_ARGS__] = q.top(); q.pop();)
|
||||
#define popback(q, ...) __AS_PROCEDURE(auto [__VA_ARGS__] = q.back(); q.pop_back();)
|
||||
#define popfront(q, ...) __AS_PROCEDURE(auto [__VA_ARGS__] = q.front();q.pop_front();)
|
||||
|
||||
/* math */
|
||||
constexpr inline int lg2(ll x) { return x == 0 ? -1 : sizeof(ll) * 8 - 1 - __builtin_clzll(x); }
|
||||
|
||||
void __exgcd(ll a, ll b, ll& x, ll& y) {
|
||||
if (b == 0) {
|
||||
x = 1, y = 0;
|
||||
return;
|
||||
}
|
||||
__exgcd(b, a % b, y, x);
|
||||
y -= a / b * x;
|
||||
}
|
||||
|
||||
ll inverse(ll a, ll b) {
|
||||
ll x, y;
|
||||
__exgcd(a, b, x, y);
|
||||
return mod(x, b);
|
||||
}
|
||||
|
||||
vector<tuple<int, int, ll>> decompose(ll x) {
|
||||
// return (factor, count, factor ** count)
|
||||
vector<tuple<int, int, ll>> res;
|
||||
for (int i = 2; i * i <= x; i++) {
|
||||
if (x % i == 0) {
|
||||
int cnt = 0;
|
||||
ll pw = 1;
|
||||
while (x % i == 0) ++cnt, x /= i, pw *= i;
|
||||
res.emplace_back(i, cnt, pw);
|
||||
}
|
||||
}
|
||||
if (x != 1) {
|
||||
res.emplace_back(x, 1, x);
|
||||
}
|
||||
return res;
|
||||
}
|
||||
|
||||
vector<pii> decompose_prime(int N) {
|
||||
// return (factor, count)
|
||||
vector<pii> result;
|
||||
for (int i = 2; i * i <= N; i++) {
|
||||
if (N % i == 0) {
|
||||
int cnt = 0;
|
||||
while (N % i == 0) N /= i, ++cnt;
|
||||
result.emplace_back(i, cnt);
|
||||
}
|
||||
}
|
||||
if (N != 1) {
|
||||
result.emplace_back(N, 1);
|
||||
}
|
||||
return result;
|
||||
}
|
||||
|
||||
/* string algorithms */
|
||||
vector<int> calc_next(string t) { // pi function of t
|
||||
int n = (int)t.length();
|
||||
vector<int> pi(n);
|
||||
for (int i = 1; i < n; i++) {
|
||||
int j = pi[i - 1];
|
||||
while (j > 0 && t[i] != t[j]) j = pi[j - 1];
|
||||
if (t[i] == t[j]) j++;
|
||||
pi[i] = j;
|
||||
}
|
||||
return pi;
|
||||
}
|
||||
vector<int> calc_z(string t) { // z function of t
|
||||
int m = t.length();
|
||||
vector<int> z;
|
||||
z.push_back(m);
|
||||
pair<int, int> prev = {1, -1};
|
||||
for (int i = 1; i < m; ++i) {
|
||||
if (z[i - prev.first] + i <= prev.second) {
|
||||
z.push_back(z[i - prev.first]);
|
||||
} else {
|
||||
int j = max(i, prev.second + 1);
|
||||
while (j < m && t[j] == t[j - i]) ++j;
|
||||
z.push_back(j - i);
|
||||
prev = {i, j - 1};
|
||||
}
|
||||
}
|
||||
return z;
|
||||
}
|
||||
vector<int> kmp(string s, string t) { // find all t in s
|
||||
string cur = t + '#' + s;
|
||||
int sz1 = s.size(), sz2 = t.size();
|
||||
vector<int> v;
|
||||
vector<int> lps = calc_next(cur);
|
||||
for (int i = sz2 + 1; i <= sz1 + sz2; i++) {
|
||||
if (lps[i] == sz2) v.push_back(i - 2 * sz2);
|
||||
}
|
||||
return v;
|
||||
}
|
||||
int period(string s) { // find the length of shortest recurring period
|
||||
int n = s.length();
|
||||
auto z = calc_z(s);
|
||||
for (int i = 1; i <= n / 2; ++i) {
|
||||
if (n % i == 0 && z[i] == n - i) {
|
||||
return i;
|
||||
}
|
||||
}
|
||||
return n;
|
||||
}
|
||||
|
||||
/* modular arithmetic */
|
||||
template <ll mdl> struct MLL {
|
||||
ll val;
|
||||
MLL(ll v = 0) : val(mod(v, mdl)) {}
|
||||
MLL(const MLL<mdl>& other) : val(other.val) {}
|
||||
friend MLL operator+(const MLL& lhs, const MLL& rhs) { return mod(lhs.val + rhs.val, mdl); }
|
||||
friend MLL operator-(const MLL& lhs, const MLL& rhs) { return mod(lhs.val - rhs.val, mdl); }
|
||||
friend MLL operator*(const MLL& lhs, const MLL& rhs) { return mod(lhs.val * rhs.val, mdl); }
|
||||
friend MLL operator/(const MLL& lhs, const MLL& rhs) { return mod(lhs.val * mod(inverse(rhs.val, mdl), mdl), mdl); }
|
||||
friend MLL operator%(const MLL& lhs, const MLL& rhs) { return mod(lhs.val - (lhs / rhs).val, mdl); }
|
||||
friend bool operator==(const MLL& lhs, const MLL& rhs) { return lhs.val == rhs.val; }
|
||||
friend bool operator!=(const MLL& lhs, const MLL& rhs) { return lhs.val != rhs.val; }
|
||||
void operator+=(const MLL& rhs) { val = (*this + rhs).val; }
|
||||
void operator-=(const MLL& rhs) { val = (*this - rhs).val; }
|
||||
void operator*=(const MLL& rhs) { val = (*this * rhs).val; }
|
||||
void operator/=(const MLL& rhs) { val = (*this / rhs).val; }
|
||||
void operator%=(const MLL& rhs) { val = (*this % rhs).val; }
|
||||
};
|
||||
struct MLLd {
|
||||
ll val, mdl;
|
||||
MLLd(ll mdl, ll v = 0) : mdl(mdl), val(mod(v, mdl)) {}
|
||||
MLLd(const MLLd& other) : val(other.val) {}
|
||||
friend MLLd operator+(const MLLd& lhs, const MLLd& rhs) { return mod(lhs.val + rhs.val, lhs.mdl); }
|
||||
friend MLLd operator-(const MLLd& lhs, const MLLd& rhs) { return mod(lhs.val - rhs.val, lhs.mdl); }
|
||||
friend MLLd operator*(const MLLd& lhs, const MLLd& rhs) { return mod(lhs.val * rhs.val, lhs.mdl); }
|
||||
friend MLLd operator/(const MLLd& lhs, const MLLd& rhs) { return mod(lhs.val * mod(inverse(rhs.val, lhs.mdl), lhs.mdl), lhs.mdl); }
|
||||
friend MLLd operator%(const MLLd& lhs, const MLLd& rhs) { return mod(lhs.val - (lhs / rhs).val, lhs.mdl); }
|
||||
friend bool operator==(const MLLd& lhs, const MLLd& rhs) { return lhs.val == rhs.val; }
|
||||
friend bool operator!=(const MLLd& lhs, const MLLd& rhs) { return lhs.val != rhs.val; }
|
||||
void operator+=(const MLLd& rhs) { val = (*this + rhs).val; }
|
||||
void operator-=(const MLLd& rhs) { val = (*this - rhs).val; }
|
||||
void operator*=(const MLLd& rhs) { val = (*this * rhs).val; }
|
||||
void operator/=(const MLLd& rhs) { val = (*this / rhs).val; }
|
||||
void operator%=(const MLLd& rhs) { val = (*this % rhs).val; }
|
||||
};
|
||||
|
||||
template <ll mdl>
|
||||
ostream& operator<<(ostream& out, const MLL<mdl>& num) {
|
||||
return out << num.val;
|
||||
}
|
||||
|
||||
ostream& operator<<(ostream& out, const MLLd& num) {
|
||||
return out << num.val;
|
||||
}
|
||||
|
||||
template <ll mdl>
|
||||
istream& operator>>(istream& in, MLL<mdl>& num) {
|
||||
return in >> num.val;
|
||||
}
|
||||
|
||||
istream& operator>>(istream& in, MLLd& num) {
|
||||
return in >> num.val;
|
||||
}
|
||||
|
||||
// miscancellous
|
||||
template <typename Func, typename RandomIt> void sort_by_key(RandomIt first, RandomIt last, Func extractor) {
|
||||
std::sort(first, last, [&] (auto&& a, auto&& b) { return std::less<>()(extractor(a), extractor(b)); });
|
||||
}
|
||||
template <typename Func, typename RandomIt, typename Compare> void sort_by_key(RandomIt first, RandomIt last, Func extractor, Compare comp) {
|
||||
std::sort(first, last, [&] (auto&& a, auto&& b) { return comp(extractor(a), extractor(b)); });
|
||||
}
|
||||
template <typename T, typename U, typename Iterator_T, typename Iterator_U>
|
||||
vector<pair<T, U>> zip(Iterator_T a_first, Iterator_T a_last, Iterator_U b_first, Iterator_U b_last) {
|
||||
vector<pair<T, U>> res;
|
||||
auto a_it = a_first;
|
||||
auto b_it = b_first;
|
||||
for (; not (a_it == a_last) and not (b_it == b_last); ++a_it, ++b_it) {
|
||||
res.emplace_back(*a_it, *b_it);
|
||||
}
|
||||
return res;
|
||||
}
|
||||
template <typename T, typename U, typename Iterator_T, typename Iterator_U>
|
||||
vector<pair<T, U>> zip_n(Iterator_T a_first, Iterator_U b_first, size_t n) {
|
||||
vector<pair<T, U>> res;
|
||||
if (n > 0) {
|
||||
res.emplace_back(*a_first, *b_first);
|
||||
for (size_t i = 1; i != n; ++i) {
|
||||
res.emplace_back(*++a_first, *++b_first);
|
||||
}
|
||||
}
|
||||
return res;
|
||||
}
|
||||
template <typename T>
|
||||
class ArithmeticIterator : bidirectional_iterator_tag {
|
||||
public:
|
||||
using difference_type = ptrdiff_t;
|
||||
using value_type = T;
|
||||
private:
|
||||
value_type value;
|
||||
public:
|
||||
ArithmeticIterator(const T& value) : value(value) {}
|
||||
value_type operator*() const { return value; }
|
||||
ArithmeticIterator<T>& operator++() { ++value; return *this; }
|
||||
ArithmeticIterator<T>& operator--() { --value; return *this; }
|
||||
bool operator==(const ArithmeticIterator<T>& rhs) const { return value == rhs.value; }
|
||||
};
|
||||
template <typename T> vector<pair<int, T>> enumerate(const vector<T>& container) {
|
||||
return zip<int, T>(ArithmeticIterator<int>(0), ArithmeticIterator<int>(INT_MAX), container.begin(), container.end());
|
||||
}
|
||||
/////////////////////////////////////////////////////////
|
||||
|
||||
#define SINGLE_TEST_CASE
|
||||
// #define DUMP_TEST_CASE 7219
|
||||
// #define TOT_TEST_CASE 10000
|
||||
|
||||
void dump() {}
|
||||
|
||||
void dump_ignore() {}
|
||||
|
||||
void prep() {
|
||||
}
|
||||
|
||||
struct mcmf {
|
||||
struct edge {
|
||||
int to;
|
||||
ll cap;
|
||||
ll flow;
|
||||
ll cost;
|
||||
int rev;
|
||||
int mark;
|
||||
};
|
||||
vector<vector<edge>> edges;
|
||||
vector<ll> dis;
|
||||
vector<bool> vis;
|
||||
ll ret;
|
||||
mcmf(int n) : edges(n + 1), dis(n + 1), vis(n + 1) {}
|
||||
void add_edge(int from, int to, ll cap, ll cost, int mark = 0, int mark_rev = 0) {
|
||||
edges[from].push_back({ to, cap, 0, cost, int(edges[to].size()), mark });
|
||||
edges[to].push_back({ from, 0, 0, -cost, int(edges[from].size() - 1), mark_rev });
|
||||
}
|
||||
bool sp(int s, int t) {
|
||||
dis.assign(edges.size(), INFLL);
|
||||
dis[s] = 0;
|
||||
int n = edges.size();
|
||||
int f = 1;
|
||||
while (f) {
|
||||
f = 0;
|
||||
for (int i = 0; i < n; ++i) {
|
||||
for (auto&& [to, cap, flow, cost, rev, mark] : edges[i]) {
|
||||
if (cap > flow and dis[to] > dis[i] + cost) {
|
||||
dis[to] = dis[i] + cost;
|
||||
f = 1;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
return dis[t] != INFLL;
|
||||
}
|
||||
ll dfs(int s, int t, ll cap) {
|
||||
if (vis[s]) {
|
||||
return 0;
|
||||
}
|
||||
vis[s] = 1;
|
||||
if (s == t) {
|
||||
return cap;
|
||||
}
|
||||
ll res = 0;
|
||||
int n = edges[s].size();
|
||||
for (int i = 0; i < n; ++i) {
|
||||
auto e = edges[s][i];
|
||||
if (e.cap > e.flow and dis[e.to] == dis[s] + e.cost) {
|
||||
ll nw = dfs(e.to, t, min(cap - res, e.cap - e.flow));
|
||||
edges[s][i].flow += nw;
|
||||
edges[e.to][e.rev].flow -= nw;
|
||||
res += nw;
|
||||
ret += nw * e.cost;
|
||||
if (res == cap) {
|
||||
return res;
|
||||
}
|
||||
}
|
||||
}
|
||||
return res;
|
||||
}
|
||||
// returns: (flow, cost)
|
||||
pll run(int s, int t) {
|
||||
ll res = 0; ret = 0;
|
||||
while (sp(s, t)) {
|
||||
vis.assign(edges.size(), 0);
|
||||
ll curr = dfs(s, t, LLONG_MAX);
|
||||
res += curr;
|
||||
}
|
||||
return { res, ret };
|
||||
}
|
||||
};
|
||||
|
||||
struct bounded_mcmf {
|
||||
int n, m, S, T;
|
||||
mcmf net;
|
||||
ll sum;
|
||||
vector<ll> fl;
|
||||
vector<ll> init;
|
||||
vector<ll> costs;
|
||||
bounded_mcmf(int n, int m) : sum(0), n(n), m(m), S(0), T(n + 1), net(n + 1), fl(m), init(n + 1), costs(m) {}
|
||||
// handle negative loop case
|
||||
void add_edge(int from, int to, ll low, ll high, ll cost, int edge_id = -1) {
|
||||
if (cost < 0) {
|
||||
__add_edge(from, to, high, high, cost, -1);
|
||||
__add_edge(to, from, 0, high - low, -cost, edge_id);
|
||||
} else {
|
||||
__add_edge(from, to, low, high, cost, edge_id);
|
||||
}
|
||||
if (edge_id != -1) {
|
||||
costs[edge_id] = cost;
|
||||
if (cost < 0) {
|
||||
fl[edge_id] += high; // RealFlow = UpperBound - Flow
|
||||
} else {
|
||||
fl[edge_id] += low; // RealFlow = LowerBound + Flow
|
||||
}
|
||||
}
|
||||
}
|
||||
void __add_edge(int from, int to, ll low, ll high, ll cost, int edge_id = -1) {
|
||||
net.add_edge(from, to, high - low, cost, edge_id, -1);
|
||||
init[to] += low, init[from] -= low;
|
||||
}
|
||||
void prep(int s, int t) {
|
||||
for (int i = 1; i <= n; ++i) {
|
||||
if (init[i] > 0) {
|
||||
net.add_edge(S, i, init[i], 0, -1, -1);
|
||||
sum += init[i];
|
||||
} else if (init[i] < 0) {
|
||||
net.add_edge(i, T, -init[i], 0, -1, -1);
|
||||
}
|
||||
}
|
||||
net.add_edge(t, s, INFLL, 0, -1, -1);
|
||||
}
|
||||
// min-cost max-flow
|
||||
optional<tuple<ll, ll, vector<ll>>> run_mcmf(int s, int t) { // BUG: unchecked code
|
||||
prep(s, t);
|
||||
if (sum != net.run(S, T).first) {
|
||||
return nullopt;
|
||||
} else {
|
||||
auto [res_flow, res_cost] = net.run(s, t);
|
||||
for (int from = 1; from <= n; ++from) {
|
||||
for (auto&& [to, cap, flow, cost, rev, mark] : net.edges[from]) {
|
||||
if (mark != -1) {
|
||||
if (costs[mark] < 0) {
|
||||
fl[mark] -= flow;
|
||||
} else {
|
||||
fl[mark] += flow;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
return {{res_flow, res_cost, fl}};
|
||||
}
|
||||
}
|
||||
// min-cost flow
|
||||
optional<tuple<ll, ll, vector<ll>>> run_mcf(int s, int t) {
|
||||
prep(s, t);
|
||||
auto [res_flow, res_cost] = net.run(S, T);
|
||||
if (sum != res_flow) {
|
||||
return nullopt;
|
||||
} else {
|
||||
for (int from = 1; from <= n; ++from) {
|
||||
for (auto&& [to, cap, flow, cost, rev, mark] : net.edges[from]) {
|
||||
if (mark != -1) {
|
||||
if (costs[mark] < 0) {
|
||||
fl[mark] -= flow;
|
||||
} else {
|
||||
fl[mark] += flow;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
return {{res_flow, res_cost, fl}};
|
||||
}
|
||||
}
|
||||
};
|
||||
|
||||
void solve() {
|
||||
read(int, n, m);
|
||||
bounded_mcmf net(n, m);
|
||||
int S = 0, T = n + 1;
|
||||
vector<int> init(n + 1);
|
||||
vector<int> res(m);
|
||||
for (int i = 0; i < m; ++i) {
|
||||
read(int, u, v, c, w);
|
||||
if (c & 1) {
|
||||
// set lower bound for edge
|
||||
init[v] += 1;
|
||||
init[u] -= 1;
|
||||
res[i] += 1;
|
||||
}
|
||||
net.add_edge(u, v, 0, c / 2, w, i);
|
||||
}
|
||||
for (int i = 1; i <= n; ++i) {
|
||||
if (i == 1 or i == n) continue;
|
||||
if (init[i] & 1) { // TODO: why.
|
||||
cout << "Impossible\n";
|
||||
return;
|
||||
}
|
||||
if (init[i] > 0) {
|
||||
net.add_edge(1, i, init[i] / 2, init[i] / 2, 0, -1); // TODO: add_edge(S, i, ...)
|
||||
} else if (init[i] < 0) {
|
||||
net.add_edge(i, n, -init[i] / 2, -init[i] / 2, 0, -1);
|
||||
}
|
||||
}
|
||||
auto ret = net.run_mcf(1, n);
|
||||
if (ret == nullopt) {
|
||||
cout << "Impossible\n";
|
||||
} else {
|
||||
cout << "Possible\n";
|
||||
auto [flow, cost, fl] = ret.value();
|
||||
for (int i = 0; i < m; ++i) {
|
||||
res[i] += fl[i] * 2;
|
||||
}
|
||||
putvec(res);
|
||||
}
|
||||
}
|
||||
|
||||
int main() {
|
||||
#if __cplusplus < 201703L || defined(_MSC_VER) && !defined(__clang__)
|
||||
assert(false && "incompatible compiler variant detected.");
|
||||
#endif
|
||||
untie, cout.tie(NULL);
|
||||
prep();
|
||||
#ifdef SINGLE_TEST_CASE
|
||||
solve();
|
||||
#else
|
||||
read(int, t);
|
||||
for (int i = 0; i < t; ++i) {
|
||||
#ifdef DUMP_TEST_CASE
|
||||
if (t != (TOT_TEST_CASE)) {
|
||||
solve();
|
||||
} else if (i + 1 == (DUMP_TEST_CASE)) {
|
||||
dump();
|
||||
} else {
|
||||
dump_ignore();
|
||||
}
|
||||
#else
|
||||
solve();
|
||||
#endif
|
||||
}
|
||||
#endif
|
||||
}
|
||||
|
|
@ -0,0 +1,520 @@
|
|||
#pragma GCC optimize("Ofast")
|
||||
/////////////////////////////////////////////////////////
|
||||
/**
|
||||
* Useful Macros
|
||||
* by subcrip
|
||||
* (requires C++17)
|
||||
*/
|
||||
|
||||
#include<bits/stdc++.h>
|
||||
using namespace std;
|
||||
|
||||
/* macro helpers */
|
||||
#define __NARGS(...) std::tuple_size<decltype(std::make_tuple(__VA_ARGS__))>::value
|
||||
#define __DECOMPOSE_S(a, x) auto x = a;
|
||||
#define __DECOMPOSE_N(a, ...) auto [__VA_ARGS__] = a;
|
||||
constexpr void __() {}
|
||||
#define __AS_PROCEDURE(...) __(); __VA_ARGS__; __()
|
||||
#define __as_typeof(container) remove_reference<decltype(container)>::type
|
||||
|
||||
/* type aliases */
|
||||
#if LONG_LONG_MAX != INT64_MAX
|
||||
using ll = int64_t;
|
||||
using ull = uint64_t;
|
||||
#else
|
||||
using ll = long long;
|
||||
using ull = unsigned long long;
|
||||
using ld = long double;
|
||||
#endif
|
||||
using int128 = __int128_t;
|
||||
using uint128 = __uint128_t;
|
||||
using ld = long double;
|
||||
using pii = pair<int, int>;
|
||||
using pil = pair<int, ll>;
|
||||
using pli = pair<ll, int>;
|
||||
using pll = pair<ll, ll>;
|
||||
using pid = pair<int, ld>;
|
||||
using pdi = pair<ld, int>;
|
||||
using pld = pair<ll, ld>;
|
||||
using pdl = pair<ld, ll>;
|
||||
using pdd = pair<ld, ld>;
|
||||
using tlll = tuple<ll, ll, ll>;
|
||||
using tlld = tuple<ll, ll, ld>;
|
||||
using tlli = tuple<ll, ll, int>;
|
||||
using tldl = tuple<ll, ld, ll>;
|
||||
using tldd = tuple<ll, ld, ld>;
|
||||
using tldi = tuple<ll, ld, int>;
|
||||
using tlil = tuple<ll, int, ll>;
|
||||
using tlid = tuple<ll, int, ld>;
|
||||
using tlii = tuple<ll, int, int>;
|
||||
using tdll = tuple<ld, ll, ll>;
|
||||
using tdld = tuple<ld, ll, ld>;
|
||||
using tdli = tuple<ld, ll, int>;
|
||||
using tddl = tuple<ld, ld, ll>;
|
||||
using tddd = tuple<ld, ld, ld>;
|
||||
using tddi = tuple<ld, ld, int>;
|
||||
using tdil = tuple<ld, int, ll>;
|
||||
using tdid = tuple<ld, int, ld>;
|
||||
using tdii = tuple<ld, int, int>;
|
||||
using till = tuple<int, ll, ll>;
|
||||
using tild = tuple<int, ll, ld>;
|
||||
using tili = tuple<int, ll, int>;
|
||||
using tidl = tuple<int, ld, ll>;
|
||||
using tidd = tuple<int, ld, ld>;
|
||||
using tidi = tuple<int, ld, int>;
|
||||
using tiil = tuple<int, int, ll>;
|
||||
using tiid = tuple<int, int, ld>;
|
||||
using tiii = tuple<int, int, int>;
|
||||
template <typename T> using max_heap = priority_queue<T>;
|
||||
template <typename T> using min_heap = priority_queue<T, vector<T>, greater<>>;
|
||||
template <typename T> using oi = ostream_iterator<T>;
|
||||
template <typename T> using ii = istream_iterator<T>;
|
||||
|
||||
/* constants */
|
||||
constexpr int INF = 0x3f3f3f3f;
|
||||
constexpr ll INFLL = 0x3f3f3f3f3f3f3f3fLL;
|
||||
constexpr ll MDL = 1e9 + 7;
|
||||
constexpr ll PRIME = 998'244'353;
|
||||
constexpr ll MDL1 = 8784491;
|
||||
constexpr ll MDL2 = PRIME;
|
||||
constexpr int128 INT128_MAX = numeric_limits<int128>::max();
|
||||
constexpr uint128 UINT128_MAX = numeric_limits<uint128>::max();
|
||||
constexpr int128 INT128_MIN = numeric_limits<int128>::min();
|
||||
constexpr uint128 UINT128_MIN = numeric_limits<uint128>::min();
|
||||
|
||||
/* random */
|
||||
|
||||
mt19937 rd(chrono::duration_cast<chrono::milliseconds>(chrono::system_clock::now().time_since_epoch()).count());
|
||||
|
||||
/* bit-wise operations */
|
||||
#define lowbit(x) ((x) & -(x))
|
||||
#define popcount(x) (__builtin_popcountll(ll(x)))
|
||||
#define parity(x) (__builtin_parityll(ll(x)))
|
||||
#define msp(x) (63LL - __builtin_clzll(ll(x)))
|
||||
#define lsp(x) (__builtin_ctzll(ll(x)))
|
||||
|
||||
/* arithmetic operations */
|
||||
#define mod(x, y) ((((x) % (y)) + (y)) % (y))
|
||||
|
||||
/* fast pairs */
|
||||
#define upair ull
|
||||
#define umake(x, y) (ull(x) << 32 | (ull(y) & ((1ULL << 32) - 1)))
|
||||
#define u1(p) ((p) >> 32)
|
||||
#define u2(p) ((p) & ((1ULL << 32) - 1))
|
||||
#define ult std::less<upair>
|
||||
#define ugt std::greater<upair>
|
||||
|
||||
#define ipair ull
|
||||
#define imake(x, y) (umake(x, y))
|
||||
#define i1(p) (int(u1(ll(p))))
|
||||
#define i2(p) (ll(u2(p) << 32) >> 32)
|
||||
struct ilt {
|
||||
bool operator()(const ipair& a, const ipair& b) const {
|
||||
if (i1(a) == i1(b)) return i2(a) < i2(b);
|
||||
else return i1(a) < i1(b);
|
||||
}
|
||||
};
|
||||
struct igt {
|
||||
bool operator()(const ipair& a, const ipair& b) const {
|
||||
if (i1(a) == i1(b)) return i2(a) > i2(b);
|
||||
else return i1(a) > i1(b);
|
||||
}
|
||||
};
|
||||
|
||||
/* conditions */
|
||||
#define loop while (1)
|
||||
#define if_or(var, val) if (!(var == val)) var = val; else
|
||||
#define continue_or(var, val) __AS_PROCEDURE(if (var == val) continue; var = val;)
|
||||
#define break_or(var, val) __AS_PROCEDURE(if (var == val) break; var = val;)
|
||||
|
||||
/* hash */
|
||||
struct safe_hash {
|
||||
// https://codeforces.com/blog/entry/62393
|
||||
static uint64_t splitmix64(uint64_t x) {
|
||||
// http://xorshift.di.unimi.it/splitmix64.c
|
||||
x += 0x9e3779b97f4a7c15;
|
||||
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
|
||||
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
|
||||
return x ^ (x >> 31);
|
||||
}
|
||||
|
||||
size_t operator()(uint64_t x) const {
|
||||
static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
|
||||
return splitmix64(x + FIXED_RANDOM);
|
||||
}
|
||||
};
|
||||
|
||||
struct pair_hash {
|
||||
template <typename T, typename U>
|
||||
size_t operator()(const pair<T, U>& a) const {
|
||||
auto hash1 = safe_hash()(a.first);
|
||||
auto hash2 = safe_hash()(a.second);
|
||||
if (hash1 != hash2) {
|
||||
return hash1 ^ hash2;
|
||||
}
|
||||
return hash1;
|
||||
}
|
||||
};
|
||||
|
||||
uniform_int_distribution<mt19937::result_type> dist(PRIME);
|
||||
const size_t __array_hash_b = 31, __array_hash_mdl1 = dist(rd), __array_hash_mdl2 = dist(rd);
|
||||
struct array_hash {
|
||||
template <typename Sequence>
|
||||
size_t operator()(const Sequence& arr) const {
|
||||
size_t pw1 = 1, pw2 = 1;
|
||||
size_t res1 = 0, res2 = 0;
|
||||
for (auto&& x : arr) {
|
||||
res1 = (res1 + x * pw1) % __array_hash_mdl1;
|
||||
res2 = (res2 + x * pw2) % __array_hash_mdl2;
|
||||
pw1 = (pw1 * __array_hash_b) % __array_hash_mdl1;
|
||||
pw2 = (pw2 * __array_hash_b) % __array_hash_mdl2;
|
||||
}
|
||||
return res1 + res2;
|
||||
}
|
||||
};
|
||||
|
||||
/* build data structures */
|
||||
#define unordered_counter(from, to) __AS_PROCEDURE(unordered_map<__as_typeof(from), size_t, safe_hash> to; for (auto&& x : from) ++to[x];)
|
||||
#define counter(from, to, cmp) __AS_PROCEDURE(map<__as_typeof(from), size_t, cmp> to; for (auto&& x : from) ++to[x];)
|
||||
#define pa(a) __AS_PROCEDURE(__typeof(a) pa; pa.push_back({}); for (auto&&x : a) pa.push_back(pa.back() + x);)
|
||||
#define sa(a) __AS_PROCEDURE(__typeof(a) sa(a.size() + 1); {int n = a.size(); for (int i = n - 1; i >= 0; --i) sa[i] = sa[i + 1] + a[i];};)
|
||||
#define adj(ch, n) __AS_PROCEDURE(vector<vector<int>> ch((n) + 1);)
|
||||
#define edge(ch, u, v) __AS_PROCEDURE(ch[u].push_back(v), ch[v].push_back(u);)
|
||||
#define edgew(ch, u, v, w) __AS_PROCEDURE(ch[u].emplace_back(v, w), ch[v].emplace_back(u, w);)
|
||||
#define Edge(ch, u, v) __AS_PROCEDURE(ch[u].push_back(v);)
|
||||
#define Edgew(ch, u, v, w) __AS_PROCEDURE(ch[u].emplace_back(v, w);)
|
||||
template <typename T, typename Iterator> pair<size_t, map<T, size_t>> discretize(Iterator __first, Iterator __last) {
|
||||
set<T> st(__first, __last);
|
||||
size_t N = 0;
|
||||
map<T, size_t> mp;
|
||||
for (auto&& x : st) mp[x] = ++N;
|
||||
return {N, mp};
|
||||
}
|
||||
template <typename T, typename Iterator> pair<size_t, unordered_map<T, size_t, safe_hash>> unordered_discretize(Iterator __first, Iterator __last) {
|
||||
set<T> st(__first, __last);
|
||||
size_t N = 0;
|
||||
unordered_map<T, size_t, safe_hash> mp;
|
||||
for (auto&& x : st) mp[x] = ++N;
|
||||
return {N, mp};
|
||||
}
|
||||
|
||||
/* io */
|
||||
#define untie __AS_PROCEDURE(ios_base::sync_with_stdio(0), cin.tie(NULL))
|
||||
template<typename T> void __read(T& x) { cin >> x; }
|
||||
template<typename T, typename... U> void __read(T& x, U&... args) { cin >> x; __read(args...); }
|
||||
#define read(type, ...) __AS_PROCEDURE(type __VA_ARGS__; __read(__VA_ARGS__);)
|
||||
#define readvec(type, a, n) __AS_PROCEDURE(vector<type> a(n); for (auto& x : a) cin >> x;)
|
||||
#define readvec1(type, a, n) __AS_PROCEDURE(vector<type> a((n) + 1); copy_n(ii<type>(cin), (n), a.begin() + 1);)
|
||||
#define putvec(a) __AS_PROCEDURE(copy(a.begin(), a.end(), oi<__as_typeof(a)::value_type>(cout, " ")); cout << endl;)
|
||||
#define putvec1(a) __AS_PROCEDURE(copy(a.begin() + 1, a.end(), oi<__as_typeof(a)::value_type>(cout, " ")); cout << endl;)
|
||||
#define putvec_eol(a) __AS_PROCEDURE(copy(a.begin(), a.end(), oi<__as_typeof(a)::value_type>(cout, "\n"));)
|
||||
#define putvec1_eol(a) __AS_PROCEDURE(copy(a.begin() + 1, a.end(), oi<__as_typeof(a)::value_type>(cout, "\n"));)
|
||||
#define debug(x) __AS_PROCEDURE(cerr << #x" = " << (x) << endl;)
|
||||
#define debugvec(a) __AS_PROCEDURE(cerr << #a" = "; for (auto&& x : a) cerr << x << ' '; cerr << endl;)
|
||||
template<typename T, typename U> istream& operator>>(istream& in, pair<T, U>& p) {
|
||||
return in >> p.first >> p.second;
|
||||
}
|
||||
template<typename T, typename U> ostream& operator<<(ostream& out, const pair<T, U>& p) {
|
||||
out << "{" << p.first << ", " << p.second << "}";
|
||||
return out;
|
||||
}
|
||||
template<typename Char, typename Traits, typename Tuple, std::size_t... Index>
|
||||
void print_tuple_impl(std::basic_ostream<Char, Traits>& os, const Tuple& t, std::index_sequence<Index...>) {
|
||||
using swallow = int[]; // guaranties left to right order
|
||||
(void)swallow { 0, (void(os << (Index == 0 ? "" : ", ") << std::get<Index>(t)), 0)... };
|
||||
}
|
||||
template<typename Char, typename Traits, typename... Args>
|
||||
decltype(auto) operator<<(std::basic_ostream<Char, Traits>& os, const std::tuple<Args...>& t) {
|
||||
os << "{";
|
||||
print_tuple_impl(os, t, std::index_sequence_for<Args...>{});
|
||||
return os << "}";
|
||||
}
|
||||
template<typename T> ostream& operator<<(ostream& out, const vector<T>& vec) {
|
||||
for (auto&& i : vec) out << i << ' ';
|
||||
return out;
|
||||
}
|
||||
std::ostream& operator<<(std::ostream& dest, const int128& value) {
|
||||
// https://stackoverflow.com/a/25115163/23881100
|
||||
std::ostream::sentry s( dest );
|
||||
if ( s ) {
|
||||
uint128 tmp = value < 0 ? -value : value;
|
||||
char buffer[ 128 ];
|
||||
char* d = std::end( buffer );
|
||||
do {
|
||||
-- d;
|
||||
*d = "0123456789"[ tmp % 10 ];
|
||||
tmp /= 10;
|
||||
} while ( tmp != 0 );
|
||||
if ( value < 0 ) {
|
||||
-- d;
|
||||
*d = '-';
|
||||
}
|
||||
int len = std::end( buffer ) - d;
|
||||
if ( dest.rdbuf()->sputn( d, len ) != len ) {
|
||||
dest.setstate( std::ios_base::badbit );
|
||||
}
|
||||
}
|
||||
return dest;
|
||||
}
|
||||
|
||||
/* pops */
|
||||
#define poptop(q, ...) __AS_PROCEDURE(auto [__VA_ARGS__] = q.top(); q.pop();)
|
||||
#define popback(q, ...) __AS_PROCEDURE(auto [__VA_ARGS__] = q.back(); q.pop_back();)
|
||||
#define popfront(q, ...) __AS_PROCEDURE(auto [__VA_ARGS__] = q.front();q.pop_front();)
|
||||
|
||||
/* math */
|
||||
constexpr inline int lg2(ll x) { return x == 0 ? -1 : sizeof(ll) * 8 - 1 - __builtin_clzll(x); }
|
||||
|
||||
void __exgcd(ll a, ll b, ll& x, ll& y) {
|
||||
if (b == 0) {
|
||||
x = 1, y = 0;
|
||||
return;
|
||||
}
|
||||
__exgcd(b, a % b, y, x);
|
||||
y -= a / b * x;
|
||||
}
|
||||
|
||||
ll inverse(ll a, ll b) {
|
||||
ll x, y;
|
||||
__exgcd(a, b, x, y);
|
||||
return mod(x, b);
|
||||
}
|
||||
|
||||
vector<tuple<int, int, ll>> decompose(ll x) {
|
||||
// return (factor, count, factor ** count)
|
||||
vector<tuple<int, int, ll>> res;
|
||||
for (int i = 2; i * i <= x; i++) {
|
||||
if (x % i == 0) {
|
||||
int cnt = 0;
|
||||
ll pw = 1;
|
||||
while (x % i == 0) ++cnt, x /= i, pw *= i;
|
||||
res.emplace_back(i, cnt, pw);
|
||||
}
|
||||
}
|
||||
if (x != 1) {
|
||||
res.emplace_back(x, 1, x);
|
||||
}
|
||||
return res;
|
||||
}
|
||||
|
||||
vector<pii> decompose_prime(int N) {
|
||||
// return (factor, count)
|
||||
vector<pii> result;
|
||||
for (int i = 2; i * i <= N; i++) {
|
||||
if (N % i == 0) {
|
||||
int cnt = 0;
|
||||
while (N % i == 0) N /= i, ++cnt;
|
||||
result.emplace_back(i, cnt);
|
||||
}
|
||||
}
|
||||
if (N != 1) {
|
||||
result.emplace_back(N, 1);
|
||||
}
|
||||
return result;
|
||||
}
|
||||
|
||||
/* string algorithms */
|
||||
vector<int> calc_next(string t) { // pi function of t
|
||||
int n = (int)t.length();
|
||||
vector<int> pi(n);
|
||||
for (int i = 1; i < n; i++) {
|
||||
int j = pi[i - 1];
|
||||
while (j > 0 && t[i] != t[j]) j = pi[j - 1];
|
||||
if (t[i] == t[j]) j++;
|
||||
pi[i] = j;
|
||||
}
|
||||
return pi;
|
||||
}
|
||||
vector<int> calc_z(string t) { // z function of t
|
||||
int m = t.length();
|
||||
vector<int> z;
|
||||
z.push_back(m);
|
||||
pair<int, int> prev = {1, -1};
|
||||
for (int i = 1; i < m; ++i) {
|
||||
if (z[i - prev.first] + i <= prev.second) {
|
||||
z.push_back(z[i - prev.first]);
|
||||
} else {
|
||||
int j = max(i, prev.second + 1);
|
||||
while (j < m && t[j] == t[j - i]) ++j;
|
||||
z.push_back(j - i);
|
||||
prev = {i, j - 1};
|
||||
}
|
||||
}
|
||||
return z;
|
||||
}
|
||||
vector<int> kmp(string s, string t) { // find all t in s
|
||||
string cur = t + '#' + s;
|
||||
int sz1 = s.size(), sz2 = t.size();
|
||||
vector<int> v;
|
||||
vector<int> lps = calc_next(cur);
|
||||
for (int i = sz2 + 1; i <= sz1 + sz2; i++) {
|
||||
if (lps[i] == sz2) v.push_back(i - 2 * sz2);
|
||||
}
|
||||
return v;
|
||||
}
|
||||
int period(string s) { // find the length of shortest recurring period
|
||||
int n = s.length();
|
||||
auto z = calc_z(s);
|
||||
for (int i = 1; i <= n / 2; ++i) {
|
||||
if (n % i == 0 && z[i] == n - i) {
|
||||
return i;
|
||||
}
|
||||
}
|
||||
return n;
|
||||
}
|
||||
|
||||
/* modular arithmetic */
|
||||
template <ll mdl> struct MLL {
|
||||
ll val;
|
||||
MLL(ll v = 0) : val(mod(v, mdl)) {}
|
||||
MLL(const MLL<mdl>& other) : val(other.val) {}
|
||||
friend MLL operator+(const MLL& lhs, const MLL& rhs) { return mod(lhs.val + rhs.val, mdl); }
|
||||
friend MLL operator-(const MLL& lhs, const MLL& rhs) { return mod(lhs.val - rhs.val, mdl); }
|
||||
friend MLL operator*(const MLL& lhs, const MLL& rhs) { return mod(lhs.val * rhs.val, mdl); }
|
||||
friend MLL operator/(const MLL& lhs, const MLL& rhs) { return mod(lhs.val * mod(inverse(rhs.val, mdl), mdl), mdl); }
|
||||
friend MLL operator%(const MLL& lhs, const MLL& rhs) { return mod(lhs.val - (lhs / rhs).val, mdl); }
|
||||
friend bool operator==(const MLL& lhs, const MLL& rhs) { return lhs.val == rhs.val; }
|
||||
friend bool operator!=(const MLL& lhs, const MLL& rhs) { return lhs.val != rhs.val; }
|
||||
void operator+=(const MLL& rhs) { val = (*this + rhs).val; }
|
||||
void operator-=(const MLL& rhs) { val = (*this - rhs).val; }
|
||||
void operator*=(const MLL& rhs) { val = (*this * rhs).val; }
|
||||
void operator/=(const MLL& rhs) { val = (*this / rhs).val; }
|
||||
void operator%=(const MLL& rhs) { val = (*this % rhs).val; }
|
||||
};
|
||||
struct MLLd {
|
||||
ll val, mdl;
|
||||
MLLd(ll mdl, ll v = 0) : mdl(mdl), val(mod(v, mdl)) {}
|
||||
MLLd(const MLLd& other) : val(other.val) {}
|
||||
friend MLLd operator+(const MLLd& lhs, const MLLd& rhs) { return mod(lhs.val + rhs.val, lhs.mdl); }
|
||||
friend MLLd operator-(const MLLd& lhs, const MLLd& rhs) { return mod(lhs.val - rhs.val, lhs.mdl); }
|
||||
friend MLLd operator*(const MLLd& lhs, const MLLd& rhs) { return mod(lhs.val * rhs.val, lhs.mdl); }
|
||||
friend MLLd operator/(const MLLd& lhs, const MLLd& rhs) { return mod(lhs.val * mod(inverse(rhs.val, lhs.mdl), lhs.mdl), lhs.mdl); }
|
||||
friend MLLd operator%(const MLLd& lhs, const MLLd& rhs) { return mod(lhs.val - (lhs / rhs).val, lhs.mdl); }
|
||||
friend bool operator==(const MLLd& lhs, const MLLd& rhs) { return lhs.val == rhs.val; }
|
||||
friend bool operator!=(const MLLd& lhs, const MLLd& rhs) { return lhs.val != rhs.val; }
|
||||
void operator+=(const MLLd& rhs) { val = (*this + rhs).val; }
|
||||
void operator-=(const MLLd& rhs) { val = (*this - rhs).val; }
|
||||
void operator*=(const MLLd& rhs) { val = (*this * rhs).val; }
|
||||
void operator/=(const MLLd& rhs) { val = (*this / rhs).val; }
|
||||
void operator%=(const MLLd& rhs) { val = (*this % rhs).val; }
|
||||
};
|
||||
|
||||
template <ll mdl>
|
||||
ostream& operator<<(ostream& out, const MLL<mdl>& num) {
|
||||
return out << num.val;
|
||||
}
|
||||
|
||||
ostream& operator<<(ostream& out, const MLLd& num) {
|
||||
return out << num.val;
|
||||
}
|
||||
|
||||
template <ll mdl>
|
||||
istream& operator>>(istream& in, MLL<mdl>& num) {
|
||||
return in >> num.val;
|
||||
}
|
||||
|
||||
istream& operator>>(istream& in, MLLd& num) {
|
||||
return in >> num.val;
|
||||
}
|
||||
|
||||
// miscancellous
|
||||
template <typename Func, typename RandomIt> void sort_by_key(RandomIt first, RandomIt last, Func extractor) {
|
||||
std::sort(first, last, [&] (auto&& a, auto&& b) { return std::less<>()(extractor(a), extractor(b)); });
|
||||
}
|
||||
template <typename Func, typename RandomIt, typename Compare> void sort_by_key(RandomIt first, RandomIt last, Func extractor, Compare comp) {
|
||||
std::sort(first, last, [&] (auto&& a, auto&& b) { return comp(extractor(a), extractor(b)); });
|
||||
}
|
||||
template <typename T, typename U, typename Iterator_T, typename Iterator_U>
|
||||
vector<pair<T, U>> zip(Iterator_T a_first, Iterator_T a_last, Iterator_U b_first, Iterator_U b_last) {
|
||||
vector<pair<T, U>> res;
|
||||
auto a_it = a_first;
|
||||
auto b_it = b_first;
|
||||
for (; a_it != a_last and b_it != b_last; ++a_it, ++b_it) {
|
||||
res.emplace_back(*a_it, *b_it);
|
||||
}
|
||||
return res;
|
||||
}
|
||||
template <typename T, typename U, typename Iterator_T, typename Iterator_U>
|
||||
vector<pair<T, U>> zip_n(Iterator_T a_first, Iterator_U b_first, size_t n) {
|
||||
vector<pair<T, U>> res;
|
||||
if (n > 0) {
|
||||
res.emplace_back(*a_first, *b_first);
|
||||
for (size_t i = 1; i != n; ++i) {
|
||||
res.emplace_back(*++a_first, *++b_first);
|
||||
}
|
||||
}
|
||||
return res;
|
||||
}
|
||||
template <typename T>
|
||||
class ArithmeticIterator : bidirectional_iterator_tag {
|
||||
public:
|
||||
using difference_type = ptrdiff_t;
|
||||
using value_type = T;
|
||||
private:
|
||||
value_type value;
|
||||
public:
|
||||
ArithmeticIterator(const T& value) : value(value) {}
|
||||
value_type operator*() const { return value; }
|
||||
ArithmeticIterator<T>& operator++() { ++value; return *this; }
|
||||
ArithmeticIterator<T>& operator--() { --value; return *this; }
|
||||
bool operator==(const ArithmeticIterator<T>& rhs) const { return value == rhs.value; }
|
||||
};
|
||||
/////////////////////////////////////////////////////////
|
||||
|
||||
// #define SINGLE_TEST_CASE
|
||||
// #define DUMP_TEST_CASE 7219
|
||||
// #define TOT_TEST_CASE 10000
|
||||
|
||||
void dump() {}
|
||||
|
||||
void dump_ignore() {}
|
||||
|
||||
void prep() {
|
||||
}
|
||||
|
||||
void solve() {
|
||||
read(int, n);
|
||||
readvec(int, a, n);
|
||||
int mn_l = 1;
|
||||
for (int b = 0; b < 20; ++b) {
|
||||
int max_dist = 0;
|
||||
int prev_1 = -1;
|
||||
for (int i = 0; i < n; ++i) {
|
||||
if (a[i] >> b & 1) {
|
||||
max_dist = max(max_dist, i - prev_1);
|
||||
prev_1 = i;
|
||||
}
|
||||
}
|
||||
if (prev_1 != -1) {
|
||||
max_dist = max(max_dist, n - prev_1);
|
||||
mn_l = max(mn_l, max_dist);
|
||||
}
|
||||
}
|
||||
cout << mn_l << '\n';
|
||||
}
|
||||
|
||||
int main() {
|
||||
#if __cplusplus < 201703L || defined(_MSC_VER) && !defined(__clang__)
|
||||
assert(false && "incompatible compiler variant detected.");
|
||||
#endif
|
||||
untie, cout.tie(NULL);
|
||||
prep();
|
||||
#ifdef SINGLE_TEST_CASE
|
||||
solve();
|
||||
#else
|
||||
read(int, t);
|
||||
for (int i = 0; i < t; ++i) {
|
||||
#ifdef DUMP_TEST_CASE
|
||||
if (t != (TOT_TEST_CASE)) {
|
||||
solve();
|
||||
} else if (i + 1 == (DUMP_TEST_CASE)) {
|
||||
dump();
|
||||
} else {
|
||||
dump_ignore();
|
||||
}
|
||||
#else
|
||||
solve();
|
||||
#endif
|
||||
}
|
||||
#endif
|
||||
}
|
||||
|
|
@ -0,0 +1,527 @@
|
|||
#pragma GCC optimize("Ofast")
|
||||
/////////////////////////////////////////////////////////
|
||||
/**
|
||||
* Useful Macros
|
||||
* by subcrip
|
||||
* (requires C++17)
|
||||
*/
|
||||
|
||||
#include<bits/stdc++.h>
|
||||
using namespace std;
|
||||
|
||||
/* macro helpers */
|
||||
#define __NARGS(...) std::tuple_size<decltype(std::make_tuple(__VA_ARGS__))>::value
|
||||
#define __DECOMPOSE_S(a, x) auto x = a;
|
||||
#define __DECOMPOSE_N(a, ...) auto [__VA_ARGS__] = a;
|
||||
constexpr void __() {}
|
||||
#define __AS_PROCEDURE(...) __(); __VA_ARGS__; __()
|
||||
#define __as_typeof(container) remove_reference<decltype(container)>::type
|
||||
|
||||
/* type aliases */
|
||||
#if LONG_LONG_MAX != INT64_MAX
|
||||
using ll = int64_t;
|
||||
using ull = uint64_t;
|
||||
#else
|
||||
using ll = long long;
|
||||
using ull = unsigned long long;
|
||||
using ld = long double;
|
||||
#endif
|
||||
using int128 = __int128_t;
|
||||
using uint128 = __uint128_t;
|
||||
using ld = long double;
|
||||
using pii = pair<int, int>;
|
||||
using pil = pair<int, ll>;
|
||||
using pli = pair<ll, int>;
|
||||
using pll = pair<ll, ll>;
|
||||
using pid = pair<int, ld>;
|
||||
using pdi = pair<ld, int>;
|
||||
using pld = pair<ll, ld>;
|
||||
using pdl = pair<ld, ll>;
|
||||
using pdd = pair<ld, ld>;
|
||||
using tlll = tuple<ll, ll, ll>;
|
||||
using tlld = tuple<ll, ll, ld>;
|
||||
using tlli = tuple<ll, ll, int>;
|
||||
using tldl = tuple<ll, ld, ll>;
|
||||
using tldd = tuple<ll, ld, ld>;
|
||||
using tldi = tuple<ll, ld, int>;
|
||||
using tlil = tuple<ll, int, ll>;
|
||||
using tlid = tuple<ll, int, ld>;
|
||||
using tlii = tuple<ll, int, int>;
|
||||
using tdll = tuple<ld, ll, ll>;
|
||||
using tdld = tuple<ld, ll, ld>;
|
||||
using tdli = tuple<ld, ll, int>;
|
||||
using tddl = tuple<ld, ld, ll>;
|
||||
using tddd = tuple<ld, ld, ld>;
|
||||
using tddi = tuple<ld, ld, int>;
|
||||
using tdil = tuple<ld, int, ll>;
|
||||
using tdid = tuple<ld, int, ld>;
|
||||
using tdii = tuple<ld, int, int>;
|
||||
using till = tuple<int, ll, ll>;
|
||||
using tild = tuple<int, ll, ld>;
|
||||
using tili = tuple<int, ll, int>;
|
||||
using tidl = tuple<int, ld, ll>;
|
||||
using tidd = tuple<int, ld, ld>;
|
||||
using tidi = tuple<int, ld, int>;
|
||||
using tiil = tuple<int, int, ll>;
|
||||
using tiid = tuple<int, int, ld>;
|
||||
using tiii = tuple<int, int, int>;
|
||||
template <typename T> using max_heap = priority_queue<T>;
|
||||
template <typename T> using min_heap = priority_queue<T, vector<T>, greater<>>;
|
||||
template <typename T> using oi = ostream_iterator<T>;
|
||||
template <typename T> using ii = istream_iterator<T>;
|
||||
|
||||
/* constants */
|
||||
constexpr int INF = 0x3f3f3f3f;
|
||||
constexpr ll INFLL = 0x3f3f3f3f3f3f3f3fLL;
|
||||
constexpr ll MDL = 1e9 + 7;
|
||||
constexpr ll PRIME = 998'244'353;
|
||||
constexpr ll MDL1 = 8784491;
|
||||
constexpr ll MDL2 = PRIME;
|
||||
constexpr int128 INT128_MAX = numeric_limits<int128>::max();
|
||||
constexpr uint128 UINT128_MAX = numeric_limits<uint128>::max();
|
||||
constexpr int128 INT128_MIN = numeric_limits<int128>::min();
|
||||
constexpr uint128 UINT128_MIN = numeric_limits<uint128>::min();
|
||||
|
||||
/* random */
|
||||
|
||||
mt19937 rd(chrono::duration_cast<chrono::milliseconds>(chrono::system_clock::now().time_since_epoch()).count());
|
||||
|
||||
/* bit-wise operations */
|
||||
#define lowbit(x) ((x) & -(x))
|
||||
#define popcount(x) (__builtin_popcountll(ll(x)))
|
||||
#define parity(x) (__builtin_parityll(ll(x)))
|
||||
#define msp(x) (63LL - __builtin_clzll(ll(x)))
|
||||
#define lsp(x) (__builtin_ctzll(ll(x)))
|
||||
|
||||
/* arithmetic operations */
|
||||
#define mod(x, y) ((((x) % (y)) + (y)) % (y))
|
||||
|
||||
/* fast pairs */
|
||||
#define upair ull
|
||||
#define umake(x, y) (ull(x) << 32 | (ull(y) & ((1ULL << 32) - 1)))
|
||||
#define u1(p) ((p) >> 32)
|
||||
#define u2(p) ((p) & ((1ULL << 32) - 1))
|
||||
#define ult std::less<upair>
|
||||
#define ugt std::greater<upair>
|
||||
|
||||
#define ipair ull
|
||||
#define imake(x, y) (umake(x, y))
|
||||
#define i1(p) (int(u1(ll(p))))
|
||||
#define i2(p) (ll(u2(p) << 32) >> 32)
|
||||
struct ilt {
|
||||
bool operator()(const ipair& a, const ipair& b) const {
|
||||
if (i1(a) == i1(b)) return i2(a) < i2(b);
|
||||
else return i1(a) < i1(b);
|
||||
}
|
||||
};
|
||||
struct igt {
|
||||
bool operator()(const ipair& a, const ipair& b) const {
|
||||
if (i1(a) == i1(b)) return i2(a) > i2(b);
|
||||
else return i1(a) > i1(b);
|
||||
}
|
||||
};
|
||||
|
||||
/* conditions */
|
||||
#define loop while (1)
|
||||
#define if_or(var, val) if (!(var == val)) var = val; else
|
||||
#define continue_or(var, val) __AS_PROCEDURE(if (var == val) continue; var = val;)
|
||||
#define break_or(var, val) __AS_PROCEDURE(if (var == val) break; var = val;)
|
||||
|
||||
/* hash */
|
||||
struct safe_hash {
|
||||
// https://codeforces.com/blog/entry/62393
|
||||
static uint64_t splitmix64(uint64_t x) {
|
||||
// http://xorshift.di.unimi.it/splitmix64.c
|
||||
x += 0x9e3779b97f4a7c15;
|
||||
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
|
||||
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
|
||||
return x ^ (x >> 31);
|
||||
}
|
||||
|
||||
size_t operator()(uint64_t x) const {
|
||||
static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
|
||||
return splitmix64(x + FIXED_RANDOM);
|
||||
}
|
||||
};
|
||||
|
||||
struct pair_hash {
|
||||
template <typename T, typename U>
|
||||
size_t operator()(const pair<T, U>& a) const {
|
||||
auto hash1 = safe_hash()(a.first);
|
||||
auto hash2 = safe_hash()(a.second);
|
||||
if (hash1 != hash2) {
|
||||
return hash1 ^ hash2;
|
||||
}
|
||||
return hash1;
|
||||
}
|
||||
};
|
||||
|
||||
uniform_int_distribution<mt19937::result_type> dist(PRIME);
|
||||
const size_t __array_hash_b = 31, __array_hash_mdl1 = dist(rd), __array_hash_mdl2 = dist(rd);
|
||||
struct array_hash {
|
||||
template <typename Sequence>
|
||||
size_t operator()(const Sequence& arr) const {
|
||||
size_t pw1 = 1, pw2 = 1;
|
||||
size_t res1 = 0, res2 = 0;
|
||||
for (auto&& x : arr) {
|
||||
res1 = (res1 + x * pw1) % __array_hash_mdl1;
|
||||
res2 = (res2 + x * pw2) % __array_hash_mdl2;
|
||||
pw1 = (pw1 * __array_hash_b) % __array_hash_mdl1;
|
||||
pw2 = (pw2 * __array_hash_b) % __array_hash_mdl2;
|
||||
}
|
||||
return res1 + res2;
|
||||
}
|
||||
};
|
||||
|
||||
/* build data structures */
|
||||
#define unordered_counter(from, to) __AS_PROCEDURE(unordered_map<__as_typeof(from), size_t, safe_hash> to; for (auto&& x : from) ++to[x];)
|
||||
#define counter(from, to, cmp) __AS_PROCEDURE(map<__as_typeof(from), size_t, cmp> to; for (auto&& x : from) ++to[x];)
|
||||
#define pa(a) __AS_PROCEDURE(__typeof(a) pa; pa.push_back({}); for (auto&&x : a) pa.push_back(pa.back() + x);)
|
||||
#define sa(a) __AS_PROCEDURE(__typeof(a) sa(a.size() + 1); {int n = a.size(); for (int i = n - 1; i >= 0; --i) sa[i] = sa[i + 1] + a[i];};)
|
||||
#define adj(ch, n) __AS_PROCEDURE(vector<vector<int>> ch((n) + 1);)
|
||||
#define edge(ch, u, v) __AS_PROCEDURE(ch[u].push_back(v), ch[v].push_back(u);)
|
||||
#define edgew(ch, u, v, w) __AS_PROCEDURE(ch[u].emplace_back(v, w), ch[v].emplace_back(u, w);)
|
||||
#define Edge(ch, u, v) __AS_PROCEDURE(ch[u].push_back(v);)
|
||||
#define Edgew(ch, u, v, w) __AS_PROCEDURE(ch[u].emplace_back(v, w);)
|
||||
template <typename T, typename Iterator> pair<size_t, map<T, size_t>> discretize(Iterator __first, Iterator __last) {
|
||||
set<T> st(__first, __last);
|
||||
size_t N = 0;
|
||||
map<T, size_t> mp;
|
||||
for (auto&& x : st) mp[x] = ++N;
|
||||
return {N, mp};
|
||||
}
|
||||
template <typename T, typename Iterator> pair<size_t, unordered_map<T, size_t, safe_hash>> unordered_discretize(Iterator __first, Iterator __last) {
|
||||
set<T> st(__first, __last);
|
||||
size_t N = 0;
|
||||
unordered_map<T, size_t, safe_hash> mp;
|
||||
for (auto&& x : st) mp[x] = ++N;
|
||||
return {N, mp};
|
||||
}
|
||||
|
||||
/* io */
|
||||
#define untie __AS_PROCEDURE(ios_base::sync_with_stdio(0), cin.tie(NULL))
|
||||
template<typename T> void __read(T& x) { cin >> x; }
|
||||
template<typename T, typename... U> void __read(T& x, U&... args) { cin >> x; __read(args...); }
|
||||
#define read(type, ...) __AS_PROCEDURE(type __VA_ARGS__; __read(__VA_ARGS__);)
|
||||
#define readvec(type, a, n) __AS_PROCEDURE(vector<type> a(n); for (auto& x : a) cin >> x;)
|
||||
#define readvec1(type, a, n) __AS_PROCEDURE(vector<type> a((n) + 1); copy_n(ii<type>(cin), (n), a.begin() + 1);)
|
||||
#define putvec(a) __AS_PROCEDURE(copy(a.begin(), a.end(), oi<__as_typeof(a)::value_type>(cout, " ")); cout << endl;)
|
||||
#define putvec1(a) __AS_PROCEDURE(copy(a.begin() + 1, a.end(), oi<__as_typeof(a)::value_type>(cout, " ")); cout << endl;)
|
||||
#define putvec_eol(a) __AS_PROCEDURE(copy(a.begin(), a.end(), oi<__as_typeof(a)::value_type>(cout, "\n"));)
|
||||
#define putvec1_eol(a) __AS_PROCEDURE(copy(a.begin() + 1, a.end(), oi<__as_typeof(a)::value_type>(cout, "\n"));)
|
||||
#define debug(x) __AS_PROCEDURE(cerr << #x" = " << (x) << endl;)
|
||||
#define debugvec(a) __AS_PROCEDURE(cerr << #a" = "; for (auto&& x : a) cerr << x << ' '; cerr << endl;)
|
||||
template<typename T, typename U> istream& operator>>(istream& in, pair<T, U>& p) {
|
||||
return in >> p.first >> p.second;
|
||||
}
|
||||
template<typename T, typename U> ostream& operator<<(ostream& out, const pair<T, U>& p) {
|
||||
out << "{" << p.first << ", " << p.second << "}";
|
||||
return out;
|
||||
}
|
||||
template<typename Char, typename Traits, typename Tuple, std::size_t... Index>
|
||||
void print_tuple_impl(std::basic_ostream<Char, Traits>& os, const Tuple& t, std::index_sequence<Index...>) {
|
||||
using swallow = int[]; // guaranties left to right order
|
||||
(void)swallow { 0, (void(os << (Index == 0 ? "" : ", ") << std::get<Index>(t)), 0)... };
|
||||
}
|
||||
template<typename Char, typename Traits, typename... Args>
|
||||
decltype(auto) operator<<(std::basic_ostream<Char, Traits>& os, const std::tuple<Args...>& t) {
|
||||
os << "{";
|
||||
print_tuple_impl(os, t, std::index_sequence_for<Args...>{});
|
||||
return os << "}";
|
||||
}
|
||||
template<typename T> ostream& operator<<(ostream& out, const vector<T>& vec) {
|
||||
for (auto&& i : vec) out << i << ' ';
|
||||
return out;
|
||||
}
|
||||
std::ostream& operator<<(std::ostream& dest, const int128& value) {
|
||||
// https://stackoverflow.com/a/25115163/23881100
|
||||
std::ostream::sentry s( dest );
|
||||
if ( s ) {
|
||||
uint128 tmp = value < 0 ? -value : value;
|
||||
char buffer[ 128 ];
|
||||
char* d = std::end( buffer );
|
||||
do {
|
||||
-- d;
|
||||
*d = "0123456789"[ tmp % 10 ];
|
||||
tmp /= 10;
|
||||
} while ( tmp != 0 );
|
||||
if ( value < 0 ) {
|
||||
-- d;
|
||||
*d = '-';
|
||||
}
|
||||
int len = std::end( buffer ) - d;
|
||||
if ( dest.rdbuf()->sputn( d, len ) != len ) {
|
||||
dest.setstate( std::ios_base::badbit );
|
||||
}
|
||||
}
|
||||
return dest;
|
||||
}
|
||||
|
||||
/* pops */
|
||||
#define poptop(q, ...) __AS_PROCEDURE(auto [__VA_ARGS__] = q.top(); q.pop();)
|
||||
#define popback(q, ...) __AS_PROCEDURE(auto [__VA_ARGS__] = q.back(); q.pop_back();)
|
||||
#define popfront(q, ...) __AS_PROCEDURE(auto [__VA_ARGS__] = q.front();q.pop_front();)
|
||||
|
||||
/* math */
|
||||
constexpr inline int lg2(ll x) { return x == 0 ? -1 : sizeof(ll) * 8 - 1 - __builtin_clzll(x); }
|
||||
|
||||
void __exgcd(ll a, ll b, ll& x, ll& y) {
|
||||
if (b == 0) {
|
||||
x = 1, y = 0;
|
||||
return;
|
||||
}
|
||||
__exgcd(b, a % b, y, x);
|
||||
y -= a / b * x;
|
||||
}
|
||||
|
||||
ll inverse(ll a, ll b) {
|
||||
ll x, y;
|
||||
__exgcd(a, b, x, y);
|
||||
return mod(x, b);
|
||||
}
|
||||
|
||||
vector<tuple<int, int, ll>> decompose(ll x) {
|
||||
// return (factor, count, factor ** count)
|
||||
vector<tuple<int, int, ll>> res;
|
||||
for (int i = 2; i * i <= x; i++) {
|
||||
if (x % i == 0) {
|
||||
int cnt = 0;
|
||||
ll pw = 1;
|
||||
while (x % i == 0) ++cnt, x /= i, pw *= i;
|
||||
res.emplace_back(i, cnt, pw);
|
||||
}
|
||||
}
|
||||
if (x != 1) {
|
||||
res.emplace_back(x, 1, x);
|
||||
}
|
||||
return res;
|
||||
}
|
||||
|
||||
vector<pii> decompose_prime(int N) {
|
||||
// return (factor, count)
|
||||
vector<pii> result;
|
||||
for (int i = 2; i * i <= N; i++) {
|
||||
if (N % i == 0) {
|
||||
int cnt = 0;
|
||||
while (N % i == 0) N /= i, ++cnt;
|
||||
result.emplace_back(i, cnt);
|
||||
}
|
||||
}
|
||||
if (N != 1) {
|
||||
result.emplace_back(N, 1);
|
||||
}
|
||||
return result;
|
||||
}
|
||||
|
||||
/* string algorithms */
|
||||
vector<int> calc_next(string t) { // pi function of t
|
||||
int n = (int)t.length();
|
||||
vector<int> pi(n);
|
||||
for (int i = 1; i < n; i++) {
|
||||
int j = pi[i - 1];
|
||||
while (j > 0 && t[i] != t[j]) j = pi[j - 1];
|
||||
if (t[i] == t[j]) j++;
|
||||
pi[i] = j;
|
||||
}
|
||||
return pi;
|
||||
}
|
||||
vector<int> calc_z(string t) { // z function of t
|
||||
int m = t.length();
|
||||
vector<int> z;
|
||||
z.push_back(m);
|
||||
pair<int, int> prev = {1, -1};
|
||||
for (int i = 1; i < m; ++i) {
|
||||
if (z[i - prev.first] + i <= prev.second) {
|
||||
z.push_back(z[i - prev.first]);
|
||||
} else {
|
||||
int j = max(i, prev.second + 1);
|
||||
while (j < m && t[j] == t[j - i]) ++j;
|
||||
z.push_back(j - i);
|
||||
prev = {i, j - 1};
|
||||
}
|
||||
}
|
||||
return z;
|
||||
}
|
||||
vector<int> kmp(string s, string t) { // find all t in s
|
||||
string cur = t + '#' + s;
|
||||
int sz1 = s.size(), sz2 = t.size();
|
||||
vector<int> v;
|
||||
vector<int> lps = calc_next(cur);
|
||||
for (int i = sz2 + 1; i <= sz1 + sz2; i++) {
|
||||
if (lps[i] == sz2) v.push_back(i - 2 * sz2);
|
||||
}
|
||||
return v;
|
||||
}
|
||||
int period(string s) { // find the length of shortest recurring period
|
||||
int n = s.length();
|
||||
auto z = calc_z(s);
|
||||
for (int i = 1; i <= n / 2; ++i) {
|
||||
if (n % i == 0 && z[i] == n - i) {
|
||||
return i;
|
||||
}
|
||||
}
|
||||
return n;
|
||||
}
|
||||
|
||||
/* modular arithmetic */
|
||||
template <ll mdl> struct MLL {
|
||||
ll val;
|
||||
MLL(ll v = 0) : val(mod(v, mdl)) {}
|
||||
MLL(const MLL<mdl>& other) : val(other.val) {}
|
||||
friend MLL operator+(const MLL& lhs, const MLL& rhs) { return mod(lhs.val + rhs.val, mdl); }
|
||||
friend MLL operator-(const MLL& lhs, const MLL& rhs) { return mod(lhs.val - rhs.val, mdl); }
|
||||
friend MLL operator*(const MLL& lhs, const MLL& rhs) { return mod(lhs.val * rhs.val, mdl); }
|
||||
friend MLL operator/(const MLL& lhs, const MLL& rhs) { return mod(lhs.val * mod(inverse(rhs.val, mdl), mdl), mdl); }
|
||||
friend MLL operator%(const MLL& lhs, const MLL& rhs) { return mod(lhs.val - (lhs / rhs).val, mdl); }
|
||||
friend bool operator==(const MLL& lhs, const MLL& rhs) { return lhs.val == rhs.val; }
|
||||
friend bool operator!=(const MLL& lhs, const MLL& rhs) { return lhs.val != rhs.val; }
|
||||
void operator+=(const MLL& rhs) { val = (*this + rhs).val; }
|
||||
void operator-=(const MLL& rhs) { val = (*this - rhs).val; }
|
||||
void operator*=(const MLL& rhs) { val = (*this * rhs).val; }
|
||||
void operator/=(const MLL& rhs) { val = (*this / rhs).val; }
|
||||
void operator%=(const MLL& rhs) { val = (*this % rhs).val; }
|
||||
};
|
||||
struct MLLd {
|
||||
ll val, mdl;
|
||||
MLLd(ll mdl, ll v = 0) : mdl(mdl), val(mod(v, mdl)) {}
|
||||
MLLd(const MLLd& other) : val(other.val) {}
|
||||
friend MLLd operator+(const MLLd& lhs, const MLLd& rhs) { return mod(lhs.val + rhs.val, lhs.mdl); }
|
||||
friend MLLd operator-(const MLLd& lhs, const MLLd& rhs) { return mod(lhs.val - rhs.val, lhs.mdl); }
|
||||
friend MLLd operator*(const MLLd& lhs, const MLLd& rhs) { return mod(lhs.val * rhs.val, lhs.mdl); }
|
||||
friend MLLd operator/(const MLLd& lhs, const MLLd& rhs) { return mod(lhs.val * mod(inverse(rhs.val, lhs.mdl), lhs.mdl), lhs.mdl); }
|
||||
friend MLLd operator%(const MLLd& lhs, const MLLd& rhs) { return mod(lhs.val - (lhs / rhs).val, lhs.mdl); }
|
||||
friend bool operator==(const MLLd& lhs, const MLLd& rhs) { return lhs.val == rhs.val; }
|
||||
friend bool operator!=(const MLLd& lhs, const MLLd& rhs) { return lhs.val != rhs.val; }
|
||||
void operator+=(const MLLd& rhs) { val = (*this + rhs).val; }
|
||||
void operator-=(const MLLd& rhs) { val = (*this - rhs).val; }
|
||||
void operator*=(const MLLd& rhs) { val = (*this * rhs).val; }
|
||||
void operator/=(const MLLd& rhs) { val = (*this / rhs).val; }
|
||||
void operator%=(const MLLd& rhs) { val = (*this % rhs).val; }
|
||||
};
|
||||
|
||||
template <ll mdl>
|
||||
ostream& operator<<(ostream& out, const MLL<mdl>& num) {
|
||||
return out << num.val;
|
||||
}
|
||||
|
||||
ostream& operator<<(ostream& out, const MLLd& num) {
|
||||
return out << num.val;
|
||||
}
|
||||
|
||||
template <ll mdl>
|
||||
istream& operator>>(istream& in, MLL<mdl>& num) {
|
||||
return in >> num.val;
|
||||
}
|
||||
|
||||
istream& operator>>(istream& in, MLLd& num) {
|
||||
return in >> num.val;
|
||||
}
|
||||
|
||||
// miscancellous
|
||||
template <typename Func, typename RandomIt> void sort_by_key(RandomIt first, RandomIt last, Func extractor) {
|
||||
std::sort(first, last, [&] (auto&& a, auto&& b) { return std::less<>()(extractor(a), extractor(b)); });
|
||||
}
|
||||
template <typename Func, typename RandomIt, typename Compare> void sort_by_key(RandomIt first, RandomIt last, Func extractor, Compare comp) {
|
||||
std::sort(first, last, [&] (auto&& a, auto&& b) { return comp(extractor(a), extractor(b)); });
|
||||
}
|
||||
template <typename T, typename U, typename Iterator_T, typename Iterator_U>
|
||||
vector<pair<T, U>> zip(Iterator_T a_first, Iterator_T a_last, Iterator_U b_first, Iterator_U b_last) {
|
||||
vector<pair<T, U>> res;
|
||||
auto a_it = a_first;
|
||||
auto b_it = b_first;
|
||||
for (; a_it != a_last and b_it != b_last; ++a_it, ++b_it) {
|
||||
res.emplace_back(*a_it, *b_it);
|
||||
}
|
||||
return res;
|
||||
}
|
||||
template <typename T, typename U, typename Iterator_T, typename Iterator_U>
|
||||
vector<pair<T, U>> zip_n(Iterator_T a_first, Iterator_U b_first, size_t n) {
|
||||
vector<pair<T, U>> res;
|
||||
if (n > 0) {
|
||||
res.emplace_back(*a_first, *b_first);
|
||||
for (size_t i = 1; i != n; ++i) {
|
||||
res.emplace_back(*++a_first, *++b_first);
|
||||
}
|
||||
}
|
||||
return res;
|
||||
}
|
||||
template <typename T>
|
||||
class ArithmeticIterator : bidirectional_iterator_tag {
|
||||
public:
|
||||
using difference_type = ptrdiff_t;
|
||||
using value_type = T;
|
||||
private:
|
||||
value_type value;
|
||||
public:
|
||||
ArithmeticIterator(const T& value) : value(value) {}
|
||||
value_type operator*() const { return value; }
|
||||
ArithmeticIterator<T>& operator++() { ++value; return *this; }
|
||||
ArithmeticIterator<T>& operator--() { --value; return *this; }
|
||||
bool operator==(const ArithmeticIterator<T>& rhs) const { return value == rhs.value; }
|
||||
};
|
||||
/////////////////////////////////////////////////////////
|
||||
|
||||
// #define SINGLE_TEST_CASE
|
||||
// #define DUMP_TEST_CASE 7219
|
||||
// #define TOT_TEST_CASE 10000
|
||||
|
||||
void dump() {}
|
||||
|
||||
void dump_ignore() {}
|
||||
|
||||
void prep() {
|
||||
}
|
||||
|
||||
void solve() {
|
||||
read(int, n);
|
||||
readvec(int, a, n);
|
||||
vector<int> pos;
|
||||
for (int i = 1; i < n; i += 2) {
|
||||
if (a[i] == 1) {
|
||||
i += 1;
|
||||
}
|
||||
if (i == n) break;
|
||||
pos.emplace_back(i);
|
||||
}
|
||||
int target = n;
|
||||
vector<int> res(n);
|
||||
sort_by_key(pos.begin(), pos.end(), [&] (int i) { return a[i]; });
|
||||
for (auto&& i : pos) {
|
||||
res[i] = target--;
|
||||
}
|
||||
vector<int> rem;
|
||||
for (int i = 0; i < n; ++i) {
|
||||
if (not res[i]) rem.emplace_back(i);
|
||||
}
|
||||
sort_by_key(rem.begin(), rem.end(), [&] (int i) { return a[i]; });
|
||||
for (auto&& i : rem) {
|
||||
res[i] = target--;
|
||||
}
|
||||
putvec(res);
|
||||
}
|
||||
|
||||
int main() {
|
||||
#if __cplusplus < 201703L || defined(_MSC_VER) && !defined(__clang__)
|
||||
assert(false && "incompatible compiler variant detected.");
|
||||
#endif
|
||||
untie, cout.tie(NULL);
|
||||
prep();
|
||||
#ifdef SINGLE_TEST_CASE
|
||||
solve();
|
||||
#else
|
||||
read(int, t);
|
||||
for (int i = 0; i < t; ++i) {
|
||||
#ifdef DUMP_TEST_CASE
|
||||
if (t != (TOT_TEST_CASE)) {
|
||||
solve();
|
||||
} else if (i + 1 == (DUMP_TEST_CASE)) {
|
||||
dump();
|
||||
} else {
|
||||
dump_ignore();
|
||||
}
|
||||
#else
|
||||
solve();
|
||||
#endif
|
||||
}
|
||||
#endif
|
||||
}
|
||||
|
|
@ -0,0 +1,545 @@
|
|||
#pragma GCC optimize("Ofast")
|
||||
/////////////////////////////////////////////////////////
|
||||
/**
|
||||
* Useful Macros
|
||||
* by subcrip
|
||||
* (requires C++17)
|
||||
*/
|
||||
|
||||
#include<bits/stdc++.h>
|
||||
using namespace std;
|
||||
|
||||
/* macro helpers */
|
||||
#define __NARGS(...) std::tuple_size<decltype(std::make_tuple(__VA_ARGS__))>::value
|
||||
#define __DECOMPOSE_S(a, x) auto x = a;
|
||||
#define __DECOMPOSE_N(a, ...) auto [__VA_ARGS__] = a;
|
||||
constexpr void __() {}
|
||||
#define __AS_PROCEDURE(...) __(); __VA_ARGS__; __()
|
||||
#define __as_typeof(container) remove_reference<decltype(container)>::type
|
||||
|
||||
/* type aliases */
|
||||
#if LONG_LONG_MAX != INT64_MAX
|
||||
using ll = int64_t;
|
||||
using ull = uint64_t;
|
||||
#else
|
||||
using ll = long long;
|
||||
using ull = unsigned long long;
|
||||
using ld = long double;
|
||||
#endif
|
||||
using int128 = __int128_t;
|
||||
using uint128 = __uint128_t;
|
||||
using ld = long double;
|
||||
using pii = pair<int, int>;
|
||||
using pil = pair<int, ll>;
|
||||
using pli = pair<ll, int>;
|
||||
using pll = pair<ll, ll>;
|
||||
using pid = pair<int, ld>;
|
||||
using pdi = pair<ld, int>;
|
||||
using pld = pair<ll, ld>;
|
||||
using pdl = pair<ld, ll>;
|
||||
using pdd = pair<ld, ld>;
|
||||
using tlll = tuple<ll, ll, ll>;
|
||||
using tlld = tuple<ll, ll, ld>;
|
||||
using tlli = tuple<ll, ll, int>;
|
||||
using tldl = tuple<ll, ld, ll>;
|
||||
using tldd = tuple<ll, ld, ld>;
|
||||
using tldi = tuple<ll, ld, int>;
|
||||
using tlil = tuple<ll, int, ll>;
|
||||
using tlid = tuple<ll, int, ld>;
|
||||
using tlii = tuple<ll, int, int>;
|
||||
using tdll = tuple<ld, ll, ll>;
|
||||
using tdld = tuple<ld, ll, ld>;
|
||||
using tdli = tuple<ld, ll, int>;
|
||||
using tddl = tuple<ld, ld, ll>;
|
||||
using tddd = tuple<ld, ld, ld>;
|
||||
using tddi = tuple<ld, ld, int>;
|
||||
using tdil = tuple<ld, int, ll>;
|
||||
using tdid = tuple<ld, int, ld>;
|
||||
using tdii = tuple<ld, int, int>;
|
||||
using till = tuple<int, ll, ll>;
|
||||
using tild = tuple<int, ll, ld>;
|
||||
using tili = tuple<int, ll, int>;
|
||||
using tidl = tuple<int, ld, ll>;
|
||||
using tidd = tuple<int, ld, ld>;
|
||||
using tidi = tuple<int, ld, int>;
|
||||
using tiil = tuple<int, int, ll>;
|
||||
using tiid = tuple<int, int, ld>;
|
||||
using tiii = tuple<int, int, int>;
|
||||
template <typename T> using max_heap = priority_queue<T>;
|
||||
template <typename T> using min_heap = priority_queue<T, vector<T>, greater<>>;
|
||||
template <typename T> using oi = ostream_iterator<T>;
|
||||
template <typename T> using ii = istream_iterator<T>;
|
||||
|
||||
/* constants */
|
||||
constexpr int INF = 0x3f3f3f3f;
|
||||
constexpr ll INFLL = 0x3f3f3f3f3f3f3f3fLL;
|
||||
constexpr ll MDL = 1e9 + 7;
|
||||
constexpr ll PRIME = 998'244'353;
|
||||
constexpr ll MDL1 = 8784491;
|
||||
constexpr ll MDL2 = PRIME;
|
||||
constexpr int128 INT128_MAX = numeric_limits<int128>::max();
|
||||
constexpr uint128 UINT128_MAX = numeric_limits<uint128>::max();
|
||||
constexpr int128 INT128_MIN = numeric_limits<int128>::min();
|
||||
constexpr uint128 UINT128_MIN = numeric_limits<uint128>::min();
|
||||
|
||||
/* random */
|
||||
|
||||
mt19937 rd(chrono::duration_cast<chrono::milliseconds>(chrono::system_clock::now().time_since_epoch()).count());
|
||||
|
||||
/* bit-wise operations */
|
||||
#define lowbit(x) ((x) & -(x))
|
||||
#define popcount(x) (__builtin_popcountll(ll(x)))
|
||||
#define parity(x) (__builtin_parityll(ll(x)))
|
||||
#define msp(x) (63LL - __builtin_clzll(ll(x)))
|
||||
#define lsp(x) (__builtin_ctzll(ll(x)))
|
||||
|
||||
/* arithmetic operations */
|
||||
#define mod(x, y) ((((x) % (y)) + (y)) % (y))
|
||||
|
||||
/* fast pairs */
|
||||
#define upair ull
|
||||
#define umake(x, y) (ull(x) << 32 | (ull(y) & ((1ULL << 32) - 1)))
|
||||
#define u1(p) ((p) >> 32)
|
||||
#define u2(p) ((p) & ((1ULL << 32) - 1))
|
||||
#define ult std::less<upair>
|
||||
#define ugt std::greater<upair>
|
||||
|
||||
#define ipair ull
|
||||
#define imake(x, y) (umake(x, y))
|
||||
#define i1(p) (int(u1(ll(p))))
|
||||
#define i2(p) (ll(u2(p) << 32) >> 32)
|
||||
struct ilt {
|
||||
bool operator()(const ipair& a, const ipair& b) const {
|
||||
if (i1(a) == i1(b)) return i2(a) < i2(b);
|
||||
else return i1(a) < i1(b);
|
||||
}
|
||||
};
|
||||
struct igt {
|
||||
bool operator()(const ipair& a, const ipair& b) const {
|
||||
if (i1(a) == i1(b)) return i2(a) > i2(b);
|
||||
else return i1(a) > i1(b);
|
||||
}
|
||||
};
|
||||
|
||||
/* conditions */
|
||||
#define loop while (1)
|
||||
#define if_or(var, val) if (!(var == val)) var = val; else
|
||||
#define continue_or(var, val) __AS_PROCEDURE(if (var == val) continue; var = val;)
|
||||
#define break_or(var, val) __AS_PROCEDURE(if (var == val) break; var = val;)
|
||||
|
||||
/* hash */
|
||||
struct safe_hash {
|
||||
// https://codeforces.com/blog/entry/62393
|
||||
static uint64_t splitmix64(uint64_t x) {
|
||||
// http://xorshift.di.unimi.it/splitmix64.c
|
||||
x += 0x9e3779b97f4a7c15;
|
||||
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
|
||||
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
|
||||
return x ^ (x >> 31);
|
||||
}
|
||||
|
||||
size_t operator()(uint64_t x) const {
|
||||
static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
|
||||
return splitmix64(x + FIXED_RANDOM);
|
||||
}
|
||||
};
|
||||
|
||||
struct pair_hash {
|
||||
template <typename T, typename U>
|
||||
size_t operator()(const pair<T, U>& a) const {
|
||||
auto hash1 = safe_hash()(a.first);
|
||||
auto hash2 = safe_hash()(a.second);
|
||||
if (hash1 != hash2) {
|
||||
return hash1 ^ hash2;
|
||||
}
|
||||
return hash1;
|
||||
}
|
||||
};
|
||||
|
||||
uniform_int_distribution<mt19937::result_type> dist(PRIME);
|
||||
const size_t __array_hash_b = 31, __array_hash_mdl1 = dist(rd), __array_hash_mdl2 = dist(rd);
|
||||
struct array_hash {
|
||||
template <typename Sequence>
|
||||
size_t operator()(const Sequence& arr) const {
|
||||
size_t pw1 = 1, pw2 = 1;
|
||||
size_t res1 = 0, res2 = 0;
|
||||
for (auto&& x : arr) {
|
||||
res1 = (res1 + x * pw1) % __array_hash_mdl1;
|
||||
res2 = (res2 + x * pw2) % __array_hash_mdl2;
|
||||
pw1 = (pw1 * __array_hash_b) % __array_hash_mdl1;
|
||||
pw2 = (pw2 * __array_hash_b) % __array_hash_mdl2;
|
||||
}
|
||||
return res1 + res2;
|
||||
}
|
||||
};
|
||||
|
||||
/* build data structures */
|
||||
#define unordered_counter(from, to) __AS_PROCEDURE(unordered_map<__as_typeof(from), size_t, safe_hash> to; for (auto&& x : from) ++to[x];)
|
||||
#define counter(from, to, cmp) __AS_PROCEDURE(map<__as_typeof(from), size_t, cmp> to; for (auto&& x : from) ++to[x];)
|
||||
#define pa(a) __AS_PROCEDURE(__typeof(a) pa; pa.push_back({}); for (auto&&x : a) pa.push_back(pa.back() + x);)
|
||||
#define sa(a) __AS_PROCEDURE(__typeof(a) sa(a.size() + 1); {int n = a.size(); for (int i = n - 1; i >= 0; --i) sa[i] = sa[i + 1] + a[i];};)
|
||||
#define adj(ch, n) __AS_PROCEDURE(vector<vector<int>> ch((n) + 1);)
|
||||
#define edge(ch, u, v) __AS_PROCEDURE(ch[u].push_back(v), ch[v].push_back(u);)
|
||||
#define edgew(ch, u, v, w) __AS_PROCEDURE(ch[u].emplace_back(v, w), ch[v].emplace_back(u, w);)
|
||||
#define Edge(ch, u, v) __AS_PROCEDURE(ch[u].push_back(v);)
|
||||
#define Edgew(ch, u, v, w) __AS_PROCEDURE(ch[u].emplace_back(v, w);)
|
||||
template <typename T, typename Iterator> pair<size_t, map<T, size_t>> discretize(Iterator __first, Iterator __last) {
|
||||
set<T> st(__first, __last);
|
||||
size_t N = 0;
|
||||
map<T, size_t> mp;
|
||||
for (auto&& x : st) mp[x] = ++N;
|
||||
return {N, mp};
|
||||
}
|
||||
template <typename T, typename Iterator> pair<size_t, unordered_map<T, size_t, safe_hash>> unordered_discretize(Iterator __first, Iterator __last) {
|
||||
set<T> st(__first, __last);
|
||||
size_t N = 0;
|
||||
unordered_map<T, size_t, safe_hash> mp;
|
||||
for (auto&& x : st) mp[x] = ++N;
|
||||
return {N, mp};
|
||||
}
|
||||
|
||||
/* io */
|
||||
#define untie __AS_PROCEDURE(ios_base::sync_with_stdio(0), cin.tie(NULL))
|
||||
template<typename T> void __read(T& x) { cin >> x; }
|
||||
template<typename T, typename... U> void __read(T& x, U&... args) { cin >> x; __read(args...); }
|
||||
#define read(type, ...) __AS_PROCEDURE(type __VA_ARGS__; __read(__VA_ARGS__);)
|
||||
#define readvec(type, a, n) __AS_PROCEDURE(vector<type> a(n); for (auto& x : a) cin >> x;)
|
||||
#define readvec1(type, a, n) __AS_PROCEDURE(vector<type> a((n) + 1); copy_n(ii<type>(cin), (n), a.begin() + 1);)
|
||||
#define putvec(a) __AS_PROCEDURE(copy(a.begin(), a.end(), oi<__as_typeof(a)::value_type>(cout, " ")); cout << endl;)
|
||||
#define putvec1(a) __AS_PROCEDURE(copy(a.begin() + 1, a.end(), oi<__as_typeof(a)::value_type>(cout, " ")); cout << endl;)
|
||||
#define putvec_eol(a) __AS_PROCEDURE(copy(a.begin(), a.end(), oi<__as_typeof(a)::value_type>(cout, "\n"));)
|
||||
#define putvec1_eol(a) __AS_PROCEDURE(copy(a.begin() + 1, a.end(), oi<__as_typeof(a)::value_type>(cout, "\n"));)
|
||||
#define debug(x) __AS_PROCEDURE(cerr << #x" = " << (x) << endl;)
|
||||
#define debugvec(a) __AS_PROCEDURE(cerr << #a" = "; for (auto&& x : a) cerr << x << ' '; cerr << endl;)
|
||||
template<typename T, typename U> istream& operator>>(istream& in, pair<T, U>& p) {
|
||||
return in >> p.first >> p.second;
|
||||
}
|
||||
template<typename T, typename U> ostream& operator<<(ostream& out, const pair<T, U>& p) {
|
||||
out << "{" << p.first << ", " << p.second << "}";
|
||||
return out;
|
||||
}
|
||||
template<typename Char, typename Traits, typename Tuple, std::size_t... Index>
|
||||
void print_tuple_impl(std::basic_ostream<Char, Traits>& os, const Tuple& t, std::index_sequence<Index...>) {
|
||||
using swallow = int[]; // guaranties left to right order
|
||||
(void)swallow { 0, (void(os << (Index == 0 ? "" : ", ") << std::get<Index>(t)), 0)... };
|
||||
}
|
||||
template<typename Char, typename Traits, typename... Args>
|
||||
decltype(auto) operator<<(std::basic_ostream<Char, Traits>& os, const std::tuple<Args...>& t) {
|
||||
os << "{";
|
||||
print_tuple_impl(os, t, std::index_sequence_for<Args...>{});
|
||||
return os << "}";
|
||||
}
|
||||
template<typename T> ostream& operator<<(ostream& out, const vector<T>& vec) {
|
||||
for (auto&& i : vec) out << i << ' ';
|
||||
return out;
|
||||
}
|
||||
std::ostream& operator<<(std::ostream& dest, const int128& value) {
|
||||
// https://stackoverflow.com/a/25115163/23881100
|
||||
std::ostream::sentry s( dest );
|
||||
if ( s ) {
|
||||
uint128 tmp = value < 0 ? -value : value;
|
||||
char buffer[ 128 ];
|
||||
char* d = std::end( buffer );
|
||||
do {
|
||||
-- d;
|
||||
*d = "0123456789"[ tmp % 10 ];
|
||||
tmp /= 10;
|
||||
} while ( tmp != 0 );
|
||||
if ( value < 0 ) {
|
||||
-- d;
|
||||
*d = '-';
|
||||
}
|
||||
int len = std::end( buffer ) - d;
|
||||
if ( dest.rdbuf()->sputn( d, len ) != len ) {
|
||||
dest.setstate( std::ios_base::badbit );
|
||||
}
|
||||
}
|
||||
return dest;
|
||||
}
|
||||
|
||||
/* pops */
|
||||
#define poptop(q, ...) __AS_PROCEDURE(auto [__VA_ARGS__] = q.top(); q.pop();)
|
||||
#define popback(q, ...) __AS_PROCEDURE(auto [__VA_ARGS__] = q.back(); q.pop_back();)
|
||||
#define popfront(q, ...) __AS_PROCEDURE(auto [__VA_ARGS__] = q.front();q.pop_front();)
|
||||
|
||||
/* math */
|
||||
constexpr inline int lg2(ll x) { return x == 0 ? -1 : sizeof(ll) * 8 - 1 - __builtin_clzll(x); }
|
||||
|
||||
void __exgcd(ll a, ll b, ll& x, ll& y) {
|
||||
if (b == 0) {
|
||||
x = 1, y = 0;
|
||||
return;
|
||||
}
|
||||
__exgcd(b, a % b, y, x);
|
||||
y -= a / b * x;
|
||||
}
|
||||
|
||||
ll inverse(ll a, ll b) {
|
||||
ll x, y;
|
||||
__exgcd(a, b, x, y);
|
||||
return mod(x, b);
|
||||
}
|
||||
|
||||
vector<tuple<int, int, ll>> decompose(ll x) {
|
||||
// return (factor, count, factor ** count)
|
||||
vector<tuple<int, int, ll>> res;
|
||||
for (int i = 2; i * i <= x; i++) {
|
||||
if (x % i == 0) {
|
||||
int cnt = 0;
|
||||
ll pw = 1;
|
||||
while (x % i == 0) ++cnt, x /= i, pw *= i;
|
||||
res.emplace_back(i, cnt, pw);
|
||||
}
|
||||
}
|
||||
if (x != 1) {
|
||||
res.emplace_back(x, 1, x);
|
||||
}
|
||||
return res;
|
||||
}
|
||||
|
||||
vector<pii> decompose_prime(int N) {
|
||||
// return (factor, count)
|
||||
vector<pii> result;
|
||||
for (int i = 2; i * i <= N; i++) {
|
||||
if (N % i == 0) {
|
||||
int cnt = 0;
|
||||
while (N % i == 0) N /= i, ++cnt;
|
||||
result.emplace_back(i, cnt);
|
||||
}
|
||||
}
|
||||
if (N != 1) {
|
||||
result.emplace_back(N, 1);
|
||||
}
|
||||
return result;
|
||||
}
|
||||
|
||||
/* string algorithms */
|
||||
vector<int> calc_next(string t) { // pi function of t
|
||||
int n = (int)t.length();
|
||||
vector<int> pi(n);
|
||||
for (int i = 1; i < n; i++) {
|
||||
int j = pi[i - 1];
|
||||
while (j > 0 && t[i] != t[j]) j = pi[j - 1];
|
||||
if (t[i] == t[j]) j++;
|
||||
pi[i] = j;
|
||||
}
|
||||
return pi;
|
||||
}
|
||||
vector<int> calc_z(string t) { // z function of t
|
||||
int m = t.length();
|
||||
vector<int> z;
|
||||
z.push_back(m);
|
||||
pair<int, int> prev = {1, -1};
|
||||
for (int i = 1; i < m; ++i) {
|
||||
if (z[i - prev.first] + i <= prev.second) {
|
||||
z.push_back(z[i - prev.first]);
|
||||
} else {
|
||||
int j = max(i, prev.second + 1);
|
||||
while (j < m && t[j] == t[j - i]) ++j;
|
||||
z.push_back(j - i);
|
||||
prev = {i, j - 1};
|
||||
}
|
||||
}
|
||||
return z;
|
||||
}
|
||||
vector<int> kmp(string s, string t) { // find all t in s
|
||||
string cur = t + '#' + s;
|
||||
int sz1 = s.size(), sz2 = t.size();
|
||||
vector<int> v;
|
||||
vector<int> lps = calc_next(cur);
|
||||
for (int i = sz2 + 1; i <= sz1 + sz2; i++) {
|
||||
if (lps[i] == sz2) v.push_back(i - 2 * sz2);
|
||||
}
|
||||
return v;
|
||||
}
|
||||
int period(string s) { // find the length of shortest recurring period
|
||||
int n = s.length();
|
||||
auto z = calc_z(s);
|
||||
for (int i = 1; i <= n / 2; ++i) {
|
||||
if (n % i == 0 && z[i] == n - i) {
|
||||
return i;
|
||||
}
|
||||
}
|
||||
return n;
|
||||
}
|
||||
|
||||
/* modular arithmetic */
|
||||
template <ll mdl> struct MLL {
|
||||
ll val;
|
||||
MLL(ll v = 0) : val(mod(v, mdl)) {}
|
||||
MLL(const MLL<mdl>& other) : val(other.val) {}
|
||||
friend MLL operator+(const MLL& lhs, const MLL& rhs) { return mod(lhs.val + rhs.val, mdl); }
|
||||
friend MLL operator-(const MLL& lhs, const MLL& rhs) { return mod(lhs.val - rhs.val, mdl); }
|
||||
friend MLL operator*(const MLL& lhs, const MLL& rhs) { return mod(lhs.val * rhs.val, mdl); }
|
||||
friend MLL operator/(const MLL& lhs, const MLL& rhs) { return mod(lhs.val * mod(inverse(rhs.val, mdl), mdl), mdl); }
|
||||
friend MLL operator%(const MLL& lhs, const MLL& rhs) { return mod(lhs.val - (lhs / rhs).val, mdl); }
|
||||
friend bool operator==(const MLL& lhs, const MLL& rhs) { return lhs.val == rhs.val; }
|
||||
friend bool operator!=(const MLL& lhs, const MLL& rhs) { return lhs.val != rhs.val; }
|
||||
void operator+=(const MLL& rhs) { val = (*this + rhs).val; }
|
||||
void operator-=(const MLL& rhs) { val = (*this - rhs).val; }
|
||||
void operator*=(const MLL& rhs) { val = (*this * rhs).val; }
|
||||
void operator/=(const MLL& rhs) { val = (*this / rhs).val; }
|
||||
void operator%=(const MLL& rhs) { val = (*this % rhs).val; }
|
||||
};
|
||||
struct MLLd {
|
||||
ll val, mdl;
|
||||
MLLd(ll mdl, ll v = 0) : mdl(mdl), val(mod(v, mdl)) {}
|
||||
MLLd(const MLLd& other) : val(other.val) {}
|
||||
friend MLLd operator+(const MLLd& lhs, const MLLd& rhs) { return mod(lhs.val + rhs.val, lhs.mdl); }
|
||||
friend MLLd operator-(const MLLd& lhs, const MLLd& rhs) { return mod(lhs.val - rhs.val, lhs.mdl); }
|
||||
friend MLLd operator*(const MLLd& lhs, const MLLd& rhs) { return mod(lhs.val * rhs.val, lhs.mdl); }
|
||||
friend MLLd operator/(const MLLd& lhs, const MLLd& rhs) { return mod(lhs.val * mod(inverse(rhs.val, lhs.mdl), lhs.mdl), lhs.mdl); }
|
||||
friend MLLd operator%(const MLLd& lhs, const MLLd& rhs) { return mod(lhs.val - (lhs / rhs).val, lhs.mdl); }
|
||||
friend bool operator==(const MLLd& lhs, const MLLd& rhs) { return lhs.val == rhs.val; }
|
||||
friend bool operator!=(const MLLd& lhs, const MLLd& rhs) { return lhs.val != rhs.val; }
|
||||
void operator+=(const MLLd& rhs) { val = (*this + rhs).val; }
|
||||
void operator-=(const MLLd& rhs) { val = (*this - rhs).val; }
|
||||
void operator*=(const MLLd& rhs) { val = (*this * rhs).val; }
|
||||
void operator/=(const MLLd& rhs) { val = (*this / rhs).val; }
|
||||
void operator%=(const MLLd& rhs) { val = (*this % rhs).val; }
|
||||
};
|
||||
|
||||
template <ll mdl>
|
||||
ostream& operator<<(ostream& out, const MLL<mdl>& num) {
|
||||
return out << num.val;
|
||||
}
|
||||
|
||||
ostream& operator<<(ostream& out, const MLLd& num) {
|
||||
return out << num.val;
|
||||
}
|
||||
|
||||
template <ll mdl>
|
||||
istream& operator>>(istream& in, MLL<mdl>& num) {
|
||||
return in >> num.val;
|
||||
}
|
||||
|
||||
istream& operator>>(istream& in, MLLd& num) {
|
||||
return in >> num.val;
|
||||
}
|
||||
|
||||
// miscancellous
|
||||
template <typename Func, typename RandomIt> void sort_by_key(RandomIt first, RandomIt last, Func extractor) {
|
||||
std::sort(first, last, [&] (auto&& a, auto&& b) { return std::less<>()(extractor(a), extractor(b)); });
|
||||
}
|
||||
template <typename Func, typename RandomIt, typename Compare> void sort_by_key(RandomIt first, RandomIt last, Func extractor, Compare comp) {
|
||||
std::sort(first, last, [&] (auto&& a, auto&& b) { return comp(extractor(a), extractor(b)); });
|
||||
}
|
||||
template <typename T, typename U, typename Iterator_T, typename Iterator_U>
|
||||
vector<pair<T, U>> zip(Iterator_T a_first, Iterator_T a_last, Iterator_U b_first, Iterator_U b_last) {
|
||||
vector<pair<T, U>> res;
|
||||
auto a_it = a_first;
|
||||
auto b_it = b_first;
|
||||
for (; a_it != a_last and b_it != b_last; ++a_it, ++b_it) {
|
||||
res.emplace_back(*a_it, *b_it);
|
||||
}
|
||||
return res;
|
||||
}
|
||||
template <typename T, typename U, typename Iterator_T, typename Iterator_U>
|
||||
vector<pair<T, U>> zip_n(Iterator_T a_first, Iterator_U b_first, size_t n) {
|
||||
vector<pair<T, U>> res;
|
||||
if (n > 0) {
|
||||
res.emplace_back(*a_first, *b_first);
|
||||
for (size_t i = 1; i != n; ++i) {
|
||||
res.emplace_back(*++a_first, *++b_first);
|
||||
}
|
||||
}
|
||||
return res;
|
||||
}
|
||||
template <typename T>
|
||||
class ArithmeticIterator : bidirectional_iterator_tag {
|
||||
public:
|
||||
using difference_type = ptrdiff_t;
|
||||
using value_type = T;
|
||||
private:
|
||||
value_type value;
|
||||
public:
|
||||
ArithmeticIterator(const T& value) : value(value) {}
|
||||
value_type operator*() const { return value; }
|
||||
ArithmeticIterator<T>& operator++() { ++value; return *this; }
|
||||
ArithmeticIterator<T>& operator--() { --value; return *this; }
|
||||
bool operator==(const ArithmeticIterator<T>& rhs) const { return value == rhs.value; }
|
||||
};
|
||||
/////////////////////////////////////////////////////////
|
||||
|
||||
// #define SINGLE_TEST_CASE
|
||||
// #define DUMP_TEST_CASE 7219
|
||||
// #define TOT_TEST_CASE 10000
|
||||
|
||||
void dump() {}
|
||||
|
||||
void dump_ignore() {}
|
||||
|
||||
void prep() {
|
||||
}
|
||||
|
||||
void solve() {
|
||||
read(int, n, k);
|
||||
int mx = -1;
|
||||
for (int i = 1; i <= n; ++i) {
|
||||
cout << "? 1 " << ll(1) * i * n << endl;
|
||||
read(int, r);
|
||||
if (r == n) {
|
||||
mx = i;
|
||||
break;
|
||||
}
|
||||
}
|
||||
if (mx == -1) exit(825);
|
||||
for (int i = n / k; i >= 1; --i) {
|
||||
ll m = ll(1) * mx * i;
|
||||
int prev = 1;
|
||||
int f = 1;
|
||||
for (int j = 1; j <= k; ++j) {
|
||||
if (prev == n + 1) {
|
||||
f = 0;
|
||||
break;
|
||||
}
|
||||
cout << "? " << prev << ' ' << m << endl;
|
||||
read(int, r);
|
||||
if (r == n + 1) {
|
||||
f = 0;
|
||||
break;
|
||||
}
|
||||
prev = r + 1;
|
||||
}
|
||||
if (f and prev == n + 1) {
|
||||
// ok
|
||||
cout << "! " << m << endl;
|
||||
read(int, stat);
|
||||
if (stat == -1) {
|
||||
exit(0);
|
||||
}
|
||||
return;
|
||||
}
|
||||
}
|
||||
cout << "! -1" << endl;
|
||||
read(int, stat);
|
||||
if (stat == -1) {
|
||||
exit(0);
|
||||
}
|
||||
}
|
||||
|
||||
int main() {
|
||||
#if __cplusplus < 201703L || defined(_MSC_VER) && !defined(__clang__)
|
||||
assert(false && "incompatible compiler variant detected.");
|
||||
#endif
|
||||
untie, cout.tie(NULL);
|
||||
prep();
|
||||
#ifdef SINGLE_TEST_CASE
|
||||
solve();
|
||||
#else
|
||||
read(int, t);
|
||||
for (int i = 0; i < t; ++i) {
|
||||
#ifdef DUMP_TEST_CASE
|
||||
if (t != (TOT_TEST_CASE)) {
|
||||
solve();
|
||||
} else if (i + 1 == (DUMP_TEST_CASE)) {
|
||||
dump();
|
||||
} else {
|
||||
dump_ignore();
|
||||
}
|
||||
#else
|
||||
solve();
|
||||
#endif
|
||||
}
|
||||
#endif
|
||||
}
|
||||
|
|
@ -429,7 +429,7 @@ vector<pair<T, U>> zip(Iterator_T a_first, Iterator_T a_last, Iterator_U b_first
|
|||
vector<pair<T, U>> res;
|
||||
auto a_it = a_first;
|
||||
auto b_it = b_first;
|
||||
for (; a_it != a_last and b_it != b_last; ++a_it, ++b_it) {
|
||||
for (; not (a_it == a_last) and not (b_it == b_last); ++a_it, ++b_it) {
|
||||
res.emplace_back(*a_it, *b_it);
|
||||
}
|
||||
return res;
|
||||
|
|
@ -459,9 +459,12 @@ public:
|
|||
ArithmeticIterator<T>& operator--() { --value; return *this; }
|
||||
bool operator==(const ArithmeticIterator<T>& rhs) const { return value == rhs.value; }
|
||||
};
|
||||
template <typename T> vector<pair<int, T>> enumerate(const vector<T>& container) {
|
||||
return zip<int, T>(ArithmeticIterator<int>(0), ArithmeticIterator<int>(INT_MAX), container.begin(), container.end());
|
||||
}
|
||||
/////////////////////////////////////////////////////////
|
||||
|
||||
// #define SINGLE_TEST_CASE
|
||||
#define SINGLE_TEST_CASE
|
||||
// #define DUMP_TEST_CASE 7219
|
||||
// #define TOT_TEST_CASE 10000
|
||||
|
||||
|
|
@ -472,32 +475,192 @@ void dump_ignore() {}
|
|||
void prep() {
|
||||
}
|
||||
|
||||
void solve() {
|
||||
read(int, n);
|
||||
readvec(int, a, n);
|
||||
vector<int> pos;
|
||||
for (int i = 1; i < n; i += 2) {
|
||||
if (a[i] == 1) {
|
||||
i += 1;
|
||||
struct dinic {
|
||||
struct edge {
|
||||
int to;
|
||||
ll cap;
|
||||
ll flow;
|
||||
int rev;
|
||||
int mark;
|
||||
};
|
||||
vector<vector<edge>> edges;
|
||||
vector<int> layer;
|
||||
vector<bool> vis;
|
||||
dinic(int n) : edges(n + 1), layer(n + 1), vis(n + 1) {}
|
||||
void add_edge(int from, int to, ll cap, int mark = 0, int mark_rev = 0) {
|
||||
edges[from].push_back({ to, cap, 0, int(edges[to].size()), mark });
|
||||
edges[to].push_back({ from, 0, 0, int(edges[from].size() - 1), mark_rev });
|
||||
}
|
||||
bool bfs(int s, int t) {
|
||||
layer.assign(edges.size(), 0);
|
||||
deque<pii> dq;
|
||||
layer[s] = 1;
|
||||
dq.emplace_back(s, 1);
|
||||
while (dq.size()) {
|
||||
popfront(dq, v, l);
|
||||
for (auto&& e : edges[v]) {
|
||||
if (layer[e.to] == 0 and e.cap > e.flow) {
|
||||
layer[e.to] = l + 1;
|
||||
dq.emplace_back(e.to, l + 1);
|
||||
}
|
||||
}
|
||||
}
|
||||
if (i == n) break;
|
||||
pos.emplace_back(i);
|
||||
return layer[t] != 0;
|
||||
}
|
||||
int target = n;
|
||||
vector<int> res(n);
|
||||
sort_by_key(pos.begin(), pos.end(), [&] (int i) { return a[i]; });
|
||||
for (auto&& i : pos) {
|
||||
res[i] = target--;
|
||||
ll dfs(int s, int t, ll cap) {
|
||||
if (vis[s]) {
|
||||
return 0;
|
||||
}
|
||||
vis[s] = 1;
|
||||
if (s == t) {
|
||||
return cap;
|
||||
}
|
||||
ll res = 0;
|
||||
int n = edges[s].size();
|
||||
for (int i = 0; i < n; ++i) {
|
||||
auto&& e = edges[s][i];
|
||||
if (e.cap > e.flow and layer[e.to] == layer[s] + 1) {
|
||||
ll nw = dfs(e.to, t, min(cap - res, e.cap - e.flow));
|
||||
edges[s][i].flow += nw;
|
||||
edges[e.to][e.rev].flow -= nw;
|
||||
res += nw;
|
||||
if (res == cap) {
|
||||
return res;
|
||||
}
|
||||
}
|
||||
}
|
||||
return res;
|
||||
}
|
||||
vector<int> rem;
|
||||
for (int i = 0; i < n; ++i) {
|
||||
if (not res[i]) rem.emplace_back(i);
|
||||
ll run(int s, int t) {
|
||||
ll res = 0;
|
||||
while (bfs(s, t)) {
|
||||
vis.assign(edges.size(), 0);
|
||||
res += dfs(s, t, LLONG_MAX);
|
||||
}
|
||||
return res;
|
||||
}
|
||||
sort_by_key(rem.begin(), rem.end(), [&] (int i) { return a[i]; });
|
||||
for (auto&& i : rem) {
|
||||
res[i] = target--;
|
||||
};
|
||||
|
||||
struct bounded_flow {
|
||||
int n, m, S, T;
|
||||
dinic net;
|
||||
ll sum;
|
||||
vector<ll> fl;
|
||||
vector<ll> init;
|
||||
bounded_flow(int n, int m) : sum(0), n(n), m(m), S(0), T(n + 1), net(n + 1), fl(m), init(n + 1) {}
|
||||
void add_edge(int from, int to, ll low, ll high, int edge_id = -1) {
|
||||
if (edge_id != -1) {
|
||||
fl[edge_id] += low;
|
||||
}
|
||||
net.add_edge(from, to, high - low, edge_id, -1);
|
||||
init[to] += low, init[from] -= low;
|
||||
}
|
||||
void prep(int s, int t) {
|
||||
for (int i = 1; i <= n; ++i) {
|
||||
if (init[i] > 0) {
|
||||
net.add_edge(S, i, init[i], -1, -1);
|
||||
sum += init[i];
|
||||
} else if (init[i] < 0) {
|
||||
net.add_edge(i, T, -init[i], -1, -1);
|
||||
}
|
||||
}
|
||||
net.add_edge(t, s, INFLL, INF, -1);
|
||||
}
|
||||
optional<pair<ll, vector<ll>>> run_max_flow(int s, int t) {
|
||||
prep(s, t);
|
||||
if (sum != net.run(S, T)) {
|
||||
return nullopt;
|
||||
} else {
|
||||
auto res_flow = net.run(s, t);
|
||||
for (int from = 1; from <= n; ++from) {
|
||||
for (auto&& [to, cap, flow, rev, mark] : net.edges[from]) {
|
||||
if (mark != -1 and mark != INF) {
|
||||
fl[mark] += flow;
|
||||
}
|
||||
}
|
||||
}
|
||||
return {{res_flow, fl}};
|
||||
}
|
||||
}
|
||||
optional<pair<ll, vector<ll>>> run_min_flow(int s, int t) {
|
||||
prep(s, t);
|
||||
if (sum != net.run(S, T)) {
|
||||
return nullopt;
|
||||
} else {
|
||||
int curr;
|
||||
for (int i = 0; i < m; ++i) {
|
||||
if (net.edges[t][i].mark == INF) {
|
||||
net.edges[t][i].cap = 0;
|
||||
net.edges[net.edges[t][i].to][net.edges[t][i].rev].cap = 0;
|
||||
curr = net.edges[t][i].flow; // WARN: real flow
|
||||
break;
|
||||
}
|
||||
}
|
||||
curr -= net.run(t, s);
|
||||
for (int from = 1; from <= n; ++from) {
|
||||
for (auto&& [to, cap, flow, rev, mark] : net.edges[from]) {
|
||||
if (mark != -1 and mark != INF) {
|
||||
fl[mark] += flow;
|
||||
}
|
||||
}
|
||||
}
|
||||
return {{curr, fl}};
|
||||
}
|
||||
}
|
||||
optional<pair<ll, vector<ll>>> run_flow(int s, int t) {
|
||||
prep(s, t);
|
||||
auto res_flow = net.run(S, T);
|
||||
if (sum != res_flow) {
|
||||
return nullopt;
|
||||
} else {
|
||||
for (int from = 1; from <= n; ++from) {
|
||||
for (auto&& [to, cap, flow, rev, mark] : net.edges[from]) {
|
||||
if (mark != -1 and mark != INF) {
|
||||
fl[mark] += flow;
|
||||
}
|
||||
}
|
||||
}
|
||||
return {{res_flow, fl}};
|
||||
}
|
||||
}
|
||||
};
|
||||
|
||||
void solve() {
|
||||
read(int, n, m, s, t);
|
||||
dinic net(n + 1);
|
||||
int S = 0, T = n + 1;
|
||||
vector<ll> init(n + 1);
|
||||
for (int i = 0 ;i < m; ++i) {
|
||||
read(ll, u, v, lower, upper);
|
||||
init[v] += lower;
|
||||
init[u] -= lower;
|
||||
net.add_edge(u, v, upper - lower);
|
||||
}
|
||||
ll sum = 0;
|
||||
for (int i =1; i <= n; ++i) {
|
||||
if (init[i] > 0) {
|
||||
net.add_edge(S, i, init[i]);
|
||||
sum += init[i];
|
||||
} else if (init[i] < 0) {
|
||||
net.add_edge(i, T, -init[i]);
|
||||
}
|
||||
}
|
||||
net.add_edge(t, s, INFLL, 1, 1); // WARN: s->t is wrong
|
||||
if (sum != net.run(S, T)) {
|
||||
cout << "please go home to sleep\n";
|
||||
} else {
|
||||
int m = net.edges[t].size();
|
||||
int curr;
|
||||
for (int i = 0; i < m; ++i) {
|
||||
if (net.edges[t][i].mark) {
|
||||
net.edges[t][i].cap = 0;
|
||||
net.edges[net.edges[t][i].to][net.edges[t][i].rev].cap = 0;
|
||||
curr = net.edges[t][i].flow; // WARN: real flow
|
||||
break;
|
||||
}
|
||||
}
|
||||
cout << curr - net.run(t, s) << '\n';
|
||||
}
|
||||
putvec(res);
|
||||
}
|
||||
|
||||
int main() {
|
||||
|
|
|
|||
67
src/bin/d.cc
67
src/bin/d.cc
|
|
@ -429,7 +429,7 @@ vector<pair<T, U>> zip(Iterator_T a_first, Iterator_T a_last, Iterator_U b_first
|
|||
vector<pair<T, U>> res;
|
||||
auto a_it = a_first;
|
||||
auto b_it = b_first;
|
||||
for (; a_it != a_last and b_it != b_last; ++a_it, ++b_it) {
|
||||
for (; not (a_it == a_last) and not (b_it == b_last); ++a_it, ++b_it) {
|
||||
res.emplace_back(*a_it, *b_it);
|
||||
}
|
||||
return res;
|
||||
|
|
@ -459,9 +459,12 @@ public:
|
|||
ArithmeticIterator<T>& operator--() { --value; return *this; }
|
||||
bool operator==(const ArithmeticIterator<T>& rhs) const { return value == rhs.value; }
|
||||
};
|
||||
template <typename T> vector<pair<int, T>> enumerate(const vector<T>& container) {
|
||||
return zip<int, T>(ArithmeticIterator<int>(0), ArithmeticIterator<int>(INT_MAX), container.begin(), container.end());
|
||||
}
|
||||
/////////////////////////////////////////////////////////
|
||||
|
||||
// #define SINGLE_TEST_CASE
|
||||
#define SINGLE_TEST_CASE
|
||||
// #define DUMP_TEST_CASE 7219
|
||||
// #define TOT_TEST_CASE 10000
|
||||
|
||||
|
|
@ -473,48 +476,32 @@ void prep() {
|
|||
}
|
||||
|
||||
void solve() {
|
||||
read(int, n, k);
|
||||
int mx = -1;
|
||||
for (int i = 1; i <= n; ++i) {
|
||||
cout << "? 1 " << ll(1) * i * n << endl;
|
||||
read(int, r);
|
||||
if (r == n) {
|
||||
mx = i;
|
||||
break;
|
||||
read(ll, a, b, c, d);
|
||||
ll area = 0, rem1 = 0, rem2 = 0, rem3 = 0, rem4 = 0, rem5 = 0, rem6 = 0;
|
||||
if (mod(a, 4) == 0) {
|
||||
area = 6, rem1 = 3, rem2 = 3, rem3 = 2, rem4 = 1, rem5 = 1, rem6 = 2;
|
||||
} else if (mod(a, 4) == 1) {
|
||||
area = 4, rem1 = 1, rem2 = 3, rem3 = 1, rem4 = 0, rem5 = 2, rem6 = 1;
|
||||
} else if (mod(a, 4) == 2) {
|
||||
area = 2, rem1 = 1, rem2 = 1, rem3 = 0, rem4 = 1, rem5 = 1, rem6 = 0;
|
||||
} else {
|
||||
area = 4, rem1 = 3, rem2 = 1, rem3 = 1, rem4 = 2, rem5 = 0, rem6 = 1;
|
||||
}
|
||||
ll res = 0;
|
||||
res += (c - a) / 2 * (d - b) / 2 * area;
|
||||
if ((d - b) & 1) {
|
||||
if (b & 1) {
|
||||
res += (c - a) / 2 * rem2;
|
||||
} else {
|
||||
res += (c - a) / 2 * rem1;
|
||||
}
|
||||
}
|
||||
if (mx == -1) exit(825);
|
||||
for (int i = n / k; i >= 1; --i) {
|
||||
ll m = ll(1) * mx * i;
|
||||
int prev = 1;
|
||||
int f = 1;
|
||||
for (int j = 1; j <= k; ++j) {
|
||||
if (prev == n + 1) {
|
||||
f = 0;
|
||||
break;
|
||||
if ((c - a) & 1) {
|
||||
if ((a & 1) == 0) {
|
||||
if ((b & 1) == 0) {
|
||||
|
||||
}
|
||||
cout << "? " << prev << ' ' << m << endl;
|
||||
read(int, r);
|
||||
if (r == n + 1) {
|
||||
f = 0;
|
||||
break;
|
||||
}
|
||||
prev = r + 1;
|
||||
}
|
||||
if (f and prev == n + 1) {
|
||||
// ok
|
||||
cout << "! " << m << endl;
|
||||
read(int, stat);
|
||||
if (stat == -1) {
|
||||
exit(0);
|
||||
}
|
||||
return;
|
||||
}
|
||||
}
|
||||
cout << "! -1" << endl;
|
||||
read(int, stat);
|
||||
if (stat == -1) {
|
||||
exit(0);
|
||||
}
|
||||
}
|
||||
|
||||
|
|
|
|||
|
|
@ -0,0 +1,582 @@
|
|||
#pragma GCC optimize("Ofast")
|
||||
/////////////////////////////////////////////////////////
|
||||
/**
|
||||
* Useful Macros
|
||||
* by subcrip
|
||||
* (requires C++17)
|
||||
*/
|
||||
|
||||
#include<bits/stdc++.h>
|
||||
using namespace std;
|
||||
|
||||
/* macro helpers */
|
||||
#define __NARGS(...) std::tuple_size<decltype(std::make_tuple(__VA_ARGS__))>::value
|
||||
#define __DECOMPOSE_S(a, x) auto x = a;
|
||||
#define __DECOMPOSE_N(a, ...) auto [__VA_ARGS__] = a;
|
||||
constexpr void __() {}
|
||||
#define __AS_PROCEDURE(...) __(); __VA_ARGS__; __()
|
||||
#define __as_typeof(container) remove_reference<decltype(container)>::type
|
||||
|
||||
/* type aliases */
|
||||
#if LONG_LONG_MAX != INT64_MAX
|
||||
using ll = int64_t;
|
||||
using ull = uint64_t;
|
||||
#else
|
||||
using ll = long long;
|
||||
using ull = unsigned long long;
|
||||
using ld = long double;
|
||||
#endif
|
||||
using int128 = __int128_t;
|
||||
using uint128 = __uint128_t;
|
||||
using ld = long double;
|
||||
using pii = pair<int, int>;
|
||||
using pil = pair<int, ll>;
|
||||
using pli = pair<ll, int>;
|
||||
using pll = pair<ll, ll>;
|
||||
using pid = pair<int, ld>;
|
||||
using pdi = pair<ld, int>;
|
||||
using pld = pair<ll, ld>;
|
||||
using pdl = pair<ld, ll>;
|
||||
using pdd = pair<ld, ld>;
|
||||
using tlll = tuple<ll, ll, ll>;
|
||||
using tlld = tuple<ll, ll, ld>;
|
||||
using tlli = tuple<ll, ll, int>;
|
||||
using tldl = tuple<ll, ld, ll>;
|
||||
using tldd = tuple<ll, ld, ld>;
|
||||
using tldi = tuple<ll, ld, int>;
|
||||
using tlil = tuple<ll, int, ll>;
|
||||
using tlid = tuple<ll, int, ld>;
|
||||
using tlii = tuple<ll, int, int>;
|
||||
using tdll = tuple<ld, ll, ll>;
|
||||
using tdld = tuple<ld, ll, ld>;
|
||||
using tdli = tuple<ld, ll, int>;
|
||||
using tddl = tuple<ld, ld, ll>;
|
||||
using tddd = tuple<ld, ld, ld>;
|
||||
using tddi = tuple<ld, ld, int>;
|
||||
using tdil = tuple<ld, int, ll>;
|
||||
using tdid = tuple<ld, int, ld>;
|
||||
using tdii = tuple<ld, int, int>;
|
||||
using till = tuple<int, ll, ll>;
|
||||
using tild = tuple<int, ll, ld>;
|
||||
using tili = tuple<int, ll, int>;
|
||||
using tidl = tuple<int, ld, ll>;
|
||||
using tidd = tuple<int, ld, ld>;
|
||||
using tidi = tuple<int, ld, int>;
|
||||
using tiil = tuple<int, int, ll>;
|
||||
using tiid = tuple<int, int, ld>;
|
||||
using tiii = tuple<int, int, int>;
|
||||
template <typename T> using max_heap = priority_queue<T>;
|
||||
template <typename T> using min_heap = priority_queue<T, vector<T>, greater<>>;
|
||||
template <typename T> using oi = ostream_iterator<T>;
|
||||
template <typename T> using ii = istream_iterator<T>;
|
||||
|
||||
/* constants */
|
||||
constexpr int INF = 0x3f3f3f3f;
|
||||
constexpr ll INFLL = 0x3f3f3f3f3f3f3f3fLL;
|
||||
constexpr ll MDL = 1e9 + 7;
|
||||
constexpr ll PRIME = 998'244'353;
|
||||
constexpr ll MDL1 = 8784491;
|
||||
constexpr ll MDL2 = PRIME;
|
||||
constexpr int128 INT128_MAX = numeric_limits<int128>::max();
|
||||
constexpr uint128 UINT128_MAX = numeric_limits<uint128>::max();
|
||||
constexpr int128 INT128_MIN = numeric_limits<int128>::min();
|
||||
constexpr uint128 UINT128_MIN = numeric_limits<uint128>::min();
|
||||
|
||||
/* random */
|
||||
|
||||
mt19937 rd(chrono::duration_cast<chrono::milliseconds>(chrono::system_clock::now().time_since_epoch()).count());
|
||||
|
||||
/* bit-wise operations */
|
||||
#define lowbit(x) ((x) & -(x))
|
||||
#define popcount(x) (__builtin_popcountll(ll(x)))
|
||||
#define parity(x) (__builtin_parityll(ll(x)))
|
||||
#define msp(x) (63LL - __builtin_clzll(ll(x)))
|
||||
#define lsp(x) (__builtin_ctzll(ll(x)))
|
||||
|
||||
/* arithmetic operations */
|
||||
#define mod(x, y) ((((x) % (y)) + (y)) % (y))
|
||||
|
||||
/* fast pairs */
|
||||
#define upair ull
|
||||
#define umake(x, y) (ull(x) << 32 | (ull(y) & ((1ULL << 32) - 1)))
|
||||
#define u1(p) ((p) >> 32)
|
||||
#define u2(p) ((p) & ((1ULL << 32) - 1))
|
||||
#define ult std::less<upair>
|
||||
#define ugt std::greater<upair>
|
||||
|
||||
#define ipair ull
|
||||
#define imake(x, y) (umake(x, y))
|
||||
#define i1(p) (int(u1(ll(p))))
|
||||
#define i2(p) (ll(u2(p) << 32) >> 32)
|
||||
struct ilt {
|
||||
bool operator()(const ipair& a, const ipair& b) const {
|
||||
if (i1(a) == i1(b)) return i2(a) < i2(b);
|
||||
else return i1(a) < i1(b);
|
||||
}
|
||||
};
|
||||
struct igt {
|
||||
bool operator()(const ipair& a, const ipair& b) const {
|
||||
if (i1(a) == i1(b)) return i2(a) > i2(b);
|
||||
else return i1(a) > i1(b);
|
||||
}
|
||||
};
|
||||
|
||||
/* conditions */
|
||||
#define loop while (1)
|
||||
#define if_or(var, val) if (!(var == val)) var = val; else
|
||||
#define continue_or(var, val) __AS_PROCEDURE(if (var == val) continue; var = val;)
|
||||
#define break_or(var, val) __AS_PROCEDURE(if (var == val) break; var = val;)
|
||||
|
||||
/* hash */
|
||||
struct safe_hash {
|
||||
// https://codeforces.com/blog/entry/62393
|
||||
static uint64_t splitmix64(uint64_t x) {
|
||||
// http://xorshift.di.unimi.it/splitmix64.c
|
||||
x += 0x9e3779b97f4a7c15;
|
||||
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
|
||||
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
|
||||
return x ^ (x >> 31);
|
||||
}
|
||||
|
||||
size_t operator()(uint64_t x) const {
|
||||
static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
|
||||
return splitmix64(x + FIXED_RANDOM);
|
||||
}
|
||||
};
|
||||
|
||||
struct pair_hash {
|
||||
template <typename T, typename U>
|
||||
size_t operator()(const pair<T, U>& a) const {
|
||||
auto hash1 = safe_hash()(a.first);
|
||||
auto hash2 = safe_hash()(a.second);
|
||||
if (hash1 != hash2) {
|
||||
return hash1 ^ hash2;
|
||||
}
|
||||
return hash1;
|
||||
}
|
||||
};
|
||||
|
||||
uniform_int_distribution<mt19937::result_type> dist(PRIME);
|
||||
const size_t __array_hash_b = 31, __array_hash_mdl1 = dist(rd), __array_hash_mdl2 = dist(rd);
|
||||
struct array_hash {
|
||||
template <typename Sequence>
|
||||
size_t operator()(const Sequence& arr) const {
|
||||
size_t pw1 = 1, pw2 = 1;
|
||||
size_t res1 = 0, res2 = 0;
|
||||
for (auto&& x : arr) {
|
||||
res1 = (res1 + x * pw1) % __array_hash_mdl1;
|
||||
res2 = (res2 + x * pw2) % __array_hash_mdl2;
|
||||
pw1 = (pw1 * __array_hash_b) % __array_hash_mdl1;
|
||||
pw2 = (pw2 * __array_hash_b) % __array_hash_mdl2;
|
||||
}
|
||||
return res1 + res2;
|
||||
}
|
||||
};
|
||||
|
||||
/* build data structures */
|
||||
#define unordered_counter(from, to) __AS_PROCEDURE(unordered_map<__as_typeof(from), size_t, safe_hash> to; for (auto&& x : from) ++to[x];)
|
||||
#define counter(from, to, cmp) __AS_PROCEDURE(map<__as_typeof(from), size_t, cmp> to; for (auto&& x : from) ++to[x];)
|
||||
#define pa(a) __AS_PROCEDURE(__typeof(a) pa; pa.push_back({}); for (auto&&x : a) pa.push_back(pa.back() + x);)
|
||||
#define sa(a) __AS_PROCEDURE(__typeof(a) sa(a.size() + 1); {int n = a.size(); for (int i = n - 1; i >= 0; --i) sa[i] = sa[i + 1] + a[i];};)
|
||||
#define adj(ch, n) __AS_PROCEDURE(vector<vector<int>> ch((n) + 1);)
|
||||
#define edge(ch, u, v) __AS_PROCEDURE(ch[u].push_back(v), ch[v].push_back(u);)
|
||||
#define edgew(ch, u, v, w) __AS_PROCEDURE(ch[u].emplace_back(v, w), ch[v].emplace_back(u, w);)
|
||||
#define Edge(ch, u, v) __AS_PROCEDURE(ch[u].push_back(v);)
|
||||
#define Edgew(ch, u, v, w) __AS_PROCEDURE(ch[u].emplace_back(v, w);)
|
||||
template <typename T, typename Iterator> pair<size_t, map<T, size_t>> discretize(Iterator __first, Iterator __last) {
|
||||
set<T> st(__first, __last);
|
||||
size_t N = 0;
|
||||
map<T, size_t> mp;
|
||||
for (auto&& x : st) mp[x] = ++N;
|
||||
return {N, mp};
|
||||
}
|
||||
template <typename T, typename Iterator> pair<size_t, unordered_map<T, size_t, safe_hash>> unordered_discretize(Iterator __first, Iterator __last) {
|
||||
set<T> st(__first, __last);
|
||||
size_t N = 0;
|
||||
unordered_map<T, size_t, safe_hash> mp;
|
||||
for (auto&& x : st) mp[x] = ++N;
|
||||
return {N, mp};
|
||||
}
|
||||
|
||||
/* io */
|
||||
#define untie __AS_PROCEDURE(ios_base::sync_with_stdio(0), cin.tie(NULL))
|
||||
template<typename T> void __read(T& x) { cin >> x; }
|
||||
template<typename T, typename... U> void __read(T& x, U&... args) { cin >> x; __read(args...); }
|
||||
#define read(type, ...) __AS_PROCEDURE(type __VA_ARGS__; __read(__VA_ARGS__);)
|
||||
#define readvec(type, a, n) __AS_PROCEDURE(vector<type> a(n); for (auto& x : a) cin >> x;)
|
||||
#define readvec1(type, a, n) __AS_PROCEDURE(vector<type> a((n) + 1); copy_n(ii<type>(cin), (n), a.begin() + 1);)
|
||||
#define putvec(a) __AS_PROCEDURE(copy(a.begin(), a.end(), oi<__as_typeof(a)::value_type>(cout, " ")); cout << endl;)
|
||||
#define putvec1(a) __AS_PROCEDURE(copy(a.begin() + 1, a.end(), oi<__as_typeof(a)::value_type>(cout, " ")); cout << endl;)
|
||||
#define putvec_eol(a) __AS_PROCEDURE(copy(a.begin(), a.end(), oi<__as_typeof(a)::value_type>(cout, "\n"));)
|
||||
#define putvec1_eol(a) __AS_PROCEDURE(copy(a.begin() + 1, a.end(), oi<__as_typeof(a)::value_type>(cout, "\n"));)
|
||||
#define debug(x) __AS_PROCEDURE(cerr << #x" = " << (x) << endl;)
|
||||
#define debugvec(a) __AS_PROCEDURE(cerr << #a" = "; for (auto&& x : a) cerr << x << ' '; cerr << endl;)
|
||||
template<typename T, typename U> istream& operator>>(istream& in, pair<T, U>& p) {
|
||||
return in >> p.first >> p.second;
|
||||
}
|
||||
template<typename T, typename U> ostream& operator<<(ostream& out, const pair<T, U>& p) {
|
||||
out << "{" << p.first << ", " << p.second << "}";
|
||||
return out;
|
||||
}
|
||||
template<typename Char, typename Traits, typename Tuple, std::size_t... Index>
|
||||
void print_tuple_impl(std::basic_ostream<Char, Traits>& os, const Tuple& t, std::index_sequence<Index...>) {
|
||||
using swallow = int[]; // guaranties left to right order
|
||||
(void)swallow { 0, (void(os << (Index == 0 ? "" : ", ") << std::get<Index>(t)), 0)... };
|
||||
}
|
||||
template<typename Char, typename Traits, typename... Args>
|
||||
decltype(auto) operator<<(std::basic_ostream<Char, Traits>& os, const std::tuple<Args...>& t) {
|
||||
os << "{";
|
||||
print_tuple_impl(os, t, std::index_sequence_for<Args...>{});
|
||||
return os << "}";
|
||||
}
|
||||
template<typename T> ostream& operator<<(ostream& out, const vector<T>& vec) {
|
||||
for (auto&& i : vec) out << i << ' ';
|
||||
return out;
|
||||
}
|
||||
std::ostream& operator<<(std::ostream& dest, const int128& value) {
|
||||
// https://stackoverflow.com/a/25115163/23881100
|
||||
std::ostream::sentry s( dest );
|
||||
if ( s ) {
|
||||
uint128 tmp = value < 0 ? -value : value;
|
||||
char buffer[ 128 ];
|
||||
char* d = std::end( buffer );
|
||||
do {
|
||||
-- d;
|
||||
*d = "0123456789"[ tmp % 10 ];
|
||||
tmp /= 10;
|
||||
} while ( tmp != 0 );
|
||||
if ( value < 0 ) {
|
||||
-- d;
|
||||
*d = '-';
|
||||
}
|
||||
int len = std::end( buffer ) - d;
|
||||
if ( dest.rdbuf()->sputn( d, len ) != len ) {
|
||||
dest.setstate( std::ios_base::badbit );
|
||||
}
|
||||
}
|
||||
return dest;
|
||||
}
|
||||
|
||||
/* pops */
|
||||
#define poptop(q, ...) __AS_PROCEDURE(auto [__VA_ARGS__] = q.top(); q.pop();)
|
||||
#define popback(q, ...) __AS_PROCEDURE(auto [__VA_ARGS__] = q.back(); q.pop_back();)
|
||||
#define popfront(q, ...) __AS_PROCEDURE(auto [__VA_ARGS__] = q.front();q.pop_front();)
|
||||
|
||||
/* math */
|
||||
constexpr inline int lg2(ll x) { return x == 0 ? -1 : sizeof(ll) * 8 - 1 - __builtin_clzll(x); }
|
||||
|
||||
void __exgcd(ll a, ll b, ll& x, ll& y) {
|
||||
if (b == 0) {
|
||||
x = 1, y = 0;
|
||||
return;
|
||||
}
|
||||
__exgcd(b, a % b, y, x);
|
||||
y -= a / b * x;
|
||||
}
|
||||
|
||||
ll inverse(ll a, ll b) {
|
||||
ll x, y;
|
||||
__exgcd(a, b, x, y);
|
||||
return mod(x, b);
|
||||
}
|
||||
|
||||
vector<tuple<int, int, ll>> decompose(ll x) {
|
||||
// return (factor, count, factor ** count)
|
||||
vector<tuple<int, int, ll>> res;
|
||||
for (int i = 2; i * i <= x; i++) {
|
||||
if (x % i == 0) {
|
||||
int cnt = 0;
|
||||
ll pw = 1;
|
||||
while (x % i == 0) ++cnt, x /= i, pw *= i;
|
||||
res.emplace_back(i, cnt, pw);
|
||||
}
|
||||
}
|
||||
if (x != 1) {
|
||||
res.emplace_back(x, 1, x);
|
||||
}
|
||||
return res;
|
||||
}
|
||||
|
||||
vector<pii> decompose_prime(int N) {
|
||||
// return (factor, count)
|
||||
vector<pii> result;
|
||||
for (int i = 2; i * i <= N; i++) {
|
||||
if (N % i == 0) {
|
||||
int cnt = 0;
|
||||
while (N % i == 0) N /= i, ++cnt;
|
||||
result.emplace_back(i, cnt);
|
||||
}
|
||||
}
|
||||
if (N != 1) {
|
||||
result.emplace_back(N, 1);
|
||||
}
|
||||
return result;
|
||||
}
|
||||
|
||||
/* string algorithms */
|
||||
vector<int> calc_next(string t) { // pi function of t
|
||||
int n = (int)t.length();
|
||||
vector<int> pi(n);
|
||||
for (int i = 1; i < n; i++) {
|
||||
int j = pi[i - 1];
|
||||
while (j > 0 && t[i] != t[j]) j = pi[j - 1];
|
||||
if (t[i] == t[j]) j++;
|
||||
pi[i] = j;
|
||||
}
|
||||
return pi;
|
||||
}
|
||||
vector<int> calc_z(string t) { // z function of t
|
||||
int m = t.length();
|
||||
vector<int> z;
|
||||
z.push_back(m);
|
||||
pair<int, int> prev = {1, -1};
|
||||
for (int i = 1; i < m; ++i) {
|
||||
if (z[i - prev.first] + i <= prev.second) {
|
||||
z.push_back(z[i - prev.first]);
|
||||
} else {
|
||||
int j = max(i, prev.second + 1);
|
||||
while (j < m && t[j] == t[j - i]) ++j;
|
||||
z.push_back(j - i);
|
||||
prev = {i, j - 1};
|
||||
}
|
||||
}
|
||||
return z;
|
||||
}
|
||||
vector<int> kmp(string s, string t) { // find all t in s
|
||||
string cur = t + '#' + s;
|
||||
int sz1 = s.size(), sz2 = t.size();
|
||||
vector<int> v;
|
||||
vector<int> lps = calc_next(cur);
|
||||
for (int i = sz2 + 1; i <= sz1 + sz2; i++) {
|
||||
if (lps[i] == sz2) v.push_back(i - 2 * sz2);
|
||||
}
|
||||
return v;
|
||||
}
|
||||
int period(string s) { // find the length of shortest recurring period
|
||||
int n = s.length();
|
||||
auto z = calc_z(s);
|
||||
for (int i = 1; i <= n / 2; ++i) {
|
||||
if (n % i == 0 && z[i] == n - i) {
|
||||
return i;
|
||||
}
|
||||
}
|
||||
return n;
|
||||
}
|
||||
|
||||
/* modular arithmetic */
|
||||
template <ll mdl> struct MLL {
|
||||
ll val;
|
||||
MLL(ll v = 0) : val(mod(v, mdl)) {}
|
||||
MLL(const MLL<mdl>& other) : val(other.val) {}
|
||||
friend MLL operator+(const MLL& lhs, const MLL& rhs) { return mod(lhs.val + rhs.val, mdl); }
|
||||
friend MLL operator-(const MLL& lhs, const MLL& rhs) { return mod(lhs.val - rhs.val, mdl); }
|
||||
friend MLL operator*(const MLL& lhs, const MLL& rhs) { return mod(lhs.val * rhs.val, mdl); }
|
||||
friend MLL operator/(const MLL& lhs, const MLL& rhs) { return mod(lhs.val * mod(inverse(rhs.val, mdl), mdl), mdl); }
|
||||
friend MLL operator%(const MLL& lhs, const MLL& rhs) { return mod(lhs.val - (lhs / rhs).val, mdl); }
|
||||
friend bool operator==(const MLL& lhs, const MLL& rhs) { return lhs.val == rhs.val; }
|
||||
friend bool operator!=(const MLL& lhs, const MLL& rhs) { return lhs.val != rhs.val; }
|
||||
void operator+=(const MLL& rhs) { val = (*this + rhs).val; }
|
||||
void operator-=(const MLL& rhs) { val = (*this - rhs).val; }
|
||||
void operator*=(const MLL& rhs) { val = (*this * rhs).val; }
|
||||
void operator/=(const MLL& rhs) { val = (*this / rhs).val; }
|
||||
void operator%=(const MLL& rhs) { val = (*this % rhs).val; }
|
||||
};
|
||||
struct MLLd {
|
||||
ll val, mdl;
|
||||
MLLd(ll mdl, ll v = 0) : mdl(mdl), val(mod(v, mdl)) {}
|
||||
MLLd(const MLLd& other) : val(other.val) {}
|
||||
friend MLLd operator+(const MLLd& lhs, const MLLd& rhs) { return mod(lhs.val + rhs.val, lhs.mdl); }
|
||||
friend MLLd operator-(const MLLd& lhs, const MLLd& rhs) { return mod(lhs.val - rhs.val, lhs.mdl); }
|
||||
friend MLLd operator*(const MLLd& lhs, const MLLd& rhs) { return mod(lhs.val * rhs.val, lhs.mdl); }
|
||||
friend MLLd operator/(const MLLd& lhs, const MLLd& rhs) { return mod(lhs.val * mod(inverse(rhs.val, lhs.mdl), lhs.mdl), lhs.mdl); }
|
||||
friend MLLd operator%(const MLLd& lhs, const MLLd& rhs) { return mod(lhs.val - (lhs / rhs).val, lhs.mdl); }
|
||||
friend bool operator==(const MLLd& lhs, const MLLd& rhs) { return lhs.val == rhs.val; }
|
||||
friend bool operator!=(const MLLd& lhs, const MLLd& rhs) { return lhs.val != rhs.val; }
|
||||
void operator+=(const MLLd& rhs) { val = (*this + rhs).val; }
|
||||
void operator-=(const MLLd& rhs) { val = (*this - rhs).val; }
|
||||
void operator*=(const MLLd& rhs) { val = (*this * rhs).val; }
|
||||
void operator/=(const MLLd& rhs) { val = (*this / rhs).val; }
|
||||
void operator%=(const MLLd& rhs) { val = (*this % rhs).val; }
|
||||
};
|
||||
|
||||
template <ll mdl>
|
||||
ostream& operator<<(ostream& out, const MLL<mdl>& num) {
|
||||
return out << num.val;
|
||||
}
|
||||
|
||||
ostream& operator<<(ostream& out, const MLLd& num) {
|
||||
return out << num.val;
|
||||
}
|
||||
|
||||
template <ll mdl>
|
||||
istream& operator>>(istream& in, MLL<mdl>& num) {
|
||||
return in >> num.val;
|
||||
}
|
||||
|
||||
istream& operator>>(istream& in, MLLd& num) {
|
||||
return in >> num.val;
|
||||
}
|
||||
|
||||
// miscancellous
|
||||
template <typename Func, typename RandomIt> void sort_by_key(RandomIt first, RandomIt last, Func extractor) {
|
||||
std::sort(first, last, [&] (auto&& a, auto&& b) { return std::less<>()(extractor(a), extractor(b)); });
|
||||
}
|
||||
template <typename Func, typename RandomIt, typename Compare> void sort_by_key(RandomIt first, RandomIt last, Func extractor, Compare comp) {
|
||||
std::sort(first, last, [&] (auto&& a, auto&& b) { return comp(extractor(a), extractor(b)); });
|
||||
}
|
||||
template <typename T, typename U, typename Iterator_T, typename Iterator_U>
|
||||
vector<pair<T, U>> zip(Iterator_T a_first, Iterator_T a_last, Iterator_U b_first, Iterator_U b_last) {
|
||||
vector<pair<T, U>> res;
|
||||
auto a_it = a_first;
|
||||
auto b_it = b_first;
|
||||
for (; not (a_it == a_last) and not (b_it == b_last); ++a_it, ++b_it) {
|
||||
res.emplace_back(*a_it, *b_it);
|
||||
}
|
||||
return res;
|
||||
}
|
||||
template <typename T, typename U, typename Iterator_T, typename Iterator_U>
|
||||
vector<pair<T, U>> zip_n(Iterator_T a_first, Iterator_U b_first, size_t n) {
|
||||
vector<pair<T, U>> res;
|
||||
if (n > 0) {
|
||||
res.emplace_back(*a_first, *b_first);
|
||||
for (size_t i = 1; i != n; ++i) {
|
||||
res.emplace_back(*++a_first, *++b_first);
|
||||
}
|
||||
}
|
||||
return res;
|
||||
}
|
||||
template <typename T>
|
||||
class ArithmeticIterator : bidirectional_iterator_tag {
|
||||
public:
|
||||
using difference_type = ptrdiff_t;
|
||||
using value_type = T;
|
||||
private:
|
||||
value_type value;
|
||||
public:
|
||||
ArithmeticIterator(const T& value) : value(value) {}
|
||||
value_type operator*() const { return value; }
|
||||
ArithmeticIterator<T>& operator++() { ++value; return *this; }
|
||||
ArithmeticIterator<T>& operator--() { --value; return *this; }
|
||||
bool operator==(const ArithmeticIterator<T>& rhs) const { return value == rhs.value; }
|
||||
};
|
||||
template <typename T> vector<pair<int, T>> enumerate(const vector<T>& container) {
|
||||
return zip<int, T>(ArithmeticIterator<int>(0), ArithmeticIterator<int>(INT_MAX), container.begin(), container.end());
|
||||
}
|
||||
/////////////////////////////////////////////////////////
|
||||
|
||||
#define SINGLE_TEST_CASE
|
||||
// #define DUMP_TEST_CASE 7219
|
||||
// #define TOT_TEST_CASE 10000
|
||||
|
||||
void dump() {}
|
||||
|
||||
void dump_ignore() {}
|
||||
|
||||
struct dinic {
|
||||
struct edge {
|
||||
int to;
|
||||
ll cap;
|
||||
ll flow;
|
||||
int rev;
|
||||
};
|
||||
|
||||
vector<vector<edge>> edges;
|
||||
vector<int> layer;
|
||||
vector<bool> vis;
|
||||
|
||||
dinic(int n) : edges(n + 1), layer(n + 1), vis(n + 1) {}
|
||||
|
||||
void add_edge(int from, int to, ll cap) {
|
||||
edges[from].push_back({ to, cap, 0, int(edges[to].size()) });
|
||||
edges[to].push_back({ from, 0, 0, int(edges[from].size() - 1)});
|
||||
}
|
||||
|
||||
bool bfs(int s, int t) {
|
||||
layer.assign(edges.size(), 0);
|
||||
deque<pii> dq;
|
||||
layer[s] = 1;
|
||||
dq.emplace_back(s, 1);
|
||||
while (dq.size()) {
|
||||
popfront(dq, v, l);
|
||||
for (auto&& e : edges[v]) {
|
||||
if (layer[e.to] == 0 and e.cap > e.flow) {
|
||||
layer[e.to] = l + 1;
|
||||
dq.emplace_back(e.to, l + 1);
|
||||
}
|
||||
}
|
||||
}
|
||||
return layer[t] != 0;
|
||||
}
|
||||
|
||||
ll dfs(int s, int t, ll cap) {
|
||||
if (vis[s]) {
|
||||
return 0;
|
||||
}
|
||||
vis[s] = 1;
|
||||
if (s == t) {
|
||||
return cap;
|
||||
}
|
||||
ll res = 0;
|
||||
int n = edges[s].size();
|
||||
for (int i = 0; i < n; ++i) {
|
||||
auto e = edges[s][i];
|
||||
if (e.cap > e.flow and layer[e.to] == layer[s] + 1) {
|
||||
ll nw = dfs(e.to, t, min(cap - res, e.cap - e.flow));
|
||||
edges[s][i].flow += nw;
|
||||
edges[e.to][e.rev].flow -= nw;
|
||||
res += nw;
|
||||
if (res == cap) {
|
||||
return res;
|
||||
}
|
||||
}
|
||||
}
|
||||
return res;
|
||||
}
|
||||
|
||||
ll run(int s, int t) {
|
||||
ll res = 0;
|
||||
while (bfs(s, t)) {
|
||||
vis.assign(edges.size(), 0);
|
||||
res += dfs(s, t, LLONG_MAX);
|
||||
}
|
||||
return res;
|
||||
}
|
||||
};
|
||||
void prep() {
|
||||
}
|
||||
|
||||
void solve() {
|
||||
read(int, n, m, s, t);
|
||||
dinic net(n);
|
||||
while (m--) {
|
||||
read(int, u, v, c);
|
||||
net.add_edge(u, v, c);
|
||||
}
|
||||
cout << net.run(s, t) << endl;
|
||||
}
|
||||
|
||||
int main() {
|
||||
#if __cplusplus < 201703L || defined(_MSC_VER) && !defined(__clang__)
|
||||
assert(false && "incompatible compiler variant detected.");
|
||||
#endif
|
||||
untie, cout.tie(NULL);
|
||||
prep();
|
||||
#ifdef SINGLE_TEST_CASE
|
||||
solve();
|
||||
#else
|
||||
read(int, t);
|
||||
for (int i = 0; i < t; ++i) {
|
||||
#ifdef DUMP_TEST_CASE
|
||||
if (t != (TOT_TEST_CASE)) {
|
||||
solve();
|
||||
} else if (i + 1 == (DUMP_TEST_CASE)) {
|
||||
dump();
|
||||
} else {
|
||||
dump_ignore();
|
||||
}
|
||||
#else
|
||||
solve();
|
||||
#endif
|
||||
}
|
||||
#endif
|
||||
}
|
||||
|
|
@ -0,0 +1,567 @@
|
|||
#pragma GCC optimize("Ofast")
|
||||
/////////////////////////////////////////////////////////
|
||||
/**
|
||||
* Useful Macros
|
||||
* by subcrip
|
||||
* (requires C++17)
|
||||
*/
|
||||
|
||||
#include<bits/stdc++.h>
|
||||
using namespace std;
|
||||
|
||||
/* macro helpers */
|
||||
#define __NARGS(...) std::tuple_size<decltype(std::make_tuple(__VA_ARGS__))>::value
|
||||
#define __DECOMPOSE_S(a, x) auto x = a;
|
||||
#define __DECOMPOSE_N(a, ...) auto [__VA_ARGS__] = a;
|
||||
constexpr void __() {}
|
||||
#define __AS_PROCEDURE(...) __(); __VA_ARGS__; __()
|
||||
#define __as_typeof(container) remove_reference<decltype(container)>::type
|
||||
|
||||
/* type aliases */
|
||||
#if LONG_LONG_MAX != INT64_MAX
|
||||
using ll = int64_t;
|
||||
using ull = uint64_t;
|
||||
#else
|
||||
using ll = long long;
|
||||
using ull = unsigned long long;
|
||||
using ld = long double;
|
||||
#endif
|
||||
using int128 = __int128_t;
|
||||
using uint128 = __uint128_t;
|
||||
using ld = long double;
|
||||
using pii = pair<int, int>;
|
||||
using pil = pair<int, ll>;
|
||||
using pli = pair<ll, int>;
|
||||
using pll = pair<ll, ll>;
|
||||
using pid = pair<int, ld>;
|
||||
using pdi = pair<ld, int>;
|
||||
using pld = pair<ll, ld>;
|
||||
using pdl = pair<ld, ll>;
|
||||
using pdd = pair<ld, ld>;
|
||||
using tlll = tuple<ll, ll, ll>;
|
||||
using tlld = tuple<ll, ll, ld>;
|
||||
using tlli = tuple<ll, ll, int>;
|
||||
using tldl = tuple<ll, ld, ll>;
|
||||
using tldd = tuple<ll, ld, ld>;
|
||||
using tldi = tuple<ll, ld, int>;
|
||||
using tlil = tuple<ll, int, ll>;
|
||||
using tlid = tuple<ll, int, ld>;
|
||||
using tlii = tuple<ll, int, int>;
|
||||
using tdll = tuple<ld, ll, ll>;
|
||||
using tdld = tuple<ld, ll, ld>;
|
||||
using tdli = tuple<ld, ll, int>;
|
||||
using tddl = tuple<ld, ld, ll>;
|
||||
using tddd = tuple<ld, ld, ld>;
|
||||
using tddi = tuple<ld, ld, int>;
|
||||
using tdil = tuple<ld, int, ll>;
|
||||
using tdid = tuple<ld, int, ld>;
|
||||
using tdii = tuple<ld, int, int>;
|
||||
using till = tuple<int, ll, ll>;
|
||||
using tild = tuple<int, ll, ld>;
|
||||
using tili = tuple<int, ll, int>;
|
||||
using tidl = tuple<int, ld, ll>;
|
||||
using tidd = tuple<int, ld, ld>;
|
||||
using tidi = tuple<int, ld, int>;
|
||||
using tiil = tuple<int, int, ll>;
|
||||
using tiid = tuple<int, int, ld>;
|
||||
using tiii = tuple<int, int, int>;
|
||||
template <typename T> using max_heap = priority_queue<T>;
|
||||
template <typename T> using min_heap = priority_queue<T, vector<T>, greater<>>;
|
||||
template <typename T> using oi = ostream_iterator<T>;
|
||||
template <typename T> using ii = istream_iterator<T>;
|
||||
|
||||
/* constants */
|
||||
constexpr int INF = 0x3f3f3f3f;
|
||||
constexpr ll INFLL = 0x3f3f3f3f3f3f3f3fLL;
|
||||
constexpr ll MDL = 1e9 + 7;
|
||||
constexpr ll PRIME = 998'244'353;
|
||||
constexpr ll MDL1 = 8784491;
|
||||
constexpr ll MDL2 = PRIME;
|
||||
constexpr int128 INT128_MAX = numeric_limits<int128>::max();
|
||||
constexpr uint128 UINT128_MAX = numeric_limits<uint128>::max();
|
||||
constexpr int128 INT128_MIN = numeric_limits<int128>::min();
|
||||
constexpr uint128 UINT128_MIN = numeric_limits<uint128>::min();
|
||||
|
||||
/* random */
|
||||
|
||||
mt19937 rd(chrono::duration_cast<chrono::milliseconds>(chrono::system_clock::now().time_since_epoch()).count());
|
||||
|
||||
/* bit-wise operations */
|
||||
#define lowbit(x) ((x) & -(x))
|
||||
#define popcount(x) (__builtin_popcountll(ll(x)))
|
||||
#define parity(x) (__builtin_parityll(ll(x)))
|
||||
#define msp(x) (63LL - __builtin_clzll(ll(x)))
|
||||
#define lsp(x) (__builtin_ctzll(ll(x)))
|
||||
|
||||
/* arithmetic operations */
|
||||
#define mod(x, y) ((((x) % (y)) + (y)) % (y))
|
||||
|
||||
/* fast pairs */
|
||||
#define upair ull
|
||||
#define umake(x, y) (ull(x) << 32 | (ull(y) & ((1ULL << 32) - 1)))
|
||||
#define u1(p) ((p) >> 32)
|
||||
#define u2(p) ((p) & ((1ULL << 32) - 1))
|
||||
#define ult std::less<upair>
|
||||
#define ugt std::greater<upair>
|
||||
|
||||
#define ipair ull
|
||||
#define imake(x, y) (umake(x, y))
|
||||
#define i1(p) (int(u1(ll(p))))
|
||||
#define i2(p) (ll(u2(p) << 32) >> 32)
|
||||
struct ilt {
|
||||
bool operator()(const ipair& a, const ipair& b) const {
|
||||
if (i1(a) == i1(b)) return i2(a) < i2(b);
|
||||
else return i1(a) < i1(b);
|
||||
}
|
||||
};
|
||||
struct igt {
|
||||
bool operator()(const ipair& a, const ipair& b) const {
|
||||
if (i1(a) == i1(b)) return i2(a) > i2(b);
|
||||
else return i1(a) > i1(b);
|
||||
}
|
||||
};
|
||||
|
||||
/* conditions */
|
||||
#define loop while (1)
|
||||
#define if_or(var, val) if (!(var == val)) var = val; else
|
||||
#define continue_or(var, val) __AS_PROCEDURE(if (var == val) continue; var = val;)
|
||||
#define break_or(var, val) __AS_PROCEDURE(if (var == val) break; var = val;)
|
||||
|
||||
/* hash */
|
||||
struct safe_hash {
|
||||
// https://codeforces.com/blog/entry/62393
|
||||
static uint64_t splitmix64(uint64_t x) {
|
||||
// http://xorshift.di.unimi.it/splitmix64.c
|
||||
x += 0x9e3779b97f4a7c15;
|
||||
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
|
||||
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
|
||||
return x ^ (x >> 31);
|
||||
}
|
||||
|
||||
size_t operator()(uint64_t x) const {
|
||||
static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
|
||||
return splitmix64(x + FIXED_RANDOM);
|
||||
}
|
||||
};
|
||||
|
||||
struct pair_hash {
|
||||
template <typename T, typename U>
|
||||
size_t operator()(const pair<T, U>& a) const {
|
||||
auto hash1 = safe_hash()(a.first);
|
||||
auto hash2 = safe_hash()(a.second);
|
||||
if (hash1 != hash2) {
|
||||
return hash1 ^ hash2;
|
||||
}
|
||||
return hash1;
|
||||
}
|
||||
};
|
||||
|
||||
uniform_int_distribution<mt19937::result_type> dist(PRIME);
|
||||
const size_t __array_hash_b = 31, __array_hash_mdl1 = dist(rd), __array_hash_mdl2 = dist(rd);
|
||||
struct array_hash {
|
||||
template <typename Sequence>
|
||||
size_t operator()(const Sequence& arr) const {
|
||||
size_t pw1 = 1, pw2 = 1;
|
||||
size_t res1 = 0, res2 = 0;
|
||||
for (auto&& x : arr) {
|
||||
res1 = (res1 + x * pw1) % __array_hash_mdl1;
|
||||
res2 = (res2 + x * pw2) % __array_hash_mdl2;
|
||||
pw1 = (pw1 * __array_hash_b) % __array_hash_mdl1;
|
||||
pw2 = (pw2 * __array_hash_b) % __array_hash_mdl2;
|
||||
}
|
||||
return res1 + res2;
|
||||
}
|
||||
};
|
||||
|
||||
/* build data structures */
|
||||
#define unordered_counter(from, to) __AS_PROCEDURE(unordered_map<__as_typeof(from), size_t, safe_hash> to; for (auto&& x : from) ++to[x];)
|
||||
#define counter(from, to, cmp) __AS_PROCEDURE(map<__as_typeof(from), size_t, cmp> to; for (auto&& x : from) ++to[x];)
|
||||
#define pa(a) __AS_PROCEDURE(__typeof(a) pa; pa.push_back({}); for (auto&&x : a) pa.push_back(pa.back() + x);)
|
||||
#define sa(a) __AS_PROCEDURE(__typeof(a) sa(a.size() + 1); {int n = a.size(); for (int i = n - 1; i >= 0; --i) sa[i] = sa[i + 1] + a[i];};)
|
||||
#define adj(ch, n) __AS_PROCEDURE(vector<vector<int>> ch((n) + 1);)
|
||||
#define edge(ch, u, v) __AS_PROCEDURE(ch[u].push_back(v), ch[v].push_back(u);)
|
||||
#define edgew(ch, u, v, w) __AS_PROCEDURE(ch[u].emplace_back(v, w), ch[v].emplace_back(u, w);)
|
||||
#define Edge(ch, u, v) __AS_PROCEDURE(ch[u].push_back(v);)
|
||||
#define Edgew(ch, u, v, w) __AS_PROCEDURE(ch[u].emplace_back(v, w);)
|
||||
template <typename T, typename Iterator> pair<size_t, map<T, size_t>> discretize(Iterator __first, Iterator __last) {
|
||||
set<T> st(__first, __last);
|
||||
size_t N = 0;
|
||||
map<T, size_t> mp;
|
||||
for (auto&& x : st) mp[x] = ++N;
|
||||
return {N, mp};
|
||||
}
|
||||
template <typename T, typename Iterator> pair<size_t, unordered_map<T, size_t, safe_hash>> unordered_discretize(Iterator __first, Iterator __last) {
|
||||
set<T> st(__first, __last);
|
||||
size_t N = 0;
|
||||
unordered_map<T, size_t, safe_hash> mp;
|
||||
for (auto&& x : st) mp[x] = ++N;
|
||||
return {N, mp};
|
||||
}
|
||||
|
||||
/* io */
|
||||
#define untie __AS_PROCEDURE(ios_base::sync_with_stdio(0), cin.tie(NULL))
|
||||
template<typename T> void __read(T& x) { cin >> x; }
|
||||
template<typename T, typename... U> void __read(T& x, U&... args) { cin >> x; __read(args...); }
|
||||
#define read(type, ...) __AS_PROCEDURE(type __VA_ARGS__; __read(__VA_ARGS__);)
|
||||
#define readvec(type, a, n) __AS_PROCEDURE(vector<type> a(n); for (auto& x : a) cin >> x;)
|
||||
#define readvec1(type, a, n) __AS_PROCEDURE(vector<type> a((n) + 1); copy_n(ii<type>(cin), (n), a.begin() + 1);)
|
||||
#define putvec(a) __AS_PROCEDURE(copy(a.begin(), a.end(), oi<__as_typeof(a)::value_type>(cout, " ")); cout << endl;)
|
||||
#define putvec1(a) __AS_PROCEDURE(copy(a.begin() + 1, a.end(), oi<__as_typeof(a)::value_type>(cout, " ")); cout << endl;)
|
||||
#define putvec_eol(a) __AS_PROCEDURE(copy(a.begin(), a.end(), oi<__as_typeof(a)::value_type>(cout, "\n"));)
|
||||
#define putvec1_eol(a) __AS_PROCEDURE(copy(a.begin() + 1, a.end(), oi<__as_typeof(a)::value_type>(cout, "\n"));)
|
||||
#define debug(x) __AS_PROCEDURE(cerr << #x" = " << (x) << endl;)
|
||||
#define debugvec(a) __AS_PROCEDURE(cerr << #a" = "; for (auto&& x : a) cerr << x << ' '; cerr << endl;)
|
||||
template<typename T, typename U> istream& operator>>(istream& in, pair<T, U>& p) {
|
||||
return in >> p.first >> p.second;
|
||||
}
|
||||
template<typename T, typename U> ostream& operator<<(ostream& out, const pair<T, U>& p) {
|
||||
out << "{" << p.first << ", " << p.second << "}";
|
||||
return out;
|
||||
}
|
||||
template<typename Char, typename Traits, typename Tuple, std::size_t... Index>
|
||||
void print_tuple_impl(std::basic_ostream<Char, Traits>& os, const Tuple& t, std::index_sequence<Index...>) {
|
||||
using swallow = int[]; // guaranties left to right order
|
||||
(void)swallow { 0, (void(os << (Index == 0 ? "" : ", ") << std::get<Index>(t)), 0)... };
|
||||
}
|
||||
template<typename Char, typename Traits, typename... Args>
|
||||
decltype(auto) operator<<(std::basic_ostream<Char, Traits>& os, const std::tuple<Args...>& t) {
|
||||
os << "{";
|
||||
print_tuple_impl(os, t, std::index_sequence_for<Args...>{});
|
||||
return os << "}";
|
||||
}
|
||||
template<typename T> ostream& operator<<(ostream& out, const vector<T>& vec) {
|
||||
for (auto&& i : vec) out << i << ' ';
|
||||
return out;
|
||||
}
|
||||
std::ostream& operator<<(std::ostream& dest, const int128& value) {
|
||||
// https://stackoverflow.com/a/25115163/23881100
|
||||
std::ostream::sentry s( dest );
|
||||
if ( s ) {
|
||||
uint128 tmp = value < 0 ? -value : value;
|
||||
char buffer[ 128 ];
|
||||
char* d = std::end( buffer );
|
||||
do {
|
||||
-- d;
|
||||
*d = "0123456789"[ tmp % 10 ];
|
||||
tmp /= 10;
|
||||
} while ( tmp != 0 );
|
||||
if ( value < 0 ) {
|
||||
-- d;
|
||||
*d = '-';
|
||||
}
|
||||
int len = std::end( buffer ) - d;
|
||||
if ( dest.rdbuf()->sputn( d, len ) != len ) {
|
||||
dest.setstate( std::ios_base::badbit );
|
||||
}
|
||||
}
|
||||
return dest;
|
||||
}
|
||||
|
||||
/* pops */
|
||||
#define poptop(q, ...) __AS_PROCEDURE(auto [__VA_ARGS__] = q.top(); q.pop();)
|
||||
#define popback(q, ...) __AS_PROCEDURE(auto [__VA_ARGS__] = q.back(); q.pop_back();)
|
||||
#define popfront(q, ...) __AS_PROCEDURE(auto [__VA_ARGS__] = q.front();q.pop_front();)
|
||||
|
||||
/* math */
|
||||
constexpr inline int lg2(ll x) { return x == 0 ? -1 : sizeof(ll) * 8 - 1 - __builtin_clzll(x); }
|
||||
|
||||
void __exgcd(ll a, ll b, ll& x, ll& y) {
|
||||
if (b == 0) {
|
||||
x = 1, y = 0;
|
||||
return;
|
||||
}
|
||||
__exgcd(b, a % b, y, x);
|
||||
y -= a / b * x;
|
||||
}
|
||||
|
||||
ll inverse(ll a, ll b) {
|
||||
ll x, y;
|
||||
__exgcd(a, b, x, y);
|
||||
return mod(x, b);
|
||||
}
|
||||
|
||||
vector<tuple<int, int, ll>> decompose(ll x) {
|
||||
// return (factor, count, factor ** count)
|
||||
vector<tuple<int, int, ll>> res;
|
||||
for (int i = 2; i * i <= x; i++) {
|
||||
if (x % i == 0) {
|
||||
int cnt = 0;
|
||||
ll pw = 1;
|
||||
while (x % i == 0) ++cnt, x /= i, pw *= i;
|
||||
res.emplace_back(i, cnt, pw);
|
||||
}
|
||||
}
|
||||
if (x != 1) {
|
||||
res.emplace_back(x, 1, x);
|
||||
}
|
||||
return res;
|
||||
}
|
||||
|
||||
vector<pii> decompose_prime(int N) {
|
||||
// return (factor, count)
|
||||
vector<pii> result;
|
||||
for (int i = 2; i * i <= N; i++) {
|
||||
if (N % i == 0) {
|
||||
int cnt = 0;
|
||||
while (N % i == 0) N /= i, ++cnt;
|
||||
result.emplace_back(i, cnt);
|
||||
}
|
||||
}
|
||||
if (N != 1) {
|
||||
result.emplace_back(N, 1);
|
||||
}
|
||||
return result;
|
||||
}
|
||||
|
||||
/* string algorithms */
|
||||
vector<int> calc_next(string t) { // pi function of t
|
||||
int n = (int)t.length();
|
||||
vector<int> pi(n);
|
||||
for (int i = 1; i < n; i++) {
|
||||
int j = pi[i - 1];
|
||||
while (j > 0 && t[i] != t[j]) j = pi[j - 1];
|
||||
if (t[i] == t[j]) j++;
|
||||
pi[i] = j;
|
||||
}
|
||||
return pi;
|
||||
}
|
||||
vector<int> calc_z(string t) { // z function of t
|
||||
int m = t.length();
|
||||
vector<int> z;
|
||||
z.push_back(m);
|
||||
pair<int, int> prev = {1, -1};
|
||||
for (int i = 1; i < m; ++i) {
|
||||
if (z[i - prev.first] + i <= prev.second) {
|
||||
z.push_back(z[i - prev.first]);
|
||||
} else {
|
||||
int j = max(i, prev.second + 1);
|
||||
while (j < m && t[j] == t[j - i]) ++j;
|
||||
z.push_back(j - i);
|
||||
prev = {i, j - 1};
|
||||
}
|
||||
}
|
||||
return z;
|
||||
}
|
||||
vector<int> kmp(string s, string t) { // find all t in s
|
||||
string cur = t + '#' + s;
|
||||
int sz1 = s.size(), sz2 = t.size();
|
||||
vector<int> v;
|
||||
vector<int> lps = calc_next(cur);
|
||||
for (int i = sz2 + 1; i <= sz1 + sz2; i++) {
|
||||
if (lps[i] == sz2) v.push_back(i - 2 * sz2);
|
||||
}
|
||||
return v;
|
||||
}
|
||||
int period(string s) { // find the length of shortest recurring period
|
||||
int n = s.length();
|
||||
auto z = calc_z(s);
|
||||
for (int i = 1; i <= n / 2; ++i) {
|
||||
if (n % i == 0 && z[i] == n - i) {
|
||||
return i;
|
||||
}
|
||||
}
|
||||
return n;
|
||||
}
|
||||
|
||||
/* modular arithmetic */
|
||||
template <ll mdl> struct MLL {
|
||||
ll val;
|
||||
MLL(ll v = 0) : val(mod(v, mdl)) {}
|
||||
MLL(const MLL<mdl>& other) : val(other.val) {}
|
||||
friend MLL operator+(const MLL& lhs, const MLL& rhs) { return mod(lhs.val + rhs.val, mdl); }
|
||||
friend MLL operator-(const MLL& lhs, const MLL& rhs) { return mod(lhs.val - rhs.val, mdl); }
|
||||
friend MLL operator*(const MLL& lhs, const MLL& rhs) { return mod(lhs.val * rhs.val, mdl); }
|
||||
friend MLL operator/(const MLL& lhs, const MLL& rhs) { return mod(lhs.val * mod(inverse(rhs.val, mdl), mdl), mdl); }
|
||||
friend MLL operator%(const MLL& lhs, const MLL& rhs) { return mod(lhs.val - (lhs / rhs).val, mdl); }
|
||||
friend bool operator==(const MLL& lhs, const MLL& rhs) { return lhs.val == rhs.val; }
|
||||
friend bool operator!=(const MLL& lhs, const MLL& rhs) { return lhs.val != rhs.val; }
|
||||
void operator+=(const MLL& rhs) { val = (*this + rhs).val; }
|
||||
void operator-=(const MLL& rhs) { val = (*this - rhs).val; }
|
||||
void operator*=(const MLL& rhs) { val = (*this * rhs).val; }
|
||||
void operator/=(const MLL& rhs) { val = (*this / rhs).val; }
|
||||
void operator%=(const MLL& rhs) { val = (*this % rhs).val; }
|
||||
};
|
||||
struct MLLd {
|
||||
ll val, mdl;
|
||||
MLLd(ll mdl, ll v = 0) : mdl(mdl), val(mod(v, mdl)) {}
|
||||
MLLd(const MLLd& other) : val(other.val) {}
|
||||
friend MLLd operator+(const MLLd& lhs, const MLLd& rhs) { return mod(lhs.val + rhs.val, lhs.mdl); }
|
||||
friend MLLd operator-(const MLLd& lhs, const MLLd& rhs) { return mod(lhs.val - rhs.val, lhs.mdl); }
|
||||
friend MLLd operator*(const MLLd& lhs, const MLLd& rhs) { return mod(lhs.val * rhs.val, lhs.mdl); }
|
||||
friend MLLd operator/(const MLLd& lhs, const MLLd& rhs) { return mod(lhs.val * mod(inverse(rhs.val, lhs.mdl), lhs.mdl), lhs.mdl); }
|
||||
friend MLLd operator%(const MLLd& lhs, const MLLd& rhs) { return mod(lhs.val - (lhs / rhs).val, lhs.mdl); }
|
||||
friend bool operator==(const MLLd& lhs, const MLLd& rhs) { return lhs.val == rhs.val; }
|
||||
friend bool operator!=(const MLLd& lhs, const MLLd& rhs) { return lhs.val != rhs.val; }
|
||||
void operator+=(const MLLd& rhs) { val = (*this + rhs).val; }
|
||||
void operator-=(const MLLd& rhs) { val = (*this - rhs).val; }
|
||||
void operator*=(const MLLd& rhs) { val = (*this * rhs).val; }
|
||||
void operator/=(const MLLd& rhs) { val = (*this / rhs).val; }
|
||||
void operator%=(const MLLd& rhs) { val = (*this % rhs).val; }
|
||||
};
|
||||
|
||||
template <ll mdl>
|
||||
ostream& operator<<(ostream& out, const MLL<mdl>& num) {
|
||||
return out << num.val;
|
||||
}
|
||||
|
||||
ostream& operator<<(ostream& out, const MLLd& num) {
|
||||
return out << num.val;
|
||||
}
|
||||
|
||||
template <ll mdl>
|
||||
istream& operator>>(istream& in, MLL<mdl>& num) {
|
||||
return in >> num.val;
|
||||
}
|
||||
|
||||
istream& operator>>(istream& in, MLLd& num) {
|
||||
return in >> num.val;
|
||||
}
|
||||
|
||||
// miscancellous
|
||||
template <typename Func, typename RandomIt> void sort_by_key(RandomIt first, RandomIt last, Func extractor) {
|
||||
std::sort(first, last, [&] (auto&& a, auto&& b) { return std::less<>()(extractor(a), extractor(b)); });
|
||||
}
|
||||
template <typename Func, typename RandomIt, typename Compare> void sort_by_key(RandomIt first, RandomIt last, Func extractor, Compare comp) {
|
||||
std::sort(first, last, [&] (auto&& a, auto&& b) { return comp(extractor(a), extractor(b)); });
|
||||
}
|
||||
template <typename T, typename U, typename Iterator_T, typename Iterator_U>
|
||||
vector<pair<T, U>> zip(Iterator_T a_first, Iterator_T a_last, Iterator_U b_first, Iterator_U b_last) {
|
||||
vector<pair<T, U>> res;
|
||||
auto a_it = a_first;
|
||||
auto b_it = b_first;
|
||||
for (; not (a_it == a_last) and not (b_it == b_last); ++a_it, ++b_it) {
|
||||
res.emplace_back(*a_it, *b_it);
|
||||
}
|
||||
return res;
|
||||
}
|
||||
template <typename T, typename U, typename Iterator_T, typename Iterator_U>
|
||||
vector<pair<T, U>> zip_n(Iterator_T a_first, Iterator_U b_first, size_t n) {
|
||||
vector<pair<T, U>> res;
|
||||
if (n > 0) {
|
||||
res.emplace_back(*a_first, *b_first);
|
||||
for (size_t i = 1; i != n; ++i) {
|
||||
res.emplace_back(*++a_first, *++b_first);
|
||||
}
|
||||
}
|
||||
return res;
|
||||
}
|
||||
template <typename T>
|
||||
class ArithmeticIterator : bidirectional_iterator_tag {
|
||||
public:
|
||||
using difference_type = ptrdiff_t;
|
||||
using value_type = T;
|
||||
private:
|
||||
value_type value;
|
||||
public:
|
||||
ArithmeticIterator(const T& value) : value(value) {}
|
||||
value_type operator*() const { return value; }
|
||||
ArithmeticIterator<T>& operator++() { ++value; return *this; }
|
||||
ArithmeticIterator<T>& operator--() { --value; return *this; }
|
||||
bool operator==(const ArithmeticIterator<T>& rhs) const { return value == rhs.value; }
|
||||
};
|
||||
template <typename T> vector<pair<int, T>> enumerate(const vector<T>& container) {
|
||||
return zip<int, T>(ArithmeticIterator<int>(0), ArithmeticIterator<int>(INT_MAX), container.begin(), container.end());
|
||||
}
|
||||
/////////////////////////////////////////////////////////
|
||||
|
||||
#define SINGLE_TEST_CASE
|
||||
// #define DUMP_TEST_CASE 7219
|
||||
// #define TOT_TEST_CASE 10000
|
||||
|
||||
void dump() {}
|
||||
|
||||
void dump_ignore() {}
|
||||
|
||||
struct edmonds_karp {
|
||||
struct edge {
|
||||
int to;
|
||||
ll cap;
|
||||
ll flow;
|
||||
pair<int, int> rev;
|
||||
};
|
||||
|
||||
vector<vector<edge>> edges;
|
||||
|
||||
edmonds_karp(int n) : edges(n + 1) {}
|
||||
|
||||
void add_edge(int from, int to, ll cap) {
|
||||
edges[from].push_back({to, cap, 0, make_pair(to, int(edges[to].size()))});
|
||||
edges[to].push_back({from, 0, 0, make_pair(from, int(edges[from].size() - 1))});
|
||||
}
|
||||
|
||||
ll run(int s, int t) {
|
||||
int n = edges.size();
|
||||
vector<pii> pa_(n + 1);
|
||||
ll res = 0;
|
||||
while (1) {
|
||||
vector<ll> pf(n + 1);
|
||||
deque<int> dq;
|
||||
dq.emplace_back(s);
|
||||
pf[s] = LLONG_MAX;
|
||||
while (dq.size()) {
|
||||
int v = dq.front(); dq.pop_front();
|
||||
for (auto&& [i, ne] : enumerate(edges[v])) {
|
||||
if (pf[ne.to] == 0 and ne.cap > ne.flow) {
|
||||
pf[ne.to] = min(pf[v], ne.cap - ne.flow);
|
||||
pa_[ne.to] = {v, i};
|
||||
dq.emplace_back(ne.to);
|
||||
}
|
||||
}
|
||||
if (pf[t] != 0) {
|
||||
break;
|
||||
}
|
||||
}
|
||||
if (pf[t] == 0) {
|
||||
break;
|
||||
}
|
||||
int p = t;
|
||||
while (pa_[p].first != 0) {
|
||||
auto [x, y] = pa_[p];
|
||||
edges[x][y].flow += pf[t];
|
||||
auto [z, w] = edges[x][y].rev;
|
||||
edges[z][w].flow -= pf[t];
|
||||
p = x;
|
||||
}
|
||||
res += pf[t];
|
||||
}
|
||||
return res;
|
||||
}
|
||||
};
|
||||
void prep() {
|
||||
}
|
||||
|
||||
void solve() {
|
||||
read(int, n, m, s, t);
|
||||
edmonds_karp net(n);
|
||||
while (m--) {
|
||||
read(int, u, v, c);
|
||||
net.add_edge(u, v, c);
|
||||
}
|
||||
cout << net.run(s, t) << '\n';
|
||||
}
|
||||
|
||||
int main() {
|
||||
#if __cplusplus < 201703L || defined(_MSC_VER) && !defined(__clang__)
|
||||
assert(false && "incompatible compiler variant detected.");
|
||||
#endif
|
||||
untie, cout.tie(NULL);
|
||||
prep();
|
||||
#ifdef SINGLE_TEST_CASE
|
||||
solve();
|
||||
#else
|
||||
read(int, t);
|
||||
for (int i = 0; i < t; ++i) {
|
||||
#ifdef DUMP_TEST_CASE
|
||||
if (t != (TOT_TEST_CASE)) {
|
||||
solve();
|
||||
} else if (i + 1 == (DUMP_TEST_CASE)) {
|
||||
dump();
|
||||
} else {
|
||||
dump_ignore();
|
||||
}
|
||||
#else
|
||||
solve();
|
||||
#endif
|
||||
}
|
||||
#endif
|
||||
}
|
||||
|
|
@ -0,0 +1,590 @@
|
|||
#pragma GCC optimize("Ofast")
|
||||
/////////////////////////////////////////////////////////
|
||||
/**
|
||||
* Useful Macros
|
||||
* by subcrip
|
||||
* (requires C++17)
|
||||
*/
|
||||
|
||||
#include<bits/stdc++.h>
|
||||
using namespace std;
|
||||
|
||||
/* macro helpers */
|
||||
#define __NARGS(...) std::tuple_size<decltype(std::make_tuple(__VA_ARGS__))>::value
|
||||
#define __DECOMPOSE_S(a, x) auto x = a;
|
||||
#define __DECOMPOSE_N(a, ...) auto [__VA_ARGS__] = a;
|
||||
constexpr void __() {}
|
||||
#define __AS_PROCEDURE(...) __(); __VA_ARGS__; __()
|
||||
#define __as_typeof(container) remove_reference<decltype(container)>::type
|
||||
|
||||
/* type aliases */
|
||||
#if LONG_LONG_MAX != INT64_MAX
|
||||
using ll = int64_t;
|
||||
using ull = uint64_t;
|
||||
#else
|
||||
using ll = long long;
|
||||
using ull = unsigned long long;
|
||||
using ld = long double;
|
||||
#endif
|
||||
using int128 = __int128_t;
|
||||
using uint128 = __uint128_t;
|
||||
using ld = long double;
|
||||
using pii = pair<int, int>;
|
||||
using pil = pair<int, ll>;
|
||||
using pli = pair<ll, int>;
|
||||
using pll = pair<ll, ll>;
|
||||
using pid = pair<int, ld>;
|
||||
using pdi = pair<ld, int>;
|
||||
using pld = pair<ll, ld>;
|
||||
using pdl = pair<ld, ll>;
|
||||
using pdd = pair<ld, ld>;
|
||||
using tlll = tuple<ll, ll, ll>;
|
||||
using tlld = tuple<ll, ll, ld>;
|
||||
using tlli = tuple<ll, ll, int>;
|
||||
using tldl = tuple<ll, ld, ll>;
|
||||
using tldd = tuple<ll, ld, ld>;
|
||||
using tldi = tuple<ll, ld, int>;
|
||||
using tlil = tuple<ll, int, ll>;
|
||||
using tlid = tuple<ll, int, ld>;
|
||||
using tlii = tuple<ll, int, int>;
|
||||
using tdll = tuple<ld, ll, ll>;
|
||||
using tdld = tuple<ld, ll, ld>;
|
||||
using tdli = tuple<ld, ll, int>;
|
||||
using tddl = tuple<ld, ld, ll>;
|
||||
using tddd = tuple<ld, ld, ld>;
|
||||
using tddi = tuple<ld, ld, int>;
|
||||
using tdil = tuple<ld, int, ll>;
|
||||
using tdid = tuple<ld, int, ld>;
|
||||
using tdii = tuple<ld, int, int>;
|
||||
using till = tuple<int, ll, ll>;
|
||||
using tild = tuple<int, ll, ld>;
|
||||
using tili = tuple<int, ll, int>;
|
||||
using tidl = tuple<int, ld, ll>;
|
||||
using tidd = tuple<int, ld, ld>;
|
||||
using tidi = tuple<int, ld, int>;
|
||||
using tiil = tuple<int, int, ll>;
|
||||
using tiid = tuple<int, int, ld>;
|
||||
using tiii = tuple<int, int, int>;
|
||||
template <typename T> using max_heap = priority_queue<T>;
|
||||
template <typename T> using min_heap = priority_queue<T, vector<T>, greater<>>;
|
||||
template <typename T> using oi = ostream_iterator<T>;
|
||||
template <typename T> using ii = istream_iterator<T>;
|
||||
|
||||
/* constants */
|
||||
constexpr int INF = 0x3f3f3f3f;
|
||||
constexpr ll INFLL = 0x3f3f3f3f3f3f3f3fLL;
|
||||
constexpr ll MDL = 1e9 + 7;
|
||||
constexpr ll PRIME = 998'244'353;
|
||||
constexpr ll MDL1 = 8784491;
|
||||
constexpr ll MDL2 = PRIME;
|
||||
constexpr int128 INT128_MAX = numeric_limits<int128>::max();
|
||||
constexpr uint128 UINT128_MAX = numeric_limits<uint128>::max();
|
||||
constexpr int128 INT128_MIN = numeric_limits<int128>::min();
|
||||
constexpr uint128 UINT128_MIN = numeric_limits<uint128>::min();
|
||||
|
||||
/* random */
|
||||
|
||||
mt19937 rd(chrono::duration_cast<chrono::milliseconds>(chrono::system_clock::now().time_since_epoch()).count());
|
||||
|
||||
/* bit-wise operations */
|
||||
#define lowbit(x) ((x) & -(x))
|
||||
#define popcount(x) (__builtin_popcountll(ll(x)))
|
||||
#define parity(x) (__builtin_parityll(ll(x)))
|
||||
#define msp(x) (63LL - __builtin_clzll(ll(x)))
|
||||
#define lsp(x) (__builtin_ctzll(ll(x)))
|
||||
|
||||
/* arithmetic operations */
|
||||
#define mod(x, y) ((((x) % (y)) + (y)) % (y))
|
||||
|
||||
/* fast pairs */
|
||||
#define upair ull
|
||||
#define umake(x, y) (ull(x) << 32 | (ull(y) & ((1ULL << 32) - 1)))
|
||||
#define u1(p) ((p) >> 32)
|
||||
#define u2(p) ((p) & ((1ULL << 32) - 1))
|
||||
#define ult std::less<upair>
|
||||
#define ugt std::greater<upair>
|
||||
|
||||
#define ipair ull
|
||||
#define imake(x, y) (umake(x, y))
|
||||
#define i1(p) (int(u1(ll(p))))
|
||||
#define i2(p) (ll(u2(p) << 32) >> 32)
|
||||
struct ilt {
|
||||
bool operator()(const ipair& a, const ipair& b) const {
|
||||
if (i1(a) == i1(b)) return i2(a) < i2(b);
|
||||
else return i1(a) < i1(b);
|
||||
}
|
||||
};
|
||||
struct igt {
|
||||
bool operator()(const ipair& a, const ipair& b) const {
|
||||
if (i1(a) == i1(b)) return i2(a) > i2(b);
|
||||
else return i1(a) > i1(b);
|
||||
}
|
||||
};
|
||||
|
||||
/* conditions */
|
||||
#define loop while (1)
|
||||
#define if_or(var, val) if (!(var == val)) var = val; else
|
||||
#define continue_or(var, val) __AS_PROCEDURE(if (var == val) continue; var = val;)
|
||||
#define break_or(var, val) __AS_PROCEDURE(if (var == val) break; var = val;)
|
||||
|
||||
/* hash */
|
||||
struct safe_hash {
|
||||
// https://codeforces.com/blog/entry/62393
|
||||
static uint64_t splitmix64(uint64_t x) {
|
||||
// http://xorshift.di.unimi.it/splitmix64.c
|
||||
x += 0x9e3779b97f4a7c15;
|
||||
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
|
||||
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
|
||||
return x ^ (x >> 31);
|
||||
}
|
||||
|
||||
size_t operator()(uint64_t x) const {
|
||||
static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
|
||||
return splitmix64(x + FIXED_RANDOM);
|
||||
}
|
||||
};
|
||||
|
||||
struct pair_hash {
|
||||
template <typename T, typename U>
|
||||
size_t operator()(const pair<T, U>& a) const {
|
||||
auto hash1 = safe_hash()(a.first);
|
||||
auto hash2 = safe_hash()(a.second);
|
||||
if (hash1 != hash2) {
|
||||
return hash1 ^ hash2;
|
||||
}
|
||||
return hash1;
|
||||
}
|
||||
};
|
||||
|
||||
uniform_int_distribution<mt19937::result_type> dist(PRIME);
|
||||
const size_t __array_hash_b = 31, __array_hash_mdl1 = dist(rd), __array_hash_mdl2 = dist(rd);
|
||||
struct array_hash {
|
||||
template <typename Sequence>
|
||||
size_t operator()(const Sequence& arr) const {
|
||||
size_t pw1 = 1, pw2 = 1;
|
||||
size_t res1 = 0, res2 = 0;
|
||||
for (auto&& x : arr) {
|
||||
res1 = (res1 + x * pw1) % __array_hash_mdl1;
|
||||
res2 = (res2 + x * pw2) % __array_hash_mdl2;
|
||||
pw1 = (pw1 * __array_hash_b) % __array_hash_mdl1;
|
||||
pw2 = (pw2 * __array_hash_b) % __array_hash_mdl2;
|
||||
}
|
||||
return res1 + res2;
|
||||
}
|
||||
};
|
||||
|
||||
/* build data structures */
|
||||
#define unordered_counter(from, to) __AS_PROCEDURE(unordered_map<__as_typeof(from), size_t, safe_hash> to; for (auto&& x : from) ++to[x];)
|
||||
#define counter(from, to, cmp) __AS_PROCEDURE(map<__as_typeof(from), size_t, cmp> to; for (auto&& x : from) ++to[x];)
|
||||
#define pa(a) __AS_PROCEDURE(__typeof(a) pa; pa.push_back({}); for (auto&&x : a) pa.push_back(pa.back() + x);)
|
||||
#define sa(a) __AS_PROCEDURE(__typeof(a) sa(a.size() + 1); {int n = a.size(); for (int i = n - 1; i >= 0; --i) sa[i] = sa[i + 1] + a[i];};)
|
||||
#define adj(ch, n) __AS_PROCEDURE(vector<vector<int>> ch((n) + 1);)
|
||||
#define edge(ch, u, v) __AS_PROCEDURE(ch[u].push_back(v), ch[v].push_back(u);)
|
||||
#define edgew(ch, u, v, w) __AS_PROCEDURE(ch[u].emplace_back(v, w), ch[v].emplace_back(u, w);)
|
||||
#define Edge(ch, u, v) __AS_PROCEDURE(ch[u].push_back(v);)
|
||||
#define Edgew(ch, u, v, w) __AS_PROCEDURE(ch[u].emplace_back(v, w);)
|
||||
template <typename T, typename Iterator> pair<size_t, map<T, size_t>> discretize(Iterator __first, Iterator __last) {
|
||||
set<T> st(__first, __last);
|
||||
size_t N = 0;
|
||||
map<T, size_t> mp;
|
||||
for (auto&& x : st) mp[x] = ++N;
|
||||
return {N, mp};
|
||||
}
|
||||
template <typename T, typename Iterator> pair<size_t, unordered_map<T, size_t, safe_hash>> unordered_discretize(Iterator __first, Iterator __last) {
|
||||
set<T> st(__first, __last);
|
||||
size_t N = 0;
|
||||
unordered_map<T, size_t, safe_hash> mp;
|
||||
for (auto&& x : st) mp[x] = ++N;
|
||||
return {N, mp};
|
||||
}
|
||||
|
||||
/* io */
|
||||
#define untie __AS_PROCEDURE(ios_base::sync_with_stdio(0), cin.tie(NULL))
|
||||
template<typename T> void __read(T& x) { cin >> x; }
|
||||
template<typename T, typename... U> void __read(T& x, U&... args) { cin >> x; __read(args...); }
|
||||
#define read(type, ...) __AS_PROCEDURE(type __VA_ARGS__; __read(__VA_ARGS__);)
|
||||
#define readvec(type, a, n) __AS_PROCEDURE(vector<type> a(n); for (auto& x : a) cin >> x;)
|
||||
#define readvec1(type, a, n) __AS_PROCEDURE(vector<type> a((n) + 1); copy_n(ii<type>(cin), (n), a.begin() + 1);)
|
||||
#define putvec(a) __AS_PROCEDURE(copy(a.begin(), a.end(), oi<__as_typeof(a)::value_type>(cout, " ")); cout << endl;)
|
||||
#define putvec1(a) __AS_PROCEDURE(copy(a.begin() + 1, a.end(), oi<__as_typeof(a)::value_type>(cout, " ")); cout << endl;)
|
||||
#define putvec_eol(a) __AS_PROCEDURE(copy(a.begin(), a.end(), oi<__as_typeof(a)::value_type>(cout, "\n"));)
|
||||
#define putvec1_eol(a) __AS_PROCEDURE(copy(a.begin() + 1, a.end(), oi<__as_typeof(a)::value_type>(cout, "\n"));)
|
||||
#define debug(x) __AS_PROCEDURE(cerr << #x" = " << (x) << endl;)
|
||||
#define debugvec(a) __AS_PROCEDURE(cerr << #a" = "; for (auto&& x : a) cerr << x << ' '; cerr << endl;)
|
||||
template<typename T, typename U> istream& operator>>(istream& in, pair<T, U>& p) {
|
||||
return in >> p.first >> p.second;
|
||||
}
|
||||
template<typename T, typename U> ostream& operator<<(ostream& out, const pair<T, U>& p) {
|
||||
out << "{" << p.first << ", " << p.second << "}";
|
||||
return out;
|
||||
}
|
||||
template<typename Char, typename Traits, typename Tuple, std::size_t... Index>
|
||||
void print_tuple_impl(std::basic_ostream<Char, Traits>& os, const Tuple& t, std::index_sequence<Index...>) {
|
||||
using swallow = int[]; // guaranties left to right order
|
||||
(void)swallow { 0, (void(os << (Index == 0 ? "" : ", ") << std::get<Index>(t)), 0)... };
|
||||
}
|
||||
template<typename Char, typename Traits, typename... Args>
|
||||
decltype(auto) operator<<(std::basic_ostream<Char, Traits>& os, const std::tuple<Args...>& t) {
|
||||
os << "{";
|
||||
print_tuple_impl(os, t, std::index_sequence_for<Args...>{});
|
||||
return os << "}";
|
||||
}
|
||||
template<typename T> ostream& operator<<(ostream& out, const vector<T>& vec) {
|
||||
for (auto&& i : vec) out << i << ' ';
|
||||
return out;
|
||||
}
|
||||
std::ostream& operator<<(std::ostream& dest, const int128& value) {
|
||||
// https://stackoverflow.com/a/25115163/23881100
|
||||
std::ostream::sentry s( dest );
|
||||
if ( s ) {
|
||||
uint128 tmp = value < 0 ? -value : value;
|
||||
char buffer[ 128 ];
|
||||
char* d = std::end( buffer );
|
||||
do {
|
||||
-- d;
|
||||
*d = "0123456789"[ tmp % 10 ];
|
||||
tmp /= 10;
|
||||
} while ( tmp != 0 );
|
||||
if ( value < 0 ) {
|
||||
-- d;
|
||||
*d = '-';
|
||||
}
|
||||
int len = std::end( buffer ) - d;
|
||||
if ( dest.rdbuf()->sputn( d, len ) != len ) {
|
||||
dest.setstate( std::ios_base::badbit );
|
||||
}
|
||||
}
|
||||
return dest;
|
||||
}
|
||||
|
||||
/* pops */
|
||||
#define poptop(q, ...) __AS_PROCEDURE(auto [__VA_ARGS__] = q.top(); q.pop();)
|
||||
#define popback(q, ...) __AS_PROCEDURE(auto [__VA_ARGS__] = q.back(); q.pop_back();)
|
||||
#define popfront(q, ...) __AS_PROCEDURE(auto [__VA_ARGS__] = q.front();q.pop_front();)
|
||||
|
||||
/* math */
|
||||
constexpr inline int lg2(ll x) { return x == 0 ? -1 : sizeof(ll) * 8 - 1 - __builtin_clzll(x); }
|
||||
|
||||
void __exgcd(ll a, ll b, ll& x, ll& y) {
|
||||
if (b == 0) {
|
||||
x = 1, y = 0;
|
||||
return;
|
||||
}
|
||||
__exgcd(b, a % b, y, x);
|
||||
y -= a / b * x;
|
||||
}
|
||||
|
||||
ll inverse(ll a, ll b) {
|
||||
ll x, y;
|
||||
__exgcd(a, b, x, y);
|
||||
return mod(x, b);
|
||||
}
|
||||
|
||||
vector<tuple<int, int, ll>> decompose(ll x) {
|
||||
// return (factor, count, factor ** count)
|
||||
vector<tuple<int, int, ll>> res;
|
||||
for (int i = 2; i * i <= x; i++) {
|
||||
if (x % i == 0) {
|
||||
int cnt = 0;
|
||||
ll pw = 1;
|
||||
while (x % i == 0) ++cnt, x /= i, pw *= i;
|
||||
res.emplace_back(i, cnt, pw);
|
||||
}
|
||||
}
|
||||
if (x != 1) {
|
||||
res.emplace_back(x, 1, x);
|
||||
}
|
||||
return res;
|
||||
}
|
||||
|
||||
vector<pii> decompose_prime(int N) {
|
||||
// return (factor, count)
|
||||
vector<pii> result;
|
||||
for (int i = 2; i * i <= N; i++) {
|
||||
if (N % i == 0) {
|
||||
int cnt = 0;
|
||||
while (N % i == 0) N /= i, ++cnt;
|
||||
result.emplace_back(i, cnt);
|
||||
}
|
||||
}
|
||||
if (N != 1) {
|
||||
result.emplace_back(N, 1);
|
||||
}
|
||||
return result;
|
||||
}
|
||||
|
||||
/* string algorithms */
|
||||
vector<int> calc_next(string t) { // pi function of t
|
||||
int n = (int)t.length();
|
||||
vector<int> pi(n);
|
||||
for (int i = 1; i < n; i++) {
|
||||
int j = pi[i - 1];
|
||||
while (j > 0 && t[i] != t[j]) j = pi[j - 1];
|
||||
if (t[i] == t[j]) j++;
|
||||
pi[i] = j;
|
||||
}
|
||||
return pi;
|
||||
}
|
||||
vector<int> calc_z(string t) { // z function of t
|
||||
int m = t.length();
|
||||
vector<int> z;
|
||||
z.push_back(m);
|
||||
pair<int, int> prev = {1, -1};
|
||||
for (int i = 1; i < m; ++i) {
|
||||
if (z[i - prev.first] + i <= prev.second) {
|
||||
z.push_back(z[i - prev.first]);
|
||||
} else {
|
||||
int j = max(i, prev.second + 1);
|
||||
while (j < m && t[j] == t[j - i]) ++j;
|
||||
z.push_back(j - i);
|
||||
prev = {i, j - 1};
|
||||
}
|
||||
}
|
||||
return z;
|
||||
}
|
||||
vector<int> kmp(string s, string t) { // find all t in s
|
||||
string cur = t + '#' + s;
|
||||
int sz1 = s.size(), sz2 = t.size();
|
||||
vector<int> v;
|
||||
vector<int> lps = calc_next(cur);
|
||||
for (int i = sz2 + 1; i <= sz1 + sz2; i++) {
|
||||
if (lps[i] == sz2) v.push_back(i - 2 * sz2);
|
||||
}
|
||||
return v;
|
||||
}
|
||||
int period(string s) { // find the length of shortest recurring period
|
||||
int n = s.length();
|
||||
auto z = calc_z(s);
|
||||
for (int i = 1; i <= n / 2; ++i) {
|
||||
if (n % i == 0 && z[i] == n - i) {
|
||||
return i;
|
||||
}
|
||||
}
|
||||
return n;
|
||||
}
|
||||
|
||||
/* modular arithmetic */
|
||||
template <ll mdl> struct MLL {
|
||||
ll val;
|
||||
MLL(ll v = 0) : val(mod(v, mdl)) {}
|
||||
MLL(const MLL<mdl>& other) : val(other.val) {}
|
||||
friend MLL operator+(const MLL& lhs, const MLL& rhs) { return mod(lhs.val + rhs.val, mdl); }
|
||||
friend MLL operator-(const MLL& lhs, const MLL& rhs) { return mod(lhs.val - rhs.val, mdl); }
|
||||
friend MLL operator*(const MLL& lhs, const MLL& rhs) { return mod(lhs.val * rhs.val, mdl); }
|
||||
friend MLL operator/(const MLL& lhs, const MLL& rhs) { return mod(lhs.val * mod(inverse(rhs.val, mdl), mdl), mdl); }
|
||||
friend MLL operator%(const MLL& lhs, const MLL& rhs) { return mod(lhs.val - (lhs / rhs).val, mdl); }
|
||||
friend bool operator==(const MLL& lhs, const MLL& rhs) { return lhs.val == rhs.val; }
|
||||
friend bool operator!=(const MLL& lhs, const MLL& rhs) { return lhs.val != rhs.val; }
|
||||
void operator+=(const MLL& rhs) { val = (*this + rhs).val; }
|
||||
void operator-=(const MLL& rhs) { val = (*this - rhs).val; }
|
||||
void operator*=(const MLL& rhs) { val = (*this * rhs).val; }
|
||||
void operator/=(const MLL& rhs) { val = (*this / rhs).val; }
|
||||
void operator%=(const MLL& rhs) { val = (*this % rhs).val; }
|
||||
};
|
||||
struct MLLd {
|
||||
ll val, mdl;
|
||||
MLLd(ll mdl, ll v = 0) : mdl(mdl), val(mod(v, mdl)) {}
|
||||
MLLd(const MLLd& other) : val(other.val) {}
|
||||
friend MLLd operator+(const MLLd& lhs, const MLLd& rhs) { return mod(lhs.val + rhs.val, lhs.mdl); }
|
||||
friend MLLd operator-(const MLLd& lhs, const MLLd& rhs) { return mod(lhs.val - rhs.val, lhs.mdl); }
|
||||
friend MLLd operator*(const MLLd& lhs, const MLLd& rhs) { return mod(lhs.val * rhs.val, lhs.mdl); }
|
||||
friend MLLd operator/(const MLLd& lhs, const MLLd& rhs) { return mod(lhs.val * mod(inverse(rhs.val, lhs.mdl), lhs.mdl), lhs.mdl); }
|
||||
friend MLLd operator%(const MLLd& lhs, const MLLd& rhs) { return mod(lhs.val - (lhs / rhs).val, lhs.mdl); }
|
||||
friend bool operator==(const MLLd& lhs, const MLLd& rhs) { return lhs.val == rhs.val; }
|
||||
friend bool operator!=(const MLLd& lhs, const MLLd& rhs) { return lhs.val != rhs.val; }
|
||||
void operator+=(const MLLd& rhs) { val = (*this + rhs).val; }
|
||||
void operator-=(const MLLd& rhs) { val = (*this - rhs).val; }
|
||||
void operator*=(const MLLd& rhs) { val = (*this * rhs).val; }
|
||||
void operator/=(const MLLd& rhs) { val = (*this / rhs).val; }
|
||||
void operator%=(const MLLd& rhs) { val = (*this % rhs).val; }
|
||||
};
|
||||
|
||||
template <ll mdl>
|
||||
ostream& operator<<(ostream& out, const MLL<mdl>& num) {
|
||||
return out << num.val;
|
||||
}
|
||||
|
||||
ostream& operator<<(ostream& out, const MLLd& num) {
|
||||
return out << num.val;
|
||||
}
|
||||
|
||||
template <ll mdl>
|
||||
istream& operator>>(istream& in, MLL<mdl>& num) {
|
||||
return in >> num.val;
|
||||
}
|
||||
|
||||
istream& operator>>(istream& in, MLLd& num) {
|
||||
return in >> num.val;
|
||||
}
|
||||
|
||||
// miscancellous
|
||||
template <typename Func, typename RandomIt> void sort_by_key(RandomIt first, RandomIt last, Func extractor) {
|
||||
std::sort(first, last, [&] (auto&& a, auto&& b) { return std::less<>()(extractor(a), extractor(b)); });
|
||||
}
|
||||
template <typename Func, typename RandomIt, typename Compare> void sort_by_key(RandomIt first, RandomIt last, Func extractor, Compare comp) {
|
||||
std::sort(first, last, [&] (auto&& a, auto&& b) { return comp(extractor(a), extractor(b)); });
|
||||
}
|
||||
template <typename T, typename U, typename Iterator_T, typename Iterator_U>
|
||||
vector<pair<T, U>> zip(Iterator_T a_first, Iterator_T a_last, Iterator_U b_first, Iterator_U b_last) {
|
||||
vector<pair<T, U>> res;
|
||||
auto a_it = a_first;
|
||||
auto b_it = b_first;
|
||||
for (; not (a_it == a_last) and not (b_it == b_last); ++a_it, ++b_it) {
|
||||
res.emplace_back(*a_it, *b_it);
|
||||
}
|
||||
return res;
|
||||
}
|
||||
template <typename T, typename U, typename Iterator_T, typename Iterator_U>
|
||||
vector<pair<T, U>> zip_n(Iterator_T a_first, Iterator_U b_first, size_t n) {
|
||||
vector<pair<T, U>> res;
|
||||
if (n > 0) {
|
||||
res.emplace_back(*a_first, *b_first);
|
||||
for (size_t i = 1; i != n; ++i) {
|
||||
res.emplace_back(*++a_first, *++b_first);
|
||||
}
|
||||
}
|
||||
return res;
|
||||
}
|
||||
template <typename T>
|
||||
class ArithmeticIterator : bidirectional_iterator_tag {
|
||||
public:
|
||||
using difference_type = ptrdiff_t;
|
||||
using value_type = T;
|
||||
private:
|
||||
value_type value;
|
||||
public:
|
||||
ArithmeticIterator(const T& value) : value(value) {}
|
||||
value_type operator*() const { return value; }
|
||||
ArithmeticIterator<T>& operator++() { ++value; return *this; }
|
||||
ArithmeticIterator<T>& operator--() { --value; return *this; }
|
||||
bool operator==(const ArithmeticIterator<T>& rhs) const { return value == rhs.value; }
|
||||
};
|
||||
template <typename T> vector<pair<int, T>> enumerate(const vector<T>& container) {
|
||||
return zip<int, T>(ArithmeticIterator<int>(0), ArithmeticIterator<int>(INT_MAX), container.begin(), container.end());
|
||||
}
|
||||
/////////////////////////////////////////////////////////
|
||||
|
||||
#define SINGLE_TEST_CASE
|
||||
// #define DUMP_TEST_CASE 7219
|
||||
// #define TOT_TEST_CASE 10000
|
||||
|
||||
void dump() {}
|
||||
|
||||
void dump_ignore() {}
|
||||
|
||||
struct mcmf {
|
||||
struct edge {
|
||||
int to;
|
||||
ll cap;
|
||||
ll flow;
|
||||
ll cost;
|
||||
int rev;
|
||||
};
|
||||
|
||||
vector<vector<edge>> edges;
|
||||
vector<ll> dis;
|
||||
vector<bool> vis;
|
||||
ll ret;
|
||||
|
||||
mcmf(int n) : edges(n + 1), dis(n + 1), vis(n + 1) {}
|
||||
|
||||
void add_edge(int from, int to, ll cap, ll cost) {
|
||||
edges[from].push_back({ to, cap, 0, cost, int(edges[to].size()) });
|
||||
edges[to].push_back({ from, 0, 0, -cost, int(edges[from].size() - 1)});
|
||||
}
|
||||
|
||||
bool sp(int s, int t) {
|
||||
dis.assign(edges.size(), INFLL);
|
||||
dis[s] = 0;
|
||||
int n = edges.size();
|
||||
int f = 1;
|
||||
while (f) {
|
||||
f = 0;
|
||||
for (int i = 0; i < n; ++i) {
|
||||
for (auto&& [to, cap, flow, cost, rev] : edges[i]) {
|
||||
if (cap > flow and dis[to] > dis[i] + cost) {
|
||||
dis[to] = dis[i] + cost;
|
||||
f = 1;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
return dis[t] != INFLL;
|
||||
}
|
||||
|
||||
ll dfs(int s, int t, ll cap) {
|
||||
if (vis[s]) {
|
||||
return 0;
|
||||
}
|
||||
vis[s] = 1;
|
||||
if (s == t) {
|
||||
return cap;
|
||||
}
|
||||
ll res = 0;
|
||||
int n = edges[s].size();
|
||||
for (int i = 0; i < n; ++i) {
|
||||
auto e = edges[s][i];
|
||||
if (e.cap > e.flow and dis[e.to] == dis[s] + e.cost) {
|
||||
ll nw = dfs(e.to, t, min(cap - res, e.cap - e.flow));
|
||||
edges[s][i].flow += nw;
|
||||
edges[e.to][e.rev].flow -= nw;
|
||||
res += nw;
|
||||
ret += nw * e.cost;
|
||||
if (res == cap) {
|
||||
return res;
|
||||
}
|
||||
}
|
||||
}
|
||||
return res;
|
||||
}
|
||||
|
||||
// returns: (flow, cost)
|
||||
pll run(int s, int t) {
|
||||
ll res = 0; ret = 0;
|
||||
while (sp(s, t)) {
|
||||
vis.assign(edges.size(), 0);
|
||||
ll curr = dfs(s, t, LLONG_MAX);
|
||||
res += curr;
|
||||
}
|
||||
return { res, ret };
|
||||
}
|
||||
};
|
||||
void prep() {
|
||||
}
|
||||
|
||||
void solve() {
|
||||
read(int, n, m);
|
||||
mcmf net(n);
|
||||
while (m--) {
|
||||
read(int, u, v, c, w);
|
||||
net.add_edge(u, v, c, w);
|
||||
}
|
||||
auto [flow, cost] = net.run(1, n);
|
||||
cout << flow << ' ' << cost << '\n';
|
||||
}
|
||||
|
||||
int main() {
|
||||
#if __cplusplus < 201703L || defined(_MSC_VER) && !defined(__clang__)
|
||||
assert(false && "incompatible compiler variant detected.");
|
||||
#endif
|
||||
untie, cout.tie(NULL);
|
||||
prep();
|
||||
#ifdef SINGLE_TEST_CASE
|
||||
solve();
|
||||
#else
|
||||
read(int, t);
|
||||
for (int i = 0; i < t; ++i) {
|
||||
#ifdef DUMP_TEST_CASE
|
||||
if (t != (TOT_TEST_CASE)) {
|
||||
solve();
|
||||
} else if (i + 1 == (DUMP_TEST_CASE)) {
|
||||
dump();
|
||||
} else {
|
||||
dump_ignore();
|
||||
}
|
||||
#else
|
||||
solve();
|
||||
#endif
|
||||
}
|
||||
#endif
|
||||
}
|
||||
|
|
@ -0,0 +1,649 @@
|
|||
#pragma GCC optimize("Ofast")
|
||||
/////////////////////////////////////////////////////////
|
||||
/**
|
||||
* Useful Macros
|
||||
* by subcrip
|
||||
* (requires C++17)
|
||||
*/
|
||||
|
||||
#include<bits/stdc++.h>
|
||||
using namespace std;
|
||||
|
||||
/* macro helpers */
|
||||
#define __NARGS(...) std::tuple_size<decltype(std::make_tuple(__VA_ARGS__))>::value
|
||||
#define __DECOMPOSE_S(a, x) auto x = a;
|
||||
#define __DECOMPOSE_N(a, ...) auto [__VA_ARGS__] = a;
|
||||
constexpr void __() {}
|
||||
#define __AS_PROCEDURE(...) __(); __VA_ARGS__; __()
|
||||
#define __as_typeof(container) remove_reference<decltype(container)>::type
|
||||
|
||||
/* type aliases */
|
||||
#if LONG_LONG_MAX != INT64_MAX
|
||||
using ll = int64_t;
|
||||
using ull = uint64_t;
|
||||
#else
|
||||
using ll = long long;
|
||||
using ull = unsigned long long;
|
||||
using ld = long double;
|
||||
#endif
|
||||
using int128 = __int128_t;
|
||||
using uint128 = __uint128_t;
|
||||
using ld = long double;
|
||||
using pii = pair<int, int>;
|
||||
using pil = pair<int, ll>;
|
||||
using pli = pair<ll, int>;
|
||||
using pll = pair<ll, ll>;
|
||||
using pid = pair<int, ld>;
|
||||
using pdi = pair<ld, int>;
|
||||
using pld = pair<ll, ld>;
|
||||
using pdl = pair<ld, ll>;
|
||||
using pdd = pair<ld, ld>;
|
||||
using tlll = tuple<ll, ll, ll>;
|
||||
using tlld = tuple<ll, ll, ld>;
|
||||
using tlli = tuple<ll, ll, int>;
|
||||
using tldl = tuple<ll, ld, ll>;
|
||||
using tldd = tuple<ll, ld, ld>;
|
||||
using tldi = tuple<ll, ld, int>;
|
||||
using tlil = tuple<ll, int, ll>;
|
||||
using tlid = tuple<ll, int, ld>;
|
||||
using tlii = tuple<ll, int, int>;
|
||||
using tdll = tuple<ld, ll, ll>;
|
||||
using tdld = tuple<ld, ll, ld>;
|
||||
using tdli = tuple<ld, ll, int>;
|
||||
using tddl = tuple<ld, ld, ll>;
|
||||
using tddd = tuple<ld, ld, ld>;
|
||||
using tddi = tuple<ld, ld, int>;
|
||||
using tdil = tuple<ld, int, ll>;
|
||||
using tdid = tuple<ld, int, ld>;
|
||||
using tdii = tuple<ld, int, int>;
|
||||
using till = tuple<int, ll, ll>;
|
||||
using tild = tuple<int, ll, ld>;
|
||||
using tili = tuple<int, ll, int>;
|
||||
using tidl = tuple<int, ld, ll>;
|
||||
using tidd = tuple<int, ld, ld>;
|
||||
using tidi = tuple<int, ld, int>;
|
||||
using tiil = tuple<int, int, ll>;
|
||||
using tiid = tuple<int, int, ld>;
|
||||
using tiii = tuple<int, int, int>;
|
||||
template <typename T> using max_heap = priority_queue<T>;
|
||||
template <typename T> using min_heap = priority_queue<T, vector<T>, greater<>>;
|
||||
template <typename T> using oi = ostream_iterator<T>;
|
||||
template <typename T> using ii = istream_iterator<T>;
|
||||
|
||||
/* constants */
|
||||
constexpr int INF = 0x3f3f3f3f;
|
||||
constexpr ll INFLL = 0x3f3f3f3f3f3f3f3fLL;
|
||||
constexpr ll MDL = 1e9 + 7;
|
||||
constexpr ll PRIME = 998'244'353;
|
||||
constexpr ll MDL1 = 8784491;
|
||||
constexpr ll MDL2 = PRIME;
|
||||
constexpr int128 INT128_MAX = numeric_limits<int128>::max();
|
||||
constexpr uint128 UINT128_MAX = numeric_limits<uint128>::max();
|
||||
constexpr int128 INT128_MIN = numeric_limits<int128>::min();
|
||||
constexpr uint128 UINT128_MIN = numeric_limits<uint128>::min();
|
||||
|
||||
/* random */
|
||||
|
||||
mt19937 rd(chrono::duration_cast<chrono::milliseconds>(chrono::system_clock::now().time_since_epoch()).count());
|
||||
|
||||
/* bit-wise operations */
|
||||
#define lowbit(x) ((x) & -(x))
|
||||
#define popcount(x) (__builtin_popcountll(ll(x)))
|
||||
#define parity(x) (__builtin_parityll(ll(x)))
|
||||
#define msp(x) (63LL - __builtin_clzll(ll(x)))
|
||||
#define lsp(x) (__builtin_ctzll(ll(x)))
|
||||
|
||||
/* arithmetic operations */
|
||||
#define mod(x, y) ((((x) % (y)) + (y)) % (y))
|
||||
|
||||
/* fast pairs */
|
||||
#define upair ull
|
||||
#define umake(x, y) (ull(x) << 32 | (ull(y) & ((1ULL << 32) - 1)))
|
||||
#define u1(p) ((p) >> 32)
|
||||
#define u2(p) ((p) & ((1ULL << 32) - 1))
|
||||
#define ult std::less<upair>
|
||||
#define ugt std::greater<upair>
|
||||
|
||||
#define ipair ull
|
||||
#define imake(x, y) (umake(x, y))
|
||||
#define i1(p) (int(u1(ll(p))))
|
||||
#define i2(p) (ll(u2(p) << 32) >> 32)
|
||||
struct ilt {
|
||||
bool operator()(const ipair& a, const ipair& b) const {
|
||||
if (i1(a) == i1(b)) return i2(a) < i2(b);
|
||||
else return i1(a) < i1(b);
|
||||
}
|
||||
};
|
||||
struct igt {
|
||||
bool operator()(const ipair& a, const ipair& b) const {
|
||||
if (i1(a) == i1(b)) return i2(a) > i2(b);
|
||||
else return i1(a) > i1(b);
|
||||
}
|
||||
};
|
||||
|
||||
/* conditions */
|
||||
#define loop while (1)
|
||||
#define if_or(var, val) if (!(var == val)) var = val; else
|
||||
#define continue_or(var, val) __AS_PROCEDURE(if (var == val) continue; var = val;)
|
||||
#define break_or(var, val) __AS_PROCEDURE(if (var == val) break; var = val;)
|
||||
|
||||
/* hash */
|
||||
struct safe_hash {
|
||||
// https://codeforces.com/blog/entry/62393
|
||||
static uint64_t splitmix64(uint64_t x) {
|
||||
// http://xorshift.di.unimi.it/splitmix64.c
|
||||
x += 0x9e3779b97f4a7c15;
|
||||
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
|
||||
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
|
||||
return x ^ (x >> 31);
|
||||
}
|
||||
|
||||
size_t operator()(uint64_t x) const {
|
||||
static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
|
||||
return splitmix64(x + FIXED_RANDOM);
|
||||
}
|
||||
};
|
||||
|
||||
struct pair_hash {
|
||||
template <typename T, typename U>
|
||||
size_t operator()(const pair<T, U>& a) const {
|
||||
auto hash1 = safe_hash()(a.first);
|
||||
auto hash2 = safe_hash()(a.second);
|
||||
if (hash1 != hash2) {
|
||||
return hash1 ^ hash2;
|
||||
}
|
||||
return hash1;
|
||||
}
|
||||
};
|
||||
|
||||
uniform_int_distribution<mt19937::result_type> dist(PRIME);
|
||||
const size_t __array_hash_b = 31, __array_hash_mdl1 = dist(rd), __array_hash_mdl2 = dist(rd);
|
||||
struct array_hash {
|
||||
template <typename Sequence>
|
||||
size_t operator()(const Sequence& arr) const {
|
||||
size_t pw1 = 1, pw2 = 1;
|
||||
size_t res1 = 0, res2 = 0;
|
||||
for (auto&& x : arr) {
|
||||
res1 = (res1 + x * pw1) % __array_hash_mdl1;
|
||||
res2 = (res2 + x * pw2) % __array_hash_mdl2;
|
||||
pw1 = (pw1 * __array_hash_b) % __array_hash_mdl1;
|
||||
pw2 = (pw2 * __array_hash_b) % __array_hash_mdl2;
|
||||
}
|
||||
return res1 + res2;
|
||||
}
|
||||
};
|
||||
|
||||
/* build data structures */
|
||||
#define unordered_counter(from, to) __AS_PROCEDURE(unordered_map<__as_typeof(from), size_t, safe_hash> to; for (auto&& x : from) ++to[x];)
|
||||
#define counter(from, to, cmp) __AS_PROCEDURE(map<__as_typeof(from), size_t, cmp> to; for (auto&& x : from) ++to[x];)
|
||||
#define pa(a) __AS_PROCEDURE(__typeof(a) pa; pa.push_back({}); for (auto&&x : a) pa.push_back(pa.back() + x);)
|
||||
#define sa(a) __AS_PROCEDURE(__typeof(a) sa(a.size() + 1); {int n = a.size(); for (int i = n - 1; i >= 0; --i) sa[i] = sa[i + 1] + a[i];};)
|
||||
#define adj(ch, n) __AS_PROCEDURE(vector<vector<int>> ch((n) + 1);)
|
||||
#define edge(ch, u, v) __AS_PROCEDURE(ch[u].push_back(v), ch[v].push_back(u);)
|
||||
#define edgew(ch, u, v, w) __AS_PROCEDURE(ch[u].emplace_back(v, w), ch[v].emplace_back(u, w);)
|
||||
#define Edge(ch, u, v) __AS_PROCEDURE(ch[u].push_back(v);)
|
||||
#define Edgew(ch, u, v, w) __AS_PROCEDURE(ch[u].emplace_back(v, w);)
|
||||
template <typename T, typename Iterator> pair<size_t, map<T, size_t>> discretize(Iterator __first, Iterator __last) {
|
||||
set<T> st(__first, __last);
|
||||
size_t N = 0;
|
||||
map<T, size_t> mp;
|
||||
for (auto&& x : st) mp[x] = ++N;
|
||||
return {N, mp};
|
||||
}
|
||||
template <typename T, typename Iterator> pair<size_t, unordered_map<T, size_t, safe_hash>> unordered_discretize(Iterator __first, Iterator __last) {
|
||||
set<T> st(__first, __last);
|
||||
size_t N = 0;
|
||||
unordered_map<T, size_t, safe_hash> mp;
|
||||
for (auto&& x : st) mp[x] = ++N;
|
||||
return {N, mp};
|
||||
}
|
||||
|
||||
/* io */
|
||||
#define untie __AS_PROCEDURE(ios_base::sync_with_stdio(0), cin.tie(NULL))
|
||||
template<typename T> void __read(T& x) { cin >> x; }
|
||||
template<typename T, typename... U> void __read(T& x, U&... args) { cin >> x; __read(args...); }
|
||||
#define read(type, ...) __AS_PROCEDURE(type __VA_ARGS__; __read(__VA_ARGS__);)
|
||||
#define readvec(type, a, n) __AS_PROCEDURE(vector<type> a(n); for (auto& x : a) cin >> x;)
|
||||
#define readvec1(type, a, n) __AS_PROCEDURE(vector<type> a((n) + 1); copy_n(ii<type>(cin), (n), a.begin() + 1);)
|
||||
#define putvec(a) __AS_PROCEDURE(copy(a.begin(), a.end(), oi<__as_typeof(a)::value_type>(cout, " ")); cout << endl;)
|
||||
#define putvec1(a) __AS_PROCEDURE(copy(a.begin() + 1, a.end(), oi<__as_typeof(a)::value_type>(cout, " ")); cout << endl;)
|
||||
#define putvec_eol(a) __AS_PROCEDURE(copy(a.begin(), a.end(), oi<__as_typeof(a)::value_type>(cout, "\n"));)
|
||||
#define putvec1_eol(a) __AS_PROCEDURE(copy(a.begin() + 1, a.end(), oi<__as_typeof(a)::value_type>(cout, "\n"));)
|
||||
#define debug(x) __AS_PROCEDURE(cerr << #x" = " << (x) << endl;)
|
||||
#define debugvec(a) __AS_PROCEDURE(cerr << #a" = "; for (auto&& x : a) cerr << x << ' '; cerr << endl;)
|
||||
template<typename T, typename U> istream& operator>>(istream& in, pair<T, U>& p) {
|
||||
return in >> p.first >> p.second;
|
||||
}
|
||||
template<typename T, typename U> ostream& operator<<(ostream& out, const pair<T, U>& p) {
|
||||
out << "{" << p.first << ", " << p.second << "}";
|
||||
return out;
|
||||
}
|
||||
template<typename Char, typename Traits, typename Tuple, std::size_t... Index>
|
||||
void print_tuple_impl(std::basic_ostream<Char, Traits>& os, const Tuple& t, std::index_sequence<Index...>) {
|
||||
using swallow = int[]; // guaranties left to right order
|
||||
(void)swallow { 0, (void(os << (Index == 0 ? "" : ", ") << std::get<Index>(t)), 0)... };
|
||||
}
|
||||
template<typename Char, typename Traits, typename... Args>
|
||||
decltype(auto) operator<<(std::basic_ostream<Char, Traits>& os, const std::tuple<Args...>& t) {
|
||||
os << "{";
|
||||
print_tuple_impl(os, t, std::index_sequence_for<Args...>{});
|
||||
return os << "}";
|
||||
}
|
||||
template<typename T> ostream& operator<<(ostream& out, const vector<T>& vec) {
|
||||
for (auto&& i : vec) out << i << ' ';
|
||||
return out;
|
||||
}
|
||||
std::ostream& operator<<(std::ostream& dest, const int128& value) {
|
||||
// https://stackoverflow.com/a/25115163/23881100
|
||||
std::ostream::sentry s( dest );
|
||||
if ( s ) {
|
||||
uint128 tmp = value < 0 ? -value : value;
|
||||
char buffer[ 128 ];
|
||||
char* d = std::end( buffer );
|
||||
do {
|
||||
-- d;
|
||||
*d = "0123456789"[ tmp % 10 ];
|
||||
tmp /= 10;
|
||||
} while ( tmp != 0 );
|
||||
if ( value < 0 ) {
|
||||
-- d;
|
||||
*d = '-';
|
||||
}
|
||||
int len = std::end( buffer ) - d;
|
||||
if ( dest.rdbuf()->sputn( d, len ) != len ) {
|
||||
dest.setstate( std::ios_base::badbit );
|
||||
}
|
||||
}
|
||||
return dest;
|
||||
}
|
||||
|
||||
/* pops */
|
||||
#define poptop(q, ...) __AS_PROCEDURE(auto [__VA_ARGS__] = q.top(); q.pop();)
|
||||
#define popback(q, ...) __AS_PROCEDURE(auto [__VA_ARGS__] = q.back(); q.pop_back();)
|
||||
#define popfront(q, ...) __AS_PROCEDURE(auto [__VA_ARGS__] = q.front();q.pop_front();)
|
||||
|
||||
/* math */
|
||||
constexpr inline int lg2(ll x) { return x == 0 ? -1 : sizeof(ll) * 8 - 1 - __builtin_clzll(x); }
|
||||
|
||||
void __exgcd(ll a, ll b, ll& x, ll& y) {
|
||||
if (b == 0) {
|
||||
x = 1, y = 0;
|
||||
return;
|
||||
}
|
||||
__exgcd(b, a % b, y, x);
|
||||
y -= a / b * x;
|
||||
}
|
||||
|
||||
ll inverse(ll a, ll b) {
|
||||
ll x, y;
|
||||
__exgcd(a, b, x, y);
|
||||
return mod(x, b);
|
||||
}
|
||||
|
||||
vector<tuple<int, int, ll>> decompose(ll x) {
|
||||
// return (factor, count, factor ** count)
|
||||
vector<tuple<int, int, ll>> res;
|
||||
for (int i = 2; i * i <= x; i++) {
|
||||
if (x % i == 0) {
|
||||
int cnt = 0;
|
||||
ll pw = 1;
|
||||
while (x % i == 0) ++cnt, x /= i, pw *= i;
|
||||
res.emplace_back(i, cnt, pw);
|
||||
}
|
||||
}
|
||||
if (x != 1) {
|
||||
res.emplace_back(x, 1, x);
|
||||
}
|
||||
return res;
|
||||
}
|
||||
|
||||
vector<pii> decompose_prime(int N) {
|
||||
// return (factor, count)
|
||||
vector<pii> result;
|
||||
for (int i = 2; i * i <= N; i++) {
|
||||
if (N % i == 0) {
|
||||
int cnt = 0;
|
||||
while (N % i == 0) N /= i, ++cnt;
|
||||
result.emplace_back(i, cnt);
|
||||
}
|
||||
}
|
||||
if (N != 1) {
|
||||
result.emplace_back(N, 1);
|
||||
}
|
||||
return result;
|
||||
}
|
||||
|
||||
/* string algorithms */
|
||||
vector<int> calc_next(string t) { // pi function of t
|
||||
int n = (int)t.length();
|
||||
vector<int> pi(n);
|
||||
for (int i = 1; i < n; i++) {
|
||||
int j = pi[i - 1];
|
||||
while (j > 0 && t[i] != t[j]) j = pi[j - 1];
|
||||
if (t[i] == t[j]) j++;
|
||||
pi[i] = j;
|
||||
}
|
||||
return pi;
|
||||
}
|
||||
vector<int> calc_z(string t) { // z function of t
|
||||
int m = t.length();
|
||||
vector<int> z;
|
||||
z.push_back(m);
|
||||
pair<int, int> prev = {1, -1};
|
||||
for (int i = 1; i < m; ++i) {
|
||||
if (z[i - prev.first] + i <= prev.second) {
|
||||
z.push_back(z[i - prev.first]);
|
||||
} else {
|
||||
int j = max(i, prev.second + 1);
|
||||
while (j < m && t[j] == t[j - i]) ++j;
|
||||
z.push_back(j - i);
|
||||
prev = {i, j - 1};
|
||||
}
|
||||
}
|
||||
return z;
|
||||
}
|
||||
vector<int> kmp(string s, string t) { // find all t in s
|
||||
string cur = t + '#' + s;
|
||||
int sz1 = s.size(), sz2 = t.size();
|
||||
vector<int> v;
|
||||
vector<int> lps = calc_next(cur);
|
||||
for (int i = sz2 + 1; i <= sz1 + sz2; i++) {
|
||||
if (lps[i] == sz2) v.push_back(i - 2 * sz2);
|
||||
}
|
||||
return v;
|
||||
}
|
||||
int period(string s) { // find the length of shortest recurring period
|
||||
int n = s.length();
|
||||
auto z = calc_z(s);
|
||||
for (int i = 1; i <= n / 2; ++i) {
|
||||
if (n % i == 0 && z[i] == n - i) {
|
||||
return i;
|
||||
}
|
||||
}
|
||||
return n;
|
||||
}
|
||||
|
||||
/* modular arithmetic */
|
||||
template <ll mdl> struct MLL {
|
||||
ll val;
|
||||
MLL(ll v = 0) : val(mod(v, mdl)) {}
|
||||
MLL(const MLL<mdl>& other) : val(other.val) {}
|
||||
friend MLL operator+(const MLL& lhs, const MLL& rhs) { return mod(lhs.val + rhs.val, mdl); }
|
||||
friend MLL operator-(const MLL& lhs, const MLL& rhs) { return mod(lhs.val - rhs.val, mdl); }
|
||||
friend MLL operator*(const MLL& lhs, const MLL& rhs) { return mod(lhs.val * rhs.val, mdl); }
|
||||
friend MLL operator/(const MLL& lhs, const MLL& rhs) { return mod(lhs.val * mod(inverse(rhs.val, mdl), mdl), mdl); }
|
||||
friend MLL operator%(const MLL& lhs, const MLL& rhs) { return mod(lhs.val - (lhs / rhs).val, mdl); }
|
||||
friend bool operator==(const MLL& lhs, const MLL& rhs) { return lhs.val == rhs.val; }
|
||||
friend bool operator!=(const MLL& lhs, const MLL& rhs) { return lhs.val != rhs.val; }
|
||||
void operator+=(const MLL& rhs) { val = (*this + rhs).val; }
|
||||
void operator-=(const MLL& rhs) { val = (*this - rhs).val; }
|
||||
void operator*=(const MLL& rhs) { val = (*this * rhs).val; }
|
||||
void operator/=(const MLL& rhs) { val = (*this / rhs).val; }
|
||||
void operator%=(const MLL& rhs) { val = (*this % rhs).val; }
|
||||
};
|
||||
struct MLLd {
|
||||
ll val, mdl;
|
||||
MLLd(ll mdl, ll v = 0) : mdl(mdl), val(mod(v, mdl)) {}
|
||||
MLLd(const MLLd& other) : val(other.val) {}
|
||||
friend MLLd operator+(const MLLd& lhs, const MLLd& rhs) { return mod(lhs.val + rhs.val, lhs.mdl); }
|
||||
friend MLLd operator-(const MLLd& lhs, const MLLd& rhs) { return mod(lhs.val - rhs.val, lhs.mdl); }
|
||||
friend MLLd operator*(const MLLd& lhs, const MLLd& rhs) { return mod(lhs.val * rhs.val, lhs.mdl); }
|
||||
friend MLLd operator/(const MLLd& lhs, const MLLd& rhs) { return mod(lhs.val * mod(inverse(rhs.val, lhs.mdl), lhs.mdl), lhs.mdl); }
|
||||
friend MLLd operator%(const MLLd& lhs, const MLLd& rhs) { return mod(lhs.val - (lhs / rhs).val, lhs.mdl); }
|
||||
friend bool operator==(const MLLd& lhs, const MLLd& rhs) { return lhs.val == rhs.val; }
|
||||
friend bool operator!=(const MLLd& lhs, const MLLd& rhs) { return lhs.val != rhs.val; }
|
||||
void operator+=(const MLLd& rhs) { val = (*this + rhs).val; }
|
||||
void operator-=(const MLLd& rhs) { val = (*this - rhs).val; }
|
||||
void operator*=(const MLLd& rhs) { val = (*this * rhs).val; }
|
||||
void operator/=(const MLLd& rhs) { val = (*this / rhs).val; }
|
||||
void operator%=(const MLLd& rhs) { val = (*this % rhs).val; }
|
||||
};
|
||||
|
||||
template <ll mdl>
|
||||
ostream& operator<<(ostream& out, const MLL<mdl>& num) {
|
||||
return out << num.val;
|
||||
}
|
||||
|
||||
ostream& operator<<(ostream& out, const MLLd& num) {
|
||||
return out << num.val;
|
||||
}
|
||||
|
||||
template <ll mdl>
|
||||
istream& operator>>(istream& in, MLL<mdl>& num) {
|
||||
return in >> num.val;
|
||||
}
|
||||
|
||||
istream& operator>>(istream& in, MLLd& num) {
|
||||
return in >> num.val;
|
||||
}
|
||||
|
||||
// miscancellous
|
||||
template <typename Func, typename RandomIt> void sort_by_key(RandomIt first, RandomIt last, Func extractor) {
|
||||
std::sort(first, last, [&] (auto&& a, auto&& b) { return std::less<>()(extractor(a), extractor(b)); });
|
||||
}
|
||||
template <typename Func, typename RandomIt, typename Compare> void sort_by_key(RandomIt first, RandomIt last, Func extractor, Compare comp) {
|
||||
std::sort(first, last, [&] (auto&& a, auto&& b) { return comp(extractor(a), extractor(b)); });
|
||||
}
|
||||
template <typename T, typename U, typename Iterator_T, typename Iterator_U>
|
||||
vector<pair<T, U>> zip(Iterator_T a_first, Iterator_T a_last, Iterator_U b_first, Iterator_U b_last) {
|
||||
vector<pair<T, U>> res;
|
||||
auto a_it = a_first;
|
||||
auto b_it = b_first;
|
||||
for (; not (a_it == a_last) and not (b_it == b_last); ++a_it, ++b_it) {
|
||||
res.emplace_back(*a_it, *b_it);
|
||||
}
|
||||
return res;
|
||||
}
|
||||
template <typename T, typename U, typename Iterator_T, typename Iterator_U>
|
||||
vector<pair<T, U>> zip_n(Iterator_T a_first, Iterator_U b_first, size_t n) {
|
||||
vector<pair<T, U>> res;
|
||||
if (n > 0) {
|
||||
res.emplace_back(*a_first, *b_first);
|
||||
for (size_t i = 1; i != n; ++i) {
|
||||
res.emplace_back(*++a_first, *++b_first);
|
||||
}
|
||||
}
|
||||
return res;
|
||||
}
|
||||
template <typename T>
|
||||
class ArithmeticIterator : bidirectional_iterator_tag {
|
||||
public:
|
||||
using difference_type = ptrdiff_t;
|
||||
using value_type = T;
|
||||
private:
|
||||
value_type value;
|
||||
public:
|
||||
ArithmeticIterator(const T& value) : value(value) {}
|
||||
value_type operator*() const { return value; }
|
||||
ArithmeticIterator<T>& operator++() { ++value; return *this; }
|
||||
ArithmeticIterator<T>& operator--() { --value; return *this; }
|
||||
bool operator==(const ArithmeticIterator<T>& rhs) const { return value == rhs.value; }
|
||||
};
|
||||
template <typename T> vector<pair<int, T>> enumerate(const vector<T>& container) {
|
||||
return zip<int, T>(ArithmeticIterator<int>(0), ArithmeticIterator<int>(INT_MAX), container.begin(), container.end());
|
||||
}
|
||||
/////////////////////////////////////////////////////////
|
||||
|
||||
#define SINGLE_TEST_CASE
|
||||
// #define DUMP_TEST_CASE 7219
|
||||
// #define TOT_TEST_CASE 10000
|
||||
|
||||
void dump() {}
|
||||
|
||||
void dump_ignore() {}
|
||||
|
||||
void prep() {
|
||||
}
|
||||
|
||||
struct dinic {
|
||||
struct edge {
|
||||
int to;
|
||||
ll cap;
|
||||
ll flow;
|
||||
int rev;
|
||||
int mark;
|
||||
};
|
||||
vector<vector<edge>> edges;
|
||||
vector<int> layer;
|
||||
vector<bool> vis;
|
||||
dinic(int n) : edges(n + 1), layer(n + 1), vis(n + 1) {}
|
||||
void add_edge(int from, int to, ll cap, int mark = 0, int mark_rev = 0) {
|
||||
edges[from].push_back({ to, cap, 0, int(edges[to].size()), mark });
|
||||
edges[to].push_back({ from, 0, 0, int(edges[from].size() - 1), mark_rev });
|
||||
}
|
||||
bool bfs(int s, int t) {
|
||||
layer.assign(edges.size(), 0);
|
||||
deque<pii> dq;
|
||||
layer[s] = 1;
|
||||
dq.emplace_back(s, 1);
|
||||
while (dq.size()) {
|
||||
popfront(dq, v, l);
|
||||
for (auto&& e : edges[v]) {
|
||||
if (layer[e.to] == 0 and e.cap > e.flow) {
|
||||
layer[e.to] = l + 1;
|
||||
dq.emplace_back(e.to, l + 1);
|
||||
}
|
||||
}
|
||||
}
|
||||
return layer[t] != 0;
|
||||
}
|
||||
ll dfs(int s, int t, ll cap) {
|
||||
if (vis[s]) {
|
||||
return 0;
|
||||
}
|
||||
vis[s] = 1;
|
||||
if (s == t) {
|
||||
return cap;
|
||||
}
|
||||
ll res = 0;
|
||||
int n = edges[s].size();
|
||||
for (int i = 0; i < n; ++i) {
|
||||
auto e = edges[s][i];
|
||||
if (e.cap > e.flow and layer[e.to] == layer[s] + 1) {
|
||||
ll nw = dfs(e.to, t, min(cap - res, e.cap - e.flow));
|
||||
edges[s][i].flow += nw;
|
||||
edges[e.to][e.rev].flow -= nw;
|
||||
res += nw;
|
||||
if (res == cap) {
|
||||
return res;
|
||||
}
|
||||
}
|
||||
}
|
||||
return res;
|
||||
}
|
||||
ll run(int s, int t) {
|
||||
ll res = 0;
|
||||
while (bfs(s, t)) {
|
||||
vis.assign(edges.size(), 0);
|
||||
res += dfs(s, t, LLONG_MAX);
|
||||
}
|
||||
return res;
|
||||
}
|
||||
};
|
||||
|
||||
struct bounded_flow {
|
||||
int n, m, S, T;
|
||||
dinic net;
|
||||
ll sum;
|
||||
vector<ll> fl;
|
||||
vector<ll> init;
|
||||
bounded_flow(int n, int m) : sum(0), n(n), m(m), S(0), T(n + 1), net(n + 1), fl(m), init(n + 1) {}
|
||||
void add_edge(int from, int to, ll low, ll high, int edge_id = -1) {
|
||||
if (edge_id != -1) {
|
||||
fl[edge_id] += low;
|
||||
}
|
||||
net.add_edge(from, to, high - low, edge_id, -1);
|
||||
init[to] += low, init[from] -= low;
|
||||
}
|
||||
void prep(int s, int t) {
|
||||
for (int i = 1; i <= n; ++i) {
|
||||
if (init[i] > 0) {
|
||||
net.add_edge(S, i, init[i], -1, -1);
|
||||
sum += init[i];
|
||||
} else if (init[i] < 0) {
|
||||
net.add_edge(i, T, -init[i], -1, -1);
|
||||
}
|
||||
}
|
||||
net.add_edge(t, s, INFLL, -1, -1);
|
||||
}
|
||||
optional<pair<ll, vector<ll>>> run_max_flow(int s, int t) {
|
||||
prep(s, t);
|
||||
if (sum != net.run(S, T)) {
|
||||
return nullopt;
|
||||
} else {
|
||||
auto res_flow = net.run(s, t);
|
||||
for (int from = 1; from <= n; ++from) {
|
||||
for (auto&& [to, cap, flow, rev, mark] : net.edges[from]) {
|
||||
if (mark != -1) {
|
||||
fl[mark] += flow;
|
||||
}
|
||||
}
|
||||
}
|
||||
return {{res_flow, fl}};
|
||||
}
|
||||
}
|
||||
optional<pair<ll, vector<ll>>> run_flow(int s, int t) {
|
||||
prep(s, t);
|
||||
auto res_flow = net.run(S, T);
|
||||
if (sum != res_flow) {
|
||||
return nullopt;
|
||||
} else {
|
||||
for (int from = 1; from <= n; ++from) {
|
||||
for (auto&& [to, cap, flow, rev, mark] : net.edges[from]) {
|
||||
if (mark != -1) {
|
||||
fl[mark] += flow;
|
||||
}
|
||||
}
|
||||
}
|
||||
return {{res_flow, fl}};
|
||||
}
|
||||
}
|
||||
};
|
||||
void solve() {
|
||||
read(int, n, m);
|
||||
bounded_flow net(n, m);
|
||||
for (int i = 0; i < m; ++i) {
|
||||
read(int, u, v, lower, upper);
|
||||
net.add_edge(u, v, lower, upper, i);
|
||||
}
|
||||
net.run(0, n + 1);
|
||||
for (auto&& [from, e] : enumerate(net.edges)) {
|
||||
for (auto&& [to, cap, flow, rev, mark] : e) {
|
||||
if ((from == 0 or to == n + 1) and flow != cap) {
|
||||
cout << "NO\n";
|
||||
return;
|
||||
}
|
||||
if (mark != -1) {
|
||||
res[mark] += flow;
|
||||
}
|
||||
}
|
||||
}
|
||||
cout << "YES\n";
|
||||
copy(res.begin(), res.end(), oi<int>(cout, "\n"));
|
||||
}
|
||||
|
||||
int main() {
|
||||
#if __cplusplus < 201703L || defined(_MSC_VER) && !defined(__clang__)
|
||||
assert(false && "incompatible compiler variant detected.");
|
||||
#endif
|
||||
untie, cout.tie(NULL);
|
||||
prep();
|
||||
#ifdef SINGLE_TEST_CASE
|
||||
solve();
|
||||
#else
|
||||
read(int, t);
|
||||
for (int i = 0; i < t; ++i) {
|
||||
#ifdef DUMP_TEST_CASE
|
||||
if (t != (TOT_TEST_CASE)) {
|
||||
solve();
|
||||
} else if (i + 1 == (DUMP_TEST_CASE)) {
|
||||
dump();
|
||||
} else {
|
||||
dump_ignore();
|
||||
}
|
||||
#else
|
||||
solve();
|
||||
#endif
|
||||
}
|
||||
#endif
|
||||
}
|
||||
|
|
@ -0,0 +1,643 @@
|
|||
#pragma GCC optimize("Ofast")
|
||||
/////////////////////////////////////////////////////////
|
||||
/**
|
||||
* Useful Macros
|
||||
* by subcrip
|
||||
* (requires C++17)
|
||||
*/
|
||||
|
||||
#include<bits/stdc++.h>
|
||||
using namespace std;
|
||||
|
||||
/* macro helpers */
|
||||
#define __NARGS(...) std::tuple_size<decltype(std::make_tuple(__VA_ARGS__))>::value
|
||||
#define __DECOMPOSE_S(a, x) auto x = a;
|
||||
#define __DECOMPOSE_N(a, ...) auto [__VA_ARGS__] = a;
|
||||
constexpr void __() {}
|
||||
#define __AS_PROCEDURE(...) __(); __VA_ARGS__; __()
|
||||
#define __as_typeof(container) remove_reference<decltype(container)>::type
|
||||
|
||||
/* type aliases */
|
||||
#if LONG_LONG_MAX != INT64_MAX
|
||||
using ll = int64_t;
|
||||
using ull = uint64_t;
|
||||
#else
|
||||
using ll = long long;
|
||||
using ull = unsigned long long;
|
||||
using ld = long double;
|
||||
#endif
|
||||
using int128 = __int128_t;
|
||||
using uint128 = __uint128_t;
|
||||
using ld = long double;
|
||||
using pii = pair<int, int>;
|
||||
using pil = pair<int, ll>;
|
||||
using pli = pair<ll, int>;
|
||||
using pll = pair<ll, ll>;
|
||||
using pid = pair<int, ld>;
|
||||
using pdi = pair<ld, int>;
|
||||
using pld = pair<ll, ld>;
|
||||
using pdl = pair<ld, ll>;
|
||||
using pdd = pair<ld, ld>;
|
||||
using tlll = tuple<ll, ll, ll>;
|
||||
using tlld = tuple<ll, ll, ld>;
|
||||
using tlli = tuple<ll, ll, int>;
|
||||
using tldl = tuple<ll, ld, ll>;
|
||||
using tldd = tuple<ll, ld, ld>;
|
||||
using tldi = tuple<ll, ld, int>;
|
||||
using tlil = tuple<ll, int, ll>;
|
||||
using tlid = tuple<ll, int, ld>;
|
||||
using tlii = tuple<ll, int, int>;
|
||||
using tdll = tuple<ld, ll, ll>;
|
||||
using tdld = tuple<ld, ll, ld>;
|
||||
using tdli = tuple<ld, ll, int>;
|
||||
using tddl = tuple<ld, ld, ll>;
|
||||
using tddd = tuple<ld, ld, ld>;
|
||||
using tddi = tuple<ld, ld, int>;
|
||||
using tdil = tuple<ld, int, ll>;
|
||||
using tdid = tuple<ld, int, ld>;
|
||||
using tdii = tuple<ld, int, int>;
|
||||
using till = tuple<int, ll, ll>;
|
||||
using tild = tuple<int, ll, ld>;
|
||||
using tili = tuple<int, ll, int>;
|
||||
using tidl = tuple<int, ld, ll>;
|
||||
using tidd = tuple<int, ld, ld>;
|
||||
using tidi = tuple<int, ld, int>;
|
||||
using tiil = tuple<int, int, ll>;
|
||||
using tiid = tuple<int, int, ld>;
|
||||
using tiii = tuple<int, int, int>;
|
||||
template <typename T> using max_heap = priority_queue<T>;
|
||||
template <typename T> using min_heap = priority_queue<T, vector<T>, greater<>>;
|
||||
template <typename T> using oi = ostream_iterator<T>;
|
||||
template <typename T> using ii = istream_iterator<T>;
|
||||
|
||||
/* constants */
|
||||
constexpr int INF = 0x3f3f3f3f;
|
||||
constexpr ll INFLL = 0x3f3f3f3f3f3f3f3fLL;
|
||||
constexpr ll MDL = 1e9 + 7;
|
||||
constexpr ll PRIME = 998'244'353;
|
||||
constexpr ll MDL1 = 8784491;
|
||||
constexpr ll MDL2 = PRIME;
|
||||
constexpr int128 INT128_MAX = numeric_limits<int128>::max();
|
||||
constexpr uint128 UINT128_MAX = numeric_limits<uint128>::max();
|
||||
constexpr int128 INT128_MIN = numeric_limits<int128>::min();
|
||||
constexpr uint128 UINT128_MIN = numeric_limits<uint128>::min();
|
||||
|
||||
/* random */
|
||||
|
||||
mt19937 rd(chrono::duration_cast<chrono::milliseconds>(chrono::system_clock::now().time_since_epoch()).count());
|
||||
|
||||
/* bit-wise operations */
|
||||
#define lowbit(x) ((x) & -(x))
|
||||
#define popcount(x) (__builtin_popcountll(ll(x)))
|
||||
#define parity(x) (__builtin_parityll(ll(x)))
|
||||
#define msp(x) (63LL - __builtin_clzll(ll(x)))
|
||||
#define lsp(x) (__builtin_ctzll(ll(x)))
|
||||
|
||||
/* arithmetic operations */
|
||||
#define mod(x, y) ((((x) % (y)) + (y)) % (y))
|
||||
|
||||
/* fast pairs */
|
||||
#define upair ull
|
||||
#define umake(x, y) (ull(x) << 32 | (ull(y) & ((1ULL << 32) - 1)))
|
||||
#define u1(p) ((p) >> 32)
|
||||
#define u2(p) ((p) & ((1ULL << 32) - 1))
|
||||
#define ult std::less<upair>
|
||||
#define ugt std::greater<upair>
|
||||
|
||||
#define ipair ull
|
||||
#define imake(x, y) (umake(x, y))
|
||||
#define i1(p) (int(u1(ll(p))))
|
||||
#define i2(p) (ll(u2(p) << 32) >> 32)
|
||||
struct ilt {
|
||||
bool operator()(const ipair& a, const ipair& b) const {
|
||||
if (i1(a) == i1(b)) return i2(a) < i2(b);
|
||||
else return i1(a) < i1(b);
|
||||
}
|
||||
};
|
||||
struct igt {
|
||||
bool operator()(const ipair& a, const ipair& b) const {
|
||||
if (i1(a) == i1(b)) return i2(a) > i2(b);
|
||||
else return i1(a) > i1(b);
|
||||
}
|
||||
};
|
||||
|
||||
/* conditions */
|
||||
#define loop while (1)
|
||||
#define if_or(var, val) if (!(var == val)) var = val; else
|
||||
#define continue_or(var, val) __AS_PROCEDURE(if (var == val) continue; var = val;)
|
||||
#define break_or(var, val) __AS_PROCEDURE(if (var == val) break; var = val;)
|
||||
|
||||
/* hash */
|
||||
struct safe_hash {
|
||||
// https://codeforces.com/blog/entry/62393
|
||||
static uint64_t splitmix64(uint64_t x) {
|
||||
// http://xorshift.di.unimi.it/splitmix64.c
|
||||
x += 0x9e3779b97f4a7c15;
|
||||
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
|
||||
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
|
||||
return x ^ (x >> 31);
|
||||
}
|
||||
|
||||
size_t operator()(uint64_t x) const {
|
||||
static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
|
||||
return splitmix64(x + FIXED_RANDOM);
|
||||
}
|
||||
};
|
||||
|
||||
struct pair_hash {
|
||||
template <typename T, typename U>
|
||||
size_t operator()(const pair<T, U>& a) const {
|
||||
auto hash1 = safe_hash()(a.first);
|
||||
auto hash2 = safe_hash()(a.second);
|
||||
if (hash1 != hash2) {
|
||||
return hash1 ^ hash2;
|
||||
}
|
||||
return hash1;
|
||||
}
|
||||
};
|
||||
|
||||
uniform_int_distribution<mt19937::result_type> dist(PRIME);
|
||||
const size_t __array_hash_b = 31, __array_hash_mdl1 = dist(rd), __array_hash_mdl2 = dist(rd);
|
||||
struct array_hash {
|
||||
template <typename Sequence>
|
||||
size_t operator()(const Sequence& arr) const {
|
||||
size_t pw1 = 1, pw2 = 1;
|
||||
size_t res1 = 0, res2 = 0;
|
||||
for (auto&& x : arr) {
|
||||
res1 = (res1 + x * pw1) % __array_hash_mdl1;
|
||||
res2 = (res2 + x * pw2) % __array_hash_mdl2;
|
||||
pw1 = (pw1 * __array_hash_b) % __array_hash_mdl1;
|
||||
pw2 = (pw2 * __array_hash_b) % __array_hash_mdl2;
|
||||
}
|
||||
return res1 + res2;
|
||||
}
|
||||
};
|
||||
|
||||
/* build data structures */
|
||||
#define unordered_counter(from, to) __AS_PROCEDURE(unordered_map<__as_typeof(from), size_t, safe_hash> to; for (auto&& x : from) ++to[x];)
|
||||
#define counter(from, to, cmp) __AS_PROCEDURE(map<__as_typeof(from), size_t, cmp> to; for (auto&& x : from) ++to[x];)
|
||||
#define pa(a) __AS_PROCEDURE(__typeof(a) pa; pa.push_back({}); for (auto&&x : a) pa.push_back(pa.back() + x);)
|
||||
#define sa(a) __AS_PROCEDURE(__typeof(a) sa(a.size() + 1); {int n = a.size(); for (int i = n - 1; i >= 0; --i) sa[i] = sa[i + 1] + a[i];};)
|
||||
#define adj(ch, n) __AS_PROCEDURE(vector<vector<int>> ch((n) + 1);)
|
||||
#define edge(ch, u, v) __AS_PROCEDURE(ch[u].push_back(v), ch[v].push_back(u);)
|
||||
#define edgew(ch, u, v, w) __AS_PROCEDURE(ch[u].emplace_back(v, w), ch[v].emplace_back(u, w);)
|
||||
#define Edge(ch, u, v) __AS_PROCEDURE(ch[u].push_back(v);)
|
||||
#define Edgew(ch, u, v, w) __AS_PROCEDURE(ch[u].emplace_back(v, w);)
|
||||
template <typename T, typename Iterator> pair<size_t, map<T, size_t>> discretize(Iterator __first, Iterator __last) {
|
||||
set<T> st(__first, __last);
|
||||
size_t N = 0;
|
||||
map<T, size_t> mp;
|
||||
for (auto&& x : st) mp[x] = ++N;
|
||||
return {N, mp};
|
||||
}
|
||||
template <typename T, typename Iterator> pair<size_t, unordered_map<T, size_t, safe_hash>> unordered_discretize(Iterator __first, Iterator __last) {
|
||||
set<T> st(__first, __last);
|
||||
size_t N = 0;
|
||||
unordered_map<T, size_t, safe_hash> mp;
|
||||
for (auto&& x : st) mp[x] = ++N;
|
||||
return {N, mp};
|
||||
}
|
||||
|
||||
/* io */
|
||||
#define untie __AS_PROCEDURE(ios_base::sync_with_stdio(0), cin.tie(NULL))
|
||||
template<typename T> void __read(T& x) { cin >> x; }
|
||||
template<typename T, typename... U> void __read(T& x, U&... args) { cin >> x; __read(args...); }
|
||||
#define read(type, ...) __AS_PROCEDURE(type __VA_ARGS__; __read(__VA_ARGS__);)
|
||||
#define readvec(type, a, n) __AS_PROCEDURE(vector<type> a(n); for (auto& x : a) cin >> x;)
|
||||
#define readvec1(type, a, n) __AS_PROCEDURE(vector<type> a((n) + 1); copy_n(ii<type>(cin), (n), a.begin() + 1);)
|
||||
#define putvec(a) __AS_PROCEDURE(copy(a.begin(), a.end(), oi<__as_typeof(a)::value_type>(cout, " ")); cout << endl;)
|
||||
#define putvec1(a) __AS_PROCEDURE(copy(a.begin() + 1, a.end(), oi<__as_typeof(a)::value_type>(cout, " ")); cout << endl;)
|
||||
#define putvec_eol(a) __AS_PROCEDURE(copy(a.begin(), a.end(), oi<__as_typeof(a)::value_type>(cout, "\n"));)
|
||||
#define putvec1_eol(a) __AS_PROCEDURE(copy(a.begin() + 1, a.end(), oi<__as_typeof(a)::value_type>(cout, "\n"));)
|
||||
#define debug(x) __AS_PROCEDURE(cerr << #x" = " << (x) << endl;)
|
||||
#define debugvec(a) __AS_PROCEDURE(cerr << #a" = "; for (auto&& x : a) cerr << x << ' '; cerr << endl;)
|
||||
template<typename T, typename U> istream& operator>>(istream& in, pair<T, U>& p) {
|
||||
return in >> p.first >> p.second;
|
||||
}
|
||||
template<typename T, typename U> ostream& operator<<(ostream& out, const pair<T, U>& p) {
|
||||
out << "{" << p.first << ", " << p.second << "}";
|
||||
return out;
|
||||
}
|
||||
template<typename Char, typename Traits, typename Tuple, std::size_t... Index>
|
||||
void print_tuple_impl(std::basic_ostream<Char, Traits>& os, const Tuple& t, std::index_sequence<Index...>) {
|
||||
using swallow = int[]; // guaranties left to right order
|
||||
(void)swallow { 0, (void(os << (Index == 0 ? "" : ", ") << std::get<Index>(t)), 0)... };
|
||||
}
|
||||
template<typename Char, typename Traits, typename... Args>
|
||||
decltype(auto) operator<<(std::basic_ostream<Char, Traits>& os, const std::tuple<Args...>& t) {
|
||||
os << "{";
|
||||
print_tuple_impl(os, t, std::index_sequence_for<Args...>{});
|
||||
return os << "}";
|
||||
}
|
||||
template<typename T> ostream& operator<<(ostream& out, const vector<T>& vec) {
|
||||
for (auto&& i : vec) out << i << ' ';
|
||||
return out;
|
||||
}
|
||||
std::ostream& operator<<(std::ostream& dest, const int128& value) {
|
||||
// https://stackoverflow.com/a/25115163/23881100
|
||||
std::ostream::sentry s( dest );
|
||||
if ( s ) {
|
||||
uint128 tmp = value < 0 ? -value : value;
|
||||
char buffer[ 128 ];
|
||||
char* d = std::end( buffer );
|
||||
do {
|
||||
-- d;
|
||||
*d = "0123456789"[ tmp % 10 ];
|
||||
tmp /= 10;
|
||||
} while ( tmp != 0 );
|
||||
if ( value < 0 ) {
|
||||
-- d;
|
||||
*d = '-';
|
||||
}
|
||||
int len = std::end( buffer ) - d;
|
||||
if ( dest.rdbuf()->sputn( d, len ) != len ) {
|
||||
dest.setstate( std::ios_base::badbit );
|
||||
}
|
||||
}
|
||||
return dest;
|
||||
}
|
||||
|
||||
/* pops */
|
||||
#define poptop(q, ...) __AS_PROCEDURE(auto [__VA_ARGS__] = q.top(); q.pop();)
|
||||
#define popback(q, ...) __AS_PROCEDURE(auto [__VA_ARGS__] = q.back(); q.pop_back();)
|
||||
#define popfront(q, ...) __AS_PROCEDURE(auto [__VA_ARGS__] = q.front();q.pop_front();)
|
||||
|
||||
/* math */
|
||||
constexpr inline int lg2(ll x) { return x == 0 ? -1 : sizeof(ll) * 8 - 1 - __builtin_clzll(x); }
|
||||
|
||||
void __exgcd(ll a, ll b, ll& x, ll& y) {
|
||||
if (b == 0) {
|
||||
x = 1, y = 0;
|
||||
return;
|
||||
}
|
||||
__exgcd(b, a % b, y, x);
|
||||
y -= a / b * x;
|
||||
}
|
||||
|
||||
ll inverse(ll a, ll b) {
|
||||
ll x, y;
|
||||
__exgcd(a, b, x, y);
|
||||
return mod(x, b);
|
||||
}
|
||||
|
||||
vector<tuple<int, int, ll>> decompose(ll x) {
|
||||
// return (factor, count, factor ** count)
|
||||
vector<tuple<int, int, ll>> res;
|
||||
for (int i = 2; i * i <= x; i++) {
|
||||
if (x % i == 0) {
|
||||
int cnt = 0;
|
||||
ll pw = 1;
|
||||
while (x % i == 0) ++cnt, x /= i, pw *= i;
|
||||
res.emplace_back(i, cnt, pw);
|
||||
}
|
||||
}
|
||||
if (x != 1) {
|
||||
res.emplace_back(x, 1, x);
|
||||
}
|
||||
return res;
|
||||
}
|
||||
|
||||
vector<pii> decompose_prime(int N) {
|
||||
// return (factor, count)
|
||||
vector<pii> result;
|
||||
for (int i = 2; i * i <= N; i++) {
|
||||
if (N % i == 0) {
|
||||
int cnt = 0;
|
||||
while (N % i == 0) N /= i, ++cnt;
|
||||
result.emplace_back(i, cnt);
|
||||
}
|
||||
}
|
||||
if (N != 1) {
|
||||
result.emplace_back(N, 1);
|
||||
}
|
||||
return result;
|
||||
}
|
||||
|
||||
/* string algorithms */
|
||||
vector<int> calc_next(string t) { // pi function of t
|
||||
int n = (int)t.length();
|
||||
vector<int> pi(n);
|
||||
for (int i = 1; i < n; i++) {
|
||||
int j = pi[i - 1];
|
||||
while (j > 0 && t[i] != t[j]) j = pi[j - 1];
|
||||
if (t[i] == t[j]) j++;
|
||||
pi[i] = j;
|
||||
}
|
||||
return pi;
|
||||
}
|
||||
vector<int> calc_z(string t) { // z function of t
|
||||
int m = t.length();
|
||||
vector<int> z;
|
||||
z.push_back(m);
|
||||
pair<int, int> prev = {1, -1};
|
||||
for (int i = 1; i < m; ++i) {
|
||||
if (z[i - prev.first] + i <= prev.second) {
|
||||
z.push_back(z[i - prev.first]);
|
||||
} else {
|
||||
int j = max(i, prev.second + 1);
|
||||
while (j < m && t[j] == t[j - i]) ++j;
|
||||
z.push_back(j - i);
|
||||
prev = {i, j - 1};
|
||||
}
|
||||
}
|
||||
return z;
|
||||
}
|
||||
vector<int> kmp(string s, string t) { // find all t in s
|
||||
string cur = t + '#' + s;
|
||||
int sz1 = s.size(), sz2 = t.size();
|
||||
vector<int> v;
|
||||
vector<int> lps = calc_next(cur);
|
||||
for (int i = sz2 + 1; i <= sz1 + sz2; i++) {
|
||||
if (lps[i] == sz2) v.push_back(i - 2 * sz2);
|
||||
}
|
||||
return v;
|
||||
}
|
||||
int period(string s) { // find the length of shortest recurring period
|
||||
int n = s.length();
|
||||
auto z = calc_z(s);
|
||||
for (int i = 1; i <= n / 2; ++i) {
|
||||
if (n % i == 0 && z[i] == n - i) {
|
||||
return i;
|
||||
}
|
||||
}
|
||||
return n;
|
||||
}
|
||||
|
||||
/* modular arithmetic */
|
||||
template <ll mdl> struct MLL {
|
||||
ll val;
|
||||
MLL(ll v = 0) : val(mod(v, mdl)) {}
|
||||
MLL(const MLL<mdl>& other) : val(other.val) {}
|
||||
friend MLL operator+(const MLL& lhs, const MLL& rhs) { return mod(lhs.val + rhs.val, mdl); }
|
||||
friend MLL operator-(const MLL& lhs, const MLL& rhs) { return mod(lhs.val - rhs.val, mdl); }
|
||||
friend MLL operator*(const MLL& lhs, const MLL& rhs) { return mod(lhs.val * rhs.val, mdl); }
|
||||
friend MLL operator/(const MLL& lhs, const MLL& rhs) { return mod(lhs.val * mod(inverse(rhs.val, mdl), mdl), mdl); }
|
||||
friend MLL operator%(const MLL& lhs, const MLL& rhs) { return mod(lhs.val - (lhs / rhs).val, mdl); }
|
||||
friend bool operator==(const MLL& lhs, const MLL& rhs) { return lhs.val == rhs.val; }
|
||||
friend bool operator!=(const MLL& lhs, const MLL& rhs) { return lhs.val != rhs.val; }
|
||||
void operator+=(const MLL& rhs) { val = (*this + rhs).val; }
|
||||
void operator-=(const MLL& rhs) { val = (*this - rhs).val; }
|
||||
void operator*=(const MLL& rhs) { val = (*this * rhs).val; }
|
||||
void operator/=(const MLL& rhs) { val = (*this / rhs).val; }
|
||||
void operator%=(const MLL& rhs) { val = (*this % rhs).val; }
|
||||
};
|
||||
struct MLLd {
|
||||
ll val, mdl;
|
||||
MLLd(ll mdl, ll v = 0) : mdl(mdl), val(mod(v, mdl)) {}
|
||||
MLLd(const MLLd& other) : val(other.val) {}
|
||||
friend MLLd operator+(const MLLd& lhs, const MLLd& rhs) { return mod(lhs.val + rhs.val, lhs.mdl); }
|
||||
friend MLLd operator-(const MLLd& lhs, const MLLd& rhs) { return mod(lhs.val - rhs.val, lhs.mdl); }
|
||||
friend MLLd operator*(const MLLd& lhs, const MLLd& rhs) { return mod(lhs.val * rhs.val, lhs.mdl); }
|
||||
friend MLLd operator/(const MLLd& lhs, const MLLd& rhs) { return mod(lhs.val * mod(inverse(rhs.val, lhs.mdl), lhs.mdl), lhs.mdl); }
|
||||
friend MLLd operator%(const MLLd& lhs, const MLLd& rhs) { return mod(lhs.val - (lhs / rhs).val, lhs.mdl); }
|
||||
friend bool operator==(const MLLd& lhs, const MLLd& rhs) { return lhs.val == rhs.val; }
|
||||
friend bool operator!=(const MLLd& lhs, const MLLd& rhs) { return lhs.val != rhs.val; }
|
||||
void operator+=(const MLLd& rhs) { val = (*this + rhs).val; }
|
||||
void operator-=(const MLLd& rhs) { val = (*this - rhs).val; }
|
||||
void operator*=(const MLLd& rhs) { val = (*this * rhs).val; }
|
||||
void operator/=(const MLLd& rhs) { val = (*this / rhs).val; }
|
||||
void operator%=(const MLLd& rhs) { val = (*this % rhs).val; }
|
||||
};
|
||||
|
||||
template <ll mdl>
|
||||
ostream& operator<<(ostream& out, const MLL<mdl>& num) {
|
||||
return out << num.val;
|
||||
}
|
||||
|
||||
ostream& operator<<(ostream& out, const MLLd& num) {
|
||||
return out << num.val;
|
||||
}
|
||||
|
||||
template <ll mdl>
|
||||
istream& operator>>(istream& in, MLL<mdl>& num) {
|
||||
return in >> num.val;
|
||||
}
|
||||
|
||||
istream& operator>>(istream& in, MLLd& num) {
|
||||
return in >> num.val;
|
||||
}
|
||||
|
||||
// miscancellous
|
||||
template <typename Func, typename RandomIt> void sort_by_key(RandomIt first, RandomIt last, Func extractor) {
|
||||
std::sort(first, last, [&] (auto&& a, auto&& b) { return std::less<>()(extractor(a), extractor(b)); });
|
||||
}
|
||||
template <typename Func, typename RandomIt, typename Compare> void sort_by_key(RandomIt first, RandomIt last, Func extractor, Compare comp) {
|
||||
std::sort(first, last, [&] (auto&& a, auto&& b) { return comp(extractor(a), extractor(b)); });
|
||||
}
|
||||
template <typename T, typename U, typename Iterator_T, typename Iterator_U>
|
||||
vector<pair<T, U>> zip(Iterator_T a_first, Iterator_T a_last, Iterator_U b_first, Iterator_U b_last) {
|
||||
vector<pair<T, U>> res;
|
||||
auto a_it = a_first;
|
||||
auto b_it = b_first;
|
||||
for (; not (a_it == a_last) and not (b_it == b_last); ++a_it, ++b_it) {
|
||||
res.emplace_back(*a_it, *b_it);
|
||||
}
|
||||
return res;
|
||||
}
|
||||
template <typename T, typename U, typename Iterator_T, typename Iterator_U>
|
||||
vector<pair<T, U>> zip_n(Iterator_T a_first, Iterator_U b_first, size_t n) {
|
||||
vector<pair<T, U>> res;
|
||||
if (n > 0) {
|
||||
res.emplace_back(*a_first, *b_first);
|
||||
for (size_t i = 1; i != n; ++i) {
|
||||
res.emplace_back(*++a_first, *++b_first);
|
||||
}
|
||||
}
|
||||
return res;
|
||||
}
|
||||
template <typename T>
|
||||
class ArithmeticIterator : bidirectional_iterator_tag {
|
||||
public:
|
||||
using difference_type = ptrdiff_t;
|
||||
using value_type = T;
|
||||
private:
|
||||
value_type value;
|
||||
public:
|
||||
ArithmeticIterator(const T& value) : value(value) {}
|
||||
value_type operator*() const { return value; }
|
||||
ArithmeticIterator<T>& operator++() { ++value; return *this; }
|
||||
ArithmeticIterator<T>& operator--() { --value; return *this; }
|
||||
bool operator==(const ArithmeticIterator<T>& rhs) const { return value == rhs.value; }
|
||||
};
|
||||
template <typename T> vector<pair<int, T>> enumerate(const vector<T>& container) {
|
||||
return zip<int, T>(ArithmeticIterator<int>(0), ArithmeticIterator<int>(INT_MAX), container.begin(), container.end());
|
||||
}
|
||||
/////////////////////////////////////////////////////////
|
||||
|
||||
#define SINGLE_TEST_CASE
|
||||
// #define DUMP_TEST_CASE 7219
|
||||
// #define TOT_TEST_CASE 10000
|
||||
|
||||
void dump() {}
|
||||
|
||||
void dump_ignore() {}
|
||||
|
||||
void prep() {
|
||||
}
|
||||
|
||||
struct dinic {
|
||||
struct edge {
|
||||
int to;
|
||||
ll cap;
|
||||
ll flow;
|
||||
int rev;
|
||||
int mark;
|
||||
};
|
||||
vector<vector<edge>> edges;
|
||||
vector<int> layer;
|
||||
vector<bool> vis;
|
||||
dinic(int n) : edges(n + 1), layer(n + 1), vis(n + 1) {}
|
||||
void add_edge(int from, int to, ll cap, int mark = 0, int mark_rev = 0) {
|
||||
edges[from].push_back({ to, cap, 0, int(edges[to].size()), mark });
|
||||
edges[to].push_back({ from, 0, 0, int(edges[from].size() - 1), mark_rev });
|
||||
}
|
||||
bool bfs(int s, int t) {
|
||||
layer.assign(edges.size(), 0);
|
||||
deque<pii> dq;
|
||||
layer[s] = 1;
|
||||
dq.emplace_back(s, 1);
|
||||
while (dq.size()) {
|
||||
popfront(dq, v, l);
|
||||
for (auto&& e : edges[v]) {
|
||||
if (layer[e.to] == 0 and e.cap > e.flow) {
|
||||
layer[e.to] = l + 1;
|
||||
dq.emplace_back(e.to, l + 1);
|
||||
}
|
||||
}
|
||||
}
|
||||
return layer[t] != 0;
|
||||
}
|
||||
ll dfs(int s, int t, ll cap) {
|
||||
if (vis[s]) {
|
||||
return 0;
|
||||
}
|
||||
vis[s] = 1;
|
||||
if (s == t) {
|
||||
return cap;
|
||||
}
|
||||
ll res = 0;
|
||||
int n = edges[s].size();
|
||||
for (int i = 0; i < n; ++i) {
|
||||
auto e = edges[s][i];
|
||||
if (e.cap > e.flow and layer[e.to] == layer[s] + 1) {
|
||||
ll nw = dfs(e.to, t, min(cap - res, e.cap - e.flow));
|
||||
edges[s][i].flow += nw;
|
||||
edges[e.to][e.rev].flow -= nw;
|
||||
res += nw;
|
||||
if (res == cap) {
|
||||
return res;
|
||||
}
|
||||
}
|
||||
}
|
||||
return res;
|
||||
}
|
||||
ll run(int s, int t) {
|
||||
ll res = 0;
|
||||
while (bfs(s, t)) {
|
||||
vis.assign(edges.size(), 0);
|
||||
res += dfs(s, t, LLONG_MAX);
|
||||
}
|
||||
return res;
|
||||
}
|
||||
};
|
||||
|
||||
struct bounded_flow {
|
||||
int n, m, S, T;
|
||||
dinic net;
|
||||
ll sum;
|
||||
vector<ll> fl;
|
||||
vector<ll> init;
|
||||
bounded_flow(int n, int m) : sum(0), n(n), m(m), S(0), T(n + 1), net(n + 1), fl(m), init(n + 1) {}
|
||||
void add_edge(int from, int to, ll low, ll high, int edge_id = -1) {
|
||||
if (edge_id != -1) {
|
||||
fl[edge_id] += low;
|
||||
}
|
||||
net.add_edge(from, to, high - low, edge_id, -1);
|
||||
init[to] += low, init[from] -= low;
|
||||
}
|
||||
void prep(int s, int t) {
|
||||
for (int i = 1; i <= n; ++i) {
|
||||
if (init[i] > 0) {
|
||||
net.add_edge(S, i, init[i], -1, -1);
|
||||
sum += init[i];
|
||||
} else if (init[i] < 0) {
|
||||
net.add_edge(i, T, -init[i], -1, -1);
|
||||
}
|
||||
}
|
||||
net.add_edge(t, s, INFLL, -1, -1);
|
||||
}
|
||||
optional<pair<ll, vector<ll>>> run_max_flow(int s, int t) {
|
||||
prep(s, t);
|
||||
if (sum != net.run(S, T)) {
|
||||
return nullopt;
|
||||
} else {
|
||||
auto res_flow = net.run(s, t);
|
||||
for (int from = 1; from <= n; ++from) {
|
||||
for (auto&& [to, cap, flow, rev, mark] : net.edges[from]) {
|
||||
if (mark != -1) {
|
||||
fl[mark] += flow;
|
||||
}
|
||||
}
|
||||
}
|
||||
return {{res_flow, fl}};
|
||||
}
|
||||
}
|
||||
optional<pair<ll, vector<ll>>> run_flow(int s, int t) {
|
||||
prep(s, t);
|
||||
auto res_flow = net.run(S, T);
|
||||
if (sum != res_flow) {
|
||||
return nullopt;
|
||||
} else {
|
||||
for (int from = 1; from <= n; ++from) {
|
||||
for (auto&& [to, cap, flow, rev, mark] : net.edges[from]) {
|
||||
if (mark != -1) {
|
||||
fl[mark] += flow;
|
||||
}
|
||||
}
|
||||
}
|
||||
return {{res_flow, fl}};
|
||||
}
|
||||
}
|
||||
};
|
||||
|
||||
void solve() {
|
||||
read(int, n, m, s, t);
|
||||
bounded_flow net(n, m);
|
||||
for (int i = 0 ;i < m; ++i) {
|
||||
read(int, u, v, lower, upper);
|
||||
net.add_edge(u, v, lower, upper, i);
|
||||
}
|
||||
auto res = net.run_max_flow(s, t);
|
||||
if (res == nullopt) {
|
||||
cout << "please go home to sleep\n";
|
||||
} else {
|
||||
auto [flow, fl] = res.value();
|
||||
cout << flow << '\n';
|
||||
}
|
||||
}
|
||||
|
||||
int main() {
|
||||
#if __cplusplus < 201703L || defined(_MSC_VER) && !defined(__clang__)
|
||||
assert(false && "incompatible compiler variant detected.");
|
||||
#endif
|
||||
untie, cout.tie(NULL);
|
||||
prep();
|
||||
#ifdef SINGLE_TEST_CASE
|
||||
solve();
|
||||
#else
|
||||
read(int, t);
|
||||
for (int i = 0; i < t; ++i) {
|
||||
#ifdef DUMP_TEST_CASE
|
||||
if (t != (TOT_TEST_CASE)) {
|
||||
solve();
|
||||
} else if (i + 1 == (DUMP_TEST_CASE)) {
|
||||
dump();
|
||||
} else {
|
||||
dump_ignore();
|
||||
}
|
||||
#else
|
||||
solve();
|
||||
#endif
|
||||
}
|
||||
#endif
|
||||
}
|
||||
|
|
@ -0,0 +1,690 @@
|
|||
#pragma GCC optimize("Ofast")
|
||||
/////////////////////////////////////////////////////////
|
||||
/**
|
||||
* Useful Macros
|
||||
* by subcrip
|
||||
* (requires C++17)
|
||||
*/
|
||||
|
||||
#include<bits/stdc++.h>
|
||||
using namespace std;
|
||||
|
||||
/* macro helpers */
|
||||
#define __NARGS(...) std::tuple_size<decltype(std::make_tuple(__VA_ARGS__))>::value
|
||||
#define __DECOMPOSE_S(a, x) auto x = a;
|
||||
#define __DECOMPOSE_N(a, ...) auto [__VA_ARGS__] = a;
|
||||
constexpr void __() {}
|
||||
#define __AS_PROCEDURE(...) __(); __VA_ARGS__; __()
|
||||
#define __as_typeof(container) remove_reference<decltype(container)>::type
|
||||
|
||||
/* type aliases */
|
||||
#if LONG_LONG_MAX != INT64_MAX
|
||||
using ll = int64_t;
|
||||
using ull = uint64_t;
|
||||
#else
|
||||
using ll = long long;
|
||||
using ull = unsigned long long;
|
||||
using ld = long double;
|
||||
#endif
|
||||
using int128 = __int128_t;
|
||||
using uint128 = __uint128_t;
|
||||
using ld = long double;
|
||||
using pii = pair<int, int>;
|
||||
using pil = pair<int, ll>;
|
||||
using pli = pair<ll, int>;
|
||||
using pll = pair<ll, ll>;
|
||||
using pid = pair<int, ld>;
|
||||
using pdi = pair<ld, int>;
|
||||
using pld = pair<ll, ld>;
|
||||
using pdl = pair<ld, ll>;
|
||||
using pdd = pair<ld, ld>;
|
||||
using tlll = tuple<ll, ll, ll>;
|
||||
using tlld = tuple<ll, ll, ld>;
|
||||
using tlli = tuple<ll, ll, int>;
|
||||
using tldl = tuple<ll, ld, ll>;
|
||||
using tldd = tuple<ll, ld, ld>;
|
||||
using tldi = tuple<ll, ld, int>;
|
||||
using tlil = tuple<ll, int, ll>;
|
||||
using tlid = tuple<ll, int, ld>;
|
||||
using tlii = tuple<ll, int, int>;
|
||||
using tdll = tuple<ld, ll, ll>;
|
||||
using tdld = tuple<ld, ll, ld>;
|
||||
using tdli = tuple<ld, ll, int>;
|
||||
using tddl = tuple<ld, ld, ll>;
|
||||
using tddd = tuple<ld, ld, ld>;
|
||||
using tddi = tuple<ld, ld, int>;
|
||||
using tdil = tuple<ld, int, ll>;
|
||||
using tdid = tuple<ld, int, ld>;
|
||||
using tdii = tuple<ld, int, int>;
|
||||
using till = tuple<int, ll, ll>;
|
||||
using tild = tuple<int, ll, ld>;
|
||||
using tili = tuple<int, ll, int>;
|
||||
using tidl = tuple<int, ld, ll>;
|
||||
using tidd = tuple<int, ld, ld>;
|
||||
using tidi = tuple<int, ld, int>;
|
||||
using tiil = tuple<int, int, ll>;
|
||||
using tiid = tuple<int, int, ld>;
|
||||
using tiii = tuple<int, int, int>;
|
||||
template <typename T> using max_heap = priority_queue<T>;
|
||||
template <typename T> using min_heap = priority_queue<T, vector<T>, greater<>>;
|
||||
template <typename T> using oi = ostream_iterator<T>;
|
||||
template <typename T> using ii = istream_iterator<T>;
|
||||
|
||||
/* constants */
|
||||
constexpr int INF = 0x3f3f3f3f;
|
||||
constexpr ll INFLL = 0x3f3f3f3f3f3f3f3fLL;
|
||||
constexpr ll MDL = 1e9 + 7;
|
||||
constexpr ll PRIME = 998'244'353;
|
||||
constexpr ll MDL1 = 8784491;
|
||||
constexpr ll MDL2 = PRIME;
|
||||
constexpr int128 INT128_MAX = numeric_limits<int128>::max();
|
||||
constexpr uint128 UINT128_MAX = numeric_limits<uint128>::max();
|
||||
constexpr int128 INT128_MIN = numeric_limits<int128>::min();
|
||||
constexpr uint128 UINT128_MIN = numeric_limits<uint128>::min();
|
||||
|
||||
/* random */
|
||||
|
||||
mt19937 rd(chrono::duration_cast<chrono::milliseconds>(chrono::system_clock::now().time_since_epoch()).count());
|
||||
|
||||
/* bit-wise operations */
|
||||
#define lowbit(x) ((x) & -(x))
|
||||
#define popcount(x) (__builtin_popcountll(ll(x)))
|
||||
#define parity(x) (__builtin_parityll(ll(x)))
|
||||
#define msp(x) (63LL - __builtin_clzll(ll(x)))
|
||||
#define lsp(x) (__builtin_ctzll(ll(x)))
|
||||
|
||||
/* arithmetic operations */
|
||||
#define mod(x, y) ((((x) % (y)) + (y)) % (y))
|
||||
|
||||
/* fast pairs */
|
||||
#define upair ull
|
||||
#define umake(x, y) (ull(x) << 32 | (ull(y) & ((1ULL << 32) - 1)))
|
||||
#define u1(p) ((p) >> 32)
|
||||
#define u2(p) ((p) & ((1ULL << 32) - 1))
|
||||
#define ult std::less<upair>
|
||||
#define ugt std::greater<upair>
|
||||
|
||||
#define ipair ull
|
||||
#define imake(x, y) (umake(x, y))
|
||||
#define i1(p) (int(u1(ll(p))))
|
||||
#define i2(p) (ll(u2(p) << 32) >> 32)
|
||||
struct ilt {
|
||||
bool operator()(const ipair& a, const ipair& b) const {
|
||||
if (i1(a) == i1(b)) return i2(a) < i2(b);
|
||||
else return i1(a) < i1(b);
|
||||
}
|
||||
};
|
||||
struct igt {
|
||||
bool operator()(const ipair& a, const ipair& b) const {
|
||||
if (i1(a) == i1(b)) return i2(a) > i2(b);
|
||||
else return i1(a) > i1(b);
|
||||
}
|
||||
};
|
||||
|
||||
/* conditions */
|
||||
#define loop while (1)
|
||||
#define if_or(var, val) if (!(var == val)) var = val; else
|
||||
#define continue_or(var, val) __AS_PROCEDURE(if (var == val) continue; var = val;)
|
||||
#define break_or(var, val) __AS_PROCEDURE(if (var == val) break; var = val;)
|
||||
|
||||
/* hash */
|
||||
struct safe_hash {
|
||||
// https://codeforces.com/blog/entry/62393
|
||||
static uint64_t splitmix64(uint64_t x) {
|
||||
// http://xorshift.di.unimi.it/splitmix64.c
|
||||
x += 0x9e3779b97f4a7c15;
|
||||
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
|
||||
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
|
||||
return x ^ (x >> 31);
|
||||
}
|
||||
|
||||
size_t operator()(uint64_t x) const {
|
||||
static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
|
||||
return splitmix64(x + FIXED_RANDOM);
|
||||
}
|
||||
};
|
||||
|
||||
struct pair_hash {
|
||||
template <typename T, typename U>
|
||||
size_t operator()(const pair<T, U>& a) const {
|
||||
auto hash1 = safe_hash()(a.first);
|
||||
auto hash2 = safe_hash()(a.second);
|
||||
if (hash1 != hash2) {
|
||||
return hash1 ^ hash2;
|
||||
}
|
||||
return hash1;
|
||||
}
|
||||
};
|
||||
|
||||
uniform_int_distribution<mt19937::result_type> dist(PRIME);
|
||||
const size_t __array_hash_b = 31, __array_hash_mdl1 = dist(rd), __array_hash_mdl2 = dist(rd);
|
||||
struct array_hash {
|
||||
template <typename Sequence>
|
||||
size_t operator()(const Sequence& arr) const {
|
||||
size_t pw1 = 1, pw2 = 1;
|
||||
size_t res1 = 0, res2 = 0;
|
||||
for (auto&& x : arr) {
|
||||
res1 = (res1 + x * pw1) % __array_hash_mdl1;
|
||||
res2 = (res2 + x * pw2) % __array_hash_mdl2;
|
||||
pw1 = (pw1 * __array_hash_b) % __array_hash_mdl1;
|
||||
pw2 = (pw2 * __array_hash_b) % __array_hash_mdl2;
|
||||
}
|
||||
return res1 + res2;
|
||||
}
|
||||
};
|
||||
|
||||
/* build data structures */
|
||||
#define unordered_counter(from, to) __AS_PROCEDURE(unordered_map<__as_typeof(from), size_t, safe_hash> to; for (auto&& x : from) ++to[x];)
|
||||
#define counter(from, to, cmp) __AS_PROCEDURE(map<__as_typeof(from), size_t, cmp> to; for (auto&& x : from) ++to[x];)
|
||||
#define pa(a) __AS_PROCEDURE(__typeof(a) pa; pa.push_back({}); for (auto&&x : a) pa.push_back(pa.back() + x);)
|
||||
#define sa(a) __AS_PROCEDURE(__typeof(a) sa(a.size() + 1); {int n = a.size(); for (int i = n - 1; i >= 0; --i) sa[i] = sa[i + 1] + a[i];};)
|
||||
#define adj(ch, n) __AS_PROCEDURE(vector<vector<int>> ch((n) + 1);)
|
||||
#define edge(ch, u, v) __AS_PROCEDURE(ch[u].push_back(v), ch[v].push_back(u);)
|
||||
#define edgew(ch, u, v, w) __AS_PROCEDURE(ch[u].emplace_back(v, w), ch[v].emplace_back(u, w);)
|
||||
#define Edge(ch, u, v) __AS_PROCEDURE(ch[u].push_back(v);)
|
||||
#define Edgew(ch, u, v, w) __AS_PROCEDURE(ch[u].emplace_back(v, w);)
|
||||
template <typename T, typename Iterator> pair<size_t, map<T, size_t>> discretize(Iterator __first, Iterator __last) {
|
||||
set<T> st(__first, __last);
|
||||
size_t N = 0;
|
||||
map<T, size_t> mp;
|
||||
for (auto&& x : st) mp[x] = ++N;
|
||||
return {N, mp};
|
||||
}
|
||||
template <typename T, typename Iterator> pair<size_t, unordered_map<T, size_t, safe_hash>> unordered_discretize(Iterator __first, Iterator __last) {
|
||||
set<T> st(__first, __last);
|
||||
size_t N = 0;
|
||||
unordered_map<T, size_t, safe_hash> mp;
|
||||
for (auto&& x : st) mp[x] = ++N;
|
||||
return {N, mp};
|
||||
}
|
||||
|
||||
/* io */
|
||||
#define untie __AS_PROCEDURE(ios_base::sync_with_stdio(0), cin.tie(NULL))
|
||||
template<typename T> void __read(T& x) { cin >> x; }
|
||||
template<typename T, typename... U> void __read(T& x, U&... args) { cin >> x; __read(args...); }
|
||||
#define read(type, ...) __AS_PROCEDURE(type __VA_ARGS__; __read(__VA_ARGS__);)
|
||||
#define readvec(type, a, n) __AS_PROCEDURE(vector<type> a(n); for (auto& x : a) cin >> x;)
|
||||
#define readvec1(type, a, n) __AS_PROCEDURE(vector<type> a((n) + 1); copy_n(ii<type>(cin), (n), a.begin() + 1);)
|
||||
#define putvec(a) __AS_PROCEDURE(copy(a.begin(), a.end(), oi<__as_typeof(a)::value_type>(cout, " ")); cout << endl;)
|
||||
#define putvec1(a) __AS_PROCEDURE(copy(a.begin() + 1, a.end(), oi<__as_typeof(a)::value_type>(cout, " ")); cout << endl;)
|
||||
#define putvec_eol(a) __AS_PROCEDURE(copy(a.begin(), a.end(), oi<__as_typeof(a)::value_type>(cout, "\n"));)
|
||||
#define putvec1_eol(a) __AS_PROCEDURE(copy(a.begin() + 1, a.end(), oi<__as_typeof(a)::value_type>(cout, "\n"));)
|
||||
#define debug(x) __AS_PROCEDURE(cerr << #x" = " << (x) << endl;)
|
||||
#define debugvec(a) __AS_PROCEDURE(cerr << #a" = "; for (auto&& x : a) cerr << x << ' '; cerr << endl;)
|
||||
template<typename T, typename U> istream& operator>>(istream& in, pair<T, U>& p) {
|
||||
return in >> p.first >> p.second;
|
||||
}
|
||||
template<typename T, typename U> ostream& operator<<(ostream& out, const pair<T, U>& p) {
|
||||
out << "{" << p.first << ", " << p.second << "}";
|
||||
return out;
|
||||
}
|
||||
template<typename Char, typename Traits, typename Tuple, std::size_t... Index>
|
||||
void print_tuple_impl(std::basic_ostream<Char, Traits>& os, const Tuple& t, std::index_sequence<Index...>) {
|
||||
using swallow = int[]; // guaranties left to right order
|
||||
(void)swallow { 0, (void(os << (Index == 0 ? "" : ", ") << std::get<Index>(t)), 0)... };
|
||||
}
|
||||
template<typename Char, typename Traits, typename... Args>
|
||||
decltype(auto) operator<<(std::basic_ostream<Char, Traits>& os, const std::tuple<Args...>& t) {
|
||||
os << "{";
|
||||
print_tuple_impl(os, t, std::index_sequence_for<Args...>{});
|
||||
return os << "}";
|
||||
}
|
||||
template<typename T> ostream& operator<<(ostream& out, const vector<T>& vec) {
|
||||
for (auto&& i : vec) out << i << ' ';
|
||||
return out;
|
||||
}
|
||||
std::ostream& operator<<(std::ostream& dest, const int128& value) {
|
||||
// https://stackoverflow.com/a/25115163/23881100
|
||||
std::ostream::sentry s( dest );
|
||||
if ( s ) {
|
||||
uint128 tmp = value < 0 ? -value : value;
|
||||
char buffer[ 128 ];
|
||||
char* d = std::end( buffer );
|
||||
do {
|
||||
-- d;
|
||||
*d = "0123456789"[ tmp % 10 ];
|
||||
tmp /= 10;
|
||||
} while ( tmp != 0 );
|
||||
if ( value < 0 ) {
|
||||
-- d;
|
||||
*d = '-';
|
||||
}
|
||||
int len = std::end( buffer ) - d;
|
||||
if ( dest.rdbuf()->sputn( d, len ) != len ) {
|
||||
dest.setstate( std::ios_base::badbit );
|
||||
}
|
||||
}
|
||||
return dest;
|
||||
}
|
||||
|
||||
/* pops */
|
||||
#define poptop(q, ...) __AS_PROCEDURE(auto [__VA_ARGS__] = q.top(); q.pop();)
|
||||
#define popback(q, ...) __AS_PROCEDURE(auto [__VA_ARGS__] = q.back(); q.pop_back();)
|
||||
#define popfront(q, ...) __AS_PROCEDURE(auto [__VA_ARGS__] = q.front();q.pop_front();)
|
||||
|
||||
/* math */
|
||||
constexpr inline int lg2(ll x) { return x == 0 ? -1 : sizeof(ll) * 8 - 1 - __builtin_clzll(x); }
|
||||
|
||||
void __exgcd(ll a, ll b, ll& x, ll& y) {
|
||||
if (b == 0) {
|
||||
x = 1, y = 0;
|
||||
return;
|
||||
}
|
||||
__exgcd(b, a % b, y, x);
|
||||
y -= a / b * x;
|
||||
}
|
||||
|
||||
ll inverse(ll a, ll b) {
|
||||
ll x, y;
|
||||
__exgcd(a, b, x, y);
|
||||
return mod(x, b);
|
||||
}
|
||||
|
||||
vector<tuple<int, int, ll>> decompose(ll x) {
|
||||
// return (factor, count, factor ** count)
|
||||
vector<tuple<int, int, ll>> res;
|
||||
for (int i = 2; i * i <= x; i++) {
|
||||
if (x % i == 0) {
|
||||
int cnt = 0;
|
||||
ll pw = 1;
|
||||
while (x % i == 0) ++cnt, x /= i, pw *= i;
|
||||
res.emplace_back(i, cnt, pw);
|
||||
}
|
||||
}
|
||||
if (x != 1) {
|
||||
res.emplace_back(x, 1, x);
|
||||
}
|
||||
return res;
|
||||
}
|
||||
|
||||
vector<pii> decompose_prime(int N) {
|
||||
// return (factor, count)
|
||||
vector<pii> result;
|
||||
for (int i = 2; i * i <= N; i++) {
|
||||
if (N % i == 0) {
|
||||
int cnt = 0;
|
||||
while (N % i == 0) N /= i, ++cnt;
|
||||
result.emplace_back(i, cnt);
|
||||
}
|
||||
}
|
||||
if (N != 1) {
|
||||
result.emplace_back(N, 1);
|
||||
}
|
||||
return result;
|
||||
}
|
||||
|
||||
/* string algorithms */
|
||||
vector<int> calc_next(string t) { // pi function of t
|
||||
int n = (int)t.length();
|
||||
vector<int> pi(n);
|
||||
for (int i = 1; i < n; i++) {
|
||||
int j = pi[i - 1];
|
||||
while (j > 0 && t[i] != t[j]) j = pi[j - 1];
|
||||
if (t[i] == t[j]) j++;
|
||||
pi[i] = j;
|
||||
}
|
||||
return pi;
|
||||
}
|
||||
vector<int> calc_z(string t) { // z function of t
|
||||
int m = t.length();
|
||||
vector<int> z;
|
||||
z.push_back(m);
|
||||
pair<int, int> prev = {1, -1};
|
||||
for (int i = 1; i < m; ++i) {
|
||||
if (z[i - prev.first] + i <= prev.second) {
|
||||
z.push_back(z[i - prev.first]);
|
||||
} else {
|
||||
int j = max(i, prev.second + 1);
|
||||
while (j < m && t[j] == t[j - i]) ++j;
|
||||
z.push_back(j - i);
|
||||
prev = {i, j - 1};
|
||||
}
|
||||
}
|
||||
return z;
|
||||
}
|
||||
vector<int> kmp(string s, string t) { // find all t in s
|
||||
string cur = t + '#' + s;
|
||||
int sz1 = s.size(), sz2 = t.size();
|
||||
vector<int> v;
|
||||
vector<int> lps = calc_next(cur);
|
||||
for (int i = sz2 + 1; i <= sz1 + sz2; i++) {
|
||||
if (lps[i] == sz2) v.push_back(i - 2 * sz2);
|
||||
}
|
||||
return v;
|
||||
}
|
||||
int period(string s) { // find the length of shortest recurring period
|
||||
int n = s.length();
|
||||
auto z = calc_z(s);
|
||||
for (int i = 1; i <= n / 2; ++i) {
|
||||
if (n % i == 0 && z[i] == n - i) {
|
||||
return i;
|
||||
}
|
||||
}
|
||||
return n;
|
||||
}
|
||||
|
||||
/* modular arithmetic */
|
||||
template <ll mdl> struct MLL {
|
||||
ll val;
|
||||
MLL(ll v = 0) : val(mod(v, mdl)) {}
|
||||
MLL(const MLL<mdl>& other) : val(other.val) {}
|
||||
friend MLL operator+(const MLL& lhs, const MLL& rhs) { return mod(lhs.val + rhs.val, mdl); }
|
||||
friend MLL operator-(const MLL& lhs, const MLL& rhs) { return mod(lhs.val - rhs.val, mdl); }
|
||||
friend MLL operator*(const MLL& lhs, const MLL& rhs) { return mod(lhs.val * rhs.val, mdl); }
|
||||
friend MLL operator/(const MLL& lhs, const MLL& rhs) { return mod(lhs.val * mod(inverse(rhs.val, mdl), mdl), mdl); }
|
||||
friend MLL operator%(const MLL& lhs, const MLL& rhs) { return mod(lhs.val - (lhs / rhs).val, mdl); }
|
||||
friend bool operator==(const MLL& lhs, const MLL& rhs) { return lhs.val == rhs.val; }
|
||||
friend bool operator!=(const MLL& lhs, const MLL& rhs) { return lhs.val != rhs.val; }
|
||||
void operator+=(const MLL& rhs) { val = (*this + rhs).val; }
|
||||
void operator-=(const MLL& rhs) { val = (*this - rhs).val; }
|
||||
void operator*=(const MLL& rhs) { val = (*this * rhs).val; }
|
||||
void operator/=(const MLL& rhs) { val = (*this / rhs).val; }
|
||||
void operator%=(const MLL& rhs) { val = (*this % rhs).val; }
|
||||
};
|
||||
struct MLLd {
|
||||
ll val, mdl;
|
||||
MLLd(ll mdl, ll v = 0) : mdl(mdl), val(mod(v, mdl)) {}
|
||||
MLLd(const MLLd& other) : val(other.val) {}
|
||||
friend MLLd operator+(const MLLd& lhs, const MLLd& rhs) { return mod(lhs.val + rhs.val, lhs.mdl); }
|
||||
friend MLLd operator-(const MLLd& lhs, const MLLd& rhs) { return mod(lhs.val - rhs.val, lhs.mdl); }
|
||||
friend MLLd operator*(const MLLd& lhs, const MLLd& rhs) { return mod(lhs.val * rhs.val, lhs.mdl); }
|
||||
friend MLLd operator/(const MLLd& lhs, const MLLd& rhs) { return mod(lhs.val * mod(inverse(rhs.val, lhs.mdl), lhs.mdl), lhs.mdl); }
|
||||
friend MLLd operator%(const MLLd& lhs, const MLLd& rhs) { return mod(lhs.val - (lhs / rhs).val, lhs.mdl); }
|
||||
friend bool operator==(const MLLd& lhs, const MLLd& rhs) { return lhs.val == rhs.val; }
|
||||
friend bool operator!=(const MLLd& lhs, const MLLd& rhs) { return lhs.val != rhs.val; }
|
||||
void operator+=(const MLLd& rhs) { val = (*this + rhs).val; }
|
||||
void operator-=(const MLLd& rhs) { val = (*this - rhs).val; }
|
||||
void operator*=(const MLLd& rhs) { val = (*this * rhs).val; }
|
||||
void operator/=(const MLLd& rhs) { val = (*this / rhs).val; }
|
||||
void operator%=(const MLLd& rhs) { val = (*this % rhs).val; }
|
||||
};
|
||||
|
||||
template <ll mdl>
|
||||
ostream& operator<<(ostream& out, const MLL<mdl>& num) {
|
||||
return out << num.val;
|
||||
}
|
||||
|
||||
ostream& operator<<(ostream& out, const MLLd& num) {
|
||||
return out << num.val;
|
||||
}
|
||||
|
||||
template <ll mdl>
|
||||
istream& operator>>(istream& in, MLL<mdl>& num) {
|
||||
return in >> num.val;
|
||||
}
|
||||
|
||||
istream& operator>>(istream& in, MLLd& num) {
|
||||
return in >> num.val;
|
||||
}
|
||||
|
||||
// miscancellous
|
||||
template <typename Func, typename RandomIt> void sort_by_key(RandomIt first, RandomIt last, Func extractor) {
|
||||
std::sort(first, last, [&] (auto&& a, auto&& b) { return std::less<>()(extractor(a), extractor(b)); });
|
||||
}
|
||||
template <typename Func, typename RandomIt, typename Compare> void sort_by_key(RandomIt first, RandomIt last, Func extractor, Compare comp) {
|
||||
std::sort(first, last, [&] (auto&& a, auto&& b) { return comp(extractor(a), extractor(b)); });
|
||||
}
|
||||
template <typename T, typename U, typename Iterator_T, typename Iterator_U>
|
||||
vector<pair<T, U>> zip(Iterator_T a_first, Iterator_T a_last, Iterator_U b_first, Iterator_U b_last) {
|
||||
vector<pair<T, U>> res;
|
||||
auto a_it = a_first;
|
||||
auto b_it = b_first;
|
||||
for (; not (a_it == a_last) and not (b_it == b_last); ++a_it, ++b_it) {
|
||||
res.emplace_back(*a_it, *b_it);
|
||||
}
|
||||
return res;
|
||||
}
|
||||
template <typename T, typename U, typename Iterator_T, typename Iterator_U>
|
||||
vector<pair<T, U>> zip_n(Iterator_T a_first, Iterator_U b_first, size_t n) {
|
||||
vector<pair<T, U>> res;
|
||||
if (n > 0) {
|
||||
res.emplace_back(*a_first, *b_first);
|
||||
for (size_t i = 1; i != n; ++i) {
|
||||
res.emplace_back(*++a_first, *++b_first);
|
||||
}
|
||||
}
|
||||
return res;
|
||||
}
|
||||
template <typename T>
|
||||
class ArithmeticIterator : bidirectional_iterator_tag {
|
||||
public:
|
||||
using difference_type = ptrdiff_t;
|
||||
using value_type = T;
|
||||
private:
|
||||
value_type value;
|
||||
public:
|
||||
ArithmeticIterator(const T& value) : value(value) {}
|
||||
value_type operator*() const { return value; }
|
||||
ArithmeticIterator<T>& operator++() { ++value; return *this; }
|
||||
ArithmeticIterator<T>& operator--() { --value; return *this; }
|
||||
bool operator==(const ArithmeticIterator<T>& rhs) const { return value == rhs.value; }
|
||||
};
|
||||
template <typename T> vector<pair<int, T>> enumerate(const vector<T>& container) {
|
||||
return zip<int, T>(ArithmeticIterator<int>(0), ArithmeticIterator<int>(INT_MAX), container.begin(), container.end());
|
||||
}
|
||||
/////////////////////////////////////////////////////////
|
||||
|
||||
#define SINGLE_TEST_CASE
|
||||
// #define DUMP_TEST_CASE 7219
|
||||
// #define TOT_TEST_CASE 10000
|
||||
|
||||
void dump() {}
|
||||
|
||||
void dump_ignore() {}
|
||||
|
||||
void prep() {
|
||||
}
|
||||
|
||||
struct dinic {
|
||||
struct edge {
|
||||
int to;
|
||||
ll cap;
|
||||
ll flow;
|
||||
int rev;
|
||||
int mark;
|
||||
};
|
||||
vector<vector<edge>> edges;
|
||||
vector<int> layer;
|
||||
vector<bool> vis;
|
||||
dinic(int n) : edges(n + 1), layer(n + 1), vis(n + 1) {}
|
||||
void add_edge(int from, int to, ll cap, int mark = 0, int mark_rev = 0) {
|
||||
edges[from].push_back({ to, cap, 0, int(edges[to].size()), mark });
|
||||
edges[to].push_back({ from, 0, 0, int(edges[from].size() - 1), mark_rev });
|
||||
}
|
||||
bool bfs(int s, int t) {
|
||||
layer.assign(edges.size(), 0);
|
||||
deque<pii> dq;
|
||||
layer[s] = 1;
|
||||
dq.emplace_back(s, 1);
|
||||
while (dq.size()) {
|
||||
popfront(dq, v, l);
|
||||
for (auto&& e : edges[v]) {
|
||||
if (layer[e.to] == 0 and e.cap > e.flow) {
|
||||
layer[e.to] = l + 1;
|
||||
dq.emplace_back(e.to, l + 1);
|
||||
}
|
||||
}
|
||||
}
|
||||
return layer[t] != 0;
|
||||
}
|
||||
ll dfs(int s, int t, ll cap) {
|
||||
if (vis[s]) {
|
||||
return 0;
|
||||
}
|
||||
vis[s] = 1;
|
||||
if (s == t) {
|
||||
return cap;
|
||||
}
|
||||
ll res = 0;
|
||||
int n = edges[s].size();
|
||||
for (int i = 0; i < n; ++i) {
|
||||
auto&& e = edges[s][i];
|
||||
if (e.cap > e.flow and layer[e.to] == layer[s] + 1) {
|
||||
ll nw = dfs(e.to, t, min(cap - res, e.cap - e.flow));
|
||||
edges[s][i].flow += nw;
|
||||
edges[e.to][e.rev].flow -= nw;
|
||||
res += nw;
|
||||
if (res == cap) {
|
||||
return res;
|
||||
}
|
||||
}
|
||||
}
|
||||
return res;
|
||||
}
|
||||
ll run(int s, int t) {
|
||||
ll res = 0;
|
||||
while (bfs(s, t)) {
|
||||
vis.assign(edges.size(), 0);
|
||||
res += dfs(s, t, LLONG_MAX);
|
||||
}
|
||||
return res;
|
||||
}
|
||||
};
|
||||
|
||||
struct bounded_flow {
|
||||
int n, m, S, T;
|
||||
dinic net;
|
||||
ll sum;
|
||||
vector<ll> fl;
|
||||
vector<ll> init;
|
||||
bounded_flow(int n, int m) : sum(0), n(n), m(m), S(0), T(n + 1), net(n + 1), fl(m), init(n + 1) {}
|
||||
void add_edge(int from, int to, ll low, ll high, int edge_id = -1) {
|
||||
if (edge_id != -1) {
|
||||
fl[edge_id] += low;
|
||||
}
|
||||
net.add_edge(from, to, high - low, edge_id, -1);
|
||||
init[to] += low, init[from] -= low;
|
||||
}
|
||||
void prep(int s, int t) {
|
||||
for (int i = 1; i <= n; ++i) {
|
||||
if (init[i] > 0) {
|
||||
net.add_edge(S, i, init[i], -1, -1);
|
||||
sum += init[i];
|
||||
} else if (init[i] < 0) {
|
||||
net.add_edge(i, T, -init[i], -1, -1);
|
||||
}
|
||||
}
|
||||
net.add_edge(t, s, INFLL, INF, -1);
|
||||
}
|
||||
optional<pair<ll, vector<ll>>> run_max_flow(int s, int t) {
|
||||
prep(s, t);
|
||||
if (sum != net.run(S, T)) {
|
||||
return nullopt;
|
||||
} else {
|
||||
auto res_flow = net.run(s, t);
|
||||
for (int from = 1; from <= n; ++from) {
|
||||
for (auto&& [to, cap, flow, rev, mark] : net.edges[from]) {
|
||||
if (mark != -1 and mark != INF) {
|
||||
fl[mark] += flow;
|
||||
}
|
||||
}
|
||||
}
|
||||
return {{res_flow, fl}};
|
||||
}
|
||||
}
|
||||
optional<pair<ll, vector<ll>>> run_min_flow(int s, int t) {
|
||||
prep(s, t);
|
||||
if (sum != net.run(S, T)) {
|
||||
return nullopt;
|
||||
} else {
|
||||
int curr;
|
||||
for (int i = 0; i < m; ++i) {
|
||||
if (net.edges[t][i].mark == INF) {
|
||||
net.edges[t][i].cap = 0;
|
||||
net.edges[net.edges[t][i].to][net.edges[t][i].rev].cap = 0;
|
||||
curr = net.edges[t][i].flow; // WARN: real flow
|
||||
break;
|
||||
}
|
||||
}
|
||||
curr -= net.run(t, s);
|
||||
for (int from = 1; from <= n; ++from) {
|
||||
for (auto&& [to, cap, flow, rev, mark] : net.edges[from]) {
|
||||
if (mark != -1 and mark != INF) {
|
||||
fl[mark] += flow;
|
||||
}
|
||||
}
|
||||
}
|
||||
return {{curr, fl}};
|
||||
}
|
||||
}
|
||||
optional<pair<ll, vector<ll>>> run_flow(int s, int t) { // BUG: unchecked code
|
||||
prep(s, t);
|
||||
auto res_flow = net.run(S, T);
|
||||
if (sum != res_flow) {
|
||||
return nullopt;
|
||||
} else {
|
||||
for (int from = 1; from <= n; ++from) {
|
||||
for (auto&& [to, cap, flow, rev, mark] : net.edges[from]) {
|
||||
if (mark != -1 and mark != INF) {
|
||||
fl[mark] += flow;
|
||||
}
|
||||
}
|
||||
}
|
||||
return {{res_flow, fl}};
|
||||
}
|
||||
}
|
||||
};
|
||||
|
||||
void solve() {
|
||||
read(int, n, m, s, t);
|
||||
dinic net(n + 1);
|
||||
int S = 0, T = n + 1;
|
||||
vector<ll> init(n + 1);
|
||||
for (int i = 0 ;i < m; ++i) {
|
||||
read(ll, u, v, lower, upper);
|
||||
init[v] += lower;
|
||||
init[u] -= lower;
|
||||
net.add_edge(u, v, upper - lower);
|
||||
}
|
||||
ll sum = 0;
|
||||
for (int i =1; i <= n; ++i) {
|
||||
if (init[i] > 0) {
|
||||
net.add_edge(S, i, init[i]);
|
||||
sum += init[i];
|
||||
} else if (init[i] < 0) {
|
||||
net.add_edge(i, T, -init[i]);
|
||||
}
|
||||
}
|
||||
net.add_edge(t, s, INFLL, 1, 1); // WARN: s->t is wrong
|
||||
if (sum != net.run(S, T)) {
|
||||
cout << "please go home to sleep\n";
|
||||
} else {
|
||||
int m = net.edges[t].size();
|
||||
int curr;
|
||||
for (int i = 0; i < m; ++i) {
|
||||
if (net.edges[t][i].mark) {
|
||||
net.edges[t][i].cap = 0;
|
||||
net.edges[net.edges[t][i].to][net.edges[t][i].rev].cap = 0;
|
||||
curr = net.edges[t][i].flow; // WARN: real flow
|
||||
break;
|
||||
}
|
||||
}
|
||||
cout << curr - net.run(t, s) << '\n';
|
||||
}
|
||||
}
|
||||
|
||||
int main() {
|
||||
#if __cplusplus < 201703L || defined(_MSC_VER) && !defined(__clang__)
|
||||
assert(false && "incompatible compiler variant detected.");
|
||||
#endif
|
||||
untie, cout.tie(NULL);
|
||||
prep();
|
||||
#ifdef SINGLE_TEST_CASE
|
||||
solve();
|
||||
#else
|
||||
read(int, t);
|
||||
for (int i = 0; i < t; ++i) {
|
||||
#ifdef DUMP_TEST_CASE
|
||||
if (t != (TOT_TEST_CASE)) {
|
||||
solve();
|
||||
} else if (i + 1 == (DUMP_TEST_CASE)) {
|
||||
dump();
|
||||
} else {
|
||||
dump_ignore();
|
||||
}
|
||||
#else
|
||||
solve();
|
||||
#endif
|
||||
}
|
||||
#endif
|
||||
}
|
||||
|
|
@ -1,9 +1,13 @@
|
|||
4
|
||||
4
|
||||
1 2 3 4
|
||||
4
|
||||
4 3 1 2
|
||||
6
|
||||
6 5 1 4 2 3
|
||||
8
|
||||
1 2 4 5 7 6 8 3
|
||||
7 12 6 7
|
||||
6 1 0 2147483647
|
||||
1 7 0 2147483647
|
||||
6 2 0 2147483647
|
||||
2 7 0 2147483647
|
||||
6 3 0 2147483647
|
||||
3 7 0 2147483647
|
||||
6 4 0 2147483647
|
||||
4 7 0 2147483647
|
||||
6 5 0 2147483647
|
||||
5 7 0 2147483647
|
||||
5 1 1 2147483647
|
||||
3 4 1 2147483647
|
||||
|
|
|
|||
|
|
@ -429,7 +429,7 @@ vector<pair<T, U>> zip(Iterator_T a_first, Iterator_T a_last, Iterator_U b_first
|
|||
vector<pair<T, U>> res;
|
||||
auto a_it = a_first;
|
||||
auto b_it = b_first;
|
||||
for (; a_it != a_last and b_it != b_last; ++a_it, ++b_it) {
|
||||
for (; not (a_it == a_last) and not (b_it == b_last); ++a_it, ++b_it) {
|
||||
res.emplace_back(*a_it, *b_it);
|
||||
}
|
||||
return res;
|
||||
|
|
@ -459,9 +459,12 @@ public:
|
|||
ArithmeticIterator<T>& operator--() { --value; return *this; }
|
||||
bool operator==(const ArithmeticIterator<T>& rhs) const { return value == rhs.value; }
|
||||
};
|
||||
template <typename T> vector<pair<int, T>> enumerate(const vector<T>& container) {
|
||||
return zip<int, T>(ArithmeticIterator<int>(0), ArithmeticIterator<int>(INT_MAX), container.begin(), container.end());
|
||||
}
|
||||
/////////////////////////////////////////////////////////
|
||||
|
||||
// #define SINGLE_TEST_CASE
|
||||
#define SINGLE_TEST_CASE
|
||||
// #define DUMP_TEST_CASE 7219
|
||||
// #define TOT_TEST_CASE 10000
|
||||
|
||||
|
|
|
|||
563
src/bin/test.cc
563
src/bin/test.cc
|
|
@ -1,500 +1,99 @@
|
|||
#pragma GCC optimize("Ofast")
|
||||
/////////////////////////////////////////////////////////
|
||||
/**
|
||||
* Useful Macros
|
||||
* by subcrip
|
||||
* (requires C++17)
|
||||
*/
|
||||
#include <iostream>
|
||||
#include <cstring>
|
||||
#include <algorithm>
|
||||
|
||||
#include<bits/stdc++.h>
|
||||
using namespace std;
|
||||
|
||||
/* macro helpers */
|
||||
#define __NARGS(...) std::tuple_size<decltype(std::make_tuple(__VA_ARGS__))>::value
|
||||
#define __DECOMPOSE_S(a, x) auto x = a;
|
||||
#define __DECOMPOSE_N(a, ...) auto [__VA_ARGS__] = a;
|
||||
constexpr void __() {}
|
||||
#define __AS_PROCEDURE(...) __(); __VA_ARGS__; __()
|
||||
#define __as_typeof(container) remove_reference<decltype(container)>::type
|
||||
const int N = 50010, M = (N + 125003) * 2, INF = 2147483647;
|
||||
|
||||
/* type aliases */
|
||||
#if LONG_LONG_MAX != INT64_MAX
|
||||
using ll = int64_t;
|
||||
using ull = uint64_t;
|
||||
#else
|
||||
using ll = long long;
|
||||
using ull = unsigned long long;
|
||||
using ld = long double;
|
||||
#endif
|
||||
using int128 = __int128_t;
|
||||
using uint128 = __uint128_t;
|
||||
using ld = long double;
|
||||
using pii = pair<int, int>;
|
||||
using pil = pair<int, ll>;
|
||||
using pli = pair<ll, int>;
|
||||
using pll = pair<ll, ll>;
|
||||
using pid = pair<int, ld>;
|
||||
using pdi = pair<ld, int>;
|
||||
using pld = pair<ll, ld>;
|
||||
using pdl = pair<ld, ll>;
|
||||
using pdd = pair<ld, ld>;
|
||||
using tlll = tuple<ll, ll, ll>;
|
||||
using tlld = tuple<ll, ll, ld>;
|
||||
using tlli = tuple<ll, ll, int>;
|
||||
using tldl = tuple<ll, ld, ll>;
|
||||
using tldd = tuple<ll, ld, ld>;
|
||||
using tldi = tuple<ll, ld, int>;
|
||||
using tlil = tuple<ll, int, ll>;
|
||||
using tlid = tuple<ll, int, ld>;
|
||||
using tlii = tuple<ll, int, int>;
|
||||
using tdll = tuple<ld, ll, ll>;
|
||||
using tdld = tuple<ld, ll, ld>;
|
||||
using tdli = tuple<ld, ll, int>;
|
||||
using tddl = tuple<ld, ld, ll>;
|
||||
using tddd = tuple<ld, ld, ld>;
|
||||
using tddi = tuple<ld, ld, int>;
|
||||
using tdil = tuple<ld, int, ll>;
|
||||
using tdid = tuple<ld, int, ld>;
|
||||
using tdii = tuple<ld, int, int>;
|
||||
using till = tuple<int, ll, ll>;
|
||||
using tild = tuple<int, ll, ld>;
|
||||
using tili = tuple<int, ll, int>;
|
||||
using tidl = tuple<int, ld, ll>;
|
||||
using tidd = tuple<int, ld, ld>;
|
||||
using tidi = tuple<int, ld, int>;
|
||||
using tiil = tuple<int, int, ll>;
|
||||
using tiid = tuple<int, int, ld>;
|
||||
using tiii = tuple<int, int, int>;
|
||||
template <typename T> using max_heap = priority_queue<T>;
|
||||
template <typename T> using min_heap = priority_queue<T, vector<T>, greater<>>;
|
||||
template <typename T> using oi = ostream_iterator<T>;
|
||||
template <typename T> using ii = istream_iterator<T>;
|
||||
int n, m, S, T;
|
||||
int h[N], e[M], f[M], ne[M], idx;
|
||||
int q[N], d[N], cur[N], A[N];
|
||||
|
||||
/* constants */
|
||||
constexpr int INF = 0x3f3f3f3f;
|
||||
constexpr ll INFLL = 0x3f3f3f3f3f3f3f3fLL;
|
||||
constexpr ll MDL = 1e9 + 7;
|
||||
constexpr ll PRIME = 998'244'353;
|
||||
constexpr ll MDL1 = 8784491;
|
||||
constexpr ll MDL2 = PRIME;
|
||||
constexpr int128 INT128_MAX = numeric_limits<int128>::max();
|
||||
constexpr uint128 UINT128_MAX = numeric_limits<uint128>::max();
|
||||
constexpr int128 INT128_MIN = numeric_limits<int128>::min();
|
||||
constexpr uint128 UINT128_MIN = numeric_limits<uint128>::min();
|
||||
|
||||
/* random */
|
||||
|
||||
mt19937 rd(chrono::duration_cast<chrono::milliseconds>(chrono::system_clock::now().time_since_epoch()).count());
|
||||
|
||||
/* bit-wise operations */
|
||||
#define lowbit(x) ((x) & -(x))
|
||||
#define popcount(x) (__builtin_popcountll(ll(x)))
|
||||
#define parity(x) (__builtin_parityll(ll(x)))
|
||||
#define msp(x) (63LL - __builtin_clzll(ll(x)))
|
||||
#define lsp(x) (__builtin_ctzll(ll(x)))
|
||||
|
||||
/* arithmetic operations */
|
||||
#define mod(x, y) ((((x) % (y)) + (y)) % (y))
|
||||
|
||||
/* fast pairs */
|
||||
#define upair ull
|
||||
#define umake(x, y) (ull(x) << 32 | (ull(y) & ((1ULL << 32) - 1)))
|
||||
#define u1(p) ((p) >> 32)
|
||||
#define u2(p) ((p) & ((1ULL << 32) - 1))
|
||||
#define ult std::less<upair>
|
||||
#define ugt std::greater<upair>
|
||||
|
||||
#define ipair ull
|
||||
#define imake(x, y) (umake(x, y))
|
||||
#define i1(p) (int(u1(ll(p))))
|
||||
#define i2(p) (ll(u2(p) << 32) >> 32)
|
||||
struct ilt {
|
||||
bool operator()(const ipair& a, const ipair& b) const {
|
||||
if (i1(a) == i1(b)) return i2(a) < i2(b);
|
||||
else return i1(a) < i1(b);
|
||||
}
|
||||
};
|
||||
struct igt {
|
||||
bool operator()(const ipair& a, const ipair& b) const {
|
||||
if (i1(a) == i1(b)) return i2(a) > i2(b);
|
||||
else return i1(a) > i1(b);
|
||||
}
|
||||
};
|
||||
|
||||
/* conditions */
|
||||
#define loop while (1)
|
||||
#define if_or(var, val) if (!(var == val)) var = val; else
|
||||
#define continue_or(var, val) __AS_PROCEDURE(if (var == val) continue; var = val;)
|
||||
#define break_or(var, val) __AS_PROCEDURE(if (var == val) break; var = val;)
|
||||
|
||||
/* hash */
|
||||
struct safe_hash {
|
||||
// https://codeforces.com/blog/entry/62393
|
||||
static uint64_t splitmix64(uint64_t x) {
|
||||
// http://xorshift.di.unimi.it/splitmix64.c
|
||||
x += 0x9e3779b97f4a7c15;
|
||||
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
|
||||
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
|
||||
return x ^ (x >> 31);
|
||||
}
|
||||
|
||||
size_t operator()(uint64_t x) const {
|
||||
static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
|
||||
return splitmix64(x + FIXED_RANDOM);
|
||||
}
|
||||
};
|
||||
|
||||
struct pair_hash {
|
||||
template <typename T, typename U>
|
||||
size_t operator()(const pair<T, U>& a) const {
|
||||
auto hash1 = safe_hash()(a.first);
|
||||
auto hash2 = safe_hash()(a.second);
|
||||
if (hash1 != hash2) {
|
||||
return hash1 ^ hash2;
|
||||
}
|
||||
return hash1;
|
||||
}
|
||||
};
|
||||
|
||||
uniform_int_distribution<mt19937::result_type> dist(PRIME);
|
||||
const size_t __array_hash_b = 31, __array_hash_mdl1 = dist(rd), __array_hash_mdl2 = dist(rd);
|
||||
struct array_hash {
|
||||
template <typename Sequence>
|
||||
size_t operator()(const Sequence& arr) const {
|
||||
size_t pw1 = 1, pw2 = 1;
|
||||
size_t res1 = 0, res2 = 0;
|
||||
for (auto&& x : arr) {
|
||||
res1 = (res1 + x * pw1) % __array_hash_mdl1;
|
||||
res2 = (res2 + x * pw2) % __array_hash_mdl2;
|
||||
pw1 = (pw1 * __array_hash_b) % __array_hash_mdl1;
|
||||
pw2 = (pw2 * __array_hash_b) % __array_hash_mdl2;
|
||||
}
|
||||
return res1 + res2;
|
||||
}
|
||||
};
|
||||
|
||||
/* build data structures */
|
||||
#define unordered_counter(from, to) __AS_PROCEDURE(unordered_map<__as_typeof(from), size_t, safe_hash> to; for (auto&& x : from) ++to[x];)
|
||||
#define counter(from, to, cmp) __AS_PROCEDURE(map<__as_typeof(from), size_t, cmp> to; for (auto&& x : from) ++to[x];)
|
||||
#define pa(a) __AS_PROCEDURE(__typeof(a) pa; pa.push_back({}); for (auto&&x : a) pa.push_back(pa.back() + x);)
|
||||
#define sa(a) __AS_PROCEDURE(__typeof(a) sa(a.size() + 1); {int n = a.size(); for (int i = n - 1; i >= 0; --i) sa[i] = sa[i + 1] + a[i];};)
|
||||
#define adj(ch, n) __AS_PROCEDURE(vector<vector<int>> ch((n) + 1);)
|
||||
#define edge(ch, u, v) __AS_PROCEDURE(ch[u].push_back(v), ch[v].push_back(u);)
|
||||
#define edgew(ch, u, v, w) __AS_PROCEDURE(ch[u].emplace_back(v, w), ch[v].emplace_back(u, w);)
|
||||
#define Edge(ch, u, v) __AS_PROCEDURE(ch[u].push_back(v);)
|
||||
#define Edgew(ch, u, v, w) __AS_PROCEDURE(ch[u].emplace_back(v, w);)
|
||||
template <typename T, typename Iterator> pair<size_t, map<T, size_t>> discretize(Iterator __first, Iterator __last) {
|
||||
set<T> st(__first, __last);
|
||||
size_t N = 0;
|
||||
map<T, size_t> mp;
|
||||
for (auto&& x : st) mp[x] = ++N;
|
||||
return {N, mp};
|
||||
}
|
||||
template <typename T, typename Iterator> pair<size_t, unordered_map<T, size_t, safe_hash>> unordered_discretize(Iterator __first, Iterator __last) {
|
||||
set<T> st(__first, __last);
|
||||
size_t N = 0;
|
||||
unordered_map<T, size_t, safe_hash> mp;
|
||||
for (auto&& x : st) mp[x] = ++N;
|
||||
return {N, mp};
|
||||
void add(int a, int b, int c)
|
||||
{
|
||||
e[idx] = b, f[idx] = c, ne[idx] = h[a], h[a] = idx ++ ;
|
||||
e[idx] = a, f[idx] = 0, ne[idx] = h[b], h[b] = idx ++ ;
|
||||
}
|
||||
|
||||
/* io */
|
||||
#define untie __AS_PROCEDURE(ios_base::sync_with_stdio(0), cin.tie(NULL))
|
||||
template<typename T> void __read(T& x) { cin >> x; }
|
||||
template<typename T, typename... U> void __read(T& x, U&... args) { cin >> x; __read(args...); }
|
||||
#define read(type, ...) __AS_PROCEDURE(type __VA_ARGS__; __read(__VA_ARGS__);)
|
||||
#define readvec(type, a, n) __AS_PROCEDURE(vector<type> a(n); for (auto& x : a) cin >> x;)
|
||||
#define readvec1(type, a, n) __AS_PROCEDURE(vector<type> a((n) + 1); copy_n(ii<type>(cin), (n), a.begin() + 1);)
|
||||
#define putvec(a) __AS_PROCEDURE(copy(a.begin(), a.end(), oi<__as_typeof(a)::value_type>(cout, " ")); cout << endl;)
|
||||
#define putvec1(a) __AS_PROCEDURE(copy(a.begin() + 1, a.end(), oi<__as_typeof(a)::value_type>(cout, " ")); cout << endl;)
|
||||
#define putvec_eol(a) __AS_PROCEDURE(copy(a.begin(), a.end(), oi<__as_typeof(a)::value_type>(cout, "\n"));)
|
||||
#define putvec1_eol(a) __AS_PROCEDURE(copy(a.begin() + 1, a.end(), oi<__as_typeof(a)::value_type>(cout, "\n"));)
|
||||
#define debug(x) __AS_PROCEDURE(cerr << #x" = " << (x) << endl;)
|
||||
#define debugvec(a) __AS_PROCEDURE(cerr << #a" = "; for (auto&& x : a) cerr << x << ' '; cerr << endl;)
|
||||
template<typename T, typename U> istream& operator>>(istream& in, pair<T, U>& p) {
|
||||
return in >> p.first >> p.second;
|
||||
}
|
||||
template<typename T, typename U> ostream& operator<<(ostream& out, const pair<T, U>& p) {
|
||||
out << "{" << p.first << ", " << p.second << "}";
|
||||
return out;
|
||||
}
|
||||
template<typename Char, typename Traits, typename Tuple, std::size_t... Index>
|
||||
void print_tuple_impl(std::basic_ostream<Char, Traits>& os, const Tuple& t, std::index_sequence<Index...>) {
|
||||
using swallow = int[]; // guaranties left to right order
|
||||
(void)swallow { 0, (void(os << (Index == 0 ? "" : ", ") << std::get<Index>(t)), 0)... };
|
||||
}
|
||||
template<typename Char, typename Traits, typename... Args>
|
||||
decltype(auto) operator<<(std::basic_ostream<Char, Traits>& os, const std::tuple<Args...>& t) {
|
||||
os << "{";
|
||||
print_tuple_impl(os, t, std::index_sequence_for<Args...>{});
|
||||
return os << "}";
|
||||
}
|
||||
template<typename T> ostream& operator<<(ostream& out, const vector<T>& vec) {
|
||||
for (auto&& i : vec) out << i << ' ';
|
||||
return out;
|
||||
}
|
||||
std::ostream& operator<<(std::ostream& dest, const int128& value) {
|
||||
// https://stackoverflow.com/a/25115163/23881100
|
||||
std::ostream::sentry s( dest );
|
||||
if ( s ) {
|
||||
uint128 tmp = value < 0 ? -value : value;
|
||||
char buffer[ 128 ];
|
||||
char* d = std::end( buffer );
|
||||
do {
|
||||
-- d;
|
||||
*d = "0123456789"[ tmp % 10 ];
|
||||
tmp /= 10;
|
||||
} while ( tmp != 0 );
|
||||
if ( value < 0 ) {
|
||||
-- d;
|
||||
*d = '-';
|
||||
}
|
||||
int len = std::end( buffer ) - d;
|
||||
if ( dest.rdbuf()->sputn( d, len ) != len ) {
|
||||
dest.setstate( std::ios_base::badbit );
|
||||
bool bfs()
|
||||
{
|
||||
int hh = 0, tt = 0;
|
||||
memset(d, -1, sizeof d);
|
||||
q[0] = S, d[S] = 0, cur[S] = h[S];
|
||||
while (hh <= tt)
|
||||
{
|
||||
int t = q[hh ++ ];
|
||||
for (int i = h[t]; ~i; i = ne[i])
|
||||
{
|
||||
int ver = e[i];
|
||||
if (d[ver] == -1 && f[i])
|
||||
{
|
||||
d[ver] = d[t] + 1;
|
||||
cur[ver] = h[ver];
|
||||
if (ver == T) return true;
|
||||
q[ ++ tt] = ver;
|
||||
}
|
||||
}
|
||||
}
|
||||
return dest;
|
||||
return false;
|
||||
}
|
||||
|
||||
/* pops */
|
||||
#define poptop(q, ...) __AS_PROCEDURE(auto [__VA_ARGS__] = q.top(); q.pop();)
|
||||
#define popback(q, ...) __AS_PROCEDURE(auto [__VA_ARGS__] = q.back(); q.pop_back();)
|
||||
#define popfront(q, ...) __AS_PROCEDURE(auto [__VA_ARGS__] = q.front();q.pop_front();)
|
||||
|
||||
/* math */
|
||||
constexpr inline int lg2(ll x) { return x == 0 ? -1 : sizeof(ll) * 8 - 1 - __builtin_clzll(x); }
|
||||
|
||||
void __exgcd(ll a, ll b, ll& x, ll& y) {
|
||||
if (b == 0) {
|
||||
x = 1, y = 0;
|
||||
return;
|
||||
}
|
||||
__exgcd(b, a % b, y, x);
|
||||
y -= a / b * x;
|
||||
}
|
||||
|
||||
ll inverse(ll a, ll b) {
|
||||
ll x, y;
|
||||
__exgcd(a, b, x, y);
|
||||
return mod(x, b);
|
||||
}
|
||||
|
||||
vector<tuple<int, int, ll>> decompose(ll x) {
|
||||
// return (factor, count, factor ** count)
|
||||
vector<tuple<int, int, ll>> res;
|
||||
for (int i = 2; i * i <= x; i++) {
|
||||
if (x % i == 0) {
|
||||
int cnt = 0;
|
||||
ll pw = 1;
|
||||
while (x % i == 0) ++cnt, x /= i, pw *= i;
|
||||
res.emplace_back(i, cnt, pw);
|
||||
int find(int u, int limit)
|
||||
{
|
||||
if (u == T) return limit;
|
||||
int flow = 0;
|
||||
for (int i = cur[u]; ~i && flow < limit; i = ne[i])
|
||||
{
|
||||
cur[u] = i;
|
||||
int ver = e[i];
|
||||
if (d[ver] == d[u] + 1 && f[i])
|
||||
{
|
||||
int t = find(ver, min(f[i], limit - flow));
|
||||
if (!t) d[ver] = -1;
|
||||
f[i] -= t, f[i ^ 1] += t, flow += t;
|
||||
}
|
||||
}
|
||||
if (x != 1) {
|
||||
res.emplace_back(x, 1, x);
|
||||
return flow;
|
||||
}
|
||||
|
||||
int dinic()
|
||||
{
|
||||
int r = 0, flow;
|
||||
while (bfs()) while (flow = find(S, INF)) r += flow;
|
||||
return r;
|
||||
}
|
||||
|
||||
int main()
|
||||
{
|
||||
int s, t;
|
||||
scanf("%d%d%d%d", &n, &m, &s, &t);
|
||||
S = 0, T = n + 1;
|
||||
memset(h, -1, sizeof h);
|
||||
while (m -- )
|
||||
{
|
||||
int a, b, c, d;
|
||||
scanf("%d%d%d%d", &a, &b, &c, &d);
|
||||
add(a, b, d - c);
|
||||
A[a] -= c, A[b] += c;
|
||||
}
|
||||
return res;
|
||||
}
|
||||
|
||||
vector<pii> decompose_prime(int N) {
|
||||
// return (factor, count)
|
||||
vector<pii> result;
|
||||
for (int i = 2; i * i <= N; i++) {
|
||||
if (N % i == 0) {
|
||||
int cnt = 0;
|
||||
while (N % i == 0) N /= i, ++cnt;
|
||||
result.emplace_back(i, cnt);
|
||||
}
|
||||
int tot = 0;
|
||||
for (int i = 1; i <= n; i ++ )
|
||||
if (A[i] > 0) add(S, i, A[i]), tot += A[i];
|
||||
else if (A[i] < 0) add(i, T, -A[i]);
|
||||
|
||||
add(t, s, INF);
|
||||
|
||||
if (dinic() < tot) puts("please go home to sleep");
|
||||
else
|
||||
{
|
||||
int res = f[idx - 1];
|
||||
S = t, T = s;
|
||||
f[idx - 1] = f[idx - 2] = 0;
|
||||
printf("%d\n", res - dinic());
|
||||
}
|
||||
if (N != 1) {
|
||||
result.emplace_back(N, 1);
|
||||
}
|
||||
return result;
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
/* string algorithms */
|
||||
vector<int> calc_next(string t) { // pi function of t
|
||||
int n = (int)t.length();
|
||||
vector<int> pi(n);
|
||||
for (int i = 1; i < n; i++) {
|
||||
int j = pi[i - 1];
|
||||
while (j > 0 && t[i] != t[j]) j = pi[j - 1];
|
||||
if (t[i] == t[j]) j++;
|
||||
pi[i] = j;
|
||||
}
|
||||
return pi;
|
||||
}
|
||||
vector<int> calc_z(string t) { // z function of t
|
||||
int m = t.length();
|
||||
vector<int> z;
|
||||
z.push_back(m);
|
||||
pair<int, int> prev = {1, -1};
|
||||
for (int i = 1; i < m; ++i) {
|
||||
if (z[i - prev.first] + i <= prev.second) {
|
||||
z.push_back(z[i - prev.first]);
|
||||
} else {
|
||||
int j = max(i, prev.second + 1);
|
||||
while (j < m && t[j] == t[j - i]) ++j;
|
||||
z.push_back(j - i);
|
||||
prev = {i, j - 1};
|
||||
}
|
||||
}
|
||||
return z;
|
||||
}
|
||||
vector<int> kmp(string s, string t) { // find all t in s
|
||||
string cur = t + '#' + s;
|
||||
int sz1 = s.size(), sz2 = t.size();
|
||||
vector<int> v;
|
||||
vector<int> lps = calc_next(cur);
|
||||
for (int i = sz2 + 1; i <= sz1 + sz2; i++) {
|
||||
if (lps[i] == sz2) v.push_back(i - 2 * sz2);
|
||||
}
|
||||
return v;
|
||||
}
|
||||
int period(string s) { // find the length of shortest recurring period
|
||||
int n = s.length();
|
||||
auto z = calc_z(s);
|
||||
for (int i = 1; i <= n / 2; ++i) {
|
||||
if (n % i == 0 && z[i] == n - i) {
|
||||
return i;
|
||||
}
|
||||
}
|
||||
return n;
|
||||
}
|
||||
|
||||
/* modular arithmetic */
|
||||
template <ll mdl> struct MLL {
|
||||
ll val;
|
||||
MLL(ll v = 0) : val(mod(v, mdl)) {}
|
||||
MLL(const MLL<mdl>& other) : val(other.val) {}
|
||||
friend MLL operator+(const MLL& lhs, const MLL& rhs) { return mod(lhs.val + rhs.val, mdl); }
|
||||
friend MLL operator-(const MLL& lhs, const MLL& rhs) { return mod(lhs.val - rhs.val, mdl); }
|
||||
friend MLL operator*(const MLL& lhs, const MLL& rhs) { return mod(lhs.val * rhs.val, mdl); }
|
||||
friend MLL operator/(const MLL& lhs, const MLL& rhs) { return mod(lhs.val * mod(inverse(rhs.val, mdl), mdl), mdl); }
|
||||
friend MLL operator%(const MLL& lhs, const MLL& rhs) { return mod(lhs.val - (lhs / rhs).val, mdl); }
|
||||
friend bool operator==(const MLL& lhs, const MLL& rhs) { return lhs.val == rhs.val; }
|
||||
friend bool operator!=(const MLL& lhs, const MLL& rhs) { return lhs.val != rhs.val; }
|
||||
void operator+=(const MLL& rhs) { val = (*this + rhs).val; }
|
||||
void operator-=(const MLL& rhs) { val = (*this - rhs).val; }
|
||||
void operator*=(const MLL& rhs) { val = (*this * rhs).val; }
|
||||
void operator/=(const MLL& rhs) { val = (*this / rhs).val; }
|
||||
void operator%=(const MLL& rhs) { val = (*this % rhs).val; }
|
||||
};
|
||||
struct MLLd {
|
||||
ll val, mdl;
|
||||
MLLd(ll mdl, ll v = 0) : mdl(mdl), val(mod(v, mdl)) {}
|
||||
MLLd(const MLLd& other) : val(other.val) {}
|
||||
friend MLLd operator+(const MLLd& lhs, const MLLd& rhs) { return mod(lhs.val + rhs.val, lhs.mdl); }
|
||||
friend MLLd operator-(const MLLd& lhs, const MLLd& rhs) { return mod(lhs.val - rhs.val, lhs.mdl); }
|
||||
friend MLLd operator*(const MLLd& lhs, const MLLd& rhs) { return mod(lhs.val * rhs.val, lhs.mdl); }
|
||||
friend MLLd operator/(const MLLd& lhs, const MLLd& rhs) { return mod(lhs.val * mod(inverse(rhs.val, lhs.mdl), lhs.mdl), lhs.mdl); }
|
||||
friend MLLd operator%(const MLLd& lhs, const MLLd& rhs) { return mod(lhs.val - (lhs / rhs).val, lhs.mdl); }
|
||||
friend bool operator==(const MLLd& lhs, const MLLd& rhs) { return lhs.val == rhs.val; }
|
||||
friend bool operator!=(const MLLd& lhs, const MLLd& rhs) { return lhs.val != rhs.val; }
|
||||
void operator+=(const MLLd& rhs) { val = (*this + rhs).val; }
|
||||
void operator-=(const MLLd& rhs) { val = (*this - rhs).val; }
|
||||
void operator*=(const MLLd& rhs) { val = (*this * rhs).val; }
|
||||
void operator/=(const MLLd& rhs) { val = (*this / rhs).val; }
|
||||
void operator%=(const MLLd& rhs) { val = (*this % rhs).val; }
|
||||
};
|
||||
|
||||
template <ll mdl>
|
||||
ostream& operator<<(ostream& out, const MLL<mdl>& num) {
|
||||
return out << num.val;
|
||||
}
|
||||
|
||||
ostream& operator<<(ostream& out, const MLLd& num) {
|
||||
return out << num.val;
|
||||
}
|
||||
|
||||
template <ll mdl>
|
||||
istream& operator>>(istream& in, MLL<mdl>& num) {
|
||||
return in >> num.val;
|
||||
}
|
||||
|
||||
istream& operator>>(istream& in, MLLd& num) {
|
||||
return in >> num.val;
|
||||
}
|
||||
|
||||
// miscancellous
|
||||
template <typename Func, typename RandomIt> void sort_by_key(RandomIt first, RandomIt last, Func extractor) {
|
||||
std::sort(first, last, [&] (auto&& a, auto&& b) { return std::less<>()(extractor(a), extractor(b)); });
|
||||
}
|
||||
template <typename Func, typename RandomIt, typename Compare> void sort_by_key(RandomIt first, RandomIt last, Func extractor, Compare comp) {
|
||||
std::sort(first, last, [&] (auto&& a, auto&& b) { return comp(extractor(a), extractor(b)); });
|
||||
}
|
||||
template <typename T, typename U, typename Iterator_T, typename Iterator_U>
|
||||
vector<pair<T, U>> zip(Iterator_T a_first, Iterator_T a_last, Iterator_U b_first, Iterator_U b_last) {
|
||||
vector<pair<T, U>> res;
|
||||
auto a_it = a_first;
|
||||
auto b_it = b_first;
|
||||
for (; a_it != a_last and b_it != b_last; ++a_it, ++b_it) {
|
||||
res.emplace_back(*a_it, *b_it);
|
||||
}
|
||||
return res;
|
||||
}
|
||||
template <typename T, typename U, typename Iterator_T, typename Iterator_U>
|
||||
vector<pair<T, U>> zip_n(Iterator_T a_first, Iterator_U b_first, size_t n) {
|
||||
vector<pair<T, U>> res;
|
||||
if (n > 0) {
|
||||
res.emplace_back(*a_first, *b_first);
|
||||
for (size_t i = 1; i != n; ++i) {
|
||||
res.emplace_back(*++a_first, *++b_first);
|
||||
}
|
||||
}
|
||||
return res;
|
||||
}
|
||||
template <typename T>
|
||||
class ArithmeticIterator : bidirectional_iterator_tag {
|
||||
public:
|
||||
using difference_type = ptrdiff_t;
|
||||
using value_type = T;
|
||||
private:
|
||||
value_type value;
|
||||
public:
|
||||
ArithmeticIterator(const T& value) : value(value) {}
|
||||
value_type operator*() const { return value; }
|
||||
ArithmeticIterator<T>& operator++() { ++value; return *this; }
|
||||
ArithmeticIterator<T>& operator--() { --value; return *this; }
|
||||
bool operator==(const ArithmeticIterator<T>& rhs) const { return value == rhs.value; }
|
||||
};
|
||||
/////////////////////////////////////////////////////////
|
||||
|
||||
#define SINGLE_TEST_CASE
|
||||
// #define DUMP_TEST_CASE 7219
|
||||
// #define TOT_TEST_CASE 10000
|
||||
|
||||
void dump() {}
|
||||
|
||||
void dump_ignore() {}
|
||||
|
||||
constexpr int MAXN = 1e6 + 10;
|
||||
using mll = MLL<MDL>;
|
||||
mll fact[MAXN], pw2[MAXN], pw3[MAXN];
|
||||
void prep() {
|
||||
fact[0] = 1, pw2[0] = 1, pw3[0] = 1;
|
||||
for (int i = 1; i < MAXN; ++i) {
|
||||
fact[i] = fact[i - 1] * i;
|
||||
pw3[i] = pw3[i - 1] * 3;
|
||||
pw2[i] = pw2[i - 1] * 2;
|
||||
}
|
||||
}
|
||||
|
||||
mll comb(int n, int k) {
|
||||
if (n < 0 or k < 0 or n < k) return 0;
|
||||
return fact[n] / fact[k] / fact[n - k];
|
||||
}
|
||||
|
||||
int main() {
|
||||
prep();
|
||||
int t = 10;
|
||||
array<mll, 10> s;
|
||||
for (int i = 0; i < 10; ++i) {
|
||||
s[i] = 0;
|
||||
for (int j = 0; j <= i; ++j) {
|
||||
s[i] += comb(i, j) * pw3[t - j] * comb(t, j);
|
||||
}
|
||||
if (i >= 2) assert(s[i] == 1 + 10 * s[i - 1] / 9 - (i - 1) * comb(t, i - 2) / pw3[i]);
|
||||
}
|
||||
}
|
||||
|
|
|
|||
Loading…
Reference in New Issue