#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef pair<ll,ll> pi;
typedef map<ll,ll> mi;
typedef long double ld;
typedef vector<ld> vd;
typedef vector<vector<ld>> vvd;
typedef pair<ld,ld> pd;
#define ff first
#define ss second
#define srt(a) sort(a.begin(),a.end());
#define fip(k, n) for (ll i = k; i < n; i++)
#define fjp(k, n) for (ll j = k; j < n; j++)
#define fin(k, n) for (ll i = k; i >= n; i--)
#define fjn(k, n) for (ll j = k; j >= n; j--)
#define fp(k, n, m) for (ll k = n; k < m; k++)
#define fn(k, n, m) for (ll k = n; k >= m; k--)
#define ordered_set tree<pi, null_type,less< pi >, rb_tree_tag,tree_order_statistics_node_update>
#define totalOne(n) __builtin_popcountll(n)
#define backZero(n) __builtin_ctzll(n)
#define frontZero(n) __builtin_clzll(n)
#define fx(k) for ( auto x : k )
#define test ll t;cin >> t;while (t--)
#define nli "\n"
// ==========================(debug)============================================================================================== //
#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x <<" "; _printn(x); cerr << nli;
#else
#define debug(x)
#endif
void _printn(ll x){ cerr<<x<<" "; }
void _printn(int x){ cerr<<x<<" "; }
void _printn(ld x){ cerr<<x<<" "; }
void _printn(double x){ cerr<<x<<" "; }
void _printn(string x){ cerr<<x<<" "; }
void _printn(char x){ cerr<<x<<" "; }
void _printn(bool x){ cerr<<x<<" "; }
template<class T,class V>void _printn(pair<T,V> vv);
template<class T> void _printn(vector<T> vv);
template<class T> void _printn(set<T> vv);
template<class T,class V> void _printn(map<T,V> vv);
template<class T> void _printn(multiset<T> vv);
template<class T,class V>void _printn(pair<T,V> vv){ cerr<<"( ";_printn(vv.ff);cerr<<",";_printn(vv.ss);cerr<<")";}
template<class T> void _printn(vector<T> vv){ cerr<<"[ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"]"; };
template<class T> void _printn(set<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T> void _printn(multiset<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T,class V> void _printn(map<T,V> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
// ==========================(debug)============================================================================================== //
ll n,m,tp,tp2,res,cnt,sum,tptp,ans;
const ll mx = 18 + 1;
const ll mod = 998244353;
// ==========================(MOD)=============================================================================================== //
ll mod_add(ll aa,ll bb){ return ((aa%mod)+(bb%mod))%mod; }
ll mod_minus(ll aa,ll bb){ return (((aa%mod)-(bb%mod))+10*mod)%mod; }
ll mod_mul(ll aa,ll bb){ return ((aa%mod)*(bb%mod))%mod; }
ll mod_power(ll aa,ll bb){ aa%=mod; ll empowered = 1; bb%=mod-1; while(bb > 0){ if(bb & 1) empowered = mod_mul(empowered,aa); bb = bb >> 1; aa = mod_mul(aa,aa); } return empowered; }
ll mod_divi(ll aa,ll bb){ aa=mod_mul(aa,mod_power(bb,mod-2)); return aa; }
// ==========================(MOD)=============================================================================================== //
bool f = false;
typedef struct OBJ{
ll lft,c,s;
void init(ll a,ll b,ll d){
lft = a;
c = b;
s = d;
return;
}
void deb(){
cerr<<lft<<" "<<c<<" "<<s<<nli;
return;
}
}obj;
obj oe;
ll rev[mx];
ll to[mx];
ll sr,de;
vector<vector<obj>> dp(1<<mx);
vector<obj> v;
int main(){
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
// #ifndef ONLINE_JUDGE
// freopen("input1.txt", "r", stdin);
// freopen("output1.txt", "w", stdout);
// freopen("error1.txt", "w", stderr);
// #endif // ONLINE_JUDGE
cin>>n>>m;
fip(0,m){
cin>>sr>>de;
sr--,de--;
rev[sr] |= (1<<de);
to[sr] |= (1<<de);
to[de] |= (1<<sr);
}
ans = 0;
res = 1<<n;
res--;
oe.init(res,1,0);
// debug(oe.c);
dp[0].push_back(oe);
fip(0,(1<<n)){
sort(dp[i].begin(),dp[i].end(),[](const obj aa,const obj bb){
if(aa.lft < bb.lft)
return aa.c < bb.c;
return aa.lft < bb.lft;
});
if(!dp[i].size())
continue;
v.clear();
v.push_back(dp[i][0]);
tp = 0;
fjp(1,(ll)dp[i].size()){
if(dp[i][j].lft==dp[i][tp].lft){
v[tp].s += dp[i][j].s;
v[tp].c += dp[i][j].c;
continue;
}
tp++;
v.push_back(dp[i][j]);
}
dp[i].clear();
dp[i] = v;
tp = 0;
fx(dp[i]){
fjp(0,n){
tp |= (1<<j);
if(x.lft&(1<<j)){
// debug(j);
tp2 = i | (1<<j);
sum = x.lft & (res-tp);
cnt = to[j] & (res-i);
sum |= cnt;
cnt = totalOne(rev[j] & i);
oe.init(sum,x.c,mod_add(x.s,mod_mul(cnt,x.c)));
// oe.deb();
dp[tp2].push_back(oe);
}
}
}
}
fx(dp[res])
ans = mod_add(ans,x.s);
cout<<ans<<nli;
cerr << "Time elapsed: " << setprecision(6) << 1000.0 * clock() / CLOCKS_PER_SEC << "ms\n";
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
6 ms |
12636 KB |
Output is correct |
| 2 |
Correct |
4 ms |
12636 KB |
Output is correct |
| 3 |
Correct |
3 ms |
12636 KB |
Output is correct |
| 4 |
Correct |
3 ms |
12636 KB |
Output is correct |
| 5 |
Correct |
3 ms |
12636 KB |
Output is correct |
| 6 |
Correct |
4 ms |
12636 KB |
Output is correct |
| 7 |
Correct |
4 ms |
12636 KB |
Output is correct |
| 8 |
Correct |
3 ms |
12636 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
6 ms |
12636 KB |
Output is correct |
| 2 |
Correct |
4 ms |
12636 KB |
Output is correct |
| 3 |
Correct |
3 ms |
12636 KB |
Output is correct |
| 4 |
Correct |
3 ms |
12636 KB |
Output is correct |
| 5 |
Correct |
3 ms |
12636 KB |
Output is correct |
| 6 |
Correct |
4 ms |
12636 KB |
Output is correct |
| 7 |
Correct |
4 ms |
12636 KB |
Output is correct |
| 8 |
Correct |
3 ms |
12636 KB |
Output is correct |
| 9 |
Correct |
3 ms |
12636 KB |
Output is correct |
| 10 |
Correct |
3 ms |
12556 KB |
Output is correct |
| 11 |
Correct |
3 ms |
12636 KB |
Output is correct |
| 12 |
Correct |
6 ms |
12636 KB |
Output is correct |
| 13 |
Correct |
4 ms |
12636 KB |
Output is correct |
| 14 |
Correct |
4 ms |
12760 KB |
Output is correct |
| 15 |
Correct |
3 ms |
12636 KB |
Output is correct |
| 16 |
Incorrect |
4 ms |
12636 KB |
Output isn't correct |
| 17 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
6 ms |
12636 KB |
Output is correct |
| 2 |
Correct |
4 ms |
12636 KB |
Output is correct |
| 3 |
Correct |
3 ms |
12636 KB |
Output is correct |
| 4 |
Correct |
3 ms |
12636 KB |
Output is correct |
| 5 |
Correct |
3 ms |
12636 KB |
Output is correct |
| 6 |
Correct |
4 ms |
12636 KB |
Output is correct |
| 7 |
Correct |
4 ms |
12636 KB |
Output is correct |
| 8 |
Correct |
3 ms |
12636 KB |
Output is correct |
| 9 |
Correct |
3 ms |
12636 KB |
Output is correct |
| 10 |
Correct |
3 ms |
12556 KB |
Output is correct |
| 11 |
Correct |
3 ms |
12636 KB |
Output is correct |
| 12 |
Correct |
6 ms |
12636 KB |
Output is correct |
| 13 |
Correct |
4 ms |
12636 KB |
Output is correct |
| 14 |
Correct |
4 ms |
12760 KB |
Output is correct |
| 15 |
Correct |
3 ms |
12636 KB |
Output is correct |
| 16 |
Incorrect |
4 ms |
12636 KB |
Output isn't correct |
| 17 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
6 ms |
12636 KB |
Output is correct |
| 2 |
Correct |
4 ms |
12636 KB |
Output is correct |
| 3 |
Correct |
3 ms |
12636 KB |
Output is correct |
| 4 |
Correct |
3 ms |
12636 KB |
Output is correct |
| 5 |
Correct |
3 ms |
12636 KB |
Output is correct |
| 6 |
Correct |
4 ms |
12636 KB |
Output is correct |
| 7 |
Correct |
4 ms |
12636 KB |
Output is correct |
| 8 |
Correct |
3 ms |
12636 KB |
Output is correct |
| 9 |
Correct |
3 ms |
12636 KB |
Output is correct |
| 10 |
Correct |
3 ms |
12556 KB |
Output is correct |
| 11 |
Correct |
3 ms |
12636 KB |
Output is correct |
| 12 |
Correct |
6 ms |
12636 KB |
Output is correct |
| 13 |
Correct |
4 ms |
12636 KB |
Output is correct |
| 14 |
Correct |
4 ms |
12760 KB |
Output is correct |
| 15 |
Correct |
3 ms |
12636 KB |
Output is correct |
| 16 |
Incorrect |
4 ms |
12636 KB |
Output isn't correct |
| 17 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
6 ms |
12636 KB |
Output is correct |
| 2 |
Correct |
4 ms |
12636 KB |
Output is correct |
| 3 |
Correct |
3 ms |
12636 KB |
Output is correct |
| 4 |
Correct |
3 ms |
12636 KB |
Output is correct |
| 5 |
Correct |
3 ms |
12636 KB |
Output is correct |
| 6 |
Correct |
4 ms |
12636 KB |
Output is correct |
| 7 |
Correct |
4 ms |
12636 KB |
Output is correct |
| 8 |
Correct |
3 ms |
12636 KB |
Output is correct |
| 9 |
Correct |
3 ms |
12636 KB |
Output is correct |
| 10 |
Correct |
3 ms |
12556 KB |
Output is correct |
| 11 |
Correct |
3 ms |
12636 KB |
Output is correct |
| 12 |
Correct |
6 ms |
12636 KB |
Output is correct |
| 13 |
Correct |
4 ms |
12636 KB |
Output is correct |
| 14 |
Correct |
4 ms |
12760 KB |
Output is correct |
| 15 |
Correct |
3 ms |
12636 KB |
Output is correct |
| 16 |
Incorrect |
4 ms |
12636 KB |
Output isn't correct |
| 17 |
Halted |
0 ms |
0 KB |
- |
