# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1066683 | vjudge1 | Amusement Park (CEOI19_amusementpark) | C++17 | 2257 ms | 2640 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
bitset<1<<20>indep;
ll dp[1<<20];
const ll mod=998244353;
int EDG[20][20];
int main(){
int n,m;
cin>>n>>m;
for(int i=0;i<m;i++){
int a,b;
cin>>a>>b;
EDG[a][b]=1;
}
for(int i=1;i<1<<n;i++){
vector<int>v;
for(int j=0;j<n;j++)
if(i&1<<j)
v.push_back(j+1);
int bad=0;
for(auto i:v)
for(auto j:v)
if(EDG[i][j])
bad=1;
indep[i]=!bad;
}
dp[0]=1;
for(int i=1;i<1<<n;i++)
for(int j=i;j;j=j-1&i)if(indep[j]){
int cnt=__builtin_popcount(j);
dp[i]=(dp[i]+dp[i^j]*(cnt&1?1:-1))%mod;
}
cout<<dp[(1<<n)-1]*m%mod*499122177ll%mod<<'\n';
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |