Submission #3771311
Source Code Expand
// #include <boost/functional/hash.hpp>
// #include <boost/multiprecision/cpp_int.hpp>
// using mlint = boost::multiprecision::cpp_int;
#include <cassert>
#include <deque>
#include <queue>
#include <stack>
#include <algorithm>
#include <iostream>
#include <set>
#include <map>
#include <list>
#include <cmath>
#include <complex>
#include <functional>
#include <random>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <iomanip>
using namespace std;
using i64 = int_fast64_t;
using db = double;
using pii = pair<int,int>;
using pli = pair<int_fast64_t,int>;
using pdi = pair<db,int>;
using plpii = pair<int_fast64_t,pair<int,int>>;
template <class T> using mat = vector<vector<T>>;
template <class T> using rprque = priority_queue<T,vector<T>,greater<T>>;
#define esc(x) cout << (x) << endl,exit(0)
#define inf(T) (numeric_limits<T>::max() / 2 - 1)
#define each(i,v) for(auto i = begin(v); i != end(v); ++i)
#define reach(i,v) for(auto i = rbegin(v); i != rend(v); ++i)
#define urep(i,s,t) for(int_fast64_t i = (s); i <= (t); ++i)
#define drep(i,s,t) for(int_fast64_t i = (s); i >= (t); --i)
#define rep(i,n) urep(i,0,(n) - 1)
#define rep1(i,n) urep(i,1,(n))
#define rrep(i,n) drep(i,(n) - 1,0)
#define all(v) begin(v),end(v)
#define rall(v) rbegin(v),rend(v)
#define vct vector
#define u_map unordered_map
#define u_set unordered_set
#define l_bnd lower_bound
#define u_bnd upper_bound
#define rsz resize
#define ers erase
#define emp emplace
#define emf emplace_front
#define emb emplace_back
#define pof pop_front
#define pob pop_back
#define mkp make_pair
#define mkt make_tuple
#define fir first
#define sec second
struct setupper {
setupper(uint_fast8_t prec) {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(prec);
#ifdef Local
#define debug 1
#define print(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
cout << "\n-- Execution At Local ---\n" << "\n<Standard Output>\n" << "\n----------------\n\n";
auto print_atexit = []() {
time_t end_time = time(NULL);
struct tm *ret = localtime(&end_time);
cout << "\n----------------\n";
cout << "\nSuccessfully Executed At " << (ret -> tm_hour) << ":" << (ret -> tm_min) << ":" << (ret -> tm_sec) << "\n\n";
};
atexit(print_atexit);
#endif
}
} setupper_obj(10);
template <class T, class U> ostream& operator << (ostream &s, pair<T,U> p) { return s << p.fir << " " << p.sec; }
template <class T> ostream& operator << (ostream &s, vector<T> &v) { for(auto i = v.begin(); i != v.end(); ++i) { if(i != begin(v)) s << " "; s << *i; } return s; }
template <class T> void hash_combine(size_t &seed, T const &key) {
hash<T> hasher;
seed ^= hasher(key) + 0x9e3779b9 + (seed << 6) + (seed >> 2);
}
namespace std {
template <class T, class U> struct hash<pair<T,U>> {
size_t operator()(pair<T,U> const &p) const {
size_t seed(0);
hash_combine(seed,p.first);
hash_combine(seed,p.second);
return seed;
}
};
template <class T, class U, class V> struct hash<tuple<T,U,V>> {
size_t operator()(tuple<T,U,V> const &t) const {
size_t seed(0);
hash_combine(seed,get<0>(t));
hash_combine(seed,get<1>(t));
hash_combine(seed,get<2>(t));
return seed;
}
};
}
const auto add = [](auto &x, auto y) { x += y; };
const auto mul = [](auto &x, auto y) { x *= y; };
const auto lam_min = [](auto x, auto y) { return min(x,y); };
const auto lam_max = [](auto x, auto y) { return max(x,y); };
const auto chmax = [](auto &m, auto x) { if(m < x){ m = x; return true; } return false; };
const auto chmin = [](auto &m, auto x) { if(m > x){ m = x; return true; } return false; };
bool odd(i64 x) { return x & 1; }
bool even(i64 x) { return !odd(x); }
bool parity(i64 x, i64 y) { return odd(x) ^ even(y); }
bool bit(i64 n, uint8_t e) { return n >> e & 1; }
i64 mask(i64 n, uint8_t e) { return n & ((1 << e) - 1); }
int ilog(i64 x, uint64_t b = 2) { if(x) return ilog(x / b, b) + 1; return -1; }
i64 qceil(i64 x, i64 y) { return x > 0 ? (x - 1) / y + 1 : x / y; }
i64 gcd(i64 a, i64 b) { if(!b) return abs(a); return gcd(b, a % b); }
i64 lcm(i64 a, i64 b) { if(a | b) return abs(a / gcd(a, b) * b); return 0; }
i64 extgcd(i64 a, i64 b, i64 &x, i64 &y) {
i64 d = a;
if(b) d = extgcd(b,a % b,y,x),y -= (a / b) * x;
else x = 1,y = 0;
return d;
}
template <class F> i64 binsr(i64 ok, i64 ng, const F &fn) { while(abs(ok - ng) > 1){ i64 mid = (ok + ng) / 2; (fn(mid) ? ok : ng) = mid; } return ok; }
template <class T> T cmprs(T &v) {
T tmp = v,ret = v; sort(all(tmp));
tmp.erase(unique(all(tmp)),end(tmp));
each(i,ret) *i = l_bnd(all(tmp),*i) - begin(tmp) + 1;
return ret;
}
constexpr int dx[9] = {1,0,-1,0,1,-1,-1,1,0};
constexpr int dy[9] = {0,1,0,-1,1,1,-1,-1,0};
constexpr i64 mod = 1e4 + 7;
constexpr db gold = 1.618033988;
constexpr db eps = 1e-15;
int n,m;
i64 dp[1<<17];
vct<int> par[17];
int main() {
cin>>n>>m;
rep(i,m) {
int x,y;
cin>>x>>y;
par[--y].emb(--x);
}
dp[0]=1;
rep(s,1<<n) {
if(s==(1<<n)-1) esc(dp[s]);
rep(j,n) {
if(bit(s,j)) continue;
bool fail=0;
for(int i:par[j]) if(!bit(s,i)) fail=1;
if(!fail) {
dp[s|1<<j]+=dp[s];
}
}
}
}
Submission Info
Submission Time |
|
Task |
D - 徒競走 |
User |
jell |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
5688 Byte |
Status |
AC |
Exec Time |
10 ms |
Memory |
768 KB |
Judge Result
Set Name |
Sample |
Subtask1 |
All |
Score / Max Score |
0 / 0 |
30 / 30 |
70 / 70 |
Status |
|
|
|
Set Name |
Test Cases |
Sample |
0_00.txt, 0_01.txt, 0_02.txt |
Subtask1 |
0_00.txt, 0_01.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt |
All |
0_00.txt, 0_01.txt, 0_02.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 2_00.txt, 2_01.txt, 2_02.txt, 2_03.txt, 2_04.txt, 2_05.txt, 2_06.txt, 2_07.txt, 2_08.txt, 2_09.txt, 2_10.txt, 2_11.txt, 2_12.txt, 2_13.txt, 2_14.txt, 2_15.txt |
Case Name |
Status |
Exec Time |
Memory |
0_00.txt |
AC |
1 ms |
256 KB |
0_01.txt |
AC |
1 ms |
256 KB |
0_02.txt |
AC |
6 ms |
768 KB |
1_00.txt |
AC |
1 ms |
256 KB |
1_01.txt |
AC |
1 ms |
256 KB |
1_02.txt |
AC |
1 ms |
256 KB |
1_03.txt |
AC |
1 ms |
256 KB |
1_04.txt |
AC |
1 ms |
256 KB |
1_05.txt |
AC |
1 ms |
256 KB |
1_06.txt |
AC |
1 ms |
256 KB |
1_07.txt |
AC |
1 ms |
256 KB |
1_08.txt |
AC |
1 ms |
256 KB |
1_09.txt |
AC |
1 ms |
256 KB |
1_10.txt |
AC |
1 ms |
256 KB |
1_11.txt |
AC |
1 ms |
256 KB |
1_12.txt |
AC |
1 ms |
256 KB |
2_00.txt |
AC |
6 ms |
768 KB |
2_01.txt |
AC |
10 ms |
768 KB |
2_02.txt |
AC |
9 ms |
768 KB |
2_03.txt |
AC |
7 ms |
768 KB |
2_04.txt |
AC |
4 ms |
512 KB |
2_05.txt |
AC |
5 ms |
512 KB |
2_06.txt |
AC |
4 ms |
512 KB |
2_07.txt |
AC |
5 ms |
512 KB |
2_08.txt |
AC |
7 ms |
768 KB |
2_09.txt |
AC |
8 ms |
768 KB |
2_10.txt |
AC |
7 ms |
768 KB |
2_11.txt |
AC |
9 ms |
768 KB |
2_12.txt |
AC |
6 ms |
768 KB |
2_13.txt |
AC |
7 ms |
768 KB |
2_14.txt |
AC |
6 ms |
768 KB |
2_15.txt |
AC |
6 ms |
768 KB |