oj.uz

Submission #288283

# Submission time Handle Problem Language Result Execution time Memory
288283 2020-09-01T11:30:08 Z BeanZ Dreaming (IOI13_dreaming) C++14
18 / 100
 74 ms 13688 KB 
#include <bits/stdc++.h>
#include "dreaming.h"

using namespace std;

#define ll long long
#define endl '\n'
const int N = 1e5 + 5;
ll dp[N], res, vis[N], vis2[N], diameter, lg, cur;
vector<pair<ll, ll>> node[N];
void dfsFirst(ll u){
        vis[u] = 1;
        for (auto j : node[u]){
                if (vis[j.first]) continue;
                dfsFirst(j.first);
                dp[u] = max(dp[u], dp[j.first] + j.second);
        }
}
void reroot(ll u, ll v){
        dp[u] = 0;
        for (auto j : node[u]){
                if (j.first == v) continue;
                dp[u] = max(dp[u], dp[j.first] + j.second);
        }
        dp[v] = 0;
        for (auto j : node[v]){
                dp[v] = max(dp[v], dp[j.first] + j.second);
        }
        res = min(res, dp[v]);
}
void dfs(ll u, ll p){
        for (auto j : node[u]){
                if (j.first == p) continue;
                reroot(u, j.first);
                dfs(j.first, u);
                reroot(j.first, u);
        }
}
void FindFirstNode(ll u, ll p, ll dist){
        if (dist > lg){
                lg = dist;
                cur = u;
        }
        for (auto j : node[u]){
                if (j.first == p) continue;
                FindFirstNode(j.first, u, dist + j.second);
        }
}
void FindDia(ll u, ll p, ll dist){
        if (dist > lg){
                lg = dist;
        }
        for (auto j : node[u]){
                if (j.first == p) continue;
                FindDia(j.first, u, dist + j.second);
        }
}
int travelTime(int N, int M, int L, int A[],int B[],int T[]){
        for (int i = 1; i <= M; i++){
                node[A[i - 1]].push_back({B[i - 1], T[i - 1]});
                node[B[i - 1]].push_back({A[i - 1], T[i - 1]});
        }
        priority_queue<ll> pq;
        ll ans = 0;
        for (int i = 1; i <= N; i++){
                if (!vis[i]){
                        diameter = 0;
                        dfsFirst(i);
                        res = dp[i];
                        dfs(i, i);
                        lg = -1;
                        FindFirstNode(i, i, 0);
                        lg = -1;
                        FindDia(cur, cur, 0);
                        ans = max(ans, lg);
                        pq.push(res);
                }
        }
        ll root = pq.top();
        pq.pop();
        ll mx = -1e18;
        while (pq.size()){
                ans = max(ans, pq.top() + 2 * L + mx);
                ans = max(ans, pq.top() + L + root);
                mx = max(mx, pq.top());
                pq.pop();
        }
        return ans;
}
/*
int main(){
        ios_base::sync_with_stdio(false);
        cin.tie(0);
        if (fopen("VietCT.INP", "r")){
                freopen("VietCT.INP", "r", stdin);
                freopen("VietCT.OUT", "w", stdout);
        }
        int n, m, l;
        cin >> n >> m >> l;
        vector<int> a, b, t;
        for (int i = 1; i <= m; i++){
                int u, v, c;
                cin >> u >> v >> c;
                a.push_back(u + 1);
                b.push_back(v + 1);
                t.push_back(c);
        }
        cout << travelTime(n, m, l, a, b, t);
}
/*
8 6 3
0 1 3
1 2 4
3 4 3
4 5 4
4 6 5
3 7 6
*/

Compilation message

dreaming.cpp:110:1: warning: "/*" within comment [-Wcomment]
  110 | /*
      |

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 13688 KB Output is correct
2 Correct 74 ms 13688 KB Output is correct
3 Correct 46 ms 9976 KB Output is correct
4 Correct 10 ms 4352 KB Output is correct
5 Correct 9 ms 3712 KB Output is correct
6 Correct 18 ms 5248 KB Output is correct
7 Incorrect 2 ms 2688 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 13688 KB Output is correct
2 Correct 74 ms 13688 KB Output is correct
3 Correct 46 ms 9976 KB Output is correct
4 Correct 10 ms 4352 KB Output is correct
5 Correct 9 ms 3712 KB Output is correct
6 Correct 18 ms 5248 KB Output is correct
7 Incorrect 2 ms 2688 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 13688 KB Output is correct
2 Correct 74 ms 13688 KB Output is correct
3 Correct 46 ms 9976 KB Output is correct
4 Correct 10 ms 4352 KB Output is correct
5 Correct 9 ms 3712 KB Output is correct
6 Correct 18 ms 5248 KB Output is correct
7 Incorrect 2 ms 2688 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 7168 KB Output is correct
2 Correct 34 ms 7200 KB Output is correct
3 Correct 35 ms 7116 KB Output is correct
4 Correct 32 ms 7168 KB Output is correct
5 Correct 33 ms 7160 KB Output is correct
6 Correct 35 ms 7924 KB Output is correct
7 Correct 36 ms 7288 KB Output is correct
8 Correct 33 ms 7040 KB Output is correct
9 Correct 33 ms 7028 KB Output is correct
10 Correct 33 ms 7292 KB Output is correct
11 Correct 2 ms 2688 KB Output is correct
12 Correct 10 ms 5368 KB Output is correct
13 Correct 11 ms 5368 KB Output is correct
14 Correct 10 ms 5240 KB Output is correct
15 Correct 11 ms 5368 KB Output is correct
16 Correct 10 ms 5240 KB Output is correct
17 Correct 10 ms 4728 KB Output is correct
18 Correct 12 ms 5496 KB Output is correct
19 Correct 11 ms 5240 KB Output is correct
20 Correct 2 ms 2688 KB Output is correct
21 Correct 2 ms 2688 KB Output is correct
22 Correct 2 ms 2816 KB Output is correct
23 Correct 10 ms 5240 KB Output is correct

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 13688 KB Output is correct
2 Correct 74 ms 13688 KB Output is correct
3 Correct 46 ms 9976 KB Output is correct
4 Correct 10 ms 4352 KB Output is correct
5 Correct 9 ms 3712 KB Output is correct
6 Correct 18 ms 5248 KB Output is correct
7 Incorrect 2 ms 2688 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 13688 KB Output is correct
2 Correct 74 ms 13688 KB Output is correct
3 Correct 46 ms 9976 KB Output is correct
4 Correct 10 ms 4352 KB Output is correct
5 Correct 9 ms 3712 KB Output is correct
6 Correct 18 ms 5248 KB Output is correct
7 Incorrect 2 ms 2688 KB Output isn't correct
8 Halted 0 ms 0 KB -