# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
946442 | Aiperiii | Amusement Park (CEOI19_amusementpark) | C++14 | 3014 ms | 171052 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>
#define int long long
#define all(x) x.begin(),x.end()
#define ff first
#define ss second
#define pb push_back
using namespace std;
const int mod=1e9+7;
signed main(){
int n,m;
cin>>n>>m;
vector <int> u(m),v(m);
for(int i=0;i<m;i++){
cin>>u[i]>>v[i];
}
int ans=0;
vector <int> ord;
set <int> st;
for(int i=1;i<=n;i++)ord.pb(i);
do{
vector <int> val_ord(n+1);
for(int i=0;i<ord.size();i++){
val_ord[ord[i]]=i;
}
int cnt=0;
int ch=0;
for(int i=0;i<m;i++){
int x=val_ord[u[i]];
int y=val_ord[v[i]];
if(x<y){
ch+=(1ll<<i);
cnt++;
}
}
int x=st.size();
st.insert(ch);
if(x!=st.size()){
ans+=cnt;ans%=mod;
}
}while(next_permutation(all(ord)));
cout<<ans<<"\n";
}
/*
3 3
1 2
2 3
1 3
1 2 3
*/
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... |