oj.uz

Submission #856477

# Submission time Handle Problem Language Result Execution time Memory
856477 2023-10-03T16:08:01 Z RiverFlow Paths (BOI18_paths) C++14
100 / 100
 386 ms 59740 KB 
#include <bits/stdc++.h>

#define nl "\n"
#define no "NO"
#define yes "YES"
#define fi first
#define se second
#define vec vector
#define task "main"
#define _mp make_pair
#define ii pair<int, int>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define evoid(val) return void(std::cout << val)
#define FOR(i, a, b) for(int i = (a); i <= (b); ++i)
#define FOD(i, b, a) for(int i = (b); i >= (a); --i)
#define unq(x) sort(all(x)); x.resize(unique(all(x)) - x.begin())

using namespace std;

template<typename U, typename V> bool maxi(U &a, V b) {
    if (a < b) { a = b; return 1; } return 0;
}
template<typename U, typename V> bool mini(U &a, V b) {
    if (a > b) { a = b; return 1; } return 0;
}

const int N = (int)3e5 + 9;
const int mod = (int)1e9 + 7;

void prepare(); void main_code();

int main() {
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    if (fopen(task".inp", "r")) {
        freopen(task".inp", "r", stdin);
        freopen(task".out", "w", stdout);
    }
    const bool MULTITEST = 0; prepare();
    int num_test = 1; if (MULTITEST) cin >> num_test;
    while (num_test--) { main_code(); }
}

void prepare() {};

#define MASK(i) (1 << i)
#define BIT(mask, i) (1 & (mask >> i))

int a[N], dp[N][1 << 5];

vector<int> p[6], g[N];

void main_code() {
    int n, m, k; cin >> n >> m >> k;
    for(int i = 1; i <= n; ++i) cin >> a[i], --a[i];
    for(int i = 1; i <= m; ++i) {
        int u, v; cin >> u >> v;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    memset(dp, 0, sizeof dp);
    FOR(i, 1, n) dp[i][MASK(a[i])] = 1;
    FOR(mask, 0, MASK(k) - 1) {
        p[__builtin_popcount(mask)].push_back(mask);
    }
    FOR(j, 1, k - 1) {
        for(int t : p[j]) {
            FOR(i, 1, n) for(int v : g[i]) if (BIT(t, a[v]) == 0) {
                dp[v][t ^ MASK(a[v])] += dp[i][t];
            }
        }
    }
    long long res = 0;

    FOR(j, 2, k) for(int t : p[j])
        FOR(i, 1, n) res += dp[i][t];

    cout << res;
}


/*     Let the river flows naturally     */

Compilation message

paths.cpp: In function 'int main()':
paths.cpp:36:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   36 |         freopen(task".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
paths.cpp:37:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |         freopen(task".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 45660 KB Output is correct
2 Correct 7 ms 45656 KB Output is correct
3 Correct 7 ms 45712 KB Output is correct
4 Correct 7 ms 45728 KB Output is correct
5 Correct 6 ms 45660 KB Output is correct
6 Correct 6 ms 45660 KB Output is correct
7 Correct 6 ms 45764 KB Output is correct
8 Correct 7 ms 45656 KB Output is correct
9 Correct 6 ms 45660 KB Output is correct
10 Correct 7 ms 45784 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 64 ms 52056 KB Output is correct
2 Correct 68 ms 51544 KB Output is correct
3 Correct 285 ms 58840 KB Output is correct
4 Correct 77 ms 53428 KB Output is correct
5 Correct 66 ms 53332 KB Output is correct
6 Correct 177 ms 57024 KB Output is correct
7 Correct 235 ms 59084 KB Output is correct
8 Correct 288 ms 59728 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 45660 KB Output is correct
2 Correct 7 ms 45656 KB Output is correct
3 Correct 7 ms 45712 KB Output is correct
4 Correct 7 ms 45728 KB Output is correct
5 Correct 6 ms 45660 KB Output is correct
6 Correct 6 ms 45660 KB Output is correct
7 Correct 6 ms 45764 KB Output is correct
8 Correct 7 ms 45656 KB Output is correct
9 Correct 6 ms 45660 KB Output is correct
10 Correct 7 ms 45784 KB Output is correct
11 Correct 64 ms 52056 KB Output is correct
12 Correct 68 ms 51544 KB Output is correct
13 Correct 285 ms 58840 KB Output is correct
14 Correct 77 ms 53428 KB Output is correct
15 Correct 66 ms 53332 KB Output is correct
16 Correct 177 ms 57024 KB Output is correct
17 Correct 235 ms 59084 KB Output is correct
18 Correct 288 ms 59728 KB Output is correct
19 Correct 68 ms 52112 KB Output is correct
20 Correct 63 ms 51608 KB Output is correct
21 Correct 253 ms 59092 KB Output is correct
22 Correct 79 ms 53332 KB Output is correct
23 Correct 69 ms 53392 KB Output is correct
24 Correct 213 ms 56984 KB Output is correct
25 Correct 234 ms 58964 KB Output is correct
26 Correct 221 ms 59740 KB Output is correct
27 Correct 85 ms 51680 KB Output is correct
28 Correct 93 ms 52992 KB Output is correct
29 Correct 375 ms 59040 KB Output is correct
30 Correct 257 ms 55532 KB Output is correct
31 Correct 230 ms 55604 KB Output is correct
32 Correct 386 ms 59084 KB Output is correct
33 Correct 6 ms 45660 KB Output is correct
34 Correct 6 ms 45672 KB Output is correct
35 Correct 7 ms 45732 KB Output is correct
36 Correct 6 ms 45660 KB Output is correct
37 Correct 6 ms 45660 KB Output is correct
38 Correct 6 ms 45660 KB Output is correct
39 Correct 6 ms 45716 KB Output is correct
40 Correct 6 ms 45660 KB Output is correct
41 Correct 6 ms 45684 KB Output is correct
42 Correct 6 ms 45660 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 45968 KB Output is correct
2 Correct 44 ms 47616 KB Output is correct
3 Correct 22 ms 47452 KB Output is correct
4 Correct 65 ms 49744 KB Output is correct
5 Correct 44 ms 50636 KB Output is correct
6 Correct 142 ms 49744 KB Output is correct
7 Correct 35 ms 47564 KB Output is correct
8 Correct 90 ms 49900 KB Output is correct
9 Correct 61 ms 50472 KB Output is correct
10 Correct 74 ms 50384 KB Output is correct
11 Correct 71 ms 48588 KB Output is correct
12 Correct 83 ms 49620 KB Output is correct
13 Correct 71 ms 48812 KB Output is correct
14 Correct 146 ms 49748 KB Output is correct
15 Correct 132 ms 50000 KB Output is correct
16 Correct 6 ms 45660 KB Output is correct
17 Correct 6 ms 45660 KB Output is correct
18 Correct 6 ms 45660 KB Output is correct
19 Correct 6 ms 45716 KB Output is correct
20 Correct 6 ms 45712 KB Output is correct
21 Correct 6 ms 45656 KB Output is correct
22 Correct 6 ms 45656 KB Output is correct
23 Correct 6 ms 45660 KB Output is correct
24 Correct 6 ms 45656 KB Output is correct
25 Correct 6 ms 45660 KB Output is correct