Submission #909088

# Submission time Handle Problem Language Result Execution time Memory
909088 2024-01-17T05:11:35 Z lighton Amusement Park (CEOI19_amusementpark) C++17
19 / 100
32 ms 31336 KB
#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 = 10000009;
ll mod = 998244353;
vector<int> perm;
//unordered_set<ll> s1,s2;
int chk1[10000007];
int chk2[10000009];
int chk3[10000011];
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 hash3 = 0;
        ll cnt = 0;
        forf(i,1,M){
            hash1 *= 2; hash2 *= 2; hash3 *= 2;
            if(perm[edge[i].first-1] > perm[edge[i].second-1]){
                hash1++; hash2++; hash3++;
                cnt++;
            }
            hash1 %= mod1;
            hash2 %= mod2;
            hash3 %= mod3;
        }
        if(chk1[hash1] == 0 && chk2[hash2] == 0 && chk3[hash3] == 0){
            ans += cnt;
            ans %= mod;
        }
        chk1[hash1] = 1; chk2[hash2] = 1; chk3[hash3] = 1;
    } while((next_permutation(all(perm))));
    printf("%lld" , ans);
}

Compilation message

amusementpark.cpp: In function 'int main()':
amusementpark.cpp:18:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   18 |     scanf("%d %d" , &N , &M);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~
amusementpark.cpp:20:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   20 |         scanf("%d %d" , &edge[i].first,&edge[i].second);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 600 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 600 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 600 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 1 ms 600 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 2 ms 604 KB Output is correct
30 Correct 3 ms 2140 KB Output is correct
31 Correct 6 ms 8280 KB Output is correct
32 Correct 3 ms 344 KB Output is correct
33 Correct 5 ms 348 KB Output is correct
34 Correct 7 ms 348 KB Output is correct
35 Correct 9 ms 1236 KB Output is correct
36 Correct 17 ms 9564 KB Output is correct
37 Incorrect 32 ms 31336 KB Output isn't correct
38 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 600 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 1 ms 600 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 2 ms 604 KB Output is correct
30 Correct 3 ms 2140 KB Output is correct
31 Correct 6 ms 8280 KB Output is correct
32 Correct 3 ms 344 KB Output is correct
33 Correct 5 ms 348 KB Output is correct
34 Correct 7 ms 348 KB Output is correct
35 Correct 9 ms 1236 KB Output is correct
36 Correct 17 ms 9564 KB Output is correct
37 Incorrect 32 ms 31336 KB Output isn't correct
38 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 600 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 1 ms 600 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 2 ms 604 KB Output is correct
30 Correct 3 ms 2140 KB Output is correct
31 Correct 6 ms 8280 KB Output is correct
32 Correct 3 ms 344 KB Output is correct
33 Correct 5 ms 348 KB Output is correct
34 Correct 7 ms 348 KB Output is correct
35 Correct 9 ms 1236 KB Output is correct
36 Correct 17 ms 9564 KB Output is correct
37 Incorrect 32 ms 31336 KB Output isn't correct
38 Halted 0 ms 0 KB -