oj.uz

Submission #1114315

# Submission time Handle Problem Language Result Execution time Memory
1114315 2024-11-18T14:09:05 Z n3rm1n Amusement Park (CEOI19_amusementpark) C++17
19 / 100
 181 ms 13680 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;
unordered_map < long long, int > mp;
vector < int > g[MAXN];
void dfs(int beg)
{
    if(imp)return;
    visited[beg] = 1;
    in_cycle[beg] = 1;
    for (auto nb: g[beg])
    {
        if(imp)return;
        if(!visited[nb])dfs(nb);
        else if(in_cycle[nb])imp = 1;
    }
    in_cycle[beg] = 0;
}

void check()
{
    int cnt = 0;
    long long curr = 0;
    for (long long i = 1; i <= m; ++ i)
    {
        if(order[from[i]] > order[to[i]])
            curr = curr;
        else
            curr = curr + 1LL * (1 << (i));
    }
    if(mp[curr])return;
    mp[curr] = 1;
    for (int i = 1; i <= n; ++ i)
    {
        g[i].clear();
        visited[i] = 0;
        in_cycle[i] = 0;
    }
    for (int i = 1; i <= m; ++ i)
    {
        if(order[from[i]] > order[to[i]])g[from[i]].push_back(to[i]);
        else
        {
            cnt ++;
            g[to[i]].push_back(from[i]);
        }
    }
    imp = 0;
    for (int i = 1; i <= n && (!imp); ++ 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;
}
/**


10 45
8 2
8 9
5 2
4 9
7 5
4 8
2 6
10 2
10 9
4 5
6 9
2 7
7 3
3 10
1 2
5 1
3 6
10 7
1 8
1 6
1 4
3 4
10 5
4 7
4 10
6 10
9 7
4 2
8 10
8 7
9 5
6 4
10 1
3 2
5 3
6 7
9 1
8 5
1 7
1 3
2 9
6 5
8 3
8 6
9 3



*/

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory 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

# Verdict Execution time Memory 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 508 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 504 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

# Verdict Execution time Memory 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 508 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 504 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 1 ms 336 KB Output is correct
27 Correct 1 ms 336 KB Output is correct
28 Correct 1 ms 336 KB Output is correct
29 Correct 2 ms 336 KB Output is correct
30 Correct 2 ms 848 KB Output is correct
31 Correct 3 ms 592 KB Output is correct
32 Correct 2 ms 336 KB Output is correct
33 Correct 3 ms 336 KB Output is correct
34 Correct 4 ms 336 KB Output is correct
35 Correct 5 ms 592 KB Output is correct
36 Correct 8 ms 848 KB Output is correct
37 Correct 13 ms 1452 KB Output is correct
38 Correct 16 ms 1964 KB Output is correct
39 Correct 12 ms 336 KB Output is correct
40 Correct 16 ms 472 KB Output is correct
41 Correct 24 ms 504 KB Output is correct
42 Correct 28 ms 592 KB Output is correct
43 Correct 40 ms 1444 KB Output is correct
44 Correct 53 ms 2724 KB Output is correct
45 Correct 85 ms 5308 KB Output is correct
46 Correct 134 ms 10100 KB Output is correct
47 Incorrect 181 ms 13680 KB Output isn't correct
48 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory 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 508 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 504 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 1 ms 336 KB Output is correct
27 Correct 1 ms 336 KB Output is correct
28 Correct 1 ms 336 KB Output is correct
29 Correct 2 ms 336 KB Output is correct
30 Correct 2 ms 848 KB Output is correct
31 Correct 3 ms 592 KB Output is correct
32 Correct 2 ms 336 KB Output is correct
33 Correct 3 ms 336 KB Output is correct
34 Correct 4 ms 336 KB Output is correct
35 Correct 5 ms 592 KB Output is correct
36 Correct 8 ms 848 KB Output is correct
37 Correct 13 ms 1452 KB Output is correct
38 Correct 16 ms 1964 KB Output is correct
39 Correct 12 ms 336 KB Output is correct
40 Correct 16 ms 472 KB Output is correct
41 Correct 24 ms 504 KB Output is correct
42 Correct 28 ms 592 KB Output is correct
43 Correct 40 ms 1444 KB Output is correct
44 Correct 53 ms 2724 KB Output is correct
45 Correct 85 ms 5308 KB Output is correct
46 Correct 134 ms 10100 KB Output is correct
47 Incorrect 181 ms 13680 KB Output isn't correct
48 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# Verdict Execution time Memory 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 508 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 504 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 1 ms 336 KB Output is correct
27 Correct 1 ms 336 KB Output is correct
28 Correct 1 ms 336 KB Output is correct
29 Correct 2 ms 336 KB Output is correct
30 Correct 2 ms 848 KB Output is correct
31 Correct 3 ms 592 KB Output is correct
32 Correct 2 ms 336 KB Output is correct
33 Correct 3 ms 336 KB Output is correct
34 Correct 4 ms 336 KB Output is correct
35 Correct 5 ms 592 KB Output is correct
36 Correct 8 ms 848 KB Output is correct
37 Correct 13 ms 1452 KB Output is correct
38 Correct 16 ms 1964 KB Output is correct
39 Correct 12 ms 336 KB Output is correct
40 Correct 16 ms 472 KB Output is correct
41 Correct 24 ms 504 KB Output is correct
42 Correct 28 ms 592 KB Output is correct
43 Correct 40 ms 1444 KB Output is correct
44 Correct 53 ms 2724 KB Output is correct
45 Correct 85 ms 5308 KB Output is correct
46 Correct 134 ms 10100 KB Output is correct
47 Incorrect 181 ms 13680 KB Output isn't correct
48 Halted 0 ms 0 KB -