# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1057049 | fv3 | Roller Coaster Railroad (IOI16_railroad) | 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 "shortcut.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<vector<pair<int, ll>>> adj;
int N;
vector<int> visited;
vector<ll> dist;
ll find_diameter()
{
visited = vector<int>(N);
dist = vector<ll>(N, 1ll << 60);
priority_queue<pair<ll, int>> q;
q.push({0, 0});
dist[0] = 0;
int mx_index;
while (1)
{
int s = q.top().second;
q.pop();
visited[s] = 1;
for (auto node : adj[s])
{