oj.uz

답안 #1114087

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1114087 2024-11-18T07:39:56 Z n3rm1n Amusement Park (CEOI19_amusementpark) C++17
19 / 100
 3000 ms 89836 KB 
#include<bits/stdc++.h>
#define endl '\n'
using namespace std;
const int MAXN = 12, MAXM = 200;
void speed()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
}
int n, m;
int from[MAXM], to[MAXM];
void read()
{
    cin >> n >> m;
    for (int i = 1; i <= m; ++ i)
        cin >> from[i] >> to[i];
}
int order[MAXN], used[MAXN], visited[MAXN], in_cycle[MAXN]; /// na koq poziciq e i
long long ans = 0, imp = 0;
const long long mod = 998244353;
set < vector < int > > mp;
vector < int > g[MAXN];
void dfs(int beg)
{
    visited[beg] = 1;
    in_cycle[beg] = 1;
    for (auto nb: g[beg])
    {
        if(!visited[nb])dfs(nb);
        else if(in_cycle[nb])imp = 1;
    }
    in_cycle[beg] = 0;
}
void check()
{
    for (int i = 1; i <= n; ++ i)
    {
        g[i].clear();
        visited[i] = 0;
        in_cycle[i] = 0;
    }

    vector < int > u;
    int cnt = 0;
    for (int i = 1; i <= m; ++ i)
    {
        if(order[from[i]] > order[to[i]])
        {
            u.push_back(0);
            g[from[i]].push_back(to[i]);
        }
        else
        {
            cnt ++;
            u.push_back(1);
            g[to[i]].push_back(from[i]);
        }
    }
    if(mp.find(u) != mp.end())return;
    mp.insert(u);

    imp = 0;
    for (int i = 1; i <= n; ++ i)
    {
        if(visited[order[i]])continue;
        dfs(visited[order[i]]);
    }
    if(imp)return;
    ans += cnt;
    ans %= mod;
}
void gen(int pos)
{
    if(pos > n)
    {
        check();
        return;
    }
    for (int i = 1; i <= n; ++ i)
    {
        if(used[i])continue;
        order[pos] = i;
        used[i] = 1;
        gen(pos+1);
        used[i] = 0;
    }
}
int main()
{
    speed();
    read();
    gen(1);
    cout << ans << endl;
    return 0;
}

Subtask #1
7.0 / 7.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 2 ms 512 KB Output is correct
27 Correct 2 ms 592 KB Output is correct
28 Correct 2 ms 548 KB Output is correct
29 Correct 3 ms 764 KB Output is correct
30 Correct 4 ms 848 KB Output is correct
31 Correct 5 ms 1104 KB Output is correct
32 Correct 5 ms 336 KB Output is correct
33 Correct 8 ms 468 KB Output is correct
34 Correct 19 ms 592 KB Output is correct
35 Correct 16 ms 960 KB Output is correct
36 Correct 22 ms 1872 KB Output is correct
37 Correct 32 ms 4424 KB Output is correct
38 Correct 46 ms 8008 KB Output is correct
39 Correct 43 ms 336 KB Output is correct
40 Correct 68 ms 632 KB Output is correct
41 Correct 102 ms 584 KB Output is correct
42 Correct 119 ms 1096 KB Output is correct
43 Correct 181 ms 4880 KB Output is correct
44 Correct 212 ms 9544 KB Output is correct
45 Correct 287 ms 22536 KB Output is correct
46 Correct 438 ms 46124 KB Output is correct
47 Correct 578 ms 79944 KB Output is correct
48 Correct 62 ms 336 KB Output is correct
49 Correct 102 ms 840 KB Output is correct
50 Correct 108 ms 840 KB Output is correct
51 Correct 115 ms 840 KB Output is correct
52 Correct 535 ms 448 KB Output is correct
53 Correct 905 ms 336 KB Output is correct
54 Correct 1171 ms 1348 KB Output is correct
55 Correct 1791 ms 5372 KB Output is correct
56 Correct 2068 ms 31588 KB Output is correct
57 Execution timed out 3003 ms 89836 KB Time limit exceeded
58 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 2 ms 512 KB Output is correct
27 Correct 2 ms 592 KB Output is correct
28 Correct 2 ms 548 KB Output is correct
29 Correct 3 ms 764 KB Output is correct
30 Correct 4 ms 848 KB Output is correct
31 Correct 5 ms 1104 KB Output is correct
32 Correct 5 ms 336 KB Output is correct
33 Correct 8 ms 468 KB Output is correct
34 Correct 19 ms 592 KB Output is correct
35 Correct 16 ms 960 KB Output is correct
36 Correct 22 ms 1872 KB Output is correct
37 Correct 32 ms 4424 KB Output is correct
38 Correct 46 ms 8008 KB Output is correct
39 Correct 43 ms 336 KB Output is correct
40 Correct 68 ms 632 KB Output is correct
41 Correct 102 ms 584 KB Output is correct
42 Correct 119 ms 1096 KB Output is correct
43 Correct 181 ms 4880 KB Output is correct
44 Correct 212 ms 9544 KB Output is correct
45 Correct 287 ms 22536 KB Output is correct
46 Correct 438 ms 46124 KB Output is correct
47 Correct 578 ms 79944 KB Output is correct
48 Correct 62 ms 336 KB Output is correct
49 Correct 102 ms 840 KB Output is correct
50 Correct 108 ms 840 KB Output is correct
51 Correct 115 ms 840 KB Output is correct
52 Correct 535 ms 448 KB Output is correct
53 Correct 905 ms 336 KB Output is correct
54 Correct 1171 ms 1348 KB Output is correct
55 Correct 1791 ms 5372 KB Output is correct
56 Correct 2068 ms 31588 KB Output is correct
57 Execution timed out 3003 ms 89836 KB Time limit exceeded
58 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 2 ms 512 KB Output is correct
27 Correct 2 ms 592 KB Output is correct
28 Correct 2 ms 548 KB Output is correct
29 Correct 3 ms 764 KB Output is correct
30 Correct 4 ms 848 KB Output is correct
31 Correct 5 ms 1104 KB Output is correct
32 Correct 5 ms 336 KB Output is correct
33 Correct 8 ms 468 KB Output is correct
34 Correct 19 ms 592 KB Output is correct
35 Correct 16 ms 960 KB Output is correct
36 Correct 22 ms 1872 KB Output is correct
37 Correct 32 ms 4424 KB Output is correct
38 Correct 46 ms 8008 KB Output is correct
39 Correct 43 ms 336 KB Output is correct
40 Correct 68 ms 632 KB Output is correct
41 Correct 102 ms 584 KB Output is correct
42 Correct 119 ms 1096 KB Output is correct
43 Correct 181 ms 4880 KB Output is correct
44 Correct 212 ms 9544 KB Output is correct
45 Correct 287 ms 22536 KB Output is correct
46 Correct 438 ms 46124 KB Output is correct
47 Correct 578 ms 79944 KB Output is correct
48 Correct 62 ms 336 KB Output is correct
49 Correct 102 ms 840 KB Output is correct
50 Correct 108 ms 840 KB Output is correct
51 Correct 115 ms 840 KB Output is correct
52 Correct 535 ms 448 KB Output is correct
53 Correct 905 ms 336 KB Output is correct
54 Correct 1171 ms 1348 KB Output is correct
55 Correct 1791 ms 5372 KB Output is correct
56 Correct 2068 ms 31588 KB Output is correct
57 Execution timed out 3003 ms 89836 KB Time limit exceeded
58 Halted 0 ms 0 KB -