oj.uz

Submission #1114176

# Submission time Handle Problem Language Result Execution time Memory
1114176 2024-11-18T09:18:21 Z n3rm1n Amusement Park (CEOI19_amusementpark) C++17
19 / 100
 3000 ms 43536 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
int ans = 0, imp = 0;
const int mod = 998244353;
set < vector < bool > > 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()
{
    vector < bool > v;
    int cnt = 0;
    for (int i = 1; i <= m; ++ i)
    {
        if(order[from[i]] > order[to[i]])
        {
            v.push_back(0);

        }
        else
        {
            v.push_back(1);


        }
    }
    if(mp.find(v) != mp.end())return;
    mp.insert(v);
    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;
}

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 568 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 504 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 568 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 504 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 2 ms 336 KB Output is correct
28 Correct 3 ms 336 KB Output is correct
29 Correct 3 ms 592 KB Output is correct
30 Correct 5 ms 764 KB Output is correct
31 Correct 7 ms 848 KB Output is correct
32 Correct 5 ms 336 KB Output is correct
33 Correct 9 ms 336 KB Output is correct
34 Correct 14 ms 588 KB Output is correct
35 Correct 20 ms 848 KB Output is correct
36 Correct 27 ms 1352 KB Output is correct
37 Correct 48 ms 2868 KB Output is correct
38 Correct 62 ms 4680 KB Output is correct
39 Correct 43 ms 336 KB Output is correct
40 Correct 77 ms 336 KB Output is correct
41 Correct 112 ms 596 KB Output is correct
42 Correct 148 ms 896 KB Output is correct
43 Correct 226 ms 3364 KB Output is correct
44 Correct 285 ms 6232 KB Output is correct
45 Correct 403 ms 13384 KB Output is correct
46 Correct 588 ms 25116 KB Output is correct
47 Correct 829 ms 39960 KB Output is correct
48 Correct 68 ms 464 KB Output is correct
49 Correct 127 ms 840 KB Output is correct
50 Correct 131 ms 848 KB Output is correct
51 Correct 155 ms 880 KB Output is correct
52 Correct 488 ms 452 KB Output is correct
53 Correct 947 ms 476 KB Output is correct
54 Correct 1481 ms 1024 KB Output is correct
55 Correct 2138 ms 3928 KB Output is correct
56 Correct 2970 ms 20160 KB Output is correct
57 Execution timed out 3054 ms 43536 KB Time limit exceeded
58 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 568 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 504 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 2 ms 336 KB Output is correct
28 Correct 3 ms 336 KB Output is correct
29 Correct 3 ms 592 KB Output is correct
30 Correct 5 ms 764 KB Output is correct
31 Correct 7 ms 848 KB Output is correct
32 Correct 5 ms 336 KB Output is correct
33 Correct 9 ms 336 KB Output is correct
34 Correct 14 ms 588 KB Output is correct
35 Correct 20 ms 848 KB Output is correct
36 Correct 27 ms 1352 KB Output is correct
37 Correct 48 ms 2868 KB Output is correct
38 Correct 62 ms 4680 KB Output is correct
39 Correct 43 ms 336 KB Output is correct
40 Correct 77 ms 336 KB Output is correct
41 Correct 112 ms 596 KB Output is correct
42 Correct 148 ms 896 KB Output is correct
43 Correct 226 ms 3364 KB Output is correct
44 Correct 285 ms 6232 KB Output is correct
45 Correct 403 ms 13384 KB Output is correct
46 Correct 588 ms 25116 KB Output is correct
47 Correct 829 ms 39960 KB Output is correct
48 Correct 68 ms 464 KB Output is correct
49 Correct 127 ms 840 KB Output is correct
50 Correct 131 ms 848 KB Output is correct
51 Correct 155 ms 880 KB Output is correct
52 Correct 488 ms 452 KB Output is correct
53 Correct 947 ms 476 KB Output is correct
54 Correct 1481 ms 1024 KB Output is correct
55 Correct 2138 ms 3928 KB Output is correct
56 Correct 2970 ms 20160 KB Output is correct
57 Execution timed out 3054 ms 43536 KB Time limit exceeded
58 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 568 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 504 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 2 ms 336 KB Output is correct
28 Correct 3 ms 336 KB Output is correct
29 Correct 3 ms 592 KB Output is correct
30 Correct 5 ms 764 KB Output is correct
31 Correct 7 ms 848 KB Output is correct
32 Correct 5 ms 336 KB Output is correct
33 Correct 9 ms 336 KB Output is correct
34 Correct 14 ms 588 KB Output is correct
35 Correct 20 ms 848 KB Output is correct
36 Correct 27 ms 1352 KB Output is correct
37 Correct 48 ms 2868 KB Output is correct
38 Correct 62 ms 4680 KB Output is correct
39 Correct 43 ms 336 KB Output is correct
40 Correct 77 ms 336 KB Output is correct
41 Correct 112 ms 596 KB Output is correct
42 Correct 148 ms 896 KB Output is correct
43 Correct 226 ms 3364 KB Output is correct
44 Correct 285 ms 6232 KB Output is correct
45 Correct 403 ms 13384 KB Output is correct
46 Correct 588 ms 25116 KB Output is correct
47 Correct 829 ms 39960 KB Output is correct
48 Correct 68 ms 464 KB Output is correct
49 Correct 127 ms 840 KB Output is correct
50 Correct 131 ms 848 KB Output is correct
51 Correct 155 ms 880 KB Output is correct
52 Correct 488 ms 452 KB Output is correct
53 Correct 947 ms 476 KB Output is correct
54 Correct 1481 ms 1024 KB Output is correct
55 Correct 2138 ms 3928 KB Output is correct
56 Correct 2970 ms 20160 KB Output is correct
57 Execution timed out 3054 ms 43536 KB Time limit exceeded
58 Halted 0 ms 0 KB -