Cpp-problem-solving/752.cpp at master · cyleung428/Cpp-problem-solving · 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
138
139
140
141
142
143
144
145
146
147
/*****************************************
 * (This comment block is added by the Judge System)
 * Submission ID: 68511
 * Submitted at:  2018-10-26 13:32:14
 *
 * User ID:       539
 * Username:      55211931
 * Problem ID:    752
 * Problem Name:  Task Manager
 */

#include <iostream>
#include <list>
#include <algorithm>
using namespace std;

class people {
public:
	int start;
	int end;
	int finish;
	int pos;
	people(int s, int e,int p)
	{
		start = s;
		end = e;
		pos = p;
	}
	int getStart()
	{
		return start;
	}
	int getEnd()
	{
		return end;
	}
	int getPos()
	{
		return pos;
	}


};


int main()
{
	int times;
	while (cin >> times)
	{
		list<people> q0;
		list<people> q1;
		int st, end, pri;
		for (int i = 0; i < times; i++)
		{
			cin >> st >> end >> pri;
			people temp = people(st, end,i);
			if (pri == 0)
			{
				q0.push_back(temp);
			}
			else
			{
				q1.push_back(temp);
			}
		}
		int finishTime = 0;
		int f[1100];
		while (!q0.empty() && !q1.empty())
		{
			if (finishTime >= q0.front().getStart())
			{
				int pos = q0.front().getPos();
				f[pos] = q0.front().getEnd() + finishTime;
				q0.pop_front();
				finishTime = f[pos];
			}
			else if (finishTime >= q1.front().getStart())
			{
				int pos = q1.front().getPos();
				f[pos] = q1.front().getEnd() + finishTime;
				q1.pop_front();
				finishTime = f[pos];
			}
			else if (q0.front().getStart() <= q1.front().getStart())
			{
				int pos = q0.front().getPos();
				f[pos] = q0.front().getEnd() + q0.front().getStart();
				q0.pop_front();
				finishTime = f[pos];
			}
			else
			{
				int pos = q1.front().getPos();
				f[pos] = q1.front().getEnd() + q1.front().getStart();
				q1.pop_front();
				finishTime = f[pos];
			}
		}
		while (!q0.empty())
		{
			if (finishTime >= q0.front().getStart())
			{
				int pos = q0.front().getPos();
				f[pos] = q0.front().getEnd() + finishTime;
				q0.pop_front();
				finishTime = f[pos];
			}
			else
			{
				int pos = q0.front().getPos();
				f[pos] = q0.front().getEnd() + q0.front().getStart();
				q0.pop_front();
				finishTime = f[pos];
			}
		}
		while (!q1.empty())
		{
			if (finishTime >= q1.front().getStart())
			{
				int pos = q1.front().getPos();
				f[pos] = q1.front().getEnd() + finishTime;
				q1.pop_front();
				finishTime = f[pos];
			}
			else
			{
				int pos = q1.front().getPos();
				f[pos] = q1.front().getEnd() + q1.front().getStart();
				q1.pop_front();
				finishTime = f[pos];
			}
		}
		cout << f[0];
		for (int i = 1; i < times; i++)
		{
			cout << " " << f[i];
		}
		cout << endl;

	}
    return 0;
}