oj.uz

Submission #990775

# Submission time Handle Problem Language Result Execution time Memory
990775 2024-05-31T10:28:00 Z stdfloat Dreaming (IOI13_dreaming) C++17
0 / 100
 32 ms 13708 KB 
#include <bits/stdc++.h>
#include "dreaming.h"
using namespace std;

#define ff  first
#define ss  second
#define pii pair<int, int>

int cnt;

vector<int> v, u, vis;

vector<pii> a;

vector<vector<pii>> E;

int dfsv(int x, int p = -1) {
    for (auto [i, w] : E[x]) {
        if (i != p) v[x] = max(v[x], w + dfsv(i, x));
    }

    return v[x];
}

void dfsu(int x) {
    vis[x] = cnt;
    for (auto [i, w] : E[x]) {
        if (!vis[i]) a.push_back({w + v[i], i});
    }

    sort(a.rbegin(), a.rend());

    for (auto [i, w] : E[x]) {
        if (!vis[i]) u[i] = max(u[x], (a[0].ss != i ? a[0].ff : (1 < (int)a.size() ? a[1].ff : 0))) + w;
    }

    a.clear();
    for (auto [i, w] : E[x])
        if (!vis[i]) dfsu(i);
}

int travelTime(int n, int m, int L, int A[], int B[], int T[]) {
    E.assign(n, {});
    for (int i = 0; i < m; i++) {
        E[A[i]].push_back({B[i], T[i]});
        E[B[i]].push_back({A[i], T[i]});
    }

    v.assign(n, 0);
    u.assign(n, 0);
    vis.assign(n, false);
    for (int i = 0; i < n; i++) {
        if (!vis[i]) {
            cnt++;
            dfsv(i);
            dfsu(i);
        }
    }

    vector<int> mn(n, INT_MAX);
    for (int i = 0; i < n; i++)
        mn[vis[i]] = min(mn[vis[i]], max(v[i], u[i]));

    sort(mn.begin(), mn.end());
    while (mn.back() == INT_MAX) mn.pop_back();
    reverse(mn.begin(), mn.end());

    if ((int)mn.size() == 1) return mn[0];
    else if ((int)mn.size() == 2) return mn[0] + L + mn[1];

    return max(mn[0] + L + mn[1], mn[1] + (L << 1) + mn[2]);
}

Subtask #1
0 / 14.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 23.0

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

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 6492 KB Output is correct
2 Correct 17 ms 6648 KB Output is correct
3 Correct 14 ms 6232 KB Output is correct
4 Correct 15 ms 6304 KB Output is correct
5 Correct 14 ms 6404 KB Output is correct
6 Correct 22 ms 6748 KB Output is correct
7 Correct 15 ms 6492 KB Output is correct
8 Correct 13 ms 6236 KB Output is correct
9 Correct 13 ms 6192 KB Output is correct
10 Correct 14 ms 6748 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 4 ms 4396 KB Output is correct
13 Correct 4 ms 4416 KB Output is correct
14 Correct 4 ms 4188 KB Output is correct
15 Correct 4 ms 4264 KB Output is correct
16 Correct 4 ms 4188 KB Output is correct
17 Correct 4 ms 4188 KB Output is correct
18 Correct 4 ms 4188 KB Output is correct
19 Correct 4 ms 4188 KB Output is correct
20 Incorrect 0 ms 348 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

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

Subtask #6
0 / 23.0

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