Submission #659274

#TimeUsernameProblemLanguageResultExecution timeMemory
659274mychecksedadAmusement Park (CEOI19_amusementpark)C++17
19 / 100
173 ms21500 KiB
/* Author : Mychecksdead */ #include<bits/stdc++.h> #include <ext/pb_ds/tree_policy.hpp> using namespace __gnu_pbds; using namespace std; typedef long long int ll; typedef long double ld; #define MOD1 (1000000000+7) #define MOD (998244353) #define PI 3.1415926535 #define pb push_back #define setp() cout << setprecision(15) #define all(x) x.begin(), x.end() #define debug(x) cerr << #x << " is " << x << '\n'; const int N = 1e6+100, M = 1e5+10, F = 2147483646, K = 20; int n, m; ll e[20][20]; void solve(){ cin >> n >> m; for(int i = 1; i <= n; ++i) for(int j = 1; j <= n; ++j) e[i][j] = -1; for(int i = 1; i <= m; ++i){ int u, v; cin >> u >> v; e[u][v] = i - 1; } vector<int> a; for(int i=1; i<=n; ++i) a.pb(i); ll ans = 0; map<ll, bool> taken; do{ ll c = 0, h = 0; for(int i = 1; i < n; ++i){ for(int j = 0; j < i; ++j){ int u = a[j], v = a[i]; if(e[u][v] == -1 && e[v][u] > -1){ c++; h += (1 << e[v][u]); } } } if(!taken[h]) taken[h] = 1, (ans += c) %= MOD; }while(next_permutation(a.begin(), a.end())); cout << ans; } int main(){ cin.tie(0); ios::sync_with_stdio(0); int T = 1, aa; // cin >> T;aa=T; while(T--){ // cout << "Case #" << aa-T << ": "; solve(); cout << '\n'; } return 0; }

Compilation message (stderr)

amusementpark.cpp: In function 'int main()':
amusementpark.cpp:54:16: warning: unused variable 'aa' [-Wunused-variable]
   54 |     int T = 1, aa;
      |                ^~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...