oj.uz

Submission #446490

# Submission time Handle Problem Language Result Execution time Memory
446490 2021-07-22T06:48:47 Z dxz05 Paths (BOI18_paths) C++14
20 / 100
 146 ms 17688 KB 
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>

using namespace std;

void debug_out() { cerr << endl; }

template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << "[" << H << "]";
    debug_out(T...);
}

#ifdef dddxxz
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

#define SZ(s) ((int)s.size())
#define all(x) (x).begin(), (x).end()
#define revall(x) (x).rbegin(), (x).rend()

clock_t startTime;

double getCurrentTime() {
    return (double) (clock() - startTime) / CLOCKS_PER_SEC;
}

#define MP make_pair

typedef long long ll;
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
const double eps = 0.00001;
const int MOD = 1e9 + 7;
const int INF = 1000000101;
const long long LLINF = 1223372000000000555;
const int N = 3e5 + 3e2;
const int M = 222;

int cnt[N][10];
int color[N];

void solve(int TC) {
    int n, m, k;
    cin >> n >> m >> k;

    for (int i = 1; i <= n; i++){
        cin >> color[i];
    }

    ll ans = 0;
    for (int i = 1; i <= m; i++){
        int a, b;
        cin >> a >> b;
        ans += color[a] != color[b];
        cnt[a][color[b]]++;
        cnt[b][color[a]]++;
    }

    ans <<= 1;

    if (k == 2){
        cout << ans;
        return;
    }

    for (int i = 1; i <= n; i++){
        for (int x = 1; x <= k; x++){
            for (int y = 1; y <= k; y++){
                if (x == y || color[i] == x || color[i] == y) continue;
                ans += 1ll * cnt[i][x] * cnt[i][y];
            }
        }
    }

    cout << ans;

}

int main() {
    startTime = clock();
    cin.tie(nullptr); cout.tie(nullptr);
    ios_base::sync_with_stdio(false);

    bool llololcal = false;
#ifdef dddxxz
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    llololcal = true;
#endif

    int TC = 1;
    //cin >> TC;

    for (int test = 1; test <= TC; test++) {
        //debug(test);
        //cout << "Case #" << test << ": ";
        solve(test);
    }

    if (llololcal) cerr << endl << "Time: " << int(getCurrentTime() * 1000) << " ms" << endl;

    return 0;
}

Subtask #1
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 332 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 460 KB Output is correct
2 Correct 52 ms 344 KB Output is correct
3 Correct 145 ms 16964 KB Output is correct
4 Correct 76 ms 4916 KB Output is correct
5 Correct 70 ms 4928 KB Output is correct
6 Correct 126 ms 13000 KB Output is correct
7 Correct 144 ms 17604 KB Output is correct
8 Correct 146 ms 17688 KB Output is correct

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 332 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

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