Taisei-sou/BACKJOON-1005.cpp at master · developers-algorithm-study/Taisei-sou · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
#include <stdio.h>

struct BuildingInfo
{
	int buildingTreeCount;
	int buildingTime;
	int *buildingTree;

	int calcedTime;
	bool isCalced;
};

int *buildTreeBuffer = NULL;
BuildingInfo *buildInfo = NULL;

void AddBuildingTree(BuildingInfo *buildingInfo, int nextLevelBuildingNum)
{
	buildingInfo->buildingTree[buildingInfo->buildingTreeCount] = nextLevelBuildingNum;
	++buildingInfo->buildingTreeCount;
}

int fastestPathLength;
int targetBuildingNum;

int Recursive(int enterBuildingNum, int length)
{
	int buildingTreeCount = buildInfo[enterBuildingNum].buildingTreeCount;
	int *builingTree = buildInfo[enterBuildingNum].buildingTree;
	length += buildInfo[enterBuildingNum].buildingTime;

	int prevTechBuildingMax = 0;
	int prevTechBuildingResult = 0;

	if (buildInfo[enterBuildingNum].isCalced == true)
		return buildInfo[enterBuildingNum].calcedTime;

	for (int count = 0; count<buildingTreeCount; count++)
	{
		if (buildInfo[builingTree[count]].isCalced == true)
		{
			if (buildInfo[builingTree[count]].calcedTime > prevTechBuildingMax)
				prevTechBuildingMax = buildInfo[builingTree[count]].calcedTime;
		}
		else
		{
			prevTechBuildingResult = Recursive(builingTree[count], length);
			if (prevTechBuildingResult > prevTechBuildingMax)
				prevTechBuildingMax = prevTechBuildingResult;
		}
	}


	if (length + prevTechBuildingMax > fastestPathLength)
	{
		fastestPathLength = length + prevTechBuildingMax;
	}

	buildInfo[enterBuildingNum].isCalced = true;
	buildInfo[enterBuildingNum].calcedTime = buildInfo[enterBuildingNum].buildingTime + prevTechBuildingMax;

	return buildInfo[enterBuildingNum].buildingTime + prevTechBuildingMax;
}

int Test()
{
	int buildingNum, buildingTreeSize;

	//Inputing
	scanf("%d%d", &buildingNum, &buildingTreeSize);

	//Memory allocating
	buildTreeBuffer = new int[buildingNum * buildingTreeSize];
	buildInfo = new BuildingInfo[buildingNum];

	for (int count = 0; count<buildingNum; ++count)
	{
		buildInfo[count].buildingTree = buildTreeBuffer + buildingTreeSize * count;
		buildInfo[count].buildingTreeCount = 0;
		buildInfo[count].isCalced = false;
		buildInfo[count].calcedTime = 0;
		scanf("%d", &(buildInfo[count].buildingTime));
	}

	int prevBuildingNum, nextBuildingNum;
	for (int count = 0; count<buildingTreeSize; ++count)
	{
		scanf("%d%d", &prevBuildingNum, &nextBuildingNum);
		--prevBuildingNum;
		--nextBuildingNum;
		//AddBuildingTree(buildInfo + prevBuildingNum, nextBuildingNum);
		//Reverse Teching
		AddBuildingTree(buildInfo + nextBuildingNum, prevBuildingNum);
	}

	//Inputing Target Building Number
	scanf("%d", &targetBuildingNum);
	--targetBuildingNum;

	fastestPathLength = 0;

	//Processing
	Recursive(targetBuildingNum, 0);

	//Memory releasing
	delete[] buildInfo;
	buildInfo = NULL;
	delete[] buildTreeBuffer;
	buildTreeBuffer = NULL;

	//Return result;
	return fastestPathLength;
}

int *testCaseResultBuffer;

int main()
{
	int testCase = 0;
	scanf("%d", &testCase);

	testCaseResultBuffer = new int[testCase];

	for (int count = 0; count < testCase; ++count)
	{
		testCaseResultBuffer[count] = Test();
	}

	//Printing result
	for (int count = 0; count < testCase; ++count)
	{
		printf("%d\n", testCaseResultBuffer[count]);
	}

	delete[] testCaseResultBuffer;

	return 0;
}