Submission #598660

#	Time	Username	Problem	Language	Result	Execution time	Memory
598660		Valaki2	Amusement Park (CEOI19_amusementpark)	C++14	19 / 100	78 ms	10116 KiB

amusementpark

#include <bits/stdc++.h>
using namespace std;

#define int long long

const int mod = 998244353;

int n, m;
vector<int> a;
vector<int> b;
unordered_set<int> s;

void solve() {
    cin >> n >> m;
    a.assign(m, 0);
    b.assign(m, 0);
    for(int i = 0; i < m; i++) {
        cin >> a[i] >> b[i];
        a[i]--;
        b[i]--;
    }
    vector<int> v(n, 0);
    for(int i = 0; i < n; i++) {
        v[i] = i;
    }
    do {
        int c = 0;
        for(int i = 0; i < m; i++) {
            c |= (v[a[i]] > v[b[i]]) * (1 << i);
        }
        s.insert(c);
    } while(next_permutation(v.begin(), v.end()));
    int ans = 0;
    for(int x : s) {
        ans = ans + __builtin_popcountll(x);
    }
    ans %= mod;
    cout << ans << "\n";
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
    return 0;
}

• Subtask 1: 7 / 7
• Subtask 2: 12 / 12
• Subtask 3: 0 / 23
• Subtask 4: 0 / 21
• Subtask 5: 0 / 37