oj.uz

Submission #1111701

# Submission time Handle Problem Language Result Execution time Memory
1111701 2024-11-12T16:53:26 Z PagodePaiva Paths (BOI18_paths) C++17
70 / 100
 403 ms 122952 KB 
#include<bits/stdc++.h>
#define int long long

using namespace std;

const int N = 300010;
int n,m, k;
vector <int> g[N];
int cor[N];
int res = 0;
int dp[N][6];
int dp2[N][6][6];

void solve(int x){
    if(x == 2){
        int t = 0;
        for(int i = 1;i <= n;i++){
            for(auto x : g[i]){
                if(cor[x] != cor[i]) t++;
            }
        }
        res += t;
        return;
    }
    if(x == 3){
        for(int v = 1;v <= n;v++){
            int resp = 0;
            for(auto x : g[v]){
                if(cor[x] == cor[v]) continue;
                for(int j = 1;j <= k;j++){
                    if(j == cor[x] or j == cor[v]) continue;
                    resp += dp[v][j];
                }
            }
            res += resp;
        }
        return;
    }
    if(x == 4){
        for(int v = 1;v <= n;v++){
            int resp = 0;
            for(auto x : g[v]){
                if(cor[x] == cor[v]) continue;
                for(int j = 1;j <= k;j++){
                    if(cor[x] == j or cor[v] == j) continue;
                    for(int t = 1;t <= k;t++){
                        if(cor[x] == t or cor[v] == t or j == t) continue;
                        resp += dp[v][j]*dp[x][t];
                    }
                }
            }
            res += resp;
        }
    }
    if(x == 5){
        for(int v = 1;v <= n;v++){
            for(int j = 1;j <= k;j++){
                if(j == cor[v]) continue;
                for(int t = 1;t <= k;t++){
                    if(j == t or t == cor[v])continue;
                    set <int> s;
                    s.insert(1);
                    s.insert(2);
                    s.insert(3);
                    s.insert(4);
                    s.insert(5);
                    s.erase(j);
                    s.erase(k);
                    s.erase(cor[v]);
                    auto it = s.begin();
                    int c1 = *it;
                    it++;
                    int c2 = *it;
                    res += dp2[v][j][t]*(dp2[v][c1][c2] + dp2[v][c2][c1]);
                }
            }
        }
    }
}
int32_t main(){
    cin >> n >> m >> k;
    for(int i = 1;i <= n;i++){
        cin >> cor[i];
    }
    for(int i = 0;i < m;i++){
        int a, b;
        cin >> a >> b;
        g[a].push_back(b);
        g[b].push_back(a);
    }
    for(int i = 1;i <= n;i++){
        int v = i;
        for(auto x : g[v]){
            dp[v][cor[x]]++;
        }
    }
    for(int i = 1;i <= n;i++){
        int v = i;
        for(auto x : g[v]){
            int c1 = cor[x];
            for(int j = 1;j <= 5;j++){
                if(j == cor[v] or j == c1) continue;
                dp2[v][c1][j] += dp[x][j];
            }
        }
    }
    for(int i = 2;i <= k;i++){
        solve(i);
    }
    cout << res << '\n';
}

Subtask #1
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7504 KB Output is correct
2 Correct 6 ms 7504 KB Output is correct
3 Correct 6 ms 7504 KB Output is correct
4 Correct 6 ms 7504 KB Output is correct
5 Correct 6 ms 7528 KB Output is correct
6 Correct 6 ms 7672 KB Output is correct
7 Correct 8 ms 7504 KB Output is correct
8 Correct 6 ms 7504 KB Output is correct
9 Correct 5 ms 7504 KB Output is correct
10 Correct 6 ms 7504 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 123 ms 17820 KB Output is correct
2 Correct 99 ms 15688 KB Output is correct
3 Correct 347 ms 118856 KB Output is correct
4 Correct 175 ms 25684 KB Output is correct
5 Correct 156 ms 27716 KB Output is correct
6 Correct 262 ms 87000 KB Output is correct
7 Correct 346 ms 122952 KB Output is correct
8 Correct 338 ms 119368 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7504 KB Output is correct
2 Correct 6 ms 7504 KB Output is correct
3 Correct 6 ms 7504 KB Output is correct
4 Correct 6 ms 7504 KB Output is correct
5 Correct 6 ms 7528 KB Output is correct
6 Correct 6 ms 7672 KB Output is correct
7 Correct 8 ms 7504 KB Output is correct
8 Correct 6 ms 7504 KB Output is correct
9 Correct 5 ms 7504 KB Output is correct
10 Correct 6 ms 7504 KB Output is correct
11 Correct 123 ms 17820 KB Output is correct
12 Correct 99 ms 15688 KB Output is correct
13 Correct 347 ms 118856 KB Output is correct
14 Correct 175 ms 25684 KB Output is correct
15 Correct 156 ms 27716 KB Output is correct
16 Correct 262 ms 87000 KB Output is correct
17 Correct 346 ms 122952 KB Output is correct
18 Correct 338 ms 119368 KB Output is correct
19 Correct 117 ms 17736 KB Output is correct
20 Correct 95 ms 16768 KB Output is correct
21 Correct 375 ms 118856 KB Output is correct
22 Correct 153 ms 28608 KB Output is correct
23 Correct 134 ms 25672 KB Output is correct
24 Correct 262 ms 83580 KB Output is correct
25 Correct 353 ms 122692 KB Output is correct
26 Correct 325 ms 121900 KB Output is correct
27 Correct 107 ms 16068 KB Output is correct
28 Correct 132 ms 20264 KB Output is correct
29 Correct 390 ms 122196 KB Output is correct
30 Correct 273 ms 69892 KB Output is correct
31 Correct 300 ms 69184 KB Output is correct
32 Correct 403 ms 118796 KB Output is correct
33 Correct 6 ms 7672 KB Output is correct
34 Correct 7 ms 7672 KB Output is correct
35 Correct 6 ms 7516 KB Output is correct
36 Correct 6 ms 7504 KB Output is correct
37 Correct 7 ms 7672 KB Output is correct
38 Correct 6 ms 7504 KB Output is correct
39 Correct 6 ms 7504 KB Output is correct
40 Correct 6 ms 7504 KB Output is correct
41 Correct 5 ms 7504 KB Output is correct
42 Correct 8 ms 7504 KB Output is correct

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 7504 KB Output is correct
2 Incorrect 43 ms 10576 KB Output isn't correct
3 Halted 0 ms 0 KB -