oj.uz

Submission #790156

# Submission time Handle Problem Language Result Execution time Memory
790156 2023-07-22T11:23:11 Z TB_ Paths (BOI18_paths) C++17
100 / 100
 309 ms 69752 KB 
#include <bits/stdc++.h>
using namespace std;

// #undef _GLIBCXX_DEBUG                // disable run-time bound checking, etc
// #pragma GCC optimize("Ofast,inline") // Ofast = O3,fast-math,allow-store-data-races,no-protect-parens
// #pragma GCC optimize ("unroll-loops")

// #pragma GCC target("bmi,bmi2,lzcnt,popcnt")                      // bit manipulation
// #pragma GCC target("movbe")                                      // byte swap
// #pragma GCC target("aes,pclmul,rdrnd")                           // encryption
// #pragma GCC target("avx,avx2,f16c,fma,sse3,ssse3,sse4.1,sse4.2") // SIMD

// #include <bits/extc++.h>
// using namespace __gnu_pbds;
// template<class T>using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
// template<class T>using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define ll long long
#define INF (ll)1e9+7
#define fo(i, n) for(int i=0;i<((ll)n);i++)
#define deb(x) cout << #x << " = " << x << endl;
#define deb2(x, y) cout << #x << " = " << x << ", " << #y << " = " << y << endl
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define LSOne(S) ((S) & (-S))
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
inline int readint(){ int v = 0; char c; while((c = getchar()) != EOF && c != ' ' && c != '\n'){ v *= 10; v += c - '0'; } return v; }
inline int readintsigned() { int v = 0; int sign = 1; char c = getchar(); if (c == '-') { sign = -1; } else { v += c - '0'; } while ((c = getchar()) != EOF && c != ' ' && c != '\n') { v *= 10; v += c - '0'; } return v * sign; }
inline string readstring() { string s; char c; while ((c = getchar()) != EOF && c != '\n' && c != ' ') { s.push_back(c); } return s; }
template <class result_t=std::chrono::milliseconds,class clock_t=std::chrono::steady_clock,class duration_t = std::chrono::milliseconds>
auto since(std::chrono::time_point<clock_t, duration_t> const& start){return std::chrono::duration_cast<result_t>(clock_t::now() - start);}
typedef pair<int, int> pii;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpii;
typedef vector<pl> vpl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<vpii> vvpii;
typedef vector<vpl> vvpl;

int main() {
    // cout << fixed << setprecision(20);
    // auto start = std::chrono::steady_clock::now(); // since(start).count()
    cin.tie(0)->sync_with_stdio(0);

    int n, m, k, from, to, pos, mask;
    cin >> n >> m >> k;
    vl color(n);
    vvl adj(n);
    fo(i, n) cin >> color[i];
    fo(i, m){
        cin >> from >> to;
        adj[--from].pb(--to);
        adj[to].pb(from);
    }

    ll memo[n][1<<k];
    memset(memo, 0, sizeof(memo));
    ll ans = 0;
    queue<pl> q; // pos, mask
    fo(i, n) {
        q.push({i, (1<<(color[i]-1))});
        memo[i][1<<(color[i]-1)] = 1;
    }

    while(!q.empty()){
        tie(pos, mask) = q.front();
        q.pop();
        if(!memo[pos][mask] || mask == (1<<k)-1) continue;

        for(auto v : adj[pos]){
            if(mask&(1<<(color[v]-1))) continue;
            q.push({v, mask|(1<<(color[v]-1))});
            memo[v][mask|(1<<(color[v]-1))] += memo[pos][mask];
            ans += memo[pos][mask];
        }
        memo[pos][mask] = 0;
    }

    cout << ans;


    return 0;
}

Subtask #1
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 324 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 320 KB Output is correct
10 Correct 1 ms 212 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 22400 KB Output is correct
2 Correct 52 ms 22184 KB Output is correct
3 Correct 217 ms 50132 KB Output is correct
4 Correct 73 ms 18536 KB Output is correct
5 Correct 58 ms 13644 KB Output is correct
6 Correct 172 ms 40864 KB Output is correct
7 Correct 221 ms 50080 KB Output is correct
8 Correct 230 ms 50616 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 324 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 320 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 66 ms 22400 KB Output is correct
12 Correct 52 ms 22184 KB Output is correct
13 Correct 217 ms 50132 KB Output is correct
14 Correct 73 ms 18536 KB Output is correct
15 Correct 58 ms 13644 KB Output is correct
16 Correct 172 ms 40864 KB Output is correct
17 Correct 221 ms 50080 KB Output is correct
18 Correct 230 ms 50616 KB Output is correct
19 Correct 63 ms 22480 KB Output is correct
20 Correct 53 ms 22136 KB Output is correct
21 Correct 225 ms 50020 KB Output is correct
22 Correct 71 ms 18552 KB Output is correct
23 Correct 75 ms 13628 KB Output is correct
24 Correct 155 ms 40860 KB Output is correct
25 Correct 240 ms 50124 KB Output is correct
26 Correct 219 ms 50620 KB Output is correct
27 Correct 73 ms 31324 KB Output is correct
28 Correct 96 ms 33140 KB Output is correct
29 Correct 309 ms 69752 KB Output is correct
30 Correct 263 ms 47904 KB Output is correct
31 Correct 281 ms 48216 KB Output is correct
32 Correct 299 ms 69724 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 0 ms 340 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 0 ms 340 KB Output is correct
41 Correct 0 ms 320 KB Output is correct
42 Correct 0 ms 212 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 47 ms 15140 KB Output is correct
3 Correct 18 ms 7380 KB Output is correct
4 Correct 51 ms 16776 KB Output is correct
5 Correct 38 ms 18224 KB Output is correct
6 Correct 93 ms 36204 KB Output is correct
7 Correct 25 ms 10332 KB Output is correct
8 Correct 65 ms 23316 KB Output is correct
9 Correct 54 ms 26112 KB Output is correct
10 Correct 74 ms 25348 KB Output is correct
11 Correct 76 ms 23236 KB Output is correct
12 Correct 78 ms 30972 KB Output is correct
13 Correct 84 ms 22916 KB Output is correct
14 Correct 107 ms 36200 KB Output is correct
15 Correct 81 ms 36000 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 316 KB Output is correct
20 Correct 0 ms 320 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 1 ms 320 KB Output is correct