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
#include <iostream>
#include <sstream>
#include <vector>
#include <algorithm>

using namespace std;

stringstream out;

struct DataInfo
{
	short number;
	int freeTimeLeft;
};

struct Task
{
	int time;
	int number;
};

bool cmp(DataInfo a, DataInfo b)
{
	return a.freeTimeLeft < b.freeTimeLeft;
}

bool asc(Task a, Task b)
{
	return a.time < b.time;
}

vector<Task> startTask;
vector<Task> endTask;
DataInfo taskPriorityList[100];

bool currentlyAvailableTasks[100];

int startTaskTime[100];
int endTaskTime[100];
int totalTaskTime[100];

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);

	int n, m;
	int taskPointer = 0;
	cin >> n >> m;
	int minP = 10000000, maxK = -1;
	for (int i = 0; i < n; ++i)
	{
		int p, k, c;
		cin >> p >> k >> c;

		Task task;
		task.number = i;
		task.time = p;
		startTask.push_back(task);

		task.time = k;
		endTask.push_back(task);

		startTaskTime[i] = p;
		endTaskTime[i] = k;
		totalTaskTime[i] = c;
		if (p < minP) minP = p;
		if (k > maxK) maxK = k;
	}

	sort(startTask.begin(), startTask.end(), asc);
	sort(endTask.begin(), endTask.end(), asc);

	auto startIt = startTask.begin();
	auto endIt = endTask.begin();

	for (int i = minP; i <= maxK; ++i)
	{
		while (startIt != startTask.end() && startIt->time <= i)
		{
			currentlyAvailableTasks[startIt->number] = true;
			startIt++;
		}

		bool pos = true;
		while (endIt != endTask.end() && endIt->time <= i)
		{
			if (totalTaskTime[endIt->number] > 0)
			{
				pos = false;
				break;
			}
			currentlyAvailableTasks[endIt->number] = false;
			endIt++;
		}
		if (!pos)
			break;

		taskPointer = 0;
		for (int j = 0; j < n; ++j)
		{
			if (currentlyAvailableTasks[j])
			{
				DataInfo dataInfo;
				dataInfo.number = j;
				dataInfo.freeTimeLeft = endTaskTime[j] - totalTaskTime[j];
				taskPriorityList[taskPointer] = dataInfo;
				taskPointer++;
				if (endTaskTime[j] - totalTaskTime[j] - i < 0)
				{
					pos = false;
					break;
				}
			}
		}
		
		if (!pos)
			break;
		int limit = min(m, taskPointer);
		if (taskPointer > m)
			sort(taskPriorityList, taskPriorityList + taskPointer, cmp);

		for (int j = 0; j < limit; ++j)
		{
			int number = taskPriorityList[j].number;
			totalTaskTime[number]--;
			currentlyAvailableTasks[number] = (totalTaskTime[number] > 0);
		}	
	}

	bool possible = true;
	for (int i = 0; i < n; ++i)
		if (totalTaskTime[i] > 0)
			possible = false;

	cout << (possible ? "TAK\n" : "NIE\n");
	return 0;
}