結果
| 問題 | No.1316 Maximum Minimum Spanning Tree |
| ユーザー |
 yosupot
|
| 提出日時 | 2020-12-13 17:45:23 |
| 言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 30,674 bytes |
| コンパイル時間 | 2,948 ms |
| コンパイル使用メモリ | 185,028 KB |
| 実行使用メモリ | 6,948 KB |
| 最終ジャッジ日時 | 2024-09-19 23:44:06 |
| 合計ジャッジ時間 | 5,618 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge3 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 2 ms
6,816 KB |
| testcase_01 | WA | - |
| testcase_02 | AC | 1 ms
6,940 KB |
| testcase_03 | AC | 2 ms
6,944 KB |
| testcase_04 | AC | 1 ms
6,940 KB |
| testcase_05 | WA | - |
| testcase_06 | AC | 2 ms
6,940 KB |
| testcase_07 | AC | 64 ms
6,940 KB |
| testcase_08 | WA | - |
| testcase_09 | AC | 12 ms
6,940 KB |
| testcase_10 | WA | - |
| testcase_11 | AC | 3 ms
6,940 KB |
| testcase_12 | WA | - |
| testcase_13 | AC | 2 ms
6,944 KB |
| testcase_14 | WA | - |
| testcase_15 | AC | 10 ms
6,944 KB |
| testcase_16 | WA | - |
| testcase_17 | AC | 9 ms
6,940 KB |
| testcase_18 | WA | - |
| testcase_19 | AC | 2 ms
6,940 KB |
| testcase_20 | WA | - |
| testcase_21 | AC | 2 ms
6,940 KB |
| testcase_22 | WA | - |
| testcase_23 | AC | 2 ms
6,940 KB |
| testcase_24 | WA | - |
| testcase_25 | AC | 2 ms
6,944 KB |
| testcase_26 | WA | - |
| testcase_27 | AC | 2 ms
6,944 KB |
| testcase_28 | WA | - |
| testcase_29 | AC | 2 ms
6,940 KB |
| testcase_30 | WA | - |
| testcase_31 | AC | 2 ms
6,944 KB |
| testcase_32 | WA | - |
| testcase_33 | AC | 2 ms
6,940 KB |
| testcase_34 | WA | - |
| testcase_35 | AC | 2 ms
6,944 KB |
| testcase_36 | WA | - |
| testcase_37 | AC | 2 ms
6,944 KB |
| testcase_38 | WA | - |
| testcase_39 | AC | 3 ms
6,940 KB |
| testcase_40 | WA | - |
| testcase_41 | AC | 2 ms
6,940 KB |
| testcase_42 | WA | - |
| testcase_43 | AC | 67 ms
6,940 KB |
| testcase_44 | WA | - |
| testcase_45 | AC | 13 ms
6,944 KB |
| testcase_46 | WA | - |
| testcase_47 | AC | 3 ms
6,940 KB |
| testcase_48 | WA | - |
| testcase_49 | AC | 3 ms
6,944 KB |
| testcase_50 | WA | - |
| testcase_51 | AC | 94 ms
6,940 KB |
| testcase_52 | WA | - |
| testcase_53 | AC | 16 ms
6,940 KB |
| testcase_54 | WA | - |
| testcase_55 | AC | 13 ms
6,944 KB |
| testcase_56 | AC | 17 ms
6,940 KB |
| testcase_57 | AC | 21 ms
6,940 KB |
| testcase_58 | AC | 20 ms
6,944 KB |
| testcase_59 | AC | 8 ms
6,944 KB |
| testcase_60 | AC | 12 ms
6,944 KB |
| testcase_61 | AC | 37 ms
6,944 KB |
| testcase_62 | AC | 14 ms
6,940 KB |
| testcase_63 | AC | 48 ms
6,940 KB |
| testcase_64 | AC | 16 ms
6,940 KB |
| testcase_65 | AC | 13 ms
6,940 KB |
| testcase_66 | AC | 16 ms
6,944 KB |
| testcase_67 | AC | 14 ms
6,940 KB |
| testcase_68 | AC | 18 ms
6,944 KB |
| testcase_69 | AC | 12 ms
6,940 KB |
| testcase_70 | AC | 18 ms
6,944 KB |
| testcase_71 | AC | 21 ms
6,944 KB |
| testcase_72 | AC | 24 ms
6,944 KB |
| testcase_73 | AC | 9 ms
6,940 KB |
| testcase_74 | AC | 17 ms
6,944 KB |
| testcase_75 | AC | 13 ms
6,940 KB |
| testcase_76 | AC | 12 ms
6,944 KB |
| testcase_77 | AC | 14 ms
6,944 KB |
| testcase_78 | AC | 14 ms
6,944 KB |
| testcase_79 | AC | 12 ms
6,940 KB |
| testcase_80 | AC | 14 ms
6,940 KB |
| testcase_81 | AC | 3 ms
6,944 KB |
ソースコード
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx")
//#undef LOCAL
#include <algorithm>
#include <cassert>
#include <vector>
namespace atcoder {
struct dsu {
public:
dsu() : _n(0) {}
dsu(int n) : _n(n), parent_or_size(n, -1) {}
int merge(int a, int b) {
assert(0 <= a && a < _n);
assert(0 <= b && b < _n);
int x = leader(a), y = leader(b);
if (x == y) return x;
if (-parent_or_size[x] < -parent_or_size[y]) std::swap(x, y);
parent_or_size[x] += parent_or_size[y];
parent_or_size[y] = x;
return x;
}
bool same(int a, int b) {
assert(0 <= a && a < _n);
assert(0 <= b && b < _n);
return leader(a) == leader(b);
}
int leader(int a) {
assert(0 <= a && a < _n);
if (parent_or_size[a] < 0) return a;
return parent_or_size[a] = leader(parent_or_size[a]);
}
int size(int a) {
assert(0 <= a && a < _n);
return -parent_or_size[leader(a)];
}
std::vector<std::vector<int>> groups() {
std::vector<int> leader_buf(_n), group_size(_n);
for (int i = 0; i < _n; i++) {
leader_buf[i] = leader(i);
group_size[leader_buf[i]]++;
}
std::vector<std::vector<int>> result(_n);
for (int i = 0; i < _n; i++) {
result[i].reserve(group_size[i]);
}
for (int i = 0; i < _n; i++) {
result[leader_buf[i]].push_back(i);
}
result.erase(
std::remove_if(result.begin(), result.end(),
[&](const std::vector<int>& v) { return v.empty(); }),
result.end());
return result;
}
private:
int _n;
std::vector<int> parent_or_size;
};
} // namespace atcoder
#include <algorithm>
#include <cassert>
#include <limits>
#include <queue>
#include <vector>
#include <vector>
namespace atcoder {
namespace internal {
template <class T> struct simple_queue {
std::vector<T> payload;
int pos = 0;
void reserve(int n) { payload.reserve(n); }
int size() const { return int(payload.size()) - pos; }
bool empty() const { return pos == int(payload.size()); }
void push(const T& t) { payload.push_back(t); }
T& front() { return payload[pos]; }
void clear() {
payload.clear();
pos = 0;
}
void pop() { pos++; }
};
} // namespace internal
} // namespace atcoder
namespace atcoder {
template <class Cap> struct mf_graph {
public:
mf_graph() : _n(0) {}
mf_graph(int n) : _n(n), g(n) {}
int add_edge(int from, int to, Cap cap) {
assert(0 <= from && from < _n);
assert(0 <= to && to < _n);
assert(0 <= cap);
int m = int(pos.size());
pos.push_back({from, int(g[from].size())});
int from_id = int(g[from].size());
int to_id = int(g[to].size());
if (from == to) to_id++;
g[from].push_back(_edge{to, to_id, cap});
g[to].push_back(_edge{from, from_id, 0});
return m;
}
struct edge {
int from, to;
Cap cap, flow;
};
edge get_edge(int i) {
int m = int(pos.size());
assert(0 <= i && i < m);
auto _e = g[pos[i].first][pos[i].second];
auto _re = g[_e.to][_e.rev];
return edge{pos[i].first, _e.to, _e.cap + _re.cap, _re.cap};
}
std::vector<edge> edges() {
int m = int(pos.size());
std::vector<edge> result;
for (int i = 0; i < m; i++) {
result.push_back(get_edge(i));
}
return result;
}
void change_edge(int i, Cap new_cap, Cap new_flow) {
int m = int(pos.size());
assert(0 <= i && i < m);
assert(0 <= new_flow && new_flow <= new_cap);
auto& _e = g[pos[i].first][pos[i].second];
auto& _re = g[_e.to][_e.rev];
_e.cap = new_cap - new_flow;
_re.cap = new_flow;
}
Cap flow(int s, int t) {
return flow(s, t, std::numeric_limits<Cap>::max());
}
Cap flow(int s, int t, Cap flow_limit) {
assert(0 <= s && s < _n);
assert(0 <= t && t < _n);
assert(s != t);
std::vector<int> level(_n), iter(_n);
internal::simple_queue<int> que;
auto bfs = [&]() {
std::fill(level.begin(), level.end(), -1);
level[s] = 0;
que.clear();
que.push(s);
while (!que.empty()) {
int v = que.front();
que.pop();
for (auto e : g[v]) {
if (e.cap == 0 || level[e.to] >= 0) continue;
level[e.to] = level[v] + 1;
if (e.to == t) return;
que.push(e.to);
}
}
};
auto dfs = [&](auto self, int v, Cap up) {
if (v == s) return up;
Cap res = 0;
int level_v = level[v];
for (int& i = iter[v]; i < int(g[v].size()); i++) {
_edge& e = g[v][i];
if (level_v <= level[e.to] || g[e.to][e.rev].cap == 0) continue;
Cap d =
self(self, e.to, std::min(up - res, g[e.to][e.rev].cap));
if (d <= 0) continue;
g[v][i].cap += d;
g[e.to][e.rev].cap -= d;
res += d;
if (res == up) return res;
}
level[v] = _n;
return res;
};
Cap flow = 0;
while (flow < flow_limit) {
bfs();
if (level[t] == -1) break;
std::fill(iter.begin(), iter.end(), 0);
Cap f = dfs(dfs, t, flow_limit - flow);
if (!f) break;
flow += f;
}
return flow;
}
std::vector<bool> min_cut(int s) {
std::vector<bool> visited(_n);
internal::simple_queue<int> que;
que.push(s);
while (!que.empty()) {
int p = que.front();
que.pop();
visited[p] = true;
for (auto e : g[p]) {
if (e.cap && !visited[e.to]) {
visited[e.to] = true;
que.push(e.to);
}
}
}
return visited;
}
private:
int _n;
struct _edge {
int to, rev;
Cap cap;
};
std::vector<std::pair<int, int>> pos;
std::vector<std::vector<_edge>> g;
};
} // namespace atcoder
#include <unistd.h>
#include <algorithm>
#include <array>
#include <cctype>
#include <cstring>
#include <string>
#include <type_traits>
#include <vector>
namespace yosupo {
namespace internal {
int ceil_pow2(int n) {
int x = 0;
while ((1U << x) < (unsigned int)(n)) x++;
return x;
}
} // namespace internal
int bsf(unsigned int n) { return __builtin_ctz(n); }
int bsf(unsigned long n) { return __builtin_ctzl(n); }
int bsf(unsigned long long n) { return __builtin_ctzll(n); }
int bsf(unsigned __int128 n) {
unsigned long long low = (unsigned long long)(n);
unsigned long long high = (unsigned long long)(n >> 64);
return low ? __builtin_ctzll(low) : 64 + __builtin_ctzll(high);
}
int bsr(unsigned int n) {
return 8 * (int)sizeof(unsigned int) - 1 - __builtin_clz(n);
}
int bsr(unsigned long n) {
return 8 * (int)sizeof(unsigned long) - 1 - __builtin_clzl(n);
}
int bsr(unsigned long long n) {
return 8 * (int)sizeof(unsigned long long) - 1 - __builtin_clzll(n);
}
int bsr(unsigned __int128 n) {
unsigned long long low = (unsigned long long)(n);
unsigned long long high = (unsigned long long)(n >> 64);
return high ? 127 - __builtin_clzll(high) : 63 - __builtin_ctzll(low);
}
} // namespace yosupo
#include <cassert>
#include <numeric>
#include <type_traits>
namespace yosupo {
namespace internal {
template <class T>
using is_signed_int128 =
typename std::conditional<std::is_same<T, __int128_t>::value ||
std::is_same<T, __int128>::value,
std::true_type,
std::false_type>::type;
template <class T>
using is_unsigned_int128 =
typename std::conditional<std::is_same<T, __uint128_t>::value ||
std::is_same<T, unsigned __int128>::value,
std::true_type,
std::false_type>::type;
template <class T>
using make_unsigned_int128 =
typename std::conditional<std::is_same<T, __int128_t>::value,
__uint128_t,
unsigned __int128>;
template <class T>
using is_integral =
typename std::conditional<std::is_integral<T>::value ||
internal::is_signed_int128<T>::value ||
internal::is_unsigned_int128<T>::value,
std::true_type,
std::false_type>::type;
template <class T>
using is_signed_int = typename std::conditional<(is_integral<T>::value &&
std::is_signed<T>::value) ||
is_signed_int128<T>::value,
std::true_type,
std::false_type>::type;
template <class T>
using is_unsigned_int =
typename std::conditional<(is_integral<T>::value &&
std::is_unsigned<T>::value) ||
is_unsigned_int128<T>::value,
std::true_type,
std::false_type>::type;
template <class T>
using to_unsigned = typename std::conditional<
is_signed_int128<T>::value,
make_unsigned_int128<T>,
typename std::conditional<std::is_signed<T>::value,
std::make_unsigned<T>,
std::common_type<T>>::type>::type;
template <class T>
using is_integral_t = std::enable_if_t<is_integral<T>::value>;
template <class T>
using is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;
template <class T>
using is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;
template <class T> using to_unsigned_t = typename to_unsigned<T>::type;
} // namespace internal
} // namespace yosupo
namespace yosupo {
struct Scanner {
public:
Scanner(FILE* fp) : fd(fileno(fp)) {}
void read() {}
template <class H, class... T> void read(H& h, T&... t) {
bool f = read_single(h);
assert(f);
read(t...);
}
int read_unsafe() { return 0; }
template <class H, class... T> int read_unsafe(H& h, T&... t) {
bool f = read_single(h);
if (!f) return 0;
return 1 + read_unsafe(t...);
}
private:
static constexpr size_t SIZE = 1 << 15;
bool read_single(std::string& ref) {
if (!skip_space()) return false;
ref = "";
while (true) {
char c = top();
if (c <= ' ') break;
ref += c;
st++;
}
return true;
}
bool read_single(double& ref) {
std::string s;
if (!read_single(s)) return false;
ref = std::stod(s);
return true;
}
template <class T, internal::is_signed_int_t<T>* = nullptr>
bool read_single(T& sref) {
using U = internal::to_unsigned_t<T>;
if (!skip_space(50)) return false;
bool neg = false;
if (line[st] == '-') {
neg = true;
st++;
}
U ref = 0;
do {
ref = 10 * ref + (line[st++] & 0x0f);
} while (line[st] >= '0');
sref = neg ? -ref : ref;
return true;
}
template <class U, internal::is_unsigned_int_t<U>* = nullptr>
bool read_single(U& ref) {
if (!skip_space(50)) return false;
ref = 0;
do {
ref = 10 * ref + (line[st++] & 0x0f);
} while (line[st] >= '0');
return true;
}
int fd = -1;
char line[SIZE];
size_t st = 0, ed = 0;
bool eof = false;
bool reread() {
if (ed - st >= 50) return true;
if (st > SIZE / 2) {
std::memmove(line, line + st, ed - st);
ed -= st;
st = 0;
}
if (eof) return false;
auto u = ::read(fd, line + ed, SIZE - ed);
if (u == 0) {
eof = true;
line[ed] = '\0';
u = 1;
}
ed += u;
return true;
}
char top() {
if (st == ed) {
bool f = reread();
assert(f);
}
return line[st];
}
bool skip_space(unsigned int token_len = 0) {
while (true) {
while (st != ed && line[st] <= ' ') st++;
if (ed - st > token_len) return true;
for (auto i = st; i < ed; i++) {
if (line[i] <= ' ') return true;
}
if (!reread()) return false;
}
}
};
struct Printer {
public:
template <bool F = false> void write() {}
template <bool F = false, class H, class... T>
void write(const H& h, const T&... t) {
if (F) write_single(' ');
write_single(h);
write<true>(t...);
}
template <class... T> void writeln(const T&... t) {
write(t...);
write_single('\n');
}
Printer(FILE* _fp) : fd(fileno(_fp)) {}
~Printer() { flush(); }
void flush() {
::write(fd, line, pos);
pos = 0;
}
private:
static std::array<std::array<char, 2>, 100> small;
static std::array<unsigned long long, 20> tens;
static int calc_len(unsigned long long x) {
int i = (bsr(x) * 3 + 3) / 10;
if (x < tens[i])
return i;
else
return i + 1;
}
static constexpr size_t SIZE = 1 << 15;
int fd;
char line[SIZE];
size_t pos = 0;
void write_single(const char& val) {
if (pos == SIZE) flush();
line[pos++] = val;
}
template <class T, internal::is_signed_int_t<T>* = nullptr>
void write_single(const T& val) {
using U = internal::to_unsigned_t<T>;
if (val == 0) {
write_single('0');
return;
}
if (pos > SIZE - 50) flush();
U uval = val;
if (val < 0) {
write_single('-');
uval = -uval;
}
write_unsigned(uval);
}
template <class U, internal::is_unsigned_int_t<U>* = nullptr>
void write_single(U uval) {
if (uval == 0) {
write_single('0');
return;
}
if (pos > SIZE - 50) flush();
write_unsigned(uval);
}
template <class U,
internal::is_unsigned_int_t<U>* = nullptr,
std::enable_if_t<sizeof(U) == 4>* = nullptr>
void write_unsigned(U uval) {
write_unsigned(uint64_t(uval));
}
template <class U,
internal::is_unsigned_int_t<U>* = nullptr,
std::enable_if_t<sizeof(U) == 8>* = nullptr>
void write_unsigned(U uval) {
size_t len = calc_len(uval);
pos += len;
char* ptr = line + pos;
while (uval >= 100) {
ptr -= 2;
memcpy(ptr, small[uval % 100].data(), 2);
uval /= 100;
}
if (uval >= 10) {
memcpy(ptr - 2, small[uval].data(), 2);
} else {
*(ptr - 1) = char('0' + uval);
}
}
template <class U, std::enable_if_t<internal::is_unsigned_int128<U>::value>* = nullptr>
void write_unsigned(U uval) {
std::string s;
if (uval == 0) s = "0";
else {
while (uval) {
s += char('0' + uval % 10);
uval /= 10;
}
reverse(s.begin(), s.end());
}
write_single(s);
}
void write_single(const std::string& s) {
for (char c : s) write_single(c);
}
void write_single(const char* s) {
size_t len = strlen(s);
for (size_t i = 0; i < len; i++) write_single(s[i]);
}
template <class T> void write_single(const std::vector<T>& val) {
auto n = val.size();
for (size_t i = 0; i < n; i++) {
if (i) write_single(' ');
write_single(val[i]);
}
}
};
std::array<std::array<char, 2>, 100> Printer::small = [] {
std::array<std::array<char, 2>, 100> table;
for (int i = 0; i <= 99; i++) {
table[i][1] = char('0' + (i % 10));
table[i][0] = char('0' + (i / 10 % 10));
}
return table;
}();
std::array<unsigned long long, 20> Printer::tens = [] {
std::array<unsigned long long, 20> table;
for (int i = 0; i < 20; i++) {
table[i] = 1;
for (int j = 0; j < i; j++) {
table[i] *= 10;
}
}
return table;
}();
} // namespace yosupo
#include <array>
#include <cassert>
#include <chrono>
#include <cstdint>
#include <type_traits>
namespace yosupo {
struct Xoshiro256StarStar {
public:
using result_type = uint64_t;
Xoshiro256StarStar() : Xoshiro256StarStar(0) {}
explicit Xoshiro256StarStar(uint64_t seed) {
for (int i = 0; i < 4; i++) {
uint64_t z = (seed += 0x9e3779b97f4a7c15);
z = (z ^ (z >> 30)) * 0xbf58476d1ce4e5b9;
z = (z ^ (z >> 27)) * 0x94d049bb133111eb;
s[i] = z ^ (z >> 31);
}
}
static constexpr result_type min() { return 0; }
static constexpr result_type max() { return -1; }
result_type operator()() {
const uint64_t result_starstar = rotl(s[1] * 5, 7) * 9;
const uint64_t t = s[1] << 17;
s[2] ^= s[0];
s[3] ^= s[1];
s[1] ^= s[2];
s[0] ^= s[3];
s[2] ^= t;
s[3] = rotl(s[3], 45);
return result_starstar;
}
private:
static uint64_t rotl(const uint64_t x, int k) {
return (x << k) | (x >> (64 - k));
}
std::array<uint64_t, 4> s;
};
namespace internal {
template <class G> uint64_t uniform(uint64_t upper, G& gen) {
static_assert(std::is_same<uint64_t, typename G::result_type>::value, "");
static_assert(G::min() == 0, "");
static_assert(G::max() == uint64_t(-1), "");
if (!(upper & (upper + 1))) {
return gen() & upper;
}
int log = bsr(upper);
uint64_t mask = (log == 63) ? ~0ULL : (1ULL << (log + 1)) - 1;
while (true) {
uint64_t r = gen() & mask;
if (r <= upper) return r;
}
}
} // namespace internal
Xoshiro256StarStar& global_gen() {
static Xoshiro256StarStar gen(
std::chrono::steady_clock::now().time_since_epoch().count());
return gen;
}
template <class T, class G> T uniform(T lower, T upper, G& gen) {
return T(lower + internal::uniform(uint64_t(upper) - uint64_t(lower), gen));
}
template <class T> T uniform(T lower, T upper) {
return uniform(lower, upper, global_gen());
}
template <class G> bool uniform_bool(G& gen) {
return internal::uniform(1, gen) == 1;
}
bool uniform_bool() { return uniform_bool(global_gen()); }
template <class T, class G>
std::pair<T, T> uniform_pair(T lower, T upper, G& gen) {
assert(upper - lower >= 1);
T a, b;
do {
a = uniform(lower, upper, gen);
b = uniform(lower, upper, gen);
} while (a == b);
if (a > b) std::swap(a, b);
return {a, b};
}
template <class T> std::pair<T, T> uniform_pair(T lower, T upper) {
return uniform_pair(lower, upper, global_gen());
}
} // namespace yosupo
using namespace atcoder;
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
#ifdef LOCAL
ostream& operator<<(ostream& os, __int128_t x) {
if (x < 0) {
os << "-";
x *= -1;
}
if (x == 0) {
return os << "0";
}
string s;
while (x) {
s += char(x % 10 + '0');
x /= 10;
}
reverse(s.begin(), s.end());
return os << s;
}
ostream& operator<<(ostream& os, __uint128_t x) {
if (x == 0) {
return os << "0";
}
string s;
while (x) {
s += char(x % 10 + '0');
x /= 10;
}
reverse(s.begin(), s.end());
return os << s;
}
template <class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p);
template <class T> ostream& operator<<(ostream& os, const V<T>& v);
template <class T> ostream& operator<<(ostream& os, const deque<T>& v);
template <class T, size_t N>
ostream& operator<<(ostream& os, const array<T, N>& a);
template <class T> ostream& operator<<(ostream& os, const set<T>& s);
template <class T, class U>
ostream& operator<<(ostream& os, const map<T, U>& m);
template <class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
return os << "P(" << p.first << ", " << p.second << ")";
}
template <class T> ostream& operator<<(ostream& os, const V<T>& v) {
os << "[";
bool f = false;
for (auto d : v) {
if (f) os << ", ";
f = true;
os << d;
}
return os << "]";
}
template <class T> ostream& operator<<(ostream& os, const deque<T>& v) {
os << "[";
bool f = false;
for (auto d : v) {
if (f) os << ", ";
f = true;
os << d;
}
return os << "]";
}
template <class T, size_t N>
ostream& operator<<(ostream& os, const array<T, N>& a) {
os << "[";
bool f = false;
for (auto d : a) {
if (f) os << ", ";
f = true;
os << d;
}
return os << "]";
}
template <class T> ostream& operator<<(ostream& os, const set<T>& s) {
os << "{";
bool f = false;
for (auto d : s) {
if (f) os << ", ";
f = true;
os << d;
}
return os << "}";
}
template <class T, class U>
ostream& operator<<(ostream& os, const map<T, U>& s) {
os << "{";
bool f = false;
for (auto p : s) {
if (f) os << ", ";
f = true;
os << p.first << ": " << p.second;
}
return os << "}";
}
struct PrettyOS {
ostream& os;
bool first;
template <class T> auto operator<<(T&& x) {
if (!first) os << ", ";
first = false;
os << x;
return *this;
}
};
template <class... T> void dbg0(T&&... t) {
(PrettyOS{cerr, true} << ... << t);
}
#define dbg(...) \
do { \
cerr << __LINE__ << " : " << #__VA_ARGS__ << " = "; \
dbg0(__VA_ARGS__); \
cerr << endl; \
} while (false);
#else
#define dbg(...)
#endif
auto sc = yosupo::Scanner(stdin);
auto pr = yosupo::Printer(stdout);
using cent = __int128;
struct E {
int from, to, idx;
cent c, d;
};
/*ostream& operator<<(ostream& os, const E& e) {
return os << "E(" << e.idx << ": " << e.from << "-" << e.to << ", " << e.c << ", " << e.d << ")";
}*/
int main() {
int n, m; cent K;
sc.read(n, m, K);
V<E> edges;
for (int i = 0; i < m; i++) {
int u, v;
cent c, d;
sc.read(u, v, c, d);
u--; v--;
edges.push_back({u, v, i, c, d});
}
V<cent> costs;
for (auto e : edges) {
costs.push_back(e.c);
}
sort(costs.begin(), costs.end());
costs.erase(unique(costs.begin(), costs.end()), costs.end());
int k = int(costs.size());
const cent INF = cent(TEN(18)) * cent(TEN(18));
cent offset = 0;
for (auto e : edges) {
offset += e.c * e.d;
}
auto answer = [&]() {
cent ans = offset;
V<int> idx(m);
iota(idx.begin(), idx.end(), 0);
sort(idx.begin(), idx.end(), [&](int a, int b) { return edges[a].c < edges[b].c; });
dsu d(n);
for (auto i : idx) {
auto e = edges[i];
ans -= e.c * e.d;
if (d.same(e.from, e.to)) continue;
d.merge(e.from, e.to);
ans += K * e.c;
}
return ans;
};
cent cur = answer();
for (int ph = 0; ph < k; ph++) {
cent now_c = costs[ph];
cent nx_c = (ph + 1 < k ? costs[ph + 1] : TEN(18));
dbg(now_c, nx_c);
while (true) {
dbg("CHECK");
bool update = false;
V<int> g2eid;
for (auto e : edges) {
if (e.c == now_c) {
g2eid.push_back(e.idx);
}
}
int l = int(g2eid.size());
V<int> eid2g(m, -1);
for (int i = 0; i < l; i++) {
eid2g[g2eid[i]] = i;
}
mf_graph<cent> mf_g(l + 2);
int sv = l, tv = sv + 1;
for (int i = 0; i < l; i++) {
mf_g.add_edge(sv, i, 100 * edges[g2eid[i]].d);
mf_g.add_edge(sv, i, 1);
}
dsu con(n);
for (auto e : edges) {
if (e.c < now_c) {
con.merge(e.from, e.to);
}
}
//extereme set
set<int> tr_idxs;
{
dsu now_con = con;
while (true) {
V<cent> deg(n);
V<int> rems;
using PE = pair<int, cent>;
VV<PE> g(n);
for (auto e : edges) {
if (e.c != now_c) continue;
int from = now_con.leader(e.from), to = now_con.leader(e.to);
if (from == to) continue;
rems.push_back(e.idx);
deg[from] += e.d;
deg[to] += e.d;
g[from].push_back({to, e.d});
g[to].push_back({from, e.d});
}
if (rems.empty()) break;
using P = pair<cent, int>;
priority_queue<P, V<P>, greater<P>> que;
for (int i = 0; i < n; i++) {
if (now_con.leader(i) != i) continue;
que.push({deg[i], i});
}
V<bool> vis(n);
V<int> ma_order;
while (que.size()) {
auto top = que.top(); que.pop();
int i = top.second;
if (vis[i]) continue;
vis[i] = true;
dbg(deg, vis, i);
ma_order.push_back(i);
for (auto e : g[i]) {
int to = e.first;
if (vis[to]) continue;
deg[to] -= e.second;
que.push({deg[to], to});
}
}
dbg(rems);
for (auto i : rems) {
auto e = edges[i];
dbg(e, now_con.leader(e.from), now_con.leader(e.to));
}
dbg(ma_order);
int u = ma_order.back();
ma_order.pop_back();
int v = ma_order.back();
assert(!now_con.same(u, v));
bool ok = false;
for (auto i : rems) {
auto e = edges[i];
int from = now_con.leader(e.from), to = now_con.leader(e.to);
if ((from == u && to == v) || (from == v && to == u)) {
ok = true;
tr_idxs.insert(e.idx);
break;
}
}
assert(ok);
now_con.merge(u, v);
}
}
using P = pair<int, int>;
VV<P> tr(n);
V<int> path;
auto dfs = [&](auto self, int s, int bk, int t) -> bool {
if (s == t) return true;
for (auto e : tr[s]) {
if (e.first == bk) continue;
if (self(self, e.first, s, t)) {
path.push_back(e.second);
return true;
}
}
return false;
};
dsu d(n);
for (auto i : tr_idxs) {
auto e = edges[i];
int from = con.leader(e.from), to = con.leader(e.to);
d.merge(from, to);
tr[from].push_back({to, e.idx});
tr[to].push_back({from, e.idx});
mf_g.add_edge(eid2g[e.idx], tv, K * 100);
}
for (auto i : g2eid) {
if (tr_idxs.count(i)) continue;
auto e = edges[i];
int from = con.leader(e.from), to = con.leader(e.to);
assert(d.same(from, to));
path.clear();
bool f = dfs(dfs, from, -1, to);
assert(f);
for (auto u : path) {
mf_g.add_edge(eid2g[i], eid2g[u], INF);
}
}
auto z = mf_g.flow(sv, tv, INF);
auto cut = mf_g.min_cut(sv);
dbg(z, cut, g2eid, eid2g);
for (int i = 0; i < l; i++) {
if (!cut[i]) {
if (nx_c == -1) {
pr.writeln(-1);
return 0;
}
edges[g2eid[i]].c = nx_c;
update = true;
}
}
if (!update) break;
cent nex = answer();
dbg(cur, nex);
assert(cur < nex);
cur = nex;
}
}
cent ans = offset;
sort(edges.begin(), edges.end(), [&](E a, E b) { return a.c < b.c; });
dsu d(n);
for (auto& e : edges) {
ans -= e.c * e.d;
if (d.same(e.from, e.to)) continue;
d.merge(e.from, e.to);
ans += K * e.c;
}
dbg(offset, ans, offset - ans);
pr.writeln(ans);
return 0;
}