oj.uz

Submission #1003646

# Submission time Handle Problem Language Result Execution time Memory
1003646 2024-06-20T14:34:29 Z GrindMachine Amusement Park (CEOI19_amusementpark) C++17
42 / 100
 532 ms 1048576 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif

/*

read the solution a long time ago and remember some ideas from there

*/

const int MOD = 1e9 + 7;
const int N = 20 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

vector<pll> adj[N];

void solve(int test_case)
{
    ll n,m; cin >> n >> m;
    rep1(i,m){
        ll u,v; cin >> u >> v;
        u--, v--;
        adj[u].pb({v,0}), adj[v].pb({u,1});
    }

    ll ans = 0;

    rep(i,n){
        for(auto [j,t] : adj[i]){
            if(!t) conts;

            // #of lexi min toposorts in which i comes before j
            ll dp[1<<n][1<<n];
            memset(dp,0,sizeof dp);
            dp[0][0] = 1;

            rep(mask,1<<n){
                rep(bad,1<<n){
                    if(!dp[mask][bad]) conts;
                    rep(u,n){
                        if(mask&(1<<u) or bad&(1<<u)) conts;
                        int mask2 = mask|(1<<u);
                        int bad2 = bad;
                        bad2 |= (1<<u)-1;
                        for(auto [v,t] : adj[u]){
                            if(mask&(1<<v)) conts;
                            if(bad2&(1<<v)){
                                bad2 ^= (1<<v);
                            }
                        }

                        dp[mask2][bad2] += dp[mask][bad];
                        dp[mask2][bad2] %= MOD;
                    }
                }
            }

            ll contrib = 0;
            rep(bad,1<<n){
                contrib += dp[(1<<n)-1][bad];
                contrib %= MOD;
            }

            ans += contrib;
            ans %= MOD;
        }
    }

    ans = (ans*(MOD+1)/2)%MOD;
    cout << ans << endl;
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 600 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 860 KB Output is correct
33 Correct 1 ms 860 KB Output is correct
34 Correct 2 ms 860 KB Output is correct
35 Correct 3 ms 860 KB Output is correct
36 Correct 3 ms 860 KB Output is correct
37 Correct 5 ms 856 KB Output is correct
38 Correct 5 ms 856 KB Output is correct
39 Correct 2 ms 2396 KB Output is correct
40 Correct 3 ms 2500 KB Output is correct
41 Correct 5 ms 2396 KB Output is correct
42 Correct 7 ms 2392 KB Output is correct
43 Correct 9 ms 2396 KB Output is correct
44 Correct 13 ms 2500 KB Output is correct
45 Correct 17 ms 2392 KB Output is correct
46 Correct 20 ms 2396 KB Output is correct
47 Correct 24 ms 2396 KB Output is correct
48 Correct 3 ms 2396 KB Output is correct
49 Correct 6 ms 2396 KB Output is correct
50 Correct 7 ms 2396 KB Output is correct
51 Correct 8 ms 2392 KB Output is correct
52 Correct 9 ms 8540 KB Output is correct
53 Correct 14 ms 8656 KB Output is correct
54 Correct 21 ms 8540 KB Output is correct
55 Correct 28 ms 8540 KB Output is correct
56 Correct 45 ms 8540 KB Output is correct
57 Correct 59 ms 8640 KB Output is correct
58 Correct 72 ms 8644 KB Output is correct
59 Correct 86 ms 8408 KB Output is correct
60 Correct 103 ms 8536 KB Output is correct
61 Correct 13 ms 8536 KB Output is correct
62 Correct 25 ms 8540 KB Output is correct
63 Correct 25 ms 8540 KB Output is correct
64 Correct 25 ms 8540 KB Output is correct

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 600 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 860 KB Output is correct
33 Correct 1 ms 860 KB Output is correct
34 Correct 2 ms 860 KB Output is correct
35 Correct 3 ms 860 KB Output is correct
36 Correct 3 ms 860 KB Output is correct
37 Correct 5 ms 856 KB Output is correct
38 Correct 5 ms 856 KB Output is correct
39 Correct 2 ms 2396 KB Output is correct
40 Correct 3 ms 2500 KB Output is correct
41 Correct 5 ms 2396 KB Output is correct
42 Correct 7 ms 2392 KB Output is correct
43 Correct 9 ms 2396 KB Output is correct
44 Correct 13 ms 2500 KB Output is correct
45 Correct 17 ms 2392 KB Output is correct
46 Correct 20 ms 2396 KB Output is correct
47 Correct 24 ms 2396 KB Output is correct
48 Correct 3 ms 2396 KB Output is correct
49 Correct 6 ms 2396 KB Output is correct
50 Correct 7 ms 2396 KB Output is correct
51 Correct 8 ms 2392 KB Output is correct
52 Correct 9 ms 8540 KB Output is correct
53 Correct 14 ms 8656 KB Output is correct
54 Correct 21 ms 8540 KB Output is correct
55 Correct 28 ms 8540 KB Output is correct
56 Correct 45 ms 8540 KB Output is correct
57 Correct 59 ms 8640 KB Output is correct
58 Correct 72 ms 8644 KB Output is correct
59 Correct 86 ms 8408 KB Output is correct
60 Correct 103 ms 8536 KB Output is correct
61 Correct 13 ms 8536 KB Output is correct
62 Correct 25 ms 8540 KB Output is correct
63 Correct 25 ms 8540 KB Output is correct
64 Correct 25 ms 8540 KB Output is correct
65 Runtime error 532 ms 1048576 KB Execution killed with signal 9
66 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 600 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 860 KB Output is correct
33 Correct 1 ms 860 KB Output is correct
34 Correct 2 ms 860 KB Output is correct
35 Correct 3 ms 860 KB Output is correct
36 Correct 3 ms 860 KB Output is correct
37 Correct 5 ms 856 KB Output is correct
38 Correct 5 ms 856 KB Output is correct
39 Correct 2 ms 2396 KB Output is correct
40 Correct 3 ms 2500 KB Output is correct
41 Correct 5 ms 2396 KB Output is correct
42 Correct 7 ms 2392 KB Output is correct
43 Correct 9 ms 2396 KB Output is correct
44 Correct 13 ms 2500 KB Output is correct
45 Correct 17 ms 2392 KB Output is correct
46 Correct 20 ms 2396 KB Output is correct
47 Correct 24 ms 2396 KB Output is correct
48 Correct 3 ms 2396 KB Output is correct
49 Correct 6 ms 2396 KB Output is correct
50 Correct 7 ms 2396 KB Output is correct
51 Correct 8 ms 2392 KB Output is correct
52 Correct 9 ms 8540 KB Output is correct
53 Correct 14 ms 8656 KB Output is correct
54 Correct 21 ms 8540 KB Output is correct
55 Correct 28 ms 8540 KB Output is correct
56 Correct 45 ms 8540 KB Output is correct
57 Correct 59 ms 8640 KB Output is correct
58 Correct 72 ms 8644 KB Output is correct
59 Correct 86 ms 8408 KB Output is correct
60 Correct 103 ms 8536 KB Output is correct
61 Correct 13 ms 8536 KB Output is correct
62 Correct 25 ms 8540 KB Output is correct
63 Correct 25 ms 8540 KB Output is correct
64 Correct 25 ms 8540 KB Output is correct
65 Runtime error 532 ms 1048576 KB Execution killed with signal 9
66 Halted 0 ms 0 KB -