提出 #26772381
ソースコード 拡げる
#include <stdio.h>
#include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
// using Bint = boost::multiprecision::cpp_int;
#define ALL(v) (v).begin(), (v).end()
#define OVERLOAD4(_1, _2, _3, _4, name, ...) name
#define REP1(n) for(ll i=0;i<n;i++)
#define REP2(i, n) for(ll i=0;i<n;i++)
#define REP3(i, a, b) for(ll i=a;i<b;i++)
#define REP4(i, a, b, c) for(ll i=a;i<b;i+=c)
#define REP(...) OVERLOAD4(__VA_ARGS__, REP4, REP3, REP2, REP1)(__VA_ARGS__)
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll,ll> LP;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const int INF = 1000000000;
const ll LINF = 1000000000000000000;//1e18
const double PI = acos(-1.0);
const double EPS = 1e-10;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
inline constexpr ll ceil_div(const ll a, const ll b) {return (a + b - 1) / b - !!((a + b - 1) % b < 0);}// return ceil(a/b)
inline constexpr ll floor_div(const ll a, const ll b) {return a / b - !!(a % b < 0);}// return floor(a/b)
/* ----------------------- DEBUG FUNCTION ---------------------------- */
#define DUMPOUT cerr
void dump_function() { DUMPOUT << ' '; }
void dump_function(bool a) { DUMPOUT << a; }
void dump_function(int a) { DUMPOUT << a; }
void dump_function(long long a) { DUMPOUT << a; }
void dump_function(char a) { DUMPOUT << a; }
void dump_function(string &a) { DUMPOUT << a; }
void dump_function(double a) { DUMPOUT << a; }
template <class T> void dump_function(const vector<T> &);
template <class T, size_t size> void dump_function(const array<T, size> &);
template <class T, class L> void dump_function(const pair<T, L> &p);
template <class T, size_t size> void dump_function(const T (&)[size]);
template <class T> void dump_function(const vector<T> &a) {
if(a.empty()) return;
dump_function(a[0]);
for(auto i = a.begin(); ++i != a.end();) {
DUMPOUT << " ";
dump_function(*i);
}
DUMPOUT << endl;
}
template <class T> void dump_function(const deque<T> &a) {
if(a.empty()) return;
dump_function(a[0]);
for(auto i = a.begin(); ++i != a.end();) {
DUMPOUT << " ";
dump_function(*i);
}
}
template <class T, size_t size> void dump_function(const array<T, size> &a) {
dump_function(a[0]);
for(auto i = a.begin(); ++i != a.end();) {
DUMPOUT << " ";
dump_function(*i);
}
}
template <class T, class L> void dump_function(const pair<T, L> &p) {
DUMPOUT << '(';
dump_function(p.first);
DUMPOUT << ",";
dump_function(p.second);
DUMPOUT << ')';
}
template <class T> void dump_function(set<T> &x) {
for(auto e : x) dump_function(e), DUMPOUT << " ";
DUMPOUT << endl;
}
template <class T> void dump_function(multiset<T> &x) {
for(auto e : x) dump_function(e), DUMPOUT << " ";
DUMPOUT << endl;
}
template <class T, size_t size> void dump_function(const T (&a)[size]) {
dump_function(a[0]);
for(auto i = a; ++i != end(a);) {
DUMPOUT << " ";
dump_function(*i);
}
}
template <class T> void dump_function(const T &a) { DUMPOUT << a; }
int dump_out() {
DUMPOUT << '\n';
return 0;
}
template <class T> int dump_out(const T &t) {
dump_function(t);
DUMPOUT << '\n';
return 0;
}
template <class Head, class... Tail> int dump_out(const Head &head, const Tail &... tail) {
dump_function(head);
DUMPOUT << ' ';
dump_out(tail...);
return 0;
}
#ifdef DEBUG_
#define dump(x) \
DUMPOUT << #x << ": "; \
dump_function(x); \
DUMPOUT << endl;
void dumps() {}
template <class T> void dumps(const T &t) {
dump_function(t);
DUMPOUT << " ";
}
template <class Head, class... Tail> void dumps(const Head &head, const Tail &... tail) {
dump_function(head);
DUMPOUT << ' ';
dump_out(tail...);
}
#else
#define dump(x)
template <class... T> void dumps(const T &...) {}
#endif
/* ----------------------- DEBUG FUNCTION ---------------------------- */
template<int MOD> struct Fp {
long long val;
constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
if (val < 0) val += MOD;
}
constexpr int getmod() const { return MOD; }
constexpr Fp operator - () const noexcept {
return val ? MOD - val : 0;
}
constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }
constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }
constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }
constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }
constexpr Fp& operator += (const Fp& r) noexcept {
val += r.val;
if (val >= MOD) val -= MOD;
return *this;
}
constexpr Fp& operator -= (const Fp& r) noexcept {
val -= r.val;
if (val < 0) val += MOD;
return *this;
}
constexpr Fp& operator *= (const Fp& r) noexcept {
val = val * r.val % MOD;
return *this;
}
constexpr Fp& operator /= (const Fp& r) noexcept {
long long a = r.val, b = MOD, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b, swap(a, b);
u -= t * v, swap(u, v);
}
val = val * u % MOD;
if (val < 0) val += MOD;
return *this;
}
constexpr bool operator == (const Fp& r) const noexcept {
return this->val == r.val;
}
constexpr bool operator != (const Fp& r) const noexcept {
return this->val != r.val;
}
friend constexpr istream& operator >> (istream& is, Fp<MOD>& x) noexcept {
is >> x.val;
x.val %= MOD;
if (x.val < 0) x.val += MOD;
return is;
}
friend constexpr ostream& operator << (ostream& os, const Fp<MOD>& x) noexcept {
return os << x.val;
}
friend constexpr Fp<MOD> modpow(const Fp<MOD>& r, long long n) noexcept {
if (n == 0) return 1;
auto t = modpow(r, n / 2);
t = t * t;
if (n & 1) t = t * r;
return t;
}
friend constexpr Fp<MOD> modinv(const Fp<MOD>& r) noexcept {
long long a = r.val, b = MOD, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b, swap(a, b);
u -= t * v, swap(u, v);
}
return Fp<MOD>(u);
}
};
template<class T> struct BiCoef {
vector<T> fact_, inv_, finv_;
constexpr BiCoef() {}
constexpr BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) {
init(n);
}
constexpr void init(int n) noexcept {
fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);
int MOD = fact_[0].getmod();
for(int i = 2; i < n; i++){
fact_[i] = fact_[i-1] * i;
inv_[i] = -inv_[MOD%i] * (MOD/i);
finv_[i] = finv_[i-1] * inv_[i];
}
}
constexpr T nCr(int n, int k) const noexcept {
if (n < k || n < 0 || k < 0) return 0;
int MOD = fact_[0].getmod();
if(n < MOD) return fact_[n] * finv_[k] * finv_[n-k];
// Lucasの定理
T ret = 1;
while(n || k){
int _n = n % MOD, _k = k % MOD;
n /= MOD;
k /= MOD;
ret *= nCr(_n, _k);
}
return ret;
}
constexpr T nPr(int n, int k) const noexcept {
if (n < k || n < 0 || k < 0) return 0;
return fact_[n] * finv_[n-k];
}
constexpr T nHr(int n, int k) const noexcept {
if (n <= 0 || k < 0) return 0;
return nCr(n + k - 1, k);
}
constexpr T fact(int n) const noexcept {
if (n < 0) return 0;
return fact_[n];
}
constexpr T inv(int n) const noexcept {
if (n < 0) return 0;
return inv_[n];
}
constexpr T finv(int n) const noexcept {
if (n < 0) return 0;
return finv_[n];
}
};
/* ----------------------------- MOD ----------------------------------- */
const int MOD = 1000000007;
const int MOD2 = 998244353;
using mint = Fp<MOD2>;
BiCoef<mint> bc;
// using vec = vector<int>;
// using mat = vector<vec>;
/* ----------------------------- MOD ----------------------------------- */
/* ----------------------- AtCoder Library ---------------------------- */
// #include <atcoder/all>
// using namespace atcoder;
/* ----------------------- AtCoder Library ---------------------------- */
void solve(){
int M;
cin >> M;
vector<vector<int>> g(9);
REP(i,M){
int u, v;
cin >> u >> v;
--u, --v;
g[u].emplace_back(v);
g[v].emplace_back(u);
}
vector<int> p(8);
vector<int> koma(9);
vector<int> correct(9);
REP(i,8){
cin >> p[i];
--p[i];
koma[p[i]] = i+1;
}
map<vector<int>, ll> mp;
// auto dfs = [&](auto && self, ll cnt, vector<int> &koma) -> void{
// if(mp.count(koma)) return;
// dump(koma);
// mp[koma] = cnt;
// int v = -1;
// REP(i,9) if(koma[i] == 0) v = i;
// for(auto nv : g[v]){
// swap(koma[nv], koma[v]);
// self(self, cnt+1, koma);
// swap(koma[nv], koma[v]);
// }
// return;
// };
// dfs(dfs, 0, koma);
queue<pair<int, vector<int>>> q;
// mp[koma] = 0;
q.emplace(0, koma);
while(!q.empty()){
auto [cnt, ko] = q.front(); q.pop();
if(mp.count(ko)) continue;
mp[ko] = cnt;
int v = -1;
REP(i,9) if(ko[i] == 0) v = i;
for(auto nv : g[v]){
swap(ko[nv], ko[v]);
if(!mp.count(ko)){
q.emplace(cnt+1, ko);
}
swap(ko[nv], ko[v]);
}
}
vector<int> idx(9);
iota(idx.begin(), idx.end(), 1);
idx.back() = 0;
if(mp.count(idx)) cout << mp[idx] << endl;
else cout << -1 << endl;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
solve();
// int T; cin >> T; REP(t,T) solve();
}
提出情報
ジャッジ結果
| セット名 |
Sample |
All |
| 得点 / 配点 |
0 / 0 |
400 / 400 |
| 結果 |
|
|
| セット名 |
テストケース |
| Sample |
example0.txt, example1.txt, example2.txt, example3.txt |
| All |
000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt, 011.txt, 012.txt, 013.txt, 014.txt, 015.txt, 016.txt, 017.txt, 018.txt, 019.txt, 020.txt, 021.txt, 022.txt, 023.txt, 024.txt, 025.txt, 026.txt, 027.txt, 028.txt, 029.txt, 030.txt, 031.txt, 032.txt, 033.txt, 034.txt, 035.txt, 036.txt, 037.txt, 038.txt, 039.txt, 040.txt, 041.txt, example0.txt, example1.txt, example2.txt, example3.txt |
| ケース名 |
結果 |
実行時間 |
メモリ |
| 000.txt |
AC |
8 ms |
3576 KiB |
| 001.txt |
AC |
3 ms |
3580 KiB |
| 002.txt |
AC |
2141 ms |
79944 KiB |
| 003.txt |
AC |
2246 ms |
79496 KiB |
| 004.txt |
AC |
2219 ms |
79832 KiB |
| 005.txt |
AC |
2389 ms |
79964 KiB |
| 006.txt |
AC |
2296 ms |
80080 KiB |
| 007.txt |
AC |
452 ms |
26404 KiB |
| 008.txt |
AC |
451 ms |
26488 KiB |
| 009.txt |
AC |
466 ms |
26500 KiB |
| 010.txt |
AC |
461 ms |
26448 KiB |
| 011.txt |
AC |
468 ms |
26360 KiB |
| 012.txt |
AC |
465 ms |
26428 KiB |
| 013.txt |
AC |
454 ms |
26508 KiB |
| 014.txt |
AC |
469 ms |
26508 KiB |
| 015.txt |
AC |
3 ms |
3508 KiB |
| 016.txt |
AC |
3 ms |
3584 KiB |
| 017.txt |
AC |
2 ms |
3608 KiB |
| 018.txt |
AC |
2 ms |
3536 KiB |
| 019.txt |
AC |
2 ms |
3512 KiB |
| 020.txt |
AC |
3 ms |
3620 KiB |
| 021.txt |
AC |
958 ms |
48932 KiB |
| 022.txt |
AC |
953 ms |
49024 KiB |
| 023.txt |
AC |
956 ms |
48872 KiB |
| 024.txt |
AC |
915 ms |
49028 KiB |
| 025.txt |
AC |
3 ms |
3520 KiB |
| 026.txt |
AC |
2 ms |
3580 KiB |
| 027.txt |
AC |
2 ms |
3608 KiB |
| 028.txt |
AC |
2 ms |
3604 KiB |
| 029.txt |
AC |
2 ms |
3580 KiB |
| 030.txt |
AC |
4 ms |
3504 KiB |
| 031.txt |
AC |
3 ms |
3604 KiB |
| 032.txt |
AC |
1780 ms |
52512 KiB |
| 033.txt |
AC |
1439 ms |
50340 KiB |
| 034.txt |
AC |
1848 ms |
53836 KiB |
| 035.txt |
AC |
1536 ms |
53456 KiB |
| 036.txt |
AC |
1396 ms |
51520 KiB |
| 037.txt |
AC |
3 ms |
3552 KiB |
| 038.txt |
AC |
5 ms |
3632 KiB |
| 039.txt |
AC |
2 ms |
3492 KiB |
| 040.txt |
AC |
2 ms |
3556 KiB |
| 041.txt |
AC |
2 ms |
3516 KiB |
| example0.txt |
AC |
2 ms |
3608 KiB |
| example1.txt |
AC |
3 ms |
3504 KiB |
| example2.txt |
AC |
480 ms |
26392 KiB |
| example3.txt |
AC |
477 ms |
26348 KiB |