oj.uz

Submission #1014087

# Submission time Handle Problem Language Result Execution time Memory
1014087 2024-07-04T10:36:11 Z ZanP Dreaming (IOI13_dreaming) C++17
18 / 100
 41 ms 38068 KB 
#include "dreaming.h"

#include <iostream>
#include <vector>
#include <algorithm>
#include <cstring>
using namespace std;
const int mxN = 1e6;
const int INF = 1e9;
int n, m, l;

int travelTime(int N,int M,int L,int A[],int B[],int T[]);

vector<pair<int, int>> pov[mxN];
int td[mxN];
bool vis[mxN];
int maxd = 0, cnt = 0;
pair<int, int> dfs(int u, int par) {
    pair<int, int> ans = { 0,u };
    vis[u] = true;
    for (auto p : pov[u]) {
        int v = p.first;
        int c = p.second;
        if (v != par) {
            pair<int, int> q = dfs(v, u);
            q.first += c;
            ans = max(ans, q);
        }
    }
    return ans;
}

int opt = INF;
int opt_dfs(int u, int tar, int d, int par)
{
    if (u == tar) {
        opt = d;
        return d;
    }
    int ans = INF;
    for (auto p : pov[u]) {
        int v = p.first;
        int c = p.second;
        if (v != par) {
            int dis = opt_dfs(v, tar, d, u) - c;
            ans = min(ans, dis);
        }
    }
    opt = min(max(ans,d-ans), opt);
    return ans;
}

int travelTime(int N, int M, int L, int A[], int B[], int T[]) {
    int n = N; int m = M; int l = L;
    for (int i = 0; i < m; i++) {
        int a = A[i], b = B[i], c = T[i];
        pov[a].push_back({ b,c });
        pov[b].push_back({ a,c });
    }
    memset(vis, 0, n);
    for (int i = 0; i < n; i++) {
        if (!vis[i] && pov[i].size() <= 1) {
            pair<int, int> p = dfs(i, -1);
            pair<int, int> q = dfs(p.second, -1);
            maxd = q.first;
            opt = INF;
            opt_dfs(p.second, q.second, q.first, -1);
            td[cnt] = -opt;
            cnt++;
        }
    }
    if (cnt == 1) {
        return maxd;
    }
    sort(td, td + cnt);
    int ans = l - td[0] - td[1];
    if (cnt > 2) { ans = max(ans, 2 * l - td[1] - td[2]); }
    return ans;
}

Subtask #1
0 / 14.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 23.0

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

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 28764 KB Output is correct
2 Correct 25 ms 28752 KB Output is correct
3 Correct 26 ms 28764 KB Output is correct
4 Correct 22 ms 28648 KB Output is correct
5 Correct 22 ms 28764 KB Output is correct
6 Correct 26 ms 29016 KB Output is correct
7 Correct 23 ms 28752 KB Output is correct
8 Correct 21 ms 28500 KB Output is correct
9 Correct 21 ms 28648 KB Output is correct
10 Correct 23 ms 28676 KB Output is correct
11 Correct 11 ms 25692 KB Output is correct
12 Correct 13 ms 26204 KB Output is correct
13 Correct 16 ms 26204 KB Output is correct
14 Correct 13 ms 26204 KB Output is correct
15 Correct 12 ms 26204 KB Output is correct
16 Correct 15 ms 26204 KB Output is correct
17 Correct 12 ms 26204 KB Output is correct
18 Correct 12 ms 26252 KB Output is correct
19 Correct 11 ms 26120 KB Output is correct
20 Correct 10 ms 25724 KB Output is correct
21 Correct 9 ms 25692 KB Output is correct
22 Correct 10 ms 25608 KB Output is correct
23 Correct 12 ms 26204 KB Output is correct

Subtask #5
0 / 12.0

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

Subtask #6
0 / 23.0

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