oj.uz

답안 #446561

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
446561 2021-07-22T12:22:33 Z dxz05 Paths (BOI18_paths) C++14
100 / 100
 1472 ms 32988 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];
vector<int> g[N];

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

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

    vector<pair<int, int>> edges;

    ll ans = 0;
    for (int i = 1; i <= m; i++){
        int a, b;
        cin >> a >> b;

        ans += 2 * (color[a] != color[b]);

        cnt[a][color[b]]++;
        cnt[b][color[a]]++;

        g[a].push_back(b);
        g[b].push_back(a);

        edges.emplace_back(a, b);
    }

    if (k == 1){
        cout << 0;
        return;
    }

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

    debug(ans);

    for (int i = 1; i <= n; i++){
        for (int x = 1; x <= k; x++){
            for (int y = 1; y <= k; y++){
                set<int> s = {color[i], x, y};
                if (s.size() == 3) ans += 1ll * cnt[i][x] * cnt[i][y];
            }
        }
    }

    debug(ans);

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

    for (auto edge : edges){
        int i = edge.first, j = edge.second;
        for (int x = 1; x <= k; x++){
            for (int y = 1; y <= k; y++){
                set<int> s = {color[i], color[j], x, y};
                if (s.size() == 4) ans += 2ll * cnt[i][x] * cnt[j][y];
            }
        }
    }

    debug(ans);

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

    for (int i = 1; i <= n; i++){
        vector<vector<int>> vv(6, vector<int>(6, 0));
        for (int j : g[i]){
            for (int x = 1; x <= 5; x++){
                vv[color[j]][x] += cnt[j][x];
            }
        }

        for (int a = 1; a <= 5; a++){
            if (a == color[i]) continue;
            for (int b = 1; b <= 5; b++){
                if (b == a || b == color[i]) continue;
                for (int c = 1; c <= 5; c++){
                    if (c == a || c == b || c == color[i]) continue;
                    for (int d = 1; d <= 5; d++){
                        if (d == a || d == b || d == c || d == color[i]) continue;
                        ans += 1ll * vv[a][b] * vv[c][d];
                    }
                }
            }
        }

    }

    debug(ans);

    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;
}

Compilation message

paths.cpp: In function 'void solve(int)':
paths.cpp:20:20: warning: statement has no effect [-Wunused-value]
   20 | #define debug(...) 42
      |                    ^~
paths.cpp:84:5: note: in expansion of macro 'debug'
   84 |     debug(ans);
      |     ^~~~~
paths.cpp:20:20: warning: statement has no effect [-Wunused-value]
   20 | #define debug(...) 42
      |                    ^~
paths.cpp:95:5: note: in expansion of macro 'debug'
   95 |     debug(ans);
      |     ^~~~~
paths.cpp:20:20: warning: statement has no effect [-Wunused-value]
   20 | #define debug(...) 42
      |                    ^~
paths.cpp:112:5: note: in expansion of macro 'debug'
  112 |     debug(ans);
      |     ^~~~~
paths.cpp:20:20: warning: statement has no effect [-Wunused-value]
   20 | #define debug(...) 42
      |                    ^~
paths.cpp:143:5: note: in expansion of macro 'debug'
  143 |     debug(ans);
      |     ^~~~~

