結果
| 問題 | No.2522 Fall in love, Girls! |
| ユーザー |
 siganai
|
| 提出日時 | 2023-10-27 23:11:48 |
| 言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
AC
|
| 実行時間 | 930 ms / 2,000 ms |
| コード長 | 10,943 bytes |
| コンパイル時間 | 3,005 ms |
| コンパイル使用メモリ | 222,620 KB |
| 実行使用メモリ | 46,196 KB |
| 最終ジャッジ日時 | 2024-09-25 15:09:34 |
| 合計ジャッジ時間 | 8,743 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge1 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 17 ms
11,020 KB |
| testcase_01 | AC | 17 ms
11,044 KB |
| testcase_02 | AC | 17 ms
11,096 KB |
| testcase_03 | AC | 930 ms
15,244 KB |
| testcase_04 | AC | 16 ms
11,152 KB |
| testcase_05 | AC | 17 ms
11,092 KB |
| testcase_06 | AC | 21 ms
14,280 KB |
| testcase_07 | AC | 24 ms
19,788 KB |
| testcase_08 | AC | 27 ms
20,668 KB |
| testcase_09 | AC | 41 ms
46,156 KB |
| testcase_10 | AC | 123 ms
46,180 KB |
| testcase_11 | AC | 40 ms
46,088 KB |
| testcase_12 | AC | 42 ms
46,016 KB |
| testcase_13 | AC | 125 ms
46,172 KB |
| testcase_14 | AC | 915 ms
46,056 KB |
| testcase_15 | AC | 916 ms
46,196 KB |
| testcase_16 | AC | 891 ms
46,196 KB |
| testcase_17 | AC | 74 ms
45,460 KB |
| testcase_18 | AC | 58 ms
46,068 KB |
| testcase_19 | AC | 59 ms
45,792 KB |
| testcase_20 | AC | 51 ms
44,672 KB |
| testcase_21 | AC | 54 ms
42,752 KB |
| testcase_22 | AC | 49 ms
44,032 KB |
| testcase_23 | AC | 59 ms
44,416 KB |
| testcase_24 | AC | 71 ms
36,496 KB |
| testcase_25 | AC | 45 ms
38,784 KB |
| testcase_26 | AC | 37 ms
30,036 KB |
| testcase_27 | AC | 34 ms
25,984 KB |
| testcase_28 | AC | 22 ms
14,208 KB |
| testcase_29 | AC | 42 ms
34,816 KB |
| testcase_30 | AC | 77 ms
44,088 KB |
| testcase_31 | AC | 49 ms
34,944 KB |
| testcase_32 | AC | 35 ms
28,160 KB |
| testcase_33 | AC | 46 ms
40,832 KB |
ソースコード
#line 1 "main.cpp"
//#pragma GCC target("avx,avx2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#define debug(...) (static_cast<void>(0))
#endif
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using pii = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vpii = vector<pii>;
using vpll = vector<pll>;
using vs = vector<string>;
template<class T> using pq = priority_queue<T, vector<T>, greater<T>>;
#define overload4(_1, _2, _3, _4, name, ...) name
#define overload3(a,b,c,name,...) name
#define rep1(n) for (ll UNUSED_NUMBER = 0; UNUSED_NUMBER < (n); ++UNUSED_NUMBER)
#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 rrep1(n) for(ll i = (n) - 1;i >= 0;i--)
#define rrep2(i,n) for(ll i = (n) - 1;i >= 0;i--)
#define rrep3(i,a,b) for(ll i = (b) - 1;i >= (a);i--)
#define rrep4(i,a,b,c) for(ll i = (a) + ((b)-(a)-1) / (c) * (c);i >= (a);i -= c)
#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)
#define all1(i) begin(i) , end(i)
#define all2(i,a) begin(i) , begin(i) + a
#define all3(i,a,b) begin(i) + a , begin(i) + b
#define all(...) overload3(__VA_ARGS__, all3, all2, all1)(__VA_ARGS__)
#define sum(...) accumulate(all(__VA_ARGS__),0LL)
template<class T> bool chmin(T &a, const T &b){ if(a > b){ a = b; return 1; } else return 0; }
template<class T> bool chmax(T &a, const T &b){ if(a < b){ a = b; return 1; } else return 0; }
template<class T> auto min(const T& a){return *min_element(all(a));}
template<class T> auto max(const T& a){return *max_element(all(a));}
template<class... Ts> void in(Ts&... t);
#define INT(...) int __VA_ARGS__; in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__; in(__VA_ARGS__)
#define STR(...) string __VA_ARGS__; in(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__; in(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__; in(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__; in(__VA_ARGS__)
#define VEC(type, name, size) vector<type> name(size); in(name)
#define VV(type, name, h, w) vector<vector<type>> name(h, vector<type>(w)); in(name)
ll intpow(ll a, ll b){ ll ans = 1; while(b){if(b & 1) ans *= a; a *= a; b /= 2;} return ans;}
ll modpow(ll a, ll b, ll p){ ll ans = 1; a %= p;if(a < 0) a += p;while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
ll GCD(ll a,ll b) { if(a == 0 || b == 0) return 0; if(a % b == 0) return b; else return GCD(b,a%b);}
ll LCM(ll a,ll b) { if(a == 0) return b; if(b == 0) return a;return a / GCD(a,b) * b;}
void Yes() {cout << "Yes\n";return;}
void No() {cout << "No\n";return;}
void YES() {cout << "YES\n";return;}
void NO() {cout << "NO\n";return;}
namespace IO{
#define VOID(a) decltype(void(a))
struct setting{ setting(){cin.tie(nullptr); ios::sync_with_stdio(false);fixed(cout); cout.precision(12);}} setting;
template<int I> struct P : P<I-1>{};
template<> struct P<0>{};
template<class T> void i(T& t){ i(t, P<3>{}); }
void i(vector<bool>::reference t, P<3>){ int a; i(a); t = a; }
template<class T> auto i(T& t, P<2>) -> VOID(cin >> t){ cin >> t; }
template<class T> auto i(T& t, P<1>) -> VOID(begin(t)){ for(auto&& x : t) i(x); }
template<class T, size_t... idx> void ituple(T& t, index_sequence<idx...>){in(get<idx>(t)...);}
template<class T> auto i(T& t, P<0>) -> VOID(tuple_size<T>{}){ituple(t, make_index_sequence<tuple_size<T>::value>{});}
#undef VOID
}
#define unpack(a) (void)initializer_list<int>{(a, 0)...}
template<class... Ts> void in(Ts&... t){ unpack(IO :: i(t)); }
#undef unpack
static const double PI = 3.1415926535897932;
template <class F> struct REC {
F f;
REC(F &&f_) : f(forward<F>(f_)) {}
template <class... Args> auto operator()(Args &&...args) const { return f(*this, forward<Args>(args)...); }};
constexpr int mod = 998244353;
//constexpr int mod = 1000000007;
#line 2 "library/modint/Modint.hpp"
template <int mod>
struct Modint{
int x;
Modint():x(0) {}
Modint(long long y): x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
Modint &operator += (const Modint &p) {
if((x += p.x) >= mod) x -= mod;
return *this;}
Modint &operator -= (const Modint &p) {
if ((x += mod - p.x) >= mod) x -= mod;
return *this;}
Modint &operator *= (const Modint &p) {
x = (int)(1LL * x * p.x % mod);
return *this;}
Modint &operator /= (const Modint &p) {
*this *= p.inverse();
return *this;}
Modint operator -() const{return Modint(-x);}
Modint operator +(const Modint &p) const {return Modint(*this) += p;}
Modint operator -(const Modint &p) const {return Modint(*this) -= p;}
Modint operator *(const Modint &p) const {return Modint(*this) *= p;}
Modint operator /(const Modint &p) const {return Modint(*this) /= p;}
Modint &operator ++() {if(x == mod - 1) x = 0; else x++; return *this;}
Modint &operator --() {if(x == 0) x = mod - 1; else x--; return *this;}
bool operator == (const Modint &p) const {return x == p.x;}
bool operator != (const Modint &p) const {return x != p.x;}
Modint inverse() const {
int a = x, b = mod, u = 1, v = 0, t;
while (b > 0) {
t = a / b;
swap(a -= t * b, b);
swap(u -= t * v, v);
}
return Modint(u);}
Modint pow(long long n) const {
Modint ret(1), mul(x);
while (n > 0) {
if (n & 1) ret *= mul;
mul *= mul;
n >>= 1;
}
return ret;}
friend ostream &operator<<(ostream &os, const Modint &p) { return os << p.x; }
friend istream &operator>>(istream &is, Modint &a) {
long long t;
is >> t;
a = Modint<mod>(t);
return (is);
}
int get() const { return x; }
static constexpr int get_mod() {return mod;}
};
#line 90 "main.cpp"
using mint = Modint<mod>;
using vm = vector<mint>;
using vvm = vector<vm>;
using vvvm = vector<vvm>;
#line 2 "library/graph/graph-template.hpp"
template <typename T>
struct Edge {
int from, to;
T cost;
Edge() = default;
Edge(int _to, T _cost) : from(-1), to(_to), cost(_cost) {}
Edge(int _from, int _to, T _cost) : from(_from), to(_to), cost(_cost) {}
bool operator < (const Edge &a) const { return cost < a.cost; }
bool operator > (const Edge &a) const { return cost > a.cost; }
Edge &operator = (const int &x) {
to = x;
return *this;
}
operator int() const { return to; }
friend ostream operator<<(ostream &os, Edge &edge) { return os << edge.to; }
};
template <typename T>
using Edges = vector<Edge<T>>;
template <typename T>
using Wgraph = vector<Edges<T>>;
using Ugraph = vector<vector<int>>;
Ugraph uinput(int N, int M = -1, bool is_directed = false, int origin = 1) {
Ugraph g(N);
if (M == -1) M = N - 1;
while(M--) {
int a,b;
cin >> a >> b;
a -= origin, b -= origin;
g[a].push_back(b);
if(!is_directed) g[b].push_back(a);
}
return g;
}
template <typename T>
Wgraph<T> winput(int N, int M = -1, bool is_directed = false,int origin = 1) {
Wgraph<T> g(N);
if (M == -1) M = N - 1;
while(M--) {
int a,b;
T c;
cin >> a >> b >> c;
a -= origin, b -= origin;
g[a].emplace_back(b,c);
if(!is_directed) g[b].emplace_back(a,c);
}
return g;
}
#line 3 "library/graph/cycledetection.hpp"
//自己ループは判定しない
template <typename G>
vector<pair<int,int>> cycleditection(const G &g,bool directed = true) {
vector<int> pidx(g.size(),-1),vis(g.size());
vector<pair<int,int>> cycle;
int fin = 0;
auto dfs = [&](auto rec,int cur,int pval,int par) -> int {
pidx[cur] = pval;
vis[cur] = 1;
for(auto &dst:g[cur]) {
if(fin) return -1;
if(!directed && dst == par) continue;
if(pidx[dst] == pidx[cur]) {
cycle.emplace_back(cur,dst);
return dst;
}
if(vis[dst]) continue;
int nx = rec(rec,dst,pval,cur);
if(nx != -1) {
cycle.emplace_back(cur,dst);
if(cur == nx) {
fin = 1;
return -1;
}
return nx;
}
}
pidx[cur] = -1;
return -1;
};
for(int i = 0;i < (int)g.size();i++) {
if(vis[i])continue;
dfs(dfs,i,i,-1);
}
if(fin) {
reverse(begin(cycle),end(cycle));
return cycle;
}
return vector<pair<int,int>> {};
}
#line 95 "main.cpp"
vector<mint> fact, fact_inv;
void make_fact(int n){
fact.resize(n+1), fact_inv.resize(n+1);
fact[0] = mint(1); rep(i,1,n+1) fact[i] = fact[i-1] * mint(i);
fact_inv[n] = fact[n].inverse(); rrep(i,0,n) fact_inv[i] = fact_inv[i+1] * mint(i+1);
}
mint ncr(int n, int r){ if(n < 0 || r < 0 || n < r) return mint(0); return fact[n] * fact_inv[r] * fact_inv[n-r];}
mint npr(int n, int r){ if(n < 0 || r < 0 || n < r) return mint(0); return fact[n] * fact_inv[n-r]; }
void solve() {
INT(n,m,k);
vvi g(n);
vi F;
vi pos(n,-1);
vpii edges;
rep(i,k) {
INT(u,v);
u--,v--;
g[u].emplace_back(v);
F.emplace_back(u);
F.emplace_back(v);
edges.emplace_back(u,v);
}
sort(all(F));
F.erase(unique(all(F)),F.end());
rep(i,F.size()) pos[F[i]] = i;
vi chk(F.size());
for(auto &[u,v]:edges) chk[pos[v]] |= 1 << pos[u];
debug(chk);
auto C = cycleditection<vvi>(g);
if(!C.empty()) {
debug(C);
cout << 0 << '\n';
return;
}
mint tmp = 0;
mint ans;
rep(i,F.size()) {
vm dp(1 << F.size());
if(chk[i] > 0) continue;
dp[1 << i] = 1;
rep(j,1 << F.size()) {
rep(l,F.size()) {
if(~j >> l & 1) {
if((chk[l] & j) == chk[l]) {
//debug(j,l);
dp[j + (1 << l)] += dp[j];
}
}
}
}
tmp += dp.back();
if(F[i] >= m) ans += dp.back() * ncr(n-1,(int)F.size() - 1) * fact[n-(int)F.size()];
//debug(i,tmp,dp);
}
int fcnt = 0;
rep(i,m,n) {
if(pos[i] == -1) fcnt++;
}
if(F.size() == 0) ans += fact[n-1] * fcnt;
else ans += tmp * ncr(n-1,(int)F.size()) * fcnt * npr(n-(int)F.size()-1,n-(int)F.size()-1);
cout << ans << '\n';
}
int main() {
//INT(TT);
make_fact(1000100);
int TT = 1;
while(TT--) solve();
}