# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
909067 | lighton | Amusement Park (CEOI19_amusementpark) | C++17 | 314 ms | 21560 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 mod1 = 1000000000000000007;
ll mod2 = 1000000000000000009;
ll mod3 = 998244353;
vector<int> perm;
set<int> s1,s2;
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 hash1 = 0, hash2 = 0; ll cnt = 0;
forf(i,1,M){
hash1 *= 2; hash2 *= 2;
if(perm[edge[i].first-1] > perm[edge[i].second-1]){
hash1++; hash2++;
cnt++;
}
hash1 %= mod1; hash2 %= mod2;
}
if(s1.find(hash1) == s1.end() || s2.find(hash2) == s2.end()){
if(s1.find(hash1) == s1.end()) s1.insert(hash1);
if(s2.find(hash1) == s2.end()) s2.insert(hash1);
ans += cnt;
ans %= mod3;
}
} 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... |