oj.uz

Submission #441400

# Submission time Handle Problem Language Result Execution time Memory
441400 2021-07-05T06:50:14 Z Haruto810198 Paths (BOI18_paths) C++17
100 / 100
 2183 ms 27796 KB 
#include <bits/stdc++.h>

using namespace std;

#define int long long
#define double long double

#define FOR(i, l, r, d) for(int i=(l); i<=(r); i+=(d))
#define szof(x) ((int)(x).size())

#define vi vector<int>
#define pii pair<int,int>

#define F first
#define S second

#define pb push_back
#define eb emplace_back
#define mkp make_pair

const int INF = 2147483647;
const int LNF = INF*INF;
const int MOD = 1000000007;
const int mod = 998244353;

//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")

const int MAX = 300010;

int n, m, k;
vi edge[MAX];
int color[MAX];
int cnt[MAX];

vector<vi> per;

void Enum(vi arr){

    if(szof(arr)>=2) per.pb(arr);

    if(szof(arr) == k){
        return;
    }

    FOR(i, 1, k, 1){
        bool flag = 1;
        for(int j : arr){
            if(j==i) flag=0;
        }
        if(flag){
            arr.pb(i);
            Enum(arr);
            arr.pop_back();
        }
    }

}

int solve(vi arr){

    FOR(i, 1, n, 1){
        cnt[i] = (color[i]==arr[0]) ? 1 : 0;
    }

    FOR(i, 1, szof(arr)-1, 1){

        int pc = arr[i-1]; /// previous color
        int cc = arr[i]; /// current color

        FOR(u, 1, n, 1){
            for(int v : edge[u]){
                if(color[u] == pc and color[v] == cc){
                    cnt[v] += cnt[u];
                }
            }
        }

    }

    int ret = 0;
    FOR(i, 1, n, 1){
        if(color[i] == arr.back()){
            ret += cnt[i];
        }
    }

    /*
    cerr<<"solve(";
    for(int i : arr){
        cerr<<i;
    }
    cerr<<") = "<<ret<<endl;
    */

    return ret;

}

signed main(){

    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    /// input
    cin>>n>>m>>k;
    FOR(i, 1, n, 1){
        cin>>color[i];
    }
    FOR(i, 1, m, 1){
        int u, v;
        cin>>u>>v;
        edge[u].pb(v);
        edge[v].pb(u);
    }

    /// permutations
    FOR(i, 1, k, 1){
        Enum({i});
    }

    /// solve
    int res = 0;
    for(vi arr : per){
        res += solve(arr);
    }

    cout<<res<<'\n';

    return 0;

}

Subtask #1
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7372 KB Output is correct
2 Correct 5 ms 7292 KB Output is correct
3 Correct 4 ms 7372 KB Output is correct
4 Correct 5 ms 7372 KB Output is correct
5 Correct 4 ms 7372 KB Output is correct
6 Correct 4 ms 7372 KB Output is correct
7 Correct 5 ms 7372 KB Output is correct
8 Correct 5 ms 7372 KB Output is correct
9 Correct 5 ms 7412 KB Output is correct
10 Correct 4 ms 7244 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 107 ms 14644 KB Output is correct
2 Correct 102 ms 15012 KB Output is correct
3 Correct 505 ms 26964 KB Output is correct
4 Correct 121 ms 19268 KB Output is correct
5 Correct 121 ms 18988 KB Output is correct
6 Correct 329 ms 23408 KB Output is correct
7 Correct 517 ms 27040 KB Output is correct
8 Correct 502 ms 27584 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7372 KB Output is correct
2 Correct 5 ms 7292 KB Output is correct
3 Correct 4 ms 7372 KB Output is correct
4 Correct 5 ms 7372 KB Output is correct
5 Correct 4 ms 7372 KB Output is correct
6 Correct 4 ms 7372 KB Output is correct
7 Correct 5 ms 7372 KB Output is correct
8 Correct 5 ms 7372 KB Output is correct
9 Correct 5 ms 7412 KB Output is correct
10 Correct 4 ms 7244 KB Output is correct
11 Correct 107 ms 14644 KB Output is correct
12 Correct 102 ms 15012 KB Output is correct
13 Correct 505 ms 26964 KB Output is correct
14 Correct 121 ms 19268 KB Output is correct
15 Correct 121 ms 18988 KB Output is correct
16 Correct 329 ms 23408 KB Output is correct
17 Correct 517 ms 27040 KB Output is correct
18 Correct 502 ms 27584 KB Output is correct
19 Correct 112 ms 17452 KB Output is correct
20 Correct 91 ms 16700 KB Output is correct
21 Correct 533 ms 27076 KB Output is correct
22 Correct 142 ms 19324 KB Output is correct
23 Correct 113 ms 18992 KB Output is correct
24 Correct 334 ms 23416 KB Output is correct
25 Correct 527 ms 27036 KB Output is correct
26 Correct 564 ms 27796 KB Output is correct
27 Correct 205 ms 16632 KB Output is correct
28 Correct 253 ms 18888 KB Output is correct
29 Correct 1863 ms 27112 KB Output is correct
30 Correct 932 ms 22364 KB Output is correct
31 Correct 950 ms 22540 KB Output is correct
32 Correct 1833 ms 27064 KB Output is correct
33 Correct 5 ms 7372 KB Output is correct
34 Correct 6 ms 7372 KB Output is correct
35 Correct 6 ms 7364 KB Output is correct
36 Correct 5 ms 7372 KB Output is correct
37 Correct 5 ms 7372 KB Output is correct
38 Correct 4 ms 7368 KB Output is correct
39 Correct 5 ms 7372 KB Output is correct
40 Correct 5 ms 7372 KB Output is correct
41 Correct 5 ms 7372 KB Output is correct
42 Correct 5 ms 7316 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7372 KB Output is correct
2 Correct 291 ms 9664 KB Output is correct
3 Correct 33 ms 10052 KB Output is correct
4 Correct 116 ms 12996 KB Output is correct
5 Correct 78 ms 13284 KB Output is correct
6 Correct 2183 ms 12968 KB Output is correct
7 Correct 66 ms 10060 KB Output is correct
8 Correct 371 ms 12864 KB Output is correct
9 Correct 250 ms 13376 KB Output is correct
10 Correct 302 ms 13020 KB Output is correct
11 Correct 1069 ms 11196 KB Output is correct
12 Correct 1046 ms 12212 KB Output is correct
13 Correct 1018 ms 11312 KB Output is correct
14 Correct 2135 ms 12972 KB Output is correct
15 Correct 2060 ms 13052 KB Output is correct
16 Correct 5 ms 7372 KB Output is correct
17 Correct 5 ms 7372 KB Output is correct
18 Correct 5 ms 7372 KB Output is correct
19 Correct 4 ms 7372 KB Output is correct
20 Correct 4 ms 7372 KB Output is correct
21 Correct 4 ms 7360 KB Output is correct
22 Correct 5 ms 7372 KB Output is correct
23 Correct 5 ms 7372 KB Output is correct
24 Correct 5 ms 7364 KB Output is correct
25 Correct 4 ms 7372 KB Output is correct