oj.uz

Submission #909067

# Submission time Handle Problem Language Result Execution time Memory
909067 2024-01-17T05:04:05 Z lighton Amusement Park (CEOI19_amusementpark) C++17
19 / 100
 314 ms 21560 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 = 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

amusementpark.cpp: In function 'int main()':
amusementpark.cpp:38:14: warning: format '%d' expects argument of type 'int', but argument 2 has type 'll' {aka 'long long int'} [-Wformat=]
   38 |     printf("%d" , ans);
      |             ~^    ~~~
      |              |    |
      |              int  ll {aka long long int}
      |             %lld
amusementpark.cpp:14:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |     scanf("%d %d" , &N , &M);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~
amusementpark.cpp:16:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 |         scanf("%d %d" , &edge[i].first,&edge[i].second);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 440 KB Output is correct
8 Correct 1 ms 348 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 440 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 508 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 0 ms 348 KB Output is correct
20 Correct 1 ms 344 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 348 KB Output is correct

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 440 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 508 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 0 ms 348 KB Output is correct
20 Correct 1 ms 344 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 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 2 ms 348 KB Output is correct
29 Correct 3 ms 348 KB Output is correct
30 Correct 3 ms 604 KB Output is correct
31 Correct 3 ms 844 KB Output is correct
32 Correct 2 ms 348 KB Output is correct
33 Correct 3 ms 348 KB Output is correct
34 Correct 7 ms 600 KB Output is correct
35 Correct 10 ms 604 KB Output is correct
36 Correct 14 ms 1372 KB Output is correct
37 Correct 23 ms 2648 KB Output is correct
38 Correct 29 ms 4180 KB Output is correct
39 Correct 13 ms 344 KB Output is correct
40 Correct 26 ms 344 KB Output is correct
41 Correct 47 ms 344 KB Output is correct
42 Correct 68 ms 852 KB Output is correct
43 Correct 99 ms 2900 KB Output is correct
44 Correct 139 ms 5456 KB Output is correct
45 Correct 188 ms 11476 KB Output is correct
46 Correct 274 ms 21560 KB Output is correct
47 Incorrect 314 ms 21428 KB Output isn't correct
48 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 440 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 508 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 0 ms 348 KB Output is correct
20 Correct 1 ms 344 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 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 2 ms 348 KB Output is correct
29 Correct 3 ms 348 KB Output is correct
30 Correct 3 ms 604 KB Output is correct
31 Correct 3 ms 844 KB Output is correct
32 Correct 2 ms 348 KB Output is correct
33 Correct 3 ms 348 KB Output is correct
34 Correct 7 ms 600 KB Output is correct
35 Correct 10 ms 604 KB Output is correct
36 Correct 14 ms 1372 KB Output is correct
37 Correct 23 ms 2648 KB Output is correct
38 Correct 29 ms 4180 KB Output is correct
39 Correct 13 ms 344 KB Output is correct
40 Correct 26 ms 344 KB Output is correct
41 Correct 47 ms 344 KB Output is correct
42 Correct 68 ms 852 KB Output is correct
43 Correct 99 ms 2900 KB Output is correct
44 Correct 139 ms 5456 KB Output is correct
45 Correct 188 ms 11476 KB Output is correct
46 Correct 274 ms 21560 KB Output is correct
47 Incorrect 314 ms 21428 KB Output isn't correct
48 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 440 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 508 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 0 ms 348 KB Output is correct
20 Correct 1 ms 344 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 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 2 ms 348 KB Output is correct
29 Correct 3 ms 348 KB Output is correct
30 Correct 3 ms 604 KB Output is correct
31 Correct 3 ms 844 KB Output is correct
32 Correct 2 ms 348 KB Output is correct
33 Correct 3 ms 348 KB Output is correct
34 Correct 7 ms 600 KB Output is correct
35 Correct 10 ms 604 KB Output is correct
36 Correct 14 ms 1372 KB Output is correct
37 Correct 23 ms 2648 KB Output is correct
38 Correct 29 ms 4180 KB Output is correct
39 Correct 13 ms 344 KB Output is correct
40 Correct 26 ms 344 KB Output is correct
41 Correct 47 ms 344 KB Output is correct
42 Correct 68 ms 852 KB Output is correct
43 Correct 99 ms 2900 KB Output is correct
44 Correct 139 ms 5456 KB Output is correct
45 Correct 188 ms 11476 KB Output is correct
46 Correct 274 ms 21560 KB Output is correct
47 Incorrect 314 ms 21428 KB Output isn't correct
48 Halted 0 ms 0 KB -