Submission #2113465


Source Code Expand

#include <iostream>
#include <set>
#include <queue>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;

int n;
vector<int> edges[2010];

int k;

int flag[2010];


void input()
{
	cin >> n >> k;

	for(int i = 0;i < n - 1;i++)
	{
		int a,b;
		cin >> a >> b;

		edges[a].push_back(b);
		edges[b].push_back(a);
	}
}

int dist = 0;

typedef pair<int,int> P;

int memo[2010];

int main()
{
	input();

	int ans = 10000;

	if(k % 2 == 0)
	{
		for(int i = 1;i <= n;i++)
		{
			int cou = 0;
			queue<P> que;
			vector<bool> vis(n + 1,false);
			que.push(P(i,0));
			while(!que.empty())
			{
				int v = que.front().first;
				int d = que.front().second;
				que.pop();

				if(vis[v]) continue;
				vis[v] = true;

				if(k / 2 < d) cou++;

				for(int to : edges[v])
				{
					if(vis[to] == false)
					{
						que.push(P(to,d + 1));
					}
				}
			}

			ans = min(cou , ans);
		}
	}
	else
	{
		for(int i = 1;i <= n;i++)
		{
			for(int next : edges[i])
			{
				int cou = 0;
				queue<P> que;
				vector<bool> vis(n + 1,false);
				que.push(P(i,0));
				que.push(P(next,0));
				while(!que.empty())
				{
					int v = que.front().first;
					int d = que.front().second;
					que.pop();

					if(vis[v]) continue;
					vis[v] = true;

					if((k - 1) / 2 < d) cou++;

					for(int to : edges[v])
					{
						if(vis[to] == false)
						{
							que.push(P(to,d + 1));
						}
					}
				}


				ans = min(cou , ans);
			}
		}
	}

	cout << ans << endl;
	return 0;
}

		


Submission Info

Submission Time
Task C - Shorten Diameter
User niuez
Language C++14 (GCC 5.4.1)
Score 600
Code Size 1625 Byte
Status AC
Exec Time 132 ms
Memory 384 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 600 / 600
Status
AC × 2
AC × 34
Set Name Test Cases
Sample sample-01.txt, sample-02.txt
All 000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt, 011.txt, 012.txt, 013.txt, 014.txt, 015.txt, 016.txt, 017.txt, 018.txt, 019.txt, 020.txt, 021.txt, 022.txt, 023.txt, 024.txt, 025.txt, 026.txt, 027.txt, 028.txt, 029.txt, 030.txt, 031.txt, sample-01.txt, sample-02.txt
Case Name Status Exec Time Memory
000.txt AC 1 ms 256 KB
001.txt AC 1 ms 256 KB
002.txt AC 1 ms 256 KB
003.txt AC 1 ms 256 KB
004.txt AC 1 ms 256 KB
005.txt AC 1 ms 256 KB
006.txt AC 1 ms 256 KB
007.txt AC 1 ms 256 KB
008.txt AC 1 ms 256 KB
009.txt AC 132 ms 384 KB
010.txt AC 112 ms 384 KB
011.txt AC 132 ms 384 KB
012.txt AC 132 ms 384 KB
013.txt AC 57 ms 384 KB
014.txt AC 68 ms 384 KB
015.txt AC 66 ms 384 KB
016.txt AC 112 ms 384 KB
017.txt AC 67 ms 384 KB
018.txt AC 3 ms 256 KB
019.txt AC 2 ms 256 KB
020.txt AC 32 ms 384 KB
021.txt AC 48 ms 384 KB
022.txt AC 14 ms 384 KB
023.txt AC 4 ms 256 KB
024.txt AC 10 ms 256 KB
025.txt AC 2 ms 256 KB
026.txt AC 108 ms 384 KB
027.txt AC 124 ms 384 KB
028.txt AC 125 ms 384 KB
029.txt AC 124 ms 384 KB
030.txt AC 108 ms 384 KB
031.txt AC 55 ms 384 KB
sample-01.txt AC 1 ms 256 KB
sample-02.txt AC 1 ms 256 KB