| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 655398 | ShirAriel | 연결리스트 수사하기 (NOI12_forensic) | C++17 | 3 ms | 1492 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 <iostream>
#include <algorithm>
#include <vector>
using namespace std;
typedef long long ll;
vector<vector<ll>> branch;
vector<bool> visited;
ll getlen(ll v)
{
	ll ans = 0;
	visited[v] = true;
	for (ll i = 0; i < branch[v].size(); i++)
	{
		ll u = branch[v][i];
		if (!visited[u])
			ans = max(getlen(u) + 1, ans);
	}
	return ans;
}
int main()
{
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	ll n;
	cin >> n;
	vector<ll> chain(n);
	for (ll i = 0; i < n; i++)
		cin >> chain[i];
	branch.resize(n);
	for (ll i = 0; i < n; i++)
		if (chain[i] != -1)
			branch[chain[i]].push_back(i);
		
	ll b = 0, c = 0;
	bool circle = false;
	visited.resize(n, false);
	ll v = chain[0], cnt=1;
	visited[0] = true;
	while (v!=-1 && !visited[v])
	{
		visited[v] = true;
		b = max(b, getlen(v));
		v = chain[v];
		cnt++;
	}
	if (v!=-1)
		circle = true;
	for (ll i = 0; i < n; i++)
		if (chain[i] == -1 && !visited[i])
			c = max(c, getlen(i) + 1);
	cout << cnt + max(c, (circle ? 0 : b));
	return 0;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
