oj.uz

Submission #446495

# Submission time Handle Problem Language Result Execution time Memory
446495 2021-07-22T07:49:11 Z dxz05 Paths (BOI18_paths) C++14
70 / 100
 1340 ms 21616 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];
    }

    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]]++;

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

    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:80:5: note: in expansion of macro 'debug'
   80 |     debug(ans);
      |     ^~~~~
paths.cpp:20:20: warning: statement has no effect [-Wunused-value]
   20 | #define debug(...) 42
      |                    ^~
paths.cpp:91:5: note: in expansion of macro 'debug'
   91 |     debug(ans);
      |     ^~~~~
paths.cpp:20:20: warning: statement has no effect [-Wunused-value]
   20 | #define debug(...) 42
      |                    ^~
paths.cpp:108:5: note: in expansion of macro 'debug'
  108 |     debug(ans);
      |     ^~~~~

Subtask #1
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 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 68 ms 4664 KB Output is correct
2 Correct 56 ms 4496 KB Output is correct
3 Correct 372 ms 17412 KB Output is correct
4 Correct 76 ms 5816 KB Output is correct
5 Correct 77 ms 5820 KB Output is correct
6 Correct 268 ms 13112 KB Output is correct
7 Correct 372 ms 17464 KB Output is correct
8 Correct 378 ms 17440 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 68 ms 4664 KB Output is correct
12 Correct 56 ms 4496 KB Output is correct
13 Correct 372 ms 17412 KB Output is correct
14 Correct 76 ms 5816 KB Output is correct
15 Correct 77 ms 5820 KB Output is correct
16 Correct 268 ms 13112 KB Output is correct
17 Correct 372 ms 17464 KB Output is correct
18 Correct 378 ms 17440 KB Output is correct
19 Correct 67 ms 7344 KB Output is correct
20 Correct 58 ms 6708 KB Output is correct
21 Correct 391 ms 21572 KB Output is correct
22 Correct 75 ms 8964 KB Output is correct
23 Correct 76 ms 8968 KB Output is correct
24 Correct 276 ms 17004 KB Output is correct
25 Correct 370 ms 21560 KB Output is correct
26 Correct 380 ms 21616 KB Output is correct
27 Correct 768 ms 6900 KB Output is correct
28 Correct 789 ms 7480 KB Output is correct
29 Correct 1340 ms 21560 KB Output is correct
30 Correct 1080 ms 14780 KB Output is correct
31 Correct 1074 ms 14648 KB Output is correct
32 Correct 1338 ms 21564 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 324 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 0 ms 332 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 0 ms 332 KB Output is correct
42 Correct 0 ms 204 KB Output is correct

Subtask #4
0 / 30.0

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