# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
208147 | E869120 | Amusement Park (CEOI19_amusementpark) | C++14 | 5 ms | 376 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
#pragma warning (disable: 4996)
long long mod = 998244353;
int N, M, A[1009], B[1009];
int idx[11];
int main() {
cin >> N >> M;
for (int i = 1; i <= M; i++) cin >> A[i] >> B[i];
for (int i = 1; i <= N; i++) idx[i] = i;
vector<long long> vec;
do {
long long ret = 0;
for (int i = 1; i <= M; i++) {
if (idx[A[i]] < idx[B[i]]) ret += (1LL << (i - 1));
}
vec.push_back(ret);
} while (next_permutation(idx + 1, idx + N + 1));
sort(vec.begin(), vec.end());
vec.erase(unique(vec.begin(), vec.end()), vec.end());
long long ans = 1LL * N * vec.size();
if (ans % 2LL == 1LL) ans += mod; ans /= 2LL;
cout << ans << endl;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |