結果
| 問題 | No.1776 Love Triangle 2 (Hard) |
| ユーザー |
 yosupot
|
| 提出日時 | 2021-12-05 03:52:17 |
| 言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 29,766 bytes |
| コンパイル時間 | 1,630 ms |
| コンパイル使用メモリ | 151,708 KB |
| 実行使用メモリ | 113,828 KB |
| 最終ジャッジ日時 | 2024-07-07 07:00:12 |
| 合計ジャッジ時間 | 39,033 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge1 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 83 ms
113,280 KB |
| testcase_01 | AC | 81 ms
113,152 KB |
| testcase_02 | AC | 79 ms
113,280 KB |
| testcase_03 | AC | 81 ms
113,524 KB |
| testcase_04 | AC | 553 ms
113,376 KB |
| testcase_05 | AC | 1,016 ms
113,536 KB |
| testcase_06 | AC | 1,004 ms
113,520 KB |
| testcase_07 | AC | 374 ms
113,280 KB |
| testcase_08 | AC | 680 ms
113,408 KB |
| testcase_09 | AC | 85 ms
113,492 KB |
| testcase_10 | WA | - |
| testcase_11 | AC | 87 ms
113,536 KB |
| testcase_12 | WA | - |
| testcase_13 | WA | - |
| testcase_14 | WA | - |
| testcase_15 | AC | 89 ms
113,480 KB |
| testcase_16 | AC | 91 ms
113,528 KB |
| testcase_17 | AC | 91 ms
113,336 KB |
| testcase_18 | AC | 112 ms
113,408 KB |
| testcase_19 | AC | 85 ms
113,408 KB |
| testcase_20 | AC | 85 ms
113,408 KB |
| testcase_21 | AC | 85 ms
113,408 KB |
| testcase_22 | WA | - |
| testcase_23 | AC | 84 ms
113,496 KB |
| testcase_24 | AC | 86 ms
113,512 KB |
| testcase_25 | WA | - |
| testcase_26 | AC | 88 ms
113,464 KB |
| testcase_27 | AC | 89 ms
113,536 KB |
| testcase_28 | AC | 85 ms
113,408 KB |
| testcase_29 | WA | - |
| testcase_30 | AC | 119 ms
113,488 KB |
| testcase_31 | AC | 134 ms
113,408 KB |
| testcase_32 | AC | 141 ms
113,408 KB |
| testcase_33 | AC | 138 ms
113,452 KB |
| testcase_34 | AC | 137 ms
113,484 KB |
| testcase_35 | AC | 131 ms
113,408 KB |
| testcase_36 | AC | 119 ms
113,408 KB |
| testcase_37 | AC | 116 ms
113,348 KB |
| testcase_38 | AC | 94 ms
113,280 KB |
| testcase_39 | AC | 107 ms
113,388 KB |
| testcase_40 | AC | 129 ms
113,408 KB |
| testcase_41 | AC | 133 ms
113,360 KB |
| testcase_42 | AC | 126 ms
113,536 KB |
| testcase_43 | AC | 114 ms
113,528 KB |
| testcase_44 | AC | 106 ms
113,536 KB |
| testcase_45 | AC | 132 ms
113,536 KB |
| testcase_46 | AC | 99 ms
113,532 KB |
| testcase_47 | AC | 85 ms
113,280 KB |
| testcase_48 | AC | 91 ms
113,536 KB |
| testcase_49 | AC | 90 ms
113,380 KB |
| testcase_50 | AC | 110 ms
113,484 KB |
| testcase_51 | WA | - |
| testcase_52 | WA | - |
| testcase_53 | WA | - |
| testcase_54 | WA | - |
| testcase_55 | WA | - |
| testcase_56 | WA | - |
| testcase_57 | WA | - |
| testcase_58 | WA | - |
| testcase_59 | WA | - |
| testcase_60 | AC | 118 ms
113,492 KB |
| testcase_61 | AC | 118 ms
113,408 KB |
| testcase_62 | AC | 100 ms
113,536 KB |
| testcase_63 | AC | 98 ms
113,436 KB |
| testcase_64 | AC | 98 ms
113,540 KB |
| testcase_65 | AC | 86 ms
113,408 KB |
| testcase_66 | AC | 89 ms
113,408 KB |
| testcase_67 | AC | 92 ms
113,536 KB |
| testcase_68 | WA | - |
| testcase_69 | AC | 1,727 ms
113,536 KB |
| testcase_70 | AC | 3,257 ms
113,604 KB |
| testcase_71 | AC | 3,280 ms
113,536 KB |
| testcase_72 | AC | 1,091 ms
113,664 KB |
| testcase_73 | AC | 2,190 ms
113,536 KB |
| testcase_74 | AC | 92 ms
113,408 KB |
| testcase_75 | AC | 91 ms
113,580 KB |
| testcase_76 | AC | 89 ms
113,640 KB |
| testcase_77 | WA | - |
| testcase_78 | AC | 90 ms
113,536 KB |
| testcase_79 | AC | 89 ms
113,448 KB |
| testcase_80 | AC | 91 ms
113,492 KB |
| testcase_81 | AC | 99 ms
113,620 KB |
| testcase_82 | AC | 111 ms
113,664 KB |
| testcase_83 | AC | 156 ms
113,408 KB |
| testcase_84 | AC | 92 ms
113,664 KB |
| testcase_85 | AC | 89 ms
113,536 KB |
| testcase_86 | AC | 91 ms
113,664 KB |
| testcase_87 | AC | 88 ms
113,476 KB |
| testcase_88 | AC | 89 ms
113,664 KB |
| testcase_89 | WA | - |
| testcase_90 | WA | - |
| testcase_91 | AC | 92 ms
113,576 KB |
| testcase_92 | AC | 89 ms
113,536 KB |
| testcase_93 | AC | 90 ms
113,584 KB |
| testcase_94 | WA | - |
| testcase_95 | AC | 184 ms
113,656 KB |
| testcase_96 | AC | 245 ms
113,448 KB |
| testcase_97 | AC | 291 ms
113,624 KB |
| testcase_98 | AC | 270 ms
113,408 KB |
| testcase_99 | AC | 265 ms
113,652 KB |
| testcase_100 | AC | 223 ms
113,508 KB |
| testcase_101 | AC | 180 ms
113,792 KB |
| testcase_102 | AC | 159 ms
113,536 KB |
| testcase_103 | AC | 167 ms
113,504 KB |
| testcase_104 | AC | 126 ms
113,644 KB |
| testcase_105 | AC | 163 ms
113,544 KB |
| testcase_106 | AC | 199 ms
113,572 KB |
| testcase_107 | AC | 114 ms
113,724 KB |
| testcase_108 | WA | - |
| testcase_109 | AC | 131 ms
113,620 KB |
| testcase_110 | AC | 100 ms
113,408 KB |
| testcase_111 | AC | 91 ms
113,512 KB |
| testcase_112 | AC | 74 ms
113,524 KB |
| testcase_113 | AC | 79 ms
113,664 KB |
| testcase_114 | WA | - |
| testcase_115 | WA | - |
| testcase_116 | WA | - |
| testcase_117 | WA | - |
| testcase_118 | WA | - |
| testcase_119 | WA | - |
| testcase_120 | WA | - |
| testcase_121 | WA | - |
| testcase_122 | WA | - |
| testcase_123 | WA | - |
| testcase_124 | AC | 126 ms
113,536 KB |
| testcase_125 | AC | 124 ms
113,664 KB |
| testcase_126 | AC | 141 ms
113,520 KB |
| testcase_127 | AC | 110 ms
113,536 KB |
| testcase_128 | AC | 99 ms
113,408 KB |
| testcase_129 | AC | 91 ms
113,472 KB |
| testcase_130 | AC | 89 ms
113,536 KB |
| testcase_131 | WA | - |
| testcase_132 | WA | - |
| testcase_133 | AC | 75 ms
113,676 KB |
| testcase_134 | WA | - |
| testcase_135 | WA | - |
| testcase_136 | WA | - |
| testcase_137 | WA | - |
| testcase_138 | WA | - |
| testcase_139 | WA | - |
| testcase_140 | WA | - |
| testcase_141 | WA | - |
| testcase_142 | WA | - |
| testcase_143 | WA | - |
| testcase_144 | WA | - |
| testcase_145 | WA | - |
| testcase_146 | WA | - |
| testcase_147 | WA | - |
| testcase_148 | WA | - |
| testcase_149 | WA | - |
| testcase_150 | WA | - |
| testcase_151 | WA | - |
| testcase_152 | WA | - |
| testcase_153 | WA | - |
| testcase_154 | WA | - |
| testcase_155 | WA | - |
| testcase_156 | WA | - |
| testcase_157 | WA | - |
| testcase_158 | WA | - |
| testcase_159 | WA | - |
| testcase_160 | WA | - |
| testcase_161 | WA | - |
| testcase_162 | WA | - |
| testcase_163 | WA | - |
| testcase_164 | WA | - |
| testcase_165 | WA | - |
| testcase_166 | WA | - |
| testcase_167 | WA | - |
| testcase_168 | WA | - |
| testcase_169 | WA | - |
| testcase_170 | WA | - |
| testcase_171 | WA | - |
| testcase_172 | WA | - |
| testcase_173 | WA | - |
| testcase_174 | WA | - |
| testcase_175 | WA | - |
ソースコード
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx")
//#undef LOCAL
#include <unistd.h>
#include <algorithm>
#include <array>
#include <cassert>
#include <cctype>
#include <cstring>
#include <sstream>
#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);
}
int popcnt(unsigned int n) { return __builtin_popcount(n); }
int popcnt(unsigned long n) { return __builtin_popcountl(n); }
int popcnt(unsigned long long n) { return __builtin_popcountll(n); }
} // 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(const Scanner&) = delete;
Scanner& operator=(const Scanner&) = delete;
Scanner(FILE* fp) : fd(fileno(fp)) { line[0] = 127; }
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...);
}
int close() { return ::close(fd); }
private:
static constexpr int SIZE = 1 << 15;
int fd = -1;
std::array<char, SIZE + 1> line;
int st = 0, ed = 0;
bool eof = false;
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,
std::enable_if_t<std::is_same<T, char>::value>* = nullptr>
bool read_single(T& ref) {
if (!skip_space<50>()) return false;
ref = top();
st++;
return true;
}
template <class T,
internal::is_signed_int_t<T>* = nullptr,
std::enable_if_t<!std::is_same<T, char>::value>* = 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,
std::enable_if_t<!std::is_same<U, char>::value>* = 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;
}
bool reread() {
if (ed - st >= 50) return true;
if (st > SIZE / 2) {
std::memmove(line.data(), line.data() + st, ed - st);
ed -= st;
st = 0;
}
if (eof) return false;
auto u = ::read(fd, line.data() + ed, SIZE - ed);
if (u == 0) {
eof = true;
line[ed] = '\0';
u = 1;
}
ed += int(u);
line[ed] = char(127);
return true;
}
char top() {
if (st == ed) {
bool f = reread();
assert(f);
}
return line[st];
}
template <int TOKEN_LEN = 0> bool skip_space() {
while (true) {
while (line[st] <= ' ') st++;
if (ed - st > TOKEN_LEN) return true;
if (st > ed) st = ed;
for (auto i = st; i < ed; i++) {
if (line[i] <= ' ') return true;
}
if (!reread()) return false;
}
}
};
struct Printer {
public:
template <char sep = ' ', bool F = false> void write() {}
template <char sep = ' ', bool F = false, class H, class... T>
void write(const H& h, const T&... t) {
if (F) write_single(sep);
write_single(h);
write<true>(t...);
}
template <char sep = ' ', class... T> void writeln(const T&... t) {
write<sep>(t...);
write_single('\n');
}
Printer(FILE* _fp) : fd(fileno(_fp)) {}
~Printer() { flush(); }
int close() {
flush();
return ::close(fd);
}
void flush() {
if (pos) {
auto res = ::write(fd, line.data(), pos);
assert(res != -1);
pos = 0;
}
}
private:
static std::array<std::array<char, 2>, 100> small;
static std::array<unsigned long long, 20> tens;
static constexpr size_t SIZE = 1 << 15;
int fd;
std::array<char, SIZE> line;
size_t pos = 0;
std::stringstream ss;
template <class T,
std::enable_if_t<std::is_same<char, T>::value>* = nullptr>
void write_single(const T& val) {
if (pos == SIZE) flush();
line[pos++] = val;
}
template <class T,
internal::is_signed_int_t<T>* = nullptr,
std::enable_if_t<!std::is_same<char, T>::value>* = 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>
static int calc_len(U x) {
int i = (bsr(x) * 3 + 3) / 10;
if (x < tens[i])
return i;
else
return i + 1;
}
template <class U,
internal::is_unsigned_int_t<U>* = nullptr,
std::enable_if_t<2 >= sizeof(U)>* = nullptr>
void write_unsigned(U uval) {
size_t len = calc_len(uval);
pos += len;
char* ptr = line.data() + 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,
internal::is_unsigned_int_t<U>* = nullptr,
std::enable_if_t<4 == sizeof(U)>* = nullptr>
void write_unsigned(U uval) {
std::array<char, 8> buf;
memcpy(buf.data() + 6, small[uval % 100].data(), 2);
memcpy(buf.data() + 4, small[uval / 100 % 100].data(), 2);
memcpy(buf.data() + 2, small[uval / 10000 % 100].data(), 2);
memcpy(buf.data() + 0, small[uval / 1000000 % 100].data(), 2);
if (uval >= 100000000) {
if (uval >= 1000000000) {
memcpy(line.data() + pos, small[uval / 100000000 % 100].data(),
2);
pos += 2;
} else {
line[pos] = char('0' + uval / 100000000);
pos++;
}
memcpy(line.data() + pos, buf.data(), 8);
pos += 8;
} else {
size_t len = calc_len(uval);
memcpy(line.data() + pos, buf.data() + (8 - len), len);
pos += len;
}
}
template <class U,
internal::is_unsigned_int_t<U>* = nullptr,
std::enable_if_t<8 == sizeof(U)>* = nullptr>
void write_unsigned(U uval) {
size_t len = calc_len(uval);
pos += len;
char* ptr = line.data() + 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) {
static std::array<char, 50> buf;
size_t len = 0;
while (uval > 0) {
buf[len++] = char((uval % 10) + '0');
uval /= 10;
}
std::reverse(buf.begin(), buf.begin() + len);
memcpy(line.data() + pos, buf.data(), len);
pos += len;
}
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 yosupo;
#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> ostream& operator<<(ostream& os, const multiset<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
struct Nimber64;
Nimber64 mul_naive(Nimber64 l, Nimber64 r);
struct Nimber64 {
const static V<ull> factor;
const static array<array<unsigned char, 256>, 256> small;
const static array<array<array<Nimber64, 256>, 8>, 8> precalc;
ull v;
Nimber64() : v(0) {}
Nimber64(ull _v) : v(_v) {}
const Nimber64 operator+(Nimber64 r) const { return v ^ r.v; }
const Nimber64 operator-(Nimber64 r) const { return v ^ r.v; }
const Nimber64 operator*(Nimber64 r) const {
Nimber64 ans;
for (int i = 0; i < 8; i++) {
for (int j = 0; j < 8; j++) {
ull x = (v >> (8 * i)) % 256;
ull y = (r.v >> (8 * j)) % 256;
ans += precalc[i][j][small[x][y]];
}
}
return ans;
}
const Nimber64 operator/(Nimber64 r) const {
auto ri = r.pow(ull(-1) - 1);
assert((r * ri) == Nimber64(1));
return (*this) * ri;
}
bool operator==(Nimber64 r) const { return v == r.v; }
bool operator!=(Nimber64 r) const { return v != r.v; }
Nimber64& operator+=(Nimber64 r) { return *this = *this + r; }
Nimber64& operator-=(Nimber64 r) { return *this = *this - r; }
Nimber64& operator*=(Nimber64 r) { return *this = *this * r; }
Nimber64& operator/=(Nimber64 r) { return *this = *this / r; }
Nimber64 pow(ull n) const {
Nimber64 x = *this, r = 1;
while (n) {
if (n & 1) r = r * x;
x = x * x;
n >>= 1;
}
return r;
}
ull discrete_logarithm(Nimber64 y) {
ull rem = 0, mod = 1;
for (ull p : factor) {
ull STEP = 1;
while (4 * STEP * STEP < p) STEP *= 2;
auto inside = [&](Nimber64 x, Nimber64 z) {
unordered_map<ull, int> mp;
Nimber64 big = 1; // x^m
for (int i = 0; i < int(STEP); i++) {
mp[z.v] = i;
z *= x;
big *= x;
}
Nimber64 now = 1;
for (ull step = 0; step < ull(p + 10); step += STEP) {
now *= big;
// check [step + 1, step + STEP]
if (mp.find(now.v) != mp.end()) {
return (step + STEP) - mp[now.v];
}
}
return ull(-1);
};
ull q = ull(-1) / p;
ull res = inside((*this).pow(q), y.pow(q));
if (res == ull(-1)) {
return ull(-1);
}
res %= p;
// mod p = v
if (mod == 1) {
rem = res;
mod = p;
} else {
while (rem % p != res) rem += mod;
mod *= p;
}
}
return rem;
}
bool is_primitive_root() const {
for (ull p : factor) {
if ((*this).pow(ull(-1) / p).v == 1) return false;
}
return true;
}
};
const V<ull> Nimber64::factor = {
6700417, 65537, 641, 257, 17, 5, 3,
};
Nimber64 mul_naive(Nimber64 l, Nimber64 r) {
ull a = l.v, b = r.v;
if (a < b) swap(a, b);
if (b == 0) return 0;
if (b == 1) return a;
int p = 32;
while (max(a, b) < (1ULL << p)) p /= 2;
ull power = 1ULL << p;
if (a >= power && b >= power) {
Nimber64 ans;
ans += mul_naive(a % power, b % power);
ans += mul_naive(a / power, b % power).v * power;
ans += mul_naive(a % power, b / power).v * power;
auto x = mul_naive(a / power, b / power);
ans += x.v * power;
ans += mul_naive(x.v, power / 2);
return ans;
} else {
return Nimber64(mul_naive(a / power, b).v * power) +
mul_naive(a % power, b);
}
};
const array<array<unsigned char, 256>, 256> Nimber64::small = []() {
array<array<unsigned char, 256>, 256> small;
for (int i = 0; i < 256; i++) {
for (int j = 0; j < 256; j++) {
small[i][j] = (unsigned char)(mul_naive(i, j).v);
}
}
return small;
}();
const array<array<array<Nimber64, 256>, 8>, 8> Nimber64::precalc = []() {
array<array<array<Nimber64, 256>, 8>, 8> precalc;
for (int i = 0; i < 8; i++) {
for (int j = 0; j < 8; j++) {
for (int k = 0; k < 256; k++) {
precalc[i][j][k] =
mul_naive(mul_naive(1ULL << (8 * i), 1ULL << (8 * j)), k);
}
}
}
return precalc;
}();
Scanner sc = Scanner(stdin);
Printer pr = Printer(stdout);
int naive(VV<bool> mp, int x, int y, int z) {
int n = int(mp.size());
V<int> idx(n);
iota(idx.begin(), idx.end(), 0);
int ans = n + 1;
do {
bool f0 = false, f1 = false, f2 = false;
for (int i = 0; i < n; i++) {
if (i && !mp[idx[i - 1]][idx[i]]) break;
if (idx[i] == x) f0 = true;
if (idx[i] == y) f1 = true;
if (idx[i] == z) f2 = true;
if (mp[idx[i]][idx[0]] && f0 && f1 && f2) {
ans = min(ans, i + 1);
}
}
} while (next_permutation(idx.begin(), idx.end()));
if (ans == n + 1) ans = -1;
return ans;
}
V<int> solve(VV<bool> mp, int x, int y, int z) {
int n = int(mp.size());
const int MN = 152;
Nimber64 dp[2][2][MN][MN][MN] = {};
VV<Nimber64> val(n, V<Nimber64>(n));
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
val[i][j] = val[j][i] = uniform<ull>(0, -1);
}
}
/*
dp[f][g][i][j][k]:
次の条件を満たすwalkを列挙、sum prod_{e in path} val[{e}]
- (y, z)は1度ずつ出てくる、xは始点と終点以外に出てこない
- (f, g)=(y, z)を通ったか
- walk: (x -> ... -> j -> k)
- walkは(x, y, z)を中点とする折返し(a -> (x or y or z) -> a)を含まない
- j = nはワイルドカード(= sum dp[f][g][i][*][k])
F_{2^p}ならサイクルがキャンセリングされる。最初から見ていき、初めて2度出てきた頂点ペアの間を反転する。
dp[true][true][i][x][*][x] != 0ならば答えi
*/
dp[0][0][0][n][x] += 1;
auto restore = [&](int len, int j, int k) {
bool f = true, g = true;
V<int> v;
v.push_back(j);
v.push_back(k);
for (int ph = len - 1; ph >= 0; ph--) {
for (int l = 0; l < n; l++) {
if (!mp[k][l]) continue;
if ((k == y || k == z) && l == j) continue;
if (!f && l == y) continue;
if (!g && l == z) continue;
dbg(f, g, j, k, l, dp[f][g][ph][l][k].v);
if (dp[f][g][ph][l][k] == Nimber64(0)) continue;
if (k == y) f = false;
if (k == z) g = false;
j = k;
k = l;
v.push_back(l);
break;
}
dbg(j, k);
}
return v;
};
for (int len = 0; len <= n; len++) {
for (int f = 0; f <= 1; f++) {
for (int g = 0; g <= 1; g++) {
for (int j = 0; j <= n; j++) {
for (int k = 0; k < n; k++) {
if (dp[f][g][len][j][k] == Nimber64(0)) continue;
bool wild_expect = (!(k == x || k == y || k == z) || len == 0);
bool wild_actual = (j == n);
if (wild_actual != wild_expect) continue;
if (len && f && g && k == x) {
return restore(len, x, j);
}
if (len && k == x) continue;
for (int l = 0; l < n; l++) {
if (!mp[k][l]) continue;
if ((k == y || k == z) && l == j) continue;
if (f && l == y) continue;
if (g && l == z) continue;
int nf = f || (l == y);
int ng = g || (l == z);
dp[nf][ng][len + 1][k][l] +=
dp[f][g][len][j][k] * val[k][l];
dp[nf][ng][len + 1][n][l] +=
dp[f][g][len][j][k] * val[k][l];
}
}
}
}
}
}
return {};
}
int main() {
int n, m;
sc.read(n, m);
VV<bool> mp(n, V<bool>(n, true));
for (int i = 0; i < n; i++) {
mp[i][i] = false;
}
int x, y, z;
sc.read(x, y, z);
x--; y--; z--;
for (int i = 0; i < m; i++) {
int a, b;
sc.read(a, b);
a--; b--;
mp[a][b] = mp[b][a] = false;
}
// int expect = naive(mp, x, y, z);
// int expect2 = solve_debug(mp, x, y, z);
auto answer = solve(mp, x, y, z);
// dbg(expect, expect2, answer);
if (answer.empty()) {
pr.writeln(-1);
return 0;
}
int len = int(answer.size() - 1);
pr.writeln(len);
for (int i = 0; i <= len; i++) {
pr.write(answer[i] + 1);
if (i != len) pr.write(' ');
}
pr.writeln();
/*
while (true) {
int n = uniform(3, 9);
VV<bool> mp(n, V<bool>(n, true));
for (int i = 0; i < n; i++) {
mp[i][i] = false;
}
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
if (uniform(0, 10) >= 2) {
mp[i][j] = mp[j][i] = false;
}
}
}
int expect = naive(mp, 0, 1, 2);
int actual = solve(mp, 0, 1, 2);
if (expect != actual) {
dbg(n);
for (auto v : mp) {
dbg(v);
}
dbg(expect, actual);
assert(false);
}
}
*/
return 0;
}