# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
909081 | lighton | Amusement Park (CEOI19_amusementpark) | C++17 | 20 ms | 21084 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 = 10000007;
ll mod2 = 10000009;
ll mod3 = 998244353;
vector<int> perm;
//unordered_set<ll> s1,s2;
int chk1[10000007];
int chk2[10000009];
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; ll 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(chk1[hash1] == 0 && chk2[hash2] == 0){
chk1[hash1] = 1; chk2[hash2] = 1;
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... |