oj.uz

Submission #441402

# Submission time Handle Problem Language Result Execution time Memory
441402 2021-07-05T07:00:14 Z abc864197532 Paths (BOI18_paths) C++17
70 / 100
 324 ms 20100 KB 
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define X first
#define Y second
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define pii pair<int, int>
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define test(args...) abc("[" + string(#args) + "]", args)
void abc() {cerr << endl;}
template <typename T, typename ...U> void abc(T a, U ...b) {
    cerr << a << ' ', abc(b...);
}
template <typename T> void printv(T l, T r) {
    while (l != r) cout << *l << " \n"[++l == r];
}
const int mod = 1e9 + 7, N = 200000;

int main () {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, m, k;
    cin >> n >> m >> k;
    vector <int> color(n, 0);
    vector <pii> edge;
    vector <vector <int>> cnt(n, vector <int>(k, 0));
    for (int i = 0; i < n; ++i) cin >> color[i], --color[i];
    for (int i = 0, u, v; i < m; ++i) {
        cin >> u >> v, --u, --v;
        if (color[u] == color[v]) continue;
        edge.eb(u, v);
        cnt[u][color[v]]++;
        cnt[v][color[u]]++;
    }
    lli ans = 0;
    // len = 2
    ans += edge.size() * 2;
    // len = 3;
    for (pii A : edge) {
        int u, v;
        tie(u, v) = A;
        for (int i = 0; i < k; ++i) if (i != color[v] && i != color[u]) {
            ans += cnt[u][i] + cnt[v][i];
        }
    }
    // len = 4
    for (pii A : edge) {
        int u, v;
        tie(u, v) = A;
        for (int i = 0; i < k; ++i) for (int j = 0; j < k; ++j) {
            if (i == j) continue;
            if (i == color[v] || i == color[u]) continue;
            if (j == color[v] || j == color[u]) continue;
            ans += 1ll * cnt[v][i] * cnt[u][j] + 1ll * cnt[v][j] * cnt[u][i];
        }
    }
    cout << ans << endl;
}

Subtask #1
23.0 / 23.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 2696 KB Output is correct
2 Correct 80 ms 2440 KB Output is correct
3 Correct 218 ms 20000 KB Output is correct
4 Correct 93 ms 4232 KB Output is correct
5 Correct 63 ms 2068 KB Output is correct
6 Correct 164 ms 14224 KB Output is correct
7 Correct 202 ms 20096 KB Output is correct
8 Correct 201 ms 19984 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 76 ms 2696 KB Output is correct
12 Correct 80 ms 2440 KB Output is correct
13 Correct 218 ms 20000 KB Output is correct
14 Correct 93 ms 4232 KB Output is correct
15 Correct 63 ms 2068 KB Output is correct
16 Correct 164 ms 14224 KB Output is correct
17 Correct 202 ms 20096 KB Output is correct
18 Correct 201 ms 19984 KB Output is correct
19 Correct 78 ms 2692 KB Output is correct
20 Correct 70 ms 2664 KB Output is correct
21 Correct 238 ms 20100 KB Output is correct
22 Correct 99 ms 4224 KB Output is correct
23 Correct 64 ms 2064 KB Output is correct
24 Correct 181 ms 14212 KB Output is correct
25 Correct 213 ms 20080 KB Output is correct
26 Correct 227 ms 20032 KB Output is correct
27 Correct 74 ms 2476 KB Output is correct
28 Correct 89 ms 2948 KB Output is correct
29 Correct 272 ms 20100 KB Output is correct
30 Correct 194 ms 11216 KB Output is correct
31 Correct 266 ms 11292 KB Output is correct
32 Correct 324 ms 20008 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 0 ms 204 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 1 ms 204 KB Output is correct
41 Correct 1 ms 204 KB Output is correct
42 Correct 1 ms 204 KB Output is correct

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 39 ms 1492 KB Output isn't correct
3 Halted 0 ms 0 KB -