| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 997182 | codefox | Dreaming (IOI13_dreaming) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define pii pair<int, int>
vector<int> depth;
vector<vector<pii>> graph;
vector<int> vis;
vector<int> vis2;
vector<int> nums;
void dfs(int i, int d)
{
if(vis[i]) return;
vis[i] = 1;
nums.push_back(i);
depth[i] = d;
for (pii ele:graph[i]) dfs(ele.second, ele.first+d);
}
int travelTime(int N, int M, int L, int A[], int B[], int T[]);
{
depth.assign(n, 1e9);
graph.assign(n, vector<pii>());
vis.assign(n, 0);
vis2.assign(n, 0);
vector<int> ind(n, 0);
for (int i = 0; i < M; i++)
{
graph[A[i]].push_back({B[i], T[i]});
graph[B[i]].push_back({A[i], T[i]});
ind[A[i]]++;
ind[B[i]]++;
}
int sol = 0;
vector<int> nodes;
for (int i = 0; i < N; i++)
{
if (vis[i]) continue;
nums.clear();
dfs(i);
int mx = 0;
priority_queue<pii, vector<pii>, greater<pii>> pq;
for (int ele:nums) if (ind[ele]==1) pq.push({0, ele});
while(pq.size());
{
int j, d;
tie(d, j) = pq.top();
pq.pop();
if (vis2[j]) continue;
vis2[j] = 1;
mx = max(mx, d);
for (pii ele:graph[j])
{
pq.push({d+ele.second, ele.first});
}
}
int mmx = 0;
int emx = 0;
for (int ele:nums)
{
if (depth[ele]>mmx)
{
mmx = depth[ele];
emx = ele;
}
vis[ele] = 0;
}
dfs(emx, 0);
for (int ele:nums)
{
mmx = max(mmx, emx);
}
nodes.push_back(mx);
sol = max(sol, mmx);
}
sort(nodes.begin(), nodes.end());
if (nodes.size()==2) sol = max(sol, nodes[0]+nodes[1]);
else if (nodes.size()>2) sol = max(sol, nodes[0]+nodes[nodes.size()-2]+nodes.back());
return sol;
}