oj.uz

Submission #997194

# Submission time Handle Problem Language Result Execution time Memory
997194 2024-06-11T19:49:54 Z codefox Dreaming (IOI13_dreaming) C++14
0 / 100
 37 ms 13116 KB 
#include <bits/stdc++.h>
#include "dreaming.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.first, ele.second+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;
	vector<int> md(N, 0);
	for (int i = 0; i < N; i++)
	{
		if (vis[i]) continue;
		nums.clear();
		dfs(i, 0);
		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();
			mx = max(mx, d);
			if (vis2[j]) continue;
			vis2[j] = 1;
			for (pii ele:graph[j])
			{	
				md[ele.first] = max(md[ele.first], ele.second+d);
				ind[ele.first]--;
				if (ind[ele.first]==1) pq.push({md[ele.first], ele.first});
			}
		}
		int mmx = 0;
		int emx = 0;
		for (int ele:nums) 
		{
			if (depth[ele]>mmx)
			{
				mmx = depth[ele];
				emx = ele;	
			}
			vis[ele] = 0;
		}
		nums.clear();
		dfs(emx, 0);
		for (int ele:nums) 
		{
			mmx = max(mmx, depth[ele]);
		}

		nodes.push_back(mx);
		sol = max(sol, mmx);
	}
	sort(nodes.begin(), nodes.end());
	if (nodes.size()==2) sol = max(sol, nodes[0]+nodes[1]+L);
	else if (nodes.size()>2) sol = max(sol, max(nodes[nodes.size()-2]+nodes[nodes.size()-3]+2*L, nodes[nodes.size()-2]+nodes.back()+L));
	return sol;
}

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 13020 KB Output is correct
2 Correct 37 ms 13116 KB Output is correct
3 Correct 22 ms 8908 KB Output is correct
4 Correct 5 ms 2136 KB Output is correct
5 Correct 4 ms 1628 KB Output is correct
6 Correct 10 ms 3380 KB Output is correct
7 Incorrect 0 ms 348 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 444 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 13020 KB Output is correct
2 Correct 37 ms 13116 KB Output is correct
3 Correct 22 ms 8908 KB Output is correct
4 Correct 5 ms 2136 KB Output is correct
5 Correct 4 ms 1628 KB Output is correct
6 Correct 10 ms 3380 KB Output is correct
7 Incorrect 0 ms 348 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

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

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 444 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 13020 KB Output is correct
2 Correct 37 ms 13116 KB Output is correct
3 Correct 22 ms 8908 KB Output is correct
4 Correct 5 ms 2136 KB Output is correct
5 Correct 4 ms 1628 KB Output is correct
6 Correct 10 ms 3380 KB Output is correct
7 Incorrect 0 ms 348 KB Output isn't correct
8 Halted 0 ms 0 KB -