oj.uz

답안 #909281

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
909281 2024-01-17T06:48:09 Z lighton Amusement Park (CEOI19_amusementpark) C++17
19 / 100
 27 ms 65116 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 = 50000007;
ll mod2 = 50000009;
//ll mod3 = 100000011;
//ll mod4 = 100000013;
ll mod = 998244353;
vector<int> perm;
//unordered_set<ll> s1,s2;
bool chk1[50000007];
bool chk2[50000009];
//bool chk3[100000011];
//bool chk4[100000013];
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 hash4 = 0;
        ll cnt = 0;
        forf(i,1,M){
            hash1 *= 2; hash2 *= 2; //hash3 *= 2; hash4 *= 2;
            if(perm[edge[i].first-1] > perm[edge[i].second-1]){
                hash1++; hash2++; //hash3++; hash4++;
                cnt++;
            }
            hash1 %= mod1;hash2 %= mod2;//hash3 %= mod3;hash4 %=mod4;
        }
        if(chk1[hash1] == 0 || chk2[hash2] == 0 ){//|| chk3[hash3] == 0 || chk4[hash4] == 0){
            ans += cnt;
            ans %= mod;
        }
        chk1[hash1] = 1; chk2[hash2] = 1; //chk3[hash3] = 1; chk4[hash4] = 1;
    } while((next_permutation(all(perm))));
    printf("%lld" , ans);
}

Compilation message

amusementpark.cpp: In function 'int main()':
amusementpark.cpp:27:41: warning: unused variable 'hash3' [-Wunused-variable]
   27 |         ll hash1 = 0;  ll hash2 = 0; ll hash3 = 0; ll hash4 = 0;
      |                                         ^~~~~
amusementpark.cpp:27:55: warning: unused variable 'hash4' [-Wunused-variable]
   27 |         ll hash1 = 0;  ll hash2 = 0; ll hash3 = 0; ll hash4 = 0;
      |                                                       ^~~~~
amusementpark.cpp:20:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   20 |     scanf("%d %d" , &N , &M);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~
amusementpark.cpp:22:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   22 |         scanf("%d %d" , &edge[i].first,&edge[i].second);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 600 KB Output is correct
8 Correct 1 ms 348 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 600 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 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 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 444 KB Output is correct

Subtask #3
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 600 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 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 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 444 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 1 ms 452 KB Output is correct
29 Correct 2 ms 352 KB Output is correct
30 Correct 3 ms 2656 KB Output is correct
31 Correct 2 ms 3940 KB Output is correct
32 Correct 2 ms 352 KB Output is correct
33 Correct 3 ms 352 KB Output is correct
34 Correct 5 ms 468 KB Output is correct
35 Correct 6 ms 352 KB Output is correct
36 Correct 9 ms 3600 KB Output is correct
37 Correct 15 ms 22716 KB Output is correct
38 Incorrect 27 ms 65116 KB Output isn't correct
39 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 600 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 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 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 444 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 1 ms 452 KB Output is correct
29 Correct 2 ms 352 KB Output is correct
30 Correct 3 ms 2656 KB Output is correct
31 Correct 2 ms 3940 KB Output is correct
32 Correct 2 ms 352 KB Output is correct
33 Correct 3 ms 352 KB Output is correct
34 Correct 5 ms 468 KB Output is correct
35 Correct 6 ms 352 KB Output is correct
36 Correct 9 ms 3600 KB Output is correct
37 Correct 15 ms 22716 KB Output is correct
38 Incorrect 27 ms 65116 KB Output isn't correct
39 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 600 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 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 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 444 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 1 ms 452 KB Output is correct
29 Correct 2 ms 352 KB Output is correct
30 Correct 3 ms 2656 KB Output is correct
31 Correct 2 ms 3940 KB Output is correct
32 Correct 2 ms 352 KB Output is correct
33 Correct 3 ms 352 KB Output is correct
34 Correct 5 ms 468 KB Output is correct
35 Correct 6 ms 352 KB Output is correct
36 Correct 9 ms 3600 KB Output is correct
37 Correct 15 ms 22716 KB Output is correct
38 Incorrect 27 ms 65116 KB Output isn't correct
39 Halted 0 ms 0 KB -