結果
| 問題 | No.1775 Love Triangle 2 |
| ユーザー |
 maspy
|
| 提出日時 | 2022-10-24 06:59:03 |
| 言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
AC
|
| 実行時間 | 6,261 ms / 8,000 ms |
| コード長 | 21,781 bytes |
| コンパイル時間 | 4,010 ms |
| コンパイル使用メモリ | 270,168 KB |
| 実行使用メモリ | 8,788 KB |
| 最終ジャッジ日時 | 2024-07-02 13:48:22 |
| 合計ジャッジ時間 | 38,135 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge5 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 4 ms
7,556 KB |
| testcase_01 | AC | 4 ms
7,424 KB |
| testcase_02 | AC | 4 ms
7,572 KB |
| testcase_03 | AC | 5 ms
7,424 KB |
| testcase_04 | AC | 6,261 ms
8,668 KB |
| testcase_05 | AC | 6,206 ms
8,688 KB |
| testcase_06 | AC | 4,729 ms
8,744 KB |
| testcase_07 | AC | 765 ms
7,832 KB |
| testcase_08 | AC | 5,733 ms
8,788 KB |
| testcase_09 | AC | 5 ms
7,556 KB |
| testcase_10 | AC | 5 ms
7,624 KB |
| testcase_11 | AC | 5 ms
7,680 KB |
| testcase_12 | AC | 5 ms
7,808 KB |
| testcase_13 | AC | 6 ms
7,720 KB |
| testcase_14 | AC | 6 ms
7,804 KB |
| testcase_15 | AC | 13 ms
7,772 KB |
| testcase_16 | AC | 14 ms
7,736 KB |
| testcase_17 | AC | 23 ms
7,936 KB |
| testcase_18 | AC | 91 ms
8,448 KB |
| testcase_19 | AC | 5 ms
7,680 KB |
| testcase_20 | AC | 5 ms
7,660 KB |
| testcase_21 | AC | 5 ms
7,552 KB |
| testcase_22 | AC | 6 ms
7,680 KB |
| testcase_23 | AC | 7 ms
7,552 KB |
| testcase_24 | AC | 5 ms
7,640 KB |
| testcase_25 | AC | 6 ms
7,680 KB |
| testcase_26 | AC | 7 ms
7,552 KB |
| testcase_27 | AC | 6 ms
7,680 KB |
| testcase_28 | AC | 8 ms
7,808 KB |
| testcase_29 | AC | 149 ms
8,668 KB |
| testcase_30 | AC | 268 ms
8,560 KB |
| testcase_31 | AC | 434 ms
8,192 KB |
| testcase_32 | AC | 417 ms
7,980 KB |
| testcase_33 | AC | 303 ms
7,872 KB |
| testcase_34 | AC | 294 ms
8,000 KB |
| testcase_35 | AC | 191 ms
7,868 KB |
| testcase_36 | AC | 87 ms
7,808 KB |
| testcase_37 | AC | 27 ms
7,680 KB |
| testcase_38 | AC | 5 ms
7,612 KB |
| testcase_39 | AC | 195 ms
8,560 KB |
| testcase_40 | AC | 398 ms
8,392 KB |
| testcase_41 | AC | 384 ms
8,116 KB |
| testcase_42 | AC | 250 ms
7,928 KB |
| testcase_43 | AC | 152 ms
8,044 KB |
| testcase_44 | AC | 100 ms
8,064 KB |
| testcase_45 | AC | 218 ms
7,936 KB |
| testcase_46 | AC | 53 ms
7,680 KB |
| testcase_47 | AC | 11 ms
7,724 KB |
| testcase_48 | AC | 10 ms
7,680 KB |
| testcase_49 | AC | 105 ms
8,652 KB |
| testcase_50 | AC | 252 ms
8,680 KB |
| testcase_51 | AC | 427 ms
8,296 KB |
| testcase_52 | AC | 531 ms
8,192 KB |
| testcase_53 | AC | 313 ms
7,904 KB |
| testcase_54 | AC | 321 ms
7,936 KB |
| testcase_55 | AC | 233 ms
7,904 KB |
| testcase_56 | AC | 90 ms
7,740 KB |
| testcase_57 | AC | 30 ms
7,680 KB |
| testcase_58 | AC | 7 ms
7,684 KB |
| testcase_59 | AC | 240 ms
8,536 KB |
| testcase_60 | AC | 275 ms
8,320 KB |
| testcase_61 | AC | 308 ms
8,192 KB |
| testcase_62 | AC | 118 ms
8,008 KB |
| testcase_63 | AC | 105 ms
7,876 KB |
| testcase_64 | AC | 76 ms
7,864 KB |
| testcase_65 | AC | 16 ms
7,920 KB |
| testcase_66 | AC | 13 ms
7,704 KB |
| testcase_67 | AC | 8 ms
7,668 KB |
| testcase_68 | AC | 5 ms
7,668 KB |
| testcase_69 | AC | 5 ms
7,680 KB |
| testcase_70 | AC | 6 ms
7,528 KB |
| testcase_71 | AC | 6 ms
7,700 KB |
| testcase_72 | AC | 6 ms
7,680 KB |
| testcase_73 | AC | 6 ms
7,596 KB |
| testcase_74 | AC | 6 ms
7,680 KB |
| testcase_75 | AC | 6 ms
7,680 KB |
| testcase_76 | AC | 5 ms
7,760 KB |
| testcase_77 | AC | 6 ms
7,660 KB |
| testcase_78 | AC | 6 ms
7,552 KB |
| testcase_79 | AC | 7 ms
7,680 KB |
| testcase_80 | AC | 7 ms
7,472 KB |
| testcase_81 | AC | 7 ms
7,680 KB |
| testcase_82 | AC | 9 ms
7,536 KB |
| testcase_83 | AC | 9 ms
7,776 KB |
| testcase_84 | AC | 8 ms
7,568 KB |
| testcase_85 | AC | 8 ms
7,484 KB |
| testcase_86 | AC | 7 ms
7,488 KB |
| testcase_87 | AC | 8 ms
7,680 KB |
| testcase_88 | AC | 10 ms
7,632 KB |
| testcase_89 | AC | 6 ms
7,704 KB |
ソースコード
#line 1 "main.cpp"
#define PROBLEM "https://atcoder.jp/contests/abc274/tasks/abc274_h"
#line 1 "/home/maspy/compro/library/my_template.hpp"
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pi = pair<ll, ll>;
using vi = vector<ll>;
using u32 = unsigned int;
using u64 = unsigned long long;
using i128 = __int128;
template <class T>
using vc = vector<T>;
template <class T>
using vvc = vector<vc<T>>;
template <class T>
using vvvc = vector<vvc<T>>;
template <class T>
using vvvvc = vector<vvvc<T>>;
template <class T>
using vvvvvc = vector<vvvvc<T>>;
template <class T>
using pq = priority_queue<T>;
template <class T>
using pqg = priority_queue<T, vector<T>, greater<T>>;
#define vec(type, name, ...) vector<type> name(__VA_ARGS__)
#define vv(type, name, h, ...) \
vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define vvv(type, name, h, w, ...) \
vector<vector<vector<type>>> name( \
h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))
#define vvvv(type, name, a, b, c, ...) \
vector<vector<vector<vector<type>>>> name( \
a, vector<vector<vector<type>>>( \
b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))
// https://trap.jp/post/1224/
#define FOR1(a) for (ll _ = 0; _ < ll(a); ++_)
#define FOR2(i, a) for (ll i = 0; i < ll(a); ++i)
#define FOR3(i, a, b) for (ll i = a; i < ll(b); ++i)
#define FOR4(i, a, b, c) for (ll i = a; i < ll(b); i += (c))
#define FOR1_R(a) for (ll i = (a)-1; i >= ll(0); --i)
#define FOR2_R(i, a) for (ll i = (a)-1; i >= ll(0); --i)
#define FOR3_R(i, a, b) for (ll i = (b)-1; i >= ll(a); --i)
#define FOR4_R(i, a, b, c) for (ll i = (b)-1; i >= ll(a); i -= (c))
#define overload4(a, b, c, d, e, ...) e
#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)
#define FOR_R(...) \
overload4(__VA_ARGS__, FOR4_R, FOR3_R, FOR2_R, FOR1_R)(__VA_ARGS__)
#define FOR_subset(t, s) for (ll t = s; t >= 0; t = (t == 0 ? -1 : (t - 1) & s))
#define all(x) x.begin(), x.end()
#define len(x) ll(x.size())
#define elif else if
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define stoi stoll
template <typename T, typename U>
T SUM(const vector<U> &A) {
T sum = 0;
for (auto &&a: A) sum += a;
return sum;
}
#define MIN(v) *min_element(all(v))
#define MAX(v) *max_element(all(v))
#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))
#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())
int popcnt(int x) { return __builtin_popcount(x); }
int popcnt(u32 x) { return __builtin_popcount(x); }
int popcnt(ll x) { return __builtin_popcountll(x); }
int popcnt(u64 x) { return __builtin_popcountll(x); }
// (0, 1, 2, 3, 4) -> (-1, 0, 1, 1, 2)
int topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }
int topbit(u32 x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }
int topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }
int topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }
// (0, 1, 2, 3, 4) -> (-1, 0, 1, 0, 2)
int lowbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); }
int lowbit(u32 x) { return (x == 0 ? -1 : __builtin_ctz(x)); }
int lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }
int lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }
template <typename T>
T pick(deque<T> &que) {
T a = que.front();
que.pop_front();
return a;
}
template <typename T>
T pick(pq<T> &que) {
T a = que.top();
que.pop();
return a;
}
template <typename T>
T pick(pqg<T> &que) {
assert(que.size());
T a = que.top();
que.pop();
return a;
}
template <typename T>
T pick(vc<T> &que) {
assert(que.size());
T a = que.back();
que.pop_back();
return a;
}
template <typename T, typename U>
T ceil(T x, U y) {
return (x > 0 ? (x + y - 1) / y : x / y);
}
template <typename T, typename U>
T floor(T x, U y) {
return (x > 0 ? x / y : (x - y + 1) / y);
}
template <typename T, typename U>
pair<T, T> divmod(T x, U y) {
T q = floor(x, y);
return {q, x - q * y};
}
template <typename F>
ll binary_search(F check, ll ok, ll ng) {
assert(check(ok));
while (abs(ok - ng) > 1) {
auto x = (ng + ok) / 2;
tie(ok, ng) = (check(x) ? mp(x, ng) : mp(ok, x));
}
return ok;
}
template <typename F>
double binary_search_real(F check, double ok, double ng, int iter = 100) {
FOR(iter) {
double x = (ok + ng) / 2;
tie(ok, ng) = (check(x) ? mp(x, ng) : mp(ok, x));
}
return (ok + ng) / 2;
}
template <class T, class S>
inline bool chmax(T &a, const S &b) {
return (a < b ? a = b, 1 : 0);
}
template <class T, class S>
inline bool chmin(T &a, const S &b) {
return (a > b ? a = b, 1 : 0);
}
vc<int> s_to_vi(const string &S, char first_char) {
vc<int> A(S.size());
FOR(i, S.size()) { A[i] = S[i] - first_char; }
return A;
}
template <typename T, typename U>
vector<T> cumsum(vector<U> &A, int off = 1) {
int N = A.size();
vector<T> B(N + 1);
FOR(i, N) { B[i + 1] = B[i] + A[i]; }
if (off == 0) B.erase(B.begin());
return B;
}
template <typename CNT, typename T>
vc<CNT> bincount(const vc<T> &A, int size) {
vc<CNT> C(size);
for (auto &&x: A) { ++C[x]; }
return C;
}
// stable
template <typename T>
vector<int> argsort(const vector<T> &A) {
vector<int> ids(A.size());
iota(all(ids), 0);
sort(all(ids),
[&](int i, int j) { return A[i] < A[j] || (A[i] == A[j] && i < j); });
return ids;
}
// A[I[0]], A[I[1]], ...
template <typename T>
vc<T> rearrange(const vc<T> &A, const vc<int> &I) {
int n = len(I);
vc<T> B(n);
FOR(i, n) B[i] = A[I[i]];
return B;
}
#line 1 "/home/maspy/compro/library/other/io.hpp"
// based on yosupo's fastio
#include <unistd.h>
namespace detail {
template <typename T, decltype(&T::is_modint) = &T::is_modint>
std::true_type check_value(int);
template <typename T>
std::false_type check_value(long);
} // namespace detail
template <typename T>
struct is_modint : decltype(detail::check_value<T>(0)) {};
template <typename T>
using is_modint_t = enable_if_t<is_modint<T>::value>;
template <typename T>
using is_not_modint_t = enable_if_t<!is_modint<T>::value>;
struct Scanner {
FILE *fp;
char line[(1 << 15) + 1];
size_t st = 0, ed = 0;
void reread() {
memmove(line, line + st, ed - st);
ed -= st;
st = 0;
ed += fread(line + ed, 1, (1 << 15) - ed, fp);
line[ed] = '\0';
}
bool succ() {
while (true) {
if (st == ed) {
reread();
if (st == ed) return false;
}
while (st != ed && isspace(line[st])) st++;
if (st != ed) break;
}
if (ed - st <= 50) {
bool sep = false;
for (size_t i = st; i < ed; i++) {
if (isspace(line[i])) {
sep = true;
break;
}
}
if (!sep) reread();
}
return true;
}
template <class T, enable_if_t<is_same<T, string>::value, int> = 0>
bool read_single(T &ref) {
if (!succ()) return false;
while (true) {
size_t sz = 0;
while (st + sz < ed && !isspace(line[st + sz])) sz++;
ref.append(line + st, sz);
st += sz;
if (!sz || st != ed) break;
reread();
}
return true;
}
template <class T, enable_if_t<is_integral<T>::value, int> = 0>
bool read_single(T &ref) {
if (!succ()) return false;
bool neg = false;
if (line[st] == '-') {
neg = true;
st++;
}
ref = T(0);
while (isdigit(line[st])) { ref = 10 * ref + (line[st++] & 0xf); }
if (neg) ref = -ref;
return true;
}
template <class T, is_modint_t<T> * = nullptr>
bool read_single(T &ref) {
long long val = 0;
bool f = read_single(val);
ref = T(val);
return f;
}
bool read_single(double &ref) {
string s;
if (!read_single(s)) return false;
ref = std::stod(s);
return true;
}
bool read_single(char &ref) {
string s;
if (!read_single(s) || s.size() != 1) return false;
ref = s[0];
return true;
}
template <class T>
bool read_single(vector<T> &ref) {
for (auto &d: ref) {
if (!read_single(d)) return false;
}
return true;
}
template <class T, class U>
bool read_single(pair<T, U> &p) {
return (read_single(p.first) && read_single(p.second));
}
template <class A, class B, class C>
bool read_single(tuple<A, B, C> &p) {
return (read_single(get<0>(p)) && read_single(get<1>(p))
&& read_single(get<2>(p)));
}
template <class A, class B, class C, class D>
bool read_single(tuple<A, B, C, D> &p) {
return (read_single(get<0>(p)) && read_single(get<1>(p))
&& read_single(get<2>(p)) && read_single(get<3>(p)));
}
void read() {}
template <class H, class... T>
void read(H &h, T &... t) {
bool f = read_single(h);
assert(f);
read(t...);
}
Scanner(FILE *fp) : fp(fp) {}
};
struct Printer {
Printer(FILE *_fp) : fp(_fp) {}
~Printer() { flush(); }
static constexpr size_t SIZE = 1 << 15;
FILE *fp;
char line[SIZE], small[50];
size_t pos = 0;
void flush() {
fwrite(line, 1, pos, fp);
pos = 0;
}
void write(const char &val) {
if (pos == SIZE) flush();
line[pos++] = val;
}
template <class T, enable_if_t<is_integral<T>::value, int> = 0>
void write(T val) {
if (pos > (1 << 15) - 50) flush();
if (val == 0) {
write('0');
return;
}
if (val < 0) {
write('-');
val = -val; // todo min
}
size_t len = 0;
while (val) {
small[len++] = char(0x30 | (val % 10));
val /= 10;
}
for (size_t i = 0; i < len; i++) { line[pos + i] = small[len - 1 - i]; }
pos += len;
}
void write(const string &s) {
for (char c: s) write(c);
}
void write(const char *s) {
size_t len = strlen(s);
for (size_t i = 0; i < len; i++) write(s[i]);
}
void write(const double &x) {
ostringstream oss;
oss << fixed << setprecision(15) << x;
string s = oss.str();
write(s);
}
void write(const long double &x) {
ostringstream oss;
oss << fixed << setprecision(15) << x;
string s = oss.str();
write(s);
}
template <class T, is_modint_t<T> * = nullptr>
void write(T &ref) {
write(ref.val);
}
template <class T>
void write(const vector<T> &val) {
auto n = val.size();
for (size_t i = 0; i < n; i++) {
if (i) write(' ');
write(val[i]);
}
}
template <class T, class U>
void write(const pair<T, U> &val) {
write(val.first);
write(' ');
write(val.second);
}
template <class A, class B, class C>
void write(const tuple<A, B, C> &val) {
auto &[a, b, c] = val;
write(a), write(' '), write(b), write(' '), write(c);
}
template <class A, class B, class C, class D>
void write(const tuple<A, B, C, D> &val) {
auto &[a, b, c, d] = val;
write(a), write(' '), write(b), write(' '), write(c), write(' '), write(d);
}
template <class A, class B, class C, class D, class E>
void write(const tuple<A, B, C, D, E> &val) {
auto &[a, b, c, d, e] = val;
write(a), write(' '), write(b), write(' '), write(c), write(' '), write(d), write(' '), write(e);
}
template <class A, class B, class C, class D, class E, class F>
void write(const tuple<A, B, C, D, E, F> &val) {
auto &[a, b, c, d, e, f] = val;
write(a), write(' '), write(b), write(' '), write(c), write(' '), write(d), write(' '), write(e), write(' '), write(f);
}
template <class T, size_t S>
void write(const array<T, S> &val) {
auto n = val.size();
for (size_t i = 0; i < n; i++) {
if (i) write(' ');
write(val[i]);
}
}
void write(i128 val) {
string s;
bool negative = 0;
if(val < 0){
negative = 1;
val = -val;
}
while (val) {
s += '0' + int(val % 10);
val /= 10;
}
if(negative) s += "-";
reverse(all(s));
if (len(s) == 0) s = "0";
write(s);
}
};
Scanner scanner = Scanner(stdin);
Printer printer = Printer(stdout);
void flush() { printer.flush(); }
void print() { printer.write('\n'); }
template <class Head, class... Tail>
void print(Head &&head, Tail &&... tail) {
printer.write(head);
if (sizeof...(Tail)) printer.write(' ');
print(forward<Tail>(tail)...);
}
void read() {}
template <class Head, class... Tail>
void read(Head &head, Tail &... tail) {
scanner.read(head);
read(tail...);
}
#define INT(...) \
int __VA_ARGS__; \
read(__VA_ARGS__)
#define LL(...) \
ll __VA_ARGS__; \
read(__VA_ARGS__)
#define STR(...) \
string __VA_ARGS__; \
read(__VA_ARGS__)
#define CHAR(...) \
char __VA_ARGS__; \
read(__VA_ARGS__)
#define DBL(...) \
double __VA_ARGS__; \
read(__VA_ARGS__)
#define VEC(type, name, size) \
vector<type> name(size); \
read(name)
#define VV(type, name, h, w) \
vector<vector<type>> name(h, vector<type>(w)); \
read(name)
void YES(bool t = 1) { print(t ? "YES" : "NO"); }
void NO(bool t = 1) { YES(!t); }
void Yes(bool t = 1) { print(t ? "Yes" : "No"); }
void No(bool t = 1) { Yes(!t); }
void yes(bool t = 1) { print(t ? "yes" : "no"); }
void no(bool t = 1) { yes(!t); }
#line 2 "/home/maspy/compro/library/graph/base.hpp"
template <typename T>
struct Edge {
int frm, to;
T cost;
int id;
};
template <typename T = int, bool directed = false>
struct Graph {
int N, M;
using cost_type = T;
using edge_type = Edge<T>;
vector<edge_type> edges;
vector<int> indptr;
vector<edge_type> csr_edges;
vc<int> vc_deg, vc_indeg, vc_outdeg;
bool prepared;
class OutgoingEdges {
public:
OutgoingEdges(const Graph* G, int l, int r) : G(G), l(l), r(r) {}
const edge_type* begin() const {
if (l == r) { return 0; }
return &G->csr_edges[l];
}
const edge_type* end() const {
if (l == r) { return 0; }
return &G->csr_edges[r];
}
private:
const Graph* G;
int l, r;
};
bool is_prepared() { return prepared; }
constexpr bool is_directed() { return directed; }
Graph() : N(0), M(0), prepared(0) {}
Graph(int N) : N(N), M(0), prepared(0) {}
void resize(int n) { N = n; }
void add(int frm, int to, T cost = 1, int i = -1) {
assert(!prepared);
assert(0 <= frm && 0 <= to && to < N);
if (i == -1) i = M;
auto e = edge_type({frm, to, cost, i});
edges.eb(e);
++M;
}
// wt, off
void read_tree(bool wt = false, int off = 1) { read_graph(N - 1, wt, off); }
void read_graph(int M, bool wt = false, int off = 1) {
for (int m = 0; m < M; ++m) {
INT(a, b);
a -= off, b -= off;
if (!wt) {
add(a, b);
} else {
T c;
read(c);
add(a, b, c);
}
}
build();
}
void read_parent(int off = 1) {
for (int v = 1; v < N; ++v) {
INT(p);
p -= off;
add(p, v);
}
build();
}
void build() {
assert(!prepared);
prepared = true;
indptr.assign(N + 1, 0);
for (auto&& e: edges) {
indptr[e.frm + 1]++;
if (!directed) indptr[e.to + 1]++;
}
for (int v = 0; v < N; ++v) { indptr[v + 1] += indptr[v]; }
auto counter = indptr;
csr_edges.resize(indptr.back() + 1);
for (auto&& e: edges) {
csr_edges[counter[e.frm]++] = e;
if (!directed)
csr_edges[counter[e.to]++] = edge_type({e.to, e.frm, e.cost, e.id});
}
}
OutgoingEdges operator[](int v) const {
assert(prepared);
return {this, indptr[v], indptr[v + 1]};
}
vc<int> deg_array() {
if (vc_deg.empty()) calc_deg();
return vc_deg;
}
pair<vc<int>, vc<int>> deg_array_inout() {
if (vc_indeg.empty()) calc_deg_inout();
return {vc_indeg, vc_outdeg};
}
int deg(int v) {
if (vc_deg.empty()) calc_deg();
return vc_deg[v];
}
int in_deg(int v) {
if (vc_indeg.empty()) calc_deg_inout();
return vc_indeg[v];
}
int out_deg(int v) {
if (vc_outdeg.empty()) calc_deg_inout();
return vc_outdeg[v];
}
void debug() {
print("Graph");
if (!prepared) {
print("frm to cost id");
for (auto&& e: edges) print(e.frm, e.to, e.cost, e.id);
} else {
print("indptr", indptr);
print("frm to cost id");
FOR(v, N) for (auto&& e: (*this)[v]) print(e.frm, e.to, e.cost, e.id);
}
}
private:
void calc_deg() {
assert(vc_deg.empty());
vc_deg.resize(N);
for (auto&& e: edges) vc_deg[e.frm]++, vc_deg[e.to]++;
}
void calc_deg_inout() {
assert(vc_indeg.empty());
vc_indeg.resize(N);
vc_outdeg.resize(N);
for (auto&& e: edges) { vc_indeg[e.to]++, vc_outdeg[e.frm]++; }
}
};
#line 5 "main.cpp"
#line 2 "/home/maspy/compro/library/random/base.hpp"
u64 RNG_64() {
static uint64_t x_
= uint64_t(chrono::duration_cast<chrono::nanoseconds>(
chrono::high_resolution_clock::now().time_since_epoch())
.count())
* 10150724397891781847ULL;
x_ ^= x_ << 7;
return x_ ^= x_ >> 9;
}
u64 RNG(u64 lim) { return RNG_64() % lim; }
ll RNG(ll l, ll r) { return l + RNG_64() % (r - l); }
#line 1 "/home/maspy/compro/library/nt/GF2.hpp"
#pragma GCC target("pclmul", "sse2", "sse4.1")
#include <emmintrin.h>
#include <smmintrin.h>
#include <wmmintrin.h>
// 2^n 元体
template <int K>
struct GF2 {
// irreducible poly x^K + ...
static constexpr int POLY[65]
= {0, 0, 3, 3, 3, 5, 3, 3, 27, 3, 9, 5, 9, 27, 33, 3, 43,
9, 9, 39, 9, 5, 3, 33, 27, 9, 27, 39, 3, 5, 3, 9, 141, 75,
27, 5, 53, 63, 99, 17, 57, 9, 39, 89, 33, 27, 3, 33, 45, 113, 29,
75, 9, 71, 125, 71, 149, 17, 99, 123, 3, 39, 105, 3, 27};
static constexpr u64 mask() { return u64(-1) >> (64 - K); }
static u64 mul(u64 a, u64 b) {
static bool prepared = 0;
static u64 MEMO[8][65536];
if (!prepared) {
prepared = 1;
vc<u64> tmp(128);
tmp[0] = 1;
FOR(i, 127) {
tmp[i + 1] = tmp[i] << 1;
if (tmp[i] >> (K - 1) & 1) {
tmp[i + 1] ^= POLY[K];
tmp[i + 1] &= mask();
}
}
FOR(k, 8) {
MEMO[k][0] = 0;
FOR(i, 16) {
FOR(s, 1 << i) { MEMO[k][s | 1 << i] = MEMO[k][s] ^ tmp[16 * k + i]; }
}
}
}
const __m128i a_ = _mm_set_epi64x(0, a);
const __m128i b_ = _mm_set_epi64x(0, b);
const __m128i c_ = _mm_clmulepi64_si128(a_, b_, 0);
u64 lo = _mm_extract_epi64(c_, 0);
u64 hi = _mm_extract_epi64(c_, 1);
u64 x = 0;
x ^= MEMO[0][lo & 65535];
x ^= MEMO[1][(lo >> 16) & 65535];
x ^= MEMO[2][(lo >> 32) & 65535];
x ^= MEMO[3][(lo >> 48) & 65535];
x ^= MEMO[4][hi & 65535];
x ^= MEMO[5][(hi >> 16) & 65535];
x ^= MEMO[6][(hi >> 32) & 65535];
x ^= MEMO[7][(hi >> 48) & 65535];
return x;
}
u64 val;
constexpr GF2(const u64 val = 0) noexcept : val(val & mask()) {}
bool operator<(const GF2 &other) const {
return val < other.val;
} // To use std::map
GF2 &operator+=(const GF2 &p) {
val ^= p.val;
return *this;
}
GF2 &operator-=(const GF2 &p) {
val ^= p.val;
return *this;
}
GF2 &operator*=(const GF2 &p) {
val = mul(val, p.val);
return *this;
}
GF2 &operator/=(const GF2 &p) {
*this *= p.inverse();
return *this;
}
GF2 operator-() const { return GF2(-val); }
GF2 operator+(const GF2 &p) const { return GF2(*this) += p; }
GF2 operator-(const GF2 &p) const { return GF2(*this) -= p; }
GF2 operator*(const GF2 &p) const { return GF2(*this) *= p; }
GF2 operator/(const GF2 &p) const { return GF2(*this) /= p; }
bool operator==(const GF2 &p) const { return val == p.val; }
bool operator!=(const GF2 &p) const { return val != p.val; }
GF2 inverse() const { return pow((u64(1) << K) - 2); }
GF2 pow(u64 n) const {
GF2 ret(1), mul(val);
while (n > 0) {
if (n & 1) ret *= mul;
mul *= mul;
n >>= 1;
}
return ret;
}
};
#line 8 "main.cpp"
// https://epubs.siam.org/doi/10.1137/1.9781611973099.139
template <typename GT>
int min_cycle(GT& G, vc<int> use) {
assert(!G.is_directed());
const int N = G.N;
using F = GF2<64>;
assert(len(use) >= 2);
int s = use.back();
use.pop_back();
// 重み付き有向グラフに変形
// 始点の近くでは逆向きを違う重みにすることで、向き違いのキャンセリングを防ぐ
Graph<F, 1> H(G.N);
for (auto&& e: G.edges) {
F a = RNG_64();
F b = a;
if (e.frm == s || e.to == s) b = RNG_64();
H.add(e.frm, e.to, a);
H.add(e.to, e.frm, b);
}
H.build();
const int M = H.M;
int K = len(use);
vc<int> mask(N);
FOR(k, K) mask[use[k]] = 1 << k;
// [集合][最後の辺]
vv(F, dp, 1 << K, M);
for (auto&& e: H[s]) { dp[mask[e.to]][e.id] = e.cost; }
FOR(L, 2, N + 1) {
vv(F, newdp, 1 << K, M);
FOR(s, 1 << K) FOR(i, M) {
if (dp[s][i] == F(0)) continue;
int v = H.edges[i].to;
for (auto&& e: H[v]) {
if (e.id == (i ^ 1)) continue;
int t = s | mask[e.to];
if (mask[e.to] && s == t) continue;
newdp[t][e.id] += dp[s][i] * e.cost;
}
}
swap(dp, newdp);
int full = (1 << K) - 1;
F sm = 0;
FOR(i, M) {
if (H.edges[i].to == s) sm += dp[full][i];
}
if (sm != F(0)) return L;
}
return -1;
}
void solve() {
LL(N, M);
vv(bool, can, N, N, 1);
INT(X, Y, Z);
--X, --Y, --Z;
FOR(M) {
LL(a, b);
--a, --b;
can[a][b] = can[b][a] = 0;
}
Graph<bool, 0> G(N);
FOR(i, N) FOR(j, i) if (can[i][j]) G.add(i, j);
G.build();
vc<int> use = {X, Y, Z};
int ANS = min_cycle(G, use);
print(ANS);
}
signed main() {
cout << fixed << setprecision(15);
ll T = 1;
// LL(T);
FOR(T) solve();
return 0;
}