oj.uz

Submission #950279

# Submission time Handle Problem Language Result Execution time Memory
950279 2024-03-20T07:35:43 Z GrindMachine Paths (BOI18_paths) C++17
100 / 100
 462 ms 62248 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(x) 42
#endif

/*



*/

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

vector<ll> adj[N];

void solve(int test_case)
{
    ll n,m,k; cin >> n >> m >> k;
    vector<ll> a(n+5);
    rep1(i,n) cin >> a[i];
    rep1(i,n) a[i]--;
    rep1(i,m){
        ll u,v; cin >> u >> v;
        adj[u].pb(v), adj[v].pb(u);
    }

    ll dp[1<<k][n+5];
    memset(dp,0,sizeof dp);
    
    rep1(i,n) dp[1<<a[i]][i] = 1;
    ll ans = 0;

    rep(mask,1<<k){
        rep1(u,n){
            ans += dp[mask][u];
            trav(v,adj[u]){
                if(mask&(1<<a[v])) conts;
                dp[mask|(1<<a[v])][v] += dp[mask][u];
            }
        }
    }

    ans -= n;
    cout << ans << endl;
}

int main()
{
    fastio;

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

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

    return 0;
}

Subtask #1
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7260 KB Output is correct
2 Correct 2 ms 7516 KB Output is correct
3 Correct 3 ms 7260 KB Output is correct
4 Correct 3 ms 7260 KB Output is correct
5 Correct 3 ms 7260 KB Output is correct
6 Correct 3 ms 7272 KB Output is correct
7 Correct 2 ms 7260 KB Output is correct
8 Correct 2 ms 7512 KB Output is correct
9 Correct 3 ms 7268 KB Output is correct
10 Correct 2 ms 7256 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 17712 KB Output is correct
2 Correct 53 ms 16728 KB Output is correct
3 Correct 253 ms 43824 KB Output is correct
4 Correct 87 ms 20052 KB Output is correct
5 Correct 67 ms 19460 KB Output is correct
6 Correct 158 ms 34756 KB Output is correct
7 Correct 269 ms 43492 KB Output is correct
8 Correct 232 ms 44116 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7260 KB Output is correct
2 Correct 2 ms 7516 KB Output is correct
3 Correct 3 ms 7260 KB Output is correct
4 Correct 3 ms 7260 KB Output is correct
5 Correct 3 ms 7260 KB Output is correct
6 Correct 3 ms 7272 KB Output is correct
7 Correct 2 ms 7260 KB Output is correct
8 Correct 2 ms 7512 KB Output is correct
9 Correct 3 ms 7268 KB Output is correct
10 Correct 2 ms 7256 KB Output is correct
11 Correct 65 ms 17712 KB Output is correct
12 Correct 53 ms 16728 KB Output is correct
13 Correct 253 ms 43824 KB Output is correct
14 Correct 87 ms 20052 KB Output is correct
15 Correct 67 ms 19460 KB Output is correct
16 Correct 158 ms 34756 KB Output is correct
17 Correct 269 ms 43492 KB Output is correct
18 Correct 232 ms 44116 KB Output is correct
19 Correct 79 ms 17888 KB Output is correct
20 Correct 60 ms 17136 KB Output is correct
21 Correct 234 ms 43604 KB Output is correct
22 Correct 72 ms 20020 KB Output is correct
23 Correct 73 ms 19540 KB Output is correct
24 Correct 219 ms 34396 KB Output is correct
25 Correct 244 ms 43492 KB Output is correct
26 Correct 241 ms 44112 KB Output is correct
27 Correct 73 ms 16968 KB Output is correct
28 Correct 91 ms 19796 KB Output is correct
29 Correct 387 ms 62248 KB Output is correct
30 Correct 243 ms 40116 KB Output is correct
31 Correct 221 ms 40152 KB Output is correct
32 Correct 462 ms 62216 KB Output is correct
33 Correct 2 ms 7256 KB Output is correct
34 Correct 2 ms 7516 KB Output is correct
35 Correct 3 ms 7260 KB Output is correct
36 Correct 2 ms 7260 KB Output is correct
37 Correct 2 ms 7260 KB Output is correct
38 Correct 2 ms 7516 KB Output is correct
39 Correct 2 ms 7260 KB Output is correct
40 Correct 2 ms 7260 KB Output is correct
41 Correct 2 ms 7260 KB Output is correct
42 Correct 2 ms 7260 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7260 KB Output is correct
2 Correct 39 ms 10560 KB Output is correct
3 Correct 21 ms 10332 KB Output is correct
4 Correct 53 ms 19396 KB Output is correct
5 Correct 38 ms 19652 KB Output is correct
6 Correct 143 ms 38132 KB Output is correct
7 Correct 27 ms 10332 KB Output is correct
8 Correct 76 ms 25428 KB Output is correct
9 Correct 55 ms 26064 KB Output is correct
10 Correct 63 ms 25796 KB Output is correct
11 Correct 84 ms 24012 KB Output is correct
12 Correct 76 ms 31200 KB Output is correct
13 Correct 83 ms 24076 KB Output is correct
14 Correct 162 ms 37972 KB Output is correct
15 Correct 131 ms 38100 KB Output is correct
16 Correct 2 ms 7260 KB Output is correct
17 Correct 3 ms 7516 KB Output is correct
18 Correct 2 ms 7260 KB Output is correct
19 Correct 2 ms 7272 KB Output is correct
20 Correct 2 ms 7260 KB Output is correct
21 Correct 2 ms 7516 KB Output is correct
22 Correct 2 ms 7512 KB Output is correct
23 Correct 2 ms 7516 KB Output is correct
24 Correct 2 ms 7260 KB Output is correct
25 Correct 2 ms 7260 KB Output is correct