제출 #909073

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
909073		lighton	Amusement Park (CEOI19_amusementpark)	C++17	19 / 100	3111 ms	162168 KiB

amusementpark

#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;
unordered_set<ll> 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;
        }
        if(s1.find(hash1) == s1.end()){
            if(s1.find(hash1) == s1.end()) s1.insert(hash1);
            //if(s2.find(hash2) == s2.end()) s2.insert(hash2);
            ans += cnt;
            ans %= mod3;
        }

    } while((next_permutation(all(perm))));
    printf("%d" , ans);
}

컴파일 시 표준 에러 (stderr) 메시지

amusementpark.cpp: In function 'int main()':
amusementpark.cpp:39:14: warning: format '%d' expects argument of type 'int', but argument 2 has type 'll' {aka 'long long int'} [-Wformat=]
   39 |     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 / 7
• Subtask 2: 12 / 12
• Subtask 3: 0 / 23
• Subtask 4: 0 / 21
• Subtask 5: 0 / 37