Submission #909284

#	Time	Username	Problem	Language	Result	Execution time	Memory
909284		lighton	Dynamic Diameter (CEOI19_diameter)	C++17	0 / 100	5043 ms	15592 KiB

diameter

#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 = 1000000000000007;
ll mod = 998244353;
vector<int> perm;
unordered_set<ll> s1[100001];
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 cnt = 0;
        forf(i,1,M){
            hash1 *= 2;
            if(perm[edge[i].first-1] > perm[edge[i].second-1]){
                hash1++; hash2++;
                cnt++;
            }
            hash1 %= mod1;
        }
        if(s1[cnt].find(hash1) == s1[cnt].end()){
            s1[cnt].insert(hash1);
            ans += cnt;
            ans %= mod;
        }
    } while((next_permutation(all(perm))));
    printf("%d" , ans);
}

Compilation message (stderr)

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

• Subtask 1: 0 / 11
• Subtask 2: 0 / 13
• Subtask 3: 0 / 7
• Subtask 4: 0 / 18
• Subtask 5: 0 / 24
• Subtask 6: 0 / 27