Submission #909110

#	Time	Username	Problem	Language	Result	Execution time	Memory
909110		lighton	Magic Tree (CEOI19_magictree)	C++17	0 / 100	2043 ms	9684 KiB

magictree

#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 = 100000007;
ll mod2 = 100000009;
ll mod3 = 100000011;
ll mod4 = 100000013;
ll mod = 998244353;
vector<int> perm;
//unordered_set<ll> s1,s2;
bool chk1[100000007];
bool chk2[100000009];
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 (stderr)

magictree.cpp: In function 'int main()':
magictree.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);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~
magictree.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: 0 / 6
• Subtask 2: 0 / 3
• Subtask 3: 0 / 11
• Subtask 4: 0 / 12
• Subtask 5: 0 / 16
• Subtask 6: 0 / 13
• Subtask 7: 0 / 22
• Subtask 8: 0 / 17