# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
955608 | Trisanu_Das | Amusement Park (CEOI19_amusementpark) | C++17 | 128 ms | 10832 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 forf(i,a,b) for(int i = a; i<=b; i++)
#define all(v) v.begin(),v.end()
using namespace std;
typedef long long ll;
int N,M;
pair<int,int> edge[100001];
ll mod = 1000000000000000007;
vector<int> perm;
set<int> s;
int main(){
scanf("%d %d" , &N , &M);
forf(i,1,M){
scanf("%d %d" , &edge[i].first,&edge[i].second);
}
forf(i,1,N) perm.push_back(i);
ll ans = 0;
do{
ll hash = 0; ll cnt = 0;
forf(i,1,M){
hash *= 2;
if(perm[edge[i].first-1] > perm[edge[i].second-1]){
hash++;
cnt++;
}
hash %= mod;
}
if(s.find(hash) == s.end()){
s.insert(hash);
ans += cnt;
}
} while((next_permutation(all(perm))));
printf("%d" , ans);
}
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... |