Subtask #1
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 7372 KB Output is correct
2 Correct 5 ms 7372 KB Output is correct
3 Correct 5 ms 7372 KB Output is correct
4 Correct 5 ms 7372 KB Output is correct
5 Correct 5 ms 7372 KB Output is correct
6 Correct 6 ms 7372 KB Output is correct
7 Correct 6 ms 7384 KB Output is correct
8 Correct 6 ms 7372 KB Output is correct
9 Correct 6 ms 7372 KB Output is correct
10 Correct 5 ms 7372 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 83 ms 14512 KB Output is correct
2 Correct 69 ms 15088 KB Output is correct
3 Correct 508 ms 32236 KB Output is correct
4 Correct 114 ms 16796 KB Output is correct
5 Correct 125 ms 16816 KB Output is correct
6 Correct 386 ms 26636 KB Output is correct
7 Correct 509 ms 32188 KB Output is correct
8 Correct 507 ms 32988 KB Output is correct

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 7372 KB Output is correct
2 Correct 5 ms 7372 KB Output is correct
3 Correct 5 ms 7372 KB Output is correct
4 Correct 5 ms 7372 KB Output is correct
5 Correct 5 ms 7372 KB Output is correct
6 Correct 6 ms 7372 KB Output is correct
7 Correct 6 ms 7384 KB Output is correct
8 Correct 6 ms 7372 KB Output is correct
9 Correct 6 ms 7372 KB Output is correct
10 Correct 5 ms 7372 KB Output is correct
11 Correct 83 ms 14512 KB Output is correct
12 Correct 69 ms 15088 KB Output is correct
13 Correct 508 ms 32236 KB Output is correct
14 Correct 114 ms 16796 KB Output is correct
15 Correct 125 ms 16816 KB Output is correct
16 Correct 386 ms 26636 KB Output is correct
17 Correct 509 ms 32188 KB Output is correct
18 Correct 507 ms 32988 KB Output is correct
19 Correct 88 ms 14600 KB Output is correct
20 Correct 68 ms 15052 KB Output is correct
21 Correct 510 ms 32264 KB Output is correct
22 Correct 116 ms 16748 KB Output is correct
23 Correct 115 ms 16764 KB Output is correct
24 Correct 358 ms 26696 KB Output is correct
25 Correct 507 ms 32336 KB Output is correct
26 Correct 502 ms 32980 KB Output is correct
27 Correct 774 ms 15124 KB Output is correct
28 Correct 803 ms 15540 KB Output is correct
29 Correct 1465 ms 32304 KB Output is correct
30 Correct 1158 ms 23808 KB Output is correct
31 Correct 1167 ms 23344 KB Output is correct
32 Correct 1472 ms 32196 KB Output is correct
33 Correct 5 ms 7372 KB Output is correct
34 Correct 5 ms 7372 KB Output is correct
35 Correct 5 ms 7372 KB Output is correct
36 Correct 5 ms 7372 KB Output is correct
37 Correct 5 ms 7324 KB Output is correct
38 Correct 6 ms 7372 KB Output is correct
39 Correct 5 ms 7368 KB Output is correct
40 Correct 6 ms 7388 KB Output is correct
41 Correct 5 ms 7268 KB Output is correct
42 Correct 5 ms 7372 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 7372 KB Output is correct
2 Correct 410 ms 9464 KB Output is correct
3 Correct 27 ms 9496 KB Output is correct
4 Correct 150 ms 15228 KB Output is correct
5 Correct 138 ms 15992 KB Output is correct
6 Correct 793 ms 15216 KB Output is correct
7 Correct 261 ms 10056 KB Output is correct
8 Correct 465 ms 16540 KB Output is correct
9 Correct 455 ms 17460 KB Output is correct
10 Correct 469 ms 17340 KB Output is correct
11 Correct 546 ms 13216 KB Output is correct
12 Correct 668 ms 15416 KB Output is correct
13 Correct 582 ms 13496 KB Output is correct
14 Correct 775 ms 16604 KB Output is correct
15 Correct 779 ms 16692 KB Output is correct
16 Correct 7 ms 7424 KB Output is correct
17 Correct 6 ms 7372 KB Output is correct
18 Correct 5 ms 7372 KB Output is correct
19 Correct 5 ms 7384 KB Output is correct
20 Correct 5 ms 7372 KB Output is correct
21 Correct 5 ms 7372 KB Output is correct
22 Correct 5 ms 7372 KB Output is correct
23 Correct 6 ms 7372 KB Output is correct
24 Correct 5 ms 7372 KB Output is correct
25 Correct 6 ms 7380 KB Output is correct