oj.uz

Submission #593362

# Submission time Handle Problem Language Result Execution time Memory
593362 2022-07-11T00:51:18 Z skittles1412 Dreaming (IOI13_dreaming) C++17
0 / 100
 44 ms 13900 KB 
#include "bits/extc++.h"

using namespace std;

template <typename T>
void dbgh(const T& t) {
    cerr << t << endl;
}

template <typename T, typename... U>
void dbgh(const T& t, const U&... u) {
    cerr << t << " | ";
    dbgh(u...);
}

#ifdef DEBUG
#define dbg(...)                                              \
    cerr << "L" << __LINE__ << " [" << #__VA_ARGS__ << "]: "; \
    dbgh(__VA_ARGS__);
#else
#define dbg(...)
#define cerr   \
    if (false) \
    cerr
#endif

#define endl "\n"
#define long int64_t
#define sz(x) int((x).size())

const int maxn = 1e5 + 5;

int dist[maxn];
vector<int> vis;
vector<pair<int, int>> graph[maxn];

void dfs(int u, int p, int d) {
    dist[u] = d;
    vis.push_back(u);
    for (auto& [v, w] : graph[u]) {
        if (v != p) {
            dfs(v, u, d + w);
        }
    }
}

void dfs(int u) {
    vis.clear();
    dfs(u, -1, 0);
}

pair<int, int> farthest() {
    pair<int, int> opt {-1, 0};
    for (auto& a : vis) {
        opt = max(opt, pair<int, int> {dist[a], a});
    }
    return opt;
}

extern "C" int travelTime(int n,
                          int m,
                          int k,
                          int arru[],
                          int arrv[],
                          int arrw[]) {
    for (int i = 0; i < m; i++) {
        int u = arru[i], v = arrv[i], w = arrw[i];
        graph[u].emplace_back(v, w);
        graph[v].emplace_back(u, w);
    }
    int ans = 0;
    bool cvis[n] {};
    int d1[n], d2[n];
    vector<int> comps;
    for (int i = 0; i < n; i++) {
        if (cvis[i]) {
            continue;
        }
        dfs(i);
        int u = farthest().second;
        for (auto& a : vis) {
            cvis[a] = true;
        }
        dfs(u);
        auto [diam, v] = farthest();
        ans = max(ans, diam);
        for (auto& a : vis) {
            d1[a] = dist[a];
        }
        dfs(v);
        for (auto& a : vis) {
            d2[a] = dist[a];
        }
        int mn = 2e9;
        for (auto& a : vis) {
            mn = min(mn, max(d1[a], d2[a]));
        }
        comps.push_back(mn);
        dbg(mn);
    }
    sort(begin(comps), end(comps), greater<>());
    if (sz(comps) >= 2) {
        ans = max(ans, k + comps[0] + comps[1]);
    }
    if (sz(comps) >= 2) {
        ans = max(ans, 2 * k + comps[1] + comps[2]);
    }
    return ans;
}

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 13900 KB Output is correct
2 Correct 44 ms 13820 KB Output is correct
3 Correct 29 ms 10028 KB Output is correct
4 Correct 7 ms 4308 KB Output is correct
5 Correct 8 ms 3592 KB Output is correct
6 Correct 11 ms 5204 KB Output is correct
7 Incorrect 1 ms 2644 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Incorrect 1 ms 2636 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 13900 KB Output is correct
2 Correct 44 ms 13820 KB Output is correct
3 Correct 29 ms 10028 KB Output is correct
4 Correct 7 ms 4308 KB Output is correct
5 Correct 8 ms 3592 KB Output is correct
6 Correct 11 ms 5204 KB Output is correct
7 Incorrect 1 ms 2644 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 6488 KB Output is correct
2 Correct 21 ms 6876 KB Output is correct
3 Correct 30 ms 6952 KB Output is correct
4 Correct 21 ms 6884 KB Output is correct
5 Correct 22 ms 7072 KB Output is correct
6 Correct 24 ms 7464 KB Output is correct
7 Correct 23 ms 7176 KB Output is correct
8 Correct 20 ms 6904 KB Output is correct
9 Correct 19 ms 6852 KB Output is correct
10 Correct 21 ms 7124 KB Output is correct
11 Correct 2 ms 2664 KB Output is correct
12 Correct 7 ms 4560 KB Output is correct
13 Correct 7 ms 4592 KB Output is correct
14 Correct 6 ms 4576 KB Output is correct
15 Correct 7 ms 4584 KB Output is correct
16 Correct 7 ms 4580 KB Output is correct
17 Correct 7 ms 4452 KB Output is correct
18 Correct 8 ms 4560 KB Output is correct
19 Correct 7 ms 4560 KB Output is correct
20 Correct 2 ms 2644 KB Output is correct
21 Incorrect 1 ms 2644 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Incorrect 1 ms 2636 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 13900 KB Output is correct
2 Correct 44 ms 13820 KB Output is correct
3 Correct 29 ms 10028 KB Output is correct
4 Correct 7 ms 4308 KB Output is correct
5 Correct 8 ms 3592 KB Output is correct
6 Correct 11 ms 5204 KB Output is correct
7 Incorrect 1 ms 2644 KB Output isn't correct
8 Halted 0 ms 0 KB -