oj.uz

답안 #572697

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
572697 2022-06-05T05:31:09 Z piOOE Amusement Park (CEOI19_amusementpark) C++17
19 / 100
 3000 ms 336 KB 
#include <bits/stdc++.h>

using namespace std;

#define sz(x) ((int)size(x))
#define all(x) begin(x), end(x)
#define trace(x) cout << #x << ": " << (x) << endl;

typedef long long ll;

mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());

int rand(int l, int r) { return (int) ((ll) rnd() % (r - l + 1)) + l; }

const int N = 18, M = N * (N - 1) / 2, mod = 998244353;

vector<int> g[N], rg[N], new_g[N];
bool used[N];

int A[M], B[M], tp[N];

bool dfs(int v) {
    tp[v] = 1;
    for (int to : new_g[v]) {
        if (!tp[to]) {
            if (dfs(to)) {
                return true;
            }
        } else if (tp[to] == 1){
            return true;
        }
    }
    tp[v] = 2;
    return false;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n, m;
    cin >> n >> m;
    for (int i = 0; i < m; ++i) {
        int a, b;
        cin >> a >> b;
        --a, --b;
        A[i] = a, B[i] = b;
        g[a].push_back(b);
        rg[b].push_back(a);
    }
    int ans = 0;
    for (int mask = 1; mask < (1 << m); ++mask) {
        for (int i = 0; i < n; ++i) {
            new_g[i].clear();
        }
        memset(tp, 0, sizeof(tp));
        int sum = 0;
        for (int i = 0; i < m; ++i) {
            if (mask & 1 << i) {
                new_g[B[i]].push_back(A[i]);
                ++sum;
            } else {
                new_g[A[i]].push_back(B[i]);
            }
        }
        bool ok = true;
        for (int i = 0; i < n; ++i) {
            if (!tp[i] && ok) {
                ok &= !dfs(i);
            }
        }
        if (ok) {
            ans += sum;
            ans %= mod;
        }
    }
    cout << ans;
    return 0;
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 328 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 328 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 332 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 5 ms 212 KB Output is correct

Subtask #3
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 328 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 328 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 332 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 5 ms 212 KB Output is correct
25 Correct 1 ms 324 KB Output is correct
26 Correct 0 ms 332 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 6 ms 212 KB Output is correct
30 Correct 42 ms 212 KB Output is correct
31 Correct 359 ms 212 KB Output is correct
32 Correct 0 ms 336 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 13 ms 212 KB Output is correct
36 Correct 189 ms 312 KB Output is correct
37 Execution timed out 3072 ms 212 KB Time limit exceeded
38 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 328 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 328 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 332 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 5 ms 212 KB Output is correct
25 Correct 1 ms 324 KB Output is correct
26 Correct 0 ms 332 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 6 ms 212 KB Output is correct
30 Correct 42 ms 212 KB Output is correct
31 Correct 359 ms 212 KB Output is correct
32 Correct 0 ms 336 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 13 ms 212 KB Output is correct
36 Correct 189 ms 312 KB Output is correct
37 Execution timed out 3072 ms 212 KB Time limit exceeded
38 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 328 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 328 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 332 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 5 ms 212 KB Output is correct
25 Correct 1 ms 324 KB Output is correct
26 Correct 0 ms 332 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 6 ms 212 KB Output is correct
30 Correct 42 ms 212 KB Output is correct
31 Correct 359 ms 212 KB Output is correct
32 Correct 0 ms 336 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 13 ms 212 KB Output is correct
36 Correct 189 ms 312 KB Output is correct
37 Execution timed out 3072 ms 212 KB Time limit exceeded
38 Halted 0 ms 0 KB -