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 #include #include #include void one() { int n; std::cin >> n; std::map from, to; for (int i = 0; i < n; ++i) { int l, a, b; std::cin >> l >> a >> b; from[a] += l; to[b] += l; } int diff = 0; auto p = from.begin(); auto q = to.begin(); for (;;) { if (p->second < q->second) { diff -= p->first * p->second; diff += q->first * p->second; q->second -= p->second; ++p; } else if (p->second == q->second) { diff -= p->first * p->second; diff += q->first * q->second; ++p; ++q; } else { diff -= p->first * q->second; diff += q->first * q->second; p->second -= q->second; ++q; } if (diff < 0 || p == from.end()) { break; } } std::cout << (diff == 0 ? "TAK" : "NIE") << "\n"; } int main() { int t; std::cin >> t; for (int i = 0; i < t; ++i) { one(); } }