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
#include <cstdio>
#include <map>

using lint = long long;

void solveCase();

int main() {
	int t;
	scanf("%d", &t);
	for(int i = 0; i < t; ++i) {
		solveCase();
	}
	return 0;
}

void solveCase() {
	int n;
	scanf("%d", &n);
	
	std::map<lint, lint> T;
	for(int i = 0; i < n; ++i) {
		lint l, a, b;
		scanf("%lld%lld%lld", &l, &a, &b);
		if(a != b) {
			T[a] += l;
			T[b] -= l;
		}
	}
	
	bool ok = true;
	
	lint sumResources = 0ll;
	lint sumEnergy = 0ll;
	lint prevTemperature = 0ll;
	for(auto&& [temperature, resources] : T) {
		lint dTemperature = temperature - prevTemperature;
		sumEnergy += (sumResources * dTemperature);
		sumResources += resources;
		prevTemperature = temperature;
		if(sumEnergy < 0ll) {
			ok = false;
			break;
		}
	}
	
	ok = ok && (sumResources == 0ll) && (sumEnergy == 0ll);
	
	puts(ok ? "TAK" : "NIE");
}