Submission #1190395
Source Code Expand
/*** Template Begin ***/
#define USING_BOOST
#define USING_NAMESPACE
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
auto init_ = [] {
std::ios_base::sync_with_stdio(false);
std::cout << std::fixed;
return 0;
}();
template <typename T>
inline T in() {
T x;
std::cin >> x;
return x;
}
template <typename T>
inline void in(T &x) {
std::cin >> x;
}
template <typename T, typename... Ts>
inline void in(T &t, Ts &... ts) {
std::cin >> t;
in(ts...);
}
template <typename T, typename U = std::vector<T>>
inline U vin(int n) {
U v(n);
for (int i = 0; i < n; ++i) {
std::cin >> v[i];
}
return v;
}
template <typename T, typename U = std::vector<T>, typename V = std::vector<U>>
inline V vin(int h, int w) {
V vv(h, U(w));
for (int i = 0; i < h; ++i) {
for (int j = 0; j < w; ++j) {
std::cin >> vv[i][j];
}
}
return vv;
}
template <typename T>
inline void out(const T &x) {
std::cout << x << std::endl;
}
template <char delimiter = ' ', typename T, typename... Ts>
inline void out(const T &t, const Ts &... ts) {
std::cout << t << delimiter;
out(ts...);
}
template <char delimiter = ' ', typename T>
inline void vout(const T &v, int n) {
for (int i = 0; i < n; ++i) {
if (i) std::cout << delimiter;
std::cout << v[i];
}
std::cout << std::endl;
}
template <char delimiter = ' ', typename T>
inline void vout(const T &v, int h, int w) {
for (int i = 0; i < h; ++i) {
for (int j = 0; j < w; ++j) {
if (j) std::cout << delimiter;
std::cout << v[i][j];
}
std::cout << std::endl;
}
}
template <typename T, size_t D>
struct multi_vector_type {
using type = std::vector<typename multi_vector_type<T, D - 1>::type>;
};
template <typename T>
struct multi_vector_type<T, 1> {
using type = std::vector<T>;
};
template <typename T>
struct multi_vector_type<T, 0> {
using type = T;
};
template <typename T, size_t D>
using multi_vector = typename multi_vector_type<T, D>::type;
template <typename T, size_t D, class = typename std::enable_if<D == 0>::type>
T make_vector(const T &val = T()) {
return val;
}
template <typename T, size_t D = 1, typename... Ts,
class = typename std::enable_if<D != 0>::type>
multi_vector<T, D> make_vector(size_t n, Ts &&... args) {
return multi_vector<T, D>(n, make_vector<T, D - 1>(args...));
}
namespace detail {
template <typename F>
struct Debug {
const char *delim_ = "\n";
F fun;
Debug(F f) : fun(f) {}
~Debug() { fun(delim_); }
Debug &delim(const char *d) {
delim_ = d;
return *this;
}
};
std::deque<std::string> split(const std::string &s, char c) {
std::deque<std::string> v;
std::stringstream ss(s);
std::string x;
while (std::getline(ss, x, c)) v.emplace_back(x);
return v;
}
template <typename T>
void deb(const char *delim, std::deque<std::string> v, T a) {
std::cerr << v[0].substr(v[0][0] == ' ', v[0].length()) << " = " << a
<< '\n';
std::cerr << std::flush;
}
template <typename T, typename... Args>
void deb(const char *delim, std::deque<std::string> v, T a, Args... args) {
std::cerr << v[0].substr(v[0][0] == ' ', v[0].length()) << " = " << a
<< delim;
v.pop_front();
deb(delim, std::move(v), args...);
}
template <typename... Args>
auto wrap(std::deque<std::string> v, Args... args) {
auto f = [=](const char *delim = "\n") { deb(delim, v, args...); };
return Debug<decltype(f)>(f);
}
}
#define debug(args...) ::detail::wrap(::detail::split(#args, ','), args)
#ifdef USING_BOOST
#include <boost/math/common_factor.hpp>
#include <boost/range.hpp>
#include <boost/range/adaptors.hpp>
#include <boost/range/algorithm.hpp>
#include <boost/range/algorithm_ext.hpp>
#include <boost/range/irange.hpp>
#include <boost/range/numeric.hpp>
inline auto rep(int begin, int end) {
if (begin > end) {
return boost::irange(0, 0);
} else {
return boost::irange(begin, end);
}
}
inline auto rep(int begin, int end, int step) {
if ((step > 0 && begin > end) || (step < 0 && begin < end)) {
return boost::irange(0, 0, step);
} else {
return boost::irange(begin, end, step);
}
}
#endif
#ifdef USING_NAMESPACE
using namespace std;
#ifdef USING_BOOST
using namespace boost;
using namespace boost::adaptors;
#endif
#endif
/*** Template End ***/
#include <algorithm>
#include <iostream>
using namespace std;
const int mod = 1e9 + 7;
int x[5][5];
bool fix[25];
int memo[1 << 25];
int64_t dfs(int k, int state) {
if (k == 25) {
return 1;
}
if (memo[state] != -1) {
return memo[state];
}
int64_t res = 0;
for (int i : rep(0, 5)) {
for (int j : rep(0, 5)) {
if ((state >> (i * 5 + j)) & 1) {
continue;
}
int next_state = state | ((1 << (i * 5 + j)));
if (!fix[k] || x[i][j] == k + 1) {
if ((i == 0 || i == 4) && (j == 0 || j == 4)) {
res = (res + dfs(k + 1, next_state)) % mod;
} else if (i == 0 || i == 4) {
if (!(((state >> (i * 5 + j - 1)) ^
(state >> (i * 5 + j + 1))) &
1)) {
res = (res + dfs(k + 1, next_state)) % mod;
}
} else if (j == 0 || j == 4) {
if (!(((state >> ((i - 1) * 5 + j)) ^
(state >> ((i + 1) * 5 + j))) &
1)) {
res = (res + dfs(k + 1, next_state)) % mod;
}
} else {
if (!(((state >> ((i - 1) * 5 + j)) ^
(state >> ((i + 1) * 5 + j))) &
1) &&
!(((state >> (i * 5 + j - 1)) ^
(state >> (i * 5 + j + 1))) &
1)) {
res = (res + dfs(k + 1, next_state)) % mod;
}
}
}
}
}
memo[state] = res;
return res;
}
int main() {
fill(memo, -1);
for (int i : rep(0, 5)) {
for (int j : rep(0, 5)) {
in(x[i][j]);
fix[x[i][j] - 1] = true;
}
}
out(dfs(0, 0));
}
Submission Info
Submission Time |
|
Task |
D - 25個の整数 |
User |
mino |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
7182 Byte |
Status |
AC |
Exec Time |
391 ms |
Memory |
131328 KB |
Judge Result
Set Name |
Sample |
Subtask1 |
Subtask2 |
Score / Max Score |
0 / 0 |
30 / 30 |
70 / 70 |
Status |
|
|
|
Set Name |
Test Cases |
Sample |
sample-01.txt, sample-02.txt, sample-03.txt, sample-04.txt |
Subtask1 |
sample-01.txt, sample-02.txt, sample-03.txt, sample-04.txt, test-1-01.txt, test-1-02.txt, test-1-03.txt, test-1-04.txt, test-1-05.txt, test-1-06.txt, test-1-07.txt, test-1-08.txt, test-1-09.txt, test-1-10.txt, test-1-11.txt, test-1-12.txt, test-1-13.txt, test-1-14.txt, test-1-15.txt |
Subtask2 |
sample-01.txt, sample-02.txt, sample-03.txt, sample-04.txt, test-1-01.txt, test-1-02.txt, test-1-03.txt, test-1-04.txt, test-1-05.txt, test-1-06.txt, test-1-07.txt, test-1-08.txt, test-1-09.txt, test-1-10.txt, test-1-11.txt, test-1-12.txt, test-1-13.txt, test-1-14.txt, test-1-15.txt, test-2-01.txt, test-2-02.txt, test-2-03.txt, test-2-04.txt, test-2-05.txt, test-2-06.txt, test-2-07.txt, test-2-08.txt, test-2-09.txt, test-2-10.txt |
Case Name |
Status |
Exec Time |
Memory |
sample-01.txt |
AC |
39 ms |
131328 KB |
sample-02.txt |
AC |
199 ms |
131328 KB |
sample-03.txt |
AC |
39 ms |
131328 KB |
sample-04.txt |
AC |
39 ms |
131328 KB |
test-1-01.txt |
AC |
39 ms |
131328 KB |
test-1-02.txt |
AC |
39 ms |
131328 KB |
test-1-03.txt |
AC |
39 ms |
131328 KB |
test-1-04.txt |
AC |
40 ms |
131328 KB |
test-1-05.txt |
AC |
39 ms |
131328 KB |
test-1-06.txt |
AC |
40 ms |
131328 KB |
test-1-07.txt |
AC |
39 ms |
131328 KB |
test-1-08.txt |
AC |
40 ms |
131328 KB |
test-1-09.txt |
AC |
39 ms |
131328 KB |
test-1-10.txt |
AC |
39 ms |
131328 KB |
test-1-11.txt |
AC |
39 ms |
131328 KB |
test-1-12.txt |
AC |
41 ms |
131328 KB |
test-1-13.txt |
AC |
39 ms |
131328 KB |
test-1-14.txt |
AC |
41 ms |
131328 KB |
test-1-15.txt |
AC |
40 ms |
131328 KB |
test-2-01.txt |
AC |
50 ms |
131328 KB |
test-2-02.txt |
AC |
86 ms |
131328 KB |
test-2-03.txt |
AC |
40 ms |
131328 KB |
test-2-04.txt |
AC |
48 ms |
131328 KB |
test-2-05.txt |
AC |
154 ms |
131328 KB |
test-2-06.txt |
AC |
386 ms |
131328 KB |
test-2-07.txt |
AC |
118 ms |
131328 KB |
test-2-08.txt |
AC |
209 ms |
131328 KB |
test-2-09.txt |
AC |
391 ms |
131328 KB |
test-2-10.txt |
AC |
313 ms |
131328 KB |