#define READ_NUM_TEST_CASES true #define USE_FAST_IO false //////////////////////////////////////////////////////////////////////////////// // AMALGAMATE: "include/template.hpp" BEGINS HERE // #include <bits/stdc++.h> using namespace std; //////////////////////////////////////////////////////////////////////////////// // AMALGAMATE: "include/abbrevs.hpp" BEGINS HERE // #define UI unsigned int #define LL long long #define ULL unsigned long long #define PII pair<int,int> #define RI ri() #define RUI rui() #define RLL rll() #define RULL rull() #define RSTR rstr() #define FOR(i,n) for(int i=0; i<int(n); ++i) #define FO(i,a,b) for(int i=(a); i<int(b); ++i) #define OF(i,a,b) for(int i=(b)-1; i>=int(a); --i) #define MIN(a,b) ((a)<(b) ? (a) : (b)) #define MAX(a,b) ((b)<(a) ? (a) : (b)) #define REMIN(a,b) ((a) = min(a,b)) #define REMAX(a,b) ((a) = max(a,b)) #define ALL(c) (c).begin(),(c).end() #define SQR(x) ((x)*(x)) bool is_pow(int x) { return (x&(x-1)) == 0; } // // AMALGAMATE: "include/abbrevs.hpp" ENDS HERE //////////////////////////////////////////////////////////////////////////////// #if USE_FAST_IO //////////////////////////////////////////////////////////////////////////////// // AMALGAMATE: "include/fast-io.hpp" BEGINS HERE // //#define FREAD fread //#define FWRITE fwrite #define FREAD fread_unlocked #define FWRITE fwrite_unlocked struct Buffer { FILE* const stream; const int buffer_size; uint8_t* const buff; int pos = 0; Buffer(FILE* a_stream, int a_buffer_size) : stream( a_stream ), buffer_size( a_buffer_size ), buff( new uint8_t[ buffer_size ] ) { setvbuf(stream, NULL, _IONBF, 0); } ~Buffer() { delete[] buff; } }; class In_Buffer : private Buffer { public: In_Buffer(FILE* a_stream, int a_buffer_size) : Buffer(a_stream, a_buffer_size) { FREAD(buff, 1, buffer_size, stream); } public: void prepare(int num_chars) { auto remaining = buffer_size - pos; if(remaining >= num_chars) return; assert(remaining >= 0); // prevent compiler warning memcpy(buff, buff+pos, remaining); int read = FREAD(buff+remaining, 1, pos, stream); int block_end = remaining + read; memset(buff + block_end, 0, buffer_size - block_end); pos = 0; } public: char get_unchecked() { return buff[ pos++ ]; } }; template<class INT> INT read_unsigned(In_Buffer& buff) { buff.prepare(25); char c = buff.get_unchecked(); while(c < '-') c = buff.get_unchecked(); INT r = 0; for(;;) { if(c < '0') return r; c -= '0'; r = r*10 + c; c = buff.get_unchecked(); } } template<class INT> INT read_signed(In_Buffer& buff) { buff.prepare(25); char c = buff.get_unchecked(); while(c < '-') c = buff.get_unchecked(); bool minus = false; if(c=='-') { c = buff.get_unchecked(); minus = true; } INT r = 0; for(;;) { if(c < '0') return minus ? -r : r; r = r*10 + (c-'0'); c = buff.get_unchecked(); } } In_Buffer& operator>>( In_Buffer& buff, char& c) { buff.prepare(1); c = buff.get_unchecked(); return buff; } In_Buffer& operator>>( In_Buffer& buff, UI& r) { r = read_unsigned<UI>(buff); return buff; } In_Buffer& operator>>( In_Buffer& buff, ULL& r) { r = read_unsigned<ULL>(buff); return buff; } In_Buffer& operator>>( In_Buffer& buff, int& r) { r = read_signed<int>(buff); return buff; } In_Buffer& operator>>( In_Buffer& buff, LL& r) { r = read_signed<LL>(buff); return buff; } In_Buffer& operator>>( In_Buffer& buff, string& r) { r.clear(); char c = buff.get_unchecked(); while(c <= ' ') c = buff.get_unchecked(); do { r.push_back( c ); c = buff.get_unchecked(); } while(c > ' '); return buff; } class Out_Buffer : private Buffer { public: Out_Buffer(FILE* a_stream, int a_buffer_size) : Buffer(a_stream, a_buffer_size) {} ~Out_Buffer() { flush(); } public: void prepare(int num_chars) { if(buffer_size - pos >= num_chars) return; flush(); } void flush() { FWRITE(buff, 1, pos, stream); pos = 0; } public: void put_unchecked(const char& c) { buff[ pos++ ] = c; } void put_unchecked(const char* str, int len) { memcpy(buff+pos, str, len); pos += len; } }; template<class INT> void write_signed(Out_Buffer& buff, const INT& i) { buff.prepare(25); if(i == 0) { buff.put_unchecked('0'); return; } auto ci = i; if(ci < 0) { buff.put_unchecked('-'); ci = -ci; } const int sz = 25; char temp[sz]; int pos = sz; while(ci) { temp[ --pos ] = '0' + ci%10; ci/=10; } buff.put_unchecked(temp+pos, sz-pos); } template<class INT> void write_unsigned(Out_Buffer& buff, const INT& i) { buff.prepare(25); if(i==0) { buff.put_unchecked('0'); return; } const int sz = 25; char temp[sz]; int pos = sz; auto ci = i; while(ci) { temp[ --pos ] = '0' + ci%10; ci/=10; } buff.put_unchecked(temp+pos, sz-pos); } Out_Buffer& operator<<( Out_Buffer& buff, const char& c) { buff.prepare(1); buff.put_unchecked( c ); return buff; } Out_Buffer& operator<<( Out_Buffer& buff, const UI& r) { write_unsigned<UI>(buff, r); return buff; } Out_Buffer& operator<<( Out_Buffer& buff, const ULL& r) { write_unsigned<ULL>(buff, r); return buff; } Out_Buffer& operator<<( Out_Buffer& buff, const int& r) { write_signed<int>(buff, r); return buff; } Out_Buffer& operator<<( Out_Buffer& buff, const LL& r) { write_signed<LL>(buff, r); return buff; } Out_Buffer& operator<<( Out_Buffer& buff, const char* cstr) { auto len = strlen(cstr); buff.prepare(len); buff.put_unchecked(cstr, len); return buff; } Out_Buffer& operator<<( Out_Buffer& buff, const string& str) { buff.prepare( str.size() ); buff.put_unchecked(str.data(), str.size()); return buff; } #define BUFF_SIZE 32768 In_Buffer fast_cin( stdin, BUFF_SIZE ); Out_Buffer fast_cout( stdout, BUFF_SIZE ); //Out_Buffer fast_cerr( stderr, BUFF_SIZE ); char fast_endl = '\n'; // // AMALGAMATE: "include/fast-io.hpp" ENDS HERE //////////////////////////////////////////////////////////////////////////////// #define cin fast_cin #define cout fast_cout #define endl fast_endl #else //////////////////////////////////////////////////////////////////////////////// // AMALGAMATE: "include/slow-io.hpp" BEGINS HERE // struct Slow_IO_Singleton { Slow_IO_Singleton() { ios_base::sync_with_stdio( false ); std::cin.tie( nullptr ); std::cout.tie( nullptr ); setlocale(LC_ALL,"C"); const int buffer_size = 32768; static char stdin_buffer[ buffer_size ]; static char stdout_buffer[ buffer_size ]; cin.rdbuf()->pubsetbuf( stdin_buffer, buffer_size ); cout.rdbuf()->pubsetbuf( stdout_buffer, buffer_size ); } ~Slow_IO_Singleton() { } }; Slow_IO_Singleton slow_io_singleton; // // AMALGAMATE: "include/slow-io.hpp" ENDS HERE //////////////////////////////////////////////////////////////////////////////// #ifndef DEBUG #define endl '\n' #endif #endif //////////////////////////////////////////////////////////////////////////////// // AMALGAMATE: "include/abbrevs-io.hpp" BEGINS HERE // int ri() { int r; cin >> r; return r; } UI rui() { UI r; cin >> r; return r; } LL rll() { LL r; cin >> r; return r; } ULL rull() { ULL r; cin >> r; return r; } string rstr() {string s; cin >> s; return s; } // // AMALGAMATE: "include/abbrevs-io.hpp" ENDS HERE //////////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////////// // AMALGAMATE: "include/debug.hpp" BEGINS HERE // #define ASS(x) assert(x) // // AMALGAMATE: "include/debug.hpp" ENDS HERE //////////////////////////////////////////////////////////////////////////////// // // for salgo #define CONTEST_MODE namespace salgo {}; using namespace salgo; // // // AMALGAMATE: "include/template.hpp" ENDS HERE //////////////////////////////////////////////////////////////////////////////// struct Test_Case { struct Cup { int size = 0; int temp = 0; bool operator<(const Cup& o) const { return temp < o.temp; } }; vector<Cup> cups, want_cups; void solve() { const int n = RI; // cout << "Case #" << icase+1 << ": " << n << endl; FOR(i,n) { auto l = RI; auto a = RI; auto b = RI; cups.push_back({l,a}); want_cups.push_back({l,b}); } sort(ALL(cups)); sort(ALL(want_cups)); auto check = [&]() { LL cups_numer = 0; LL cups_denom = 0; int i = 0; int j = 0; FOR(x,n) { int missing_size = want_cups[x].size; while(missing_size > 0) { int take = MIN(cups[i].size-j, missing_size); missing_size -= take; // cout << "take " << take << " from " << i << endl; cups_numer += 1LL * take * cups[i].temp; cups_denom += take; j += take; if(j == cups[i].size) { j = 0; ++i; } } // cout << 1.0L * cups_numer / cups_denom << " vs " << want_cups[x].temp << endl; if(cups_numer > 1LL * want_cups[x].temp * cups_denom) { return false; } cups_numer -= 1LL * want_cups[x].temp * want_cups[x].size; cups_denom -= want_cups[x].size; } // cout << "end " << cups_numer << " " << cups_denom << endl; // if(cups_numer) return true; }; // cout << endl << "PASS 1" << endl; auto r = check(); if(r) { FOR(i,n) cups[i].temp *= -1; FOR(i,n) want_cups[i].temp *= -1; sort(ALL(cups)); sort(ALL(want_cups)); // cout << endl << "PASS 2" << endl; r = check(); } cout << (r ? "TAK" : "NIE") << endl; } int icase = -1; }; // struct Test_Case int main() { int num_cases = READ_NUM_TEST_CASES ? RI : 1; FOR(i, num_cases) { Test_Case tc; tc.icase = i; tc.solve(); } return 0; }
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 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 | #define READ_NUM_TEST_CASES true #define USE_FAST_IO false //////////////////////////////////////////////////////////////////////////////// // AMALGAMATE: "include/template.hpp" BEGINS HERE // #include <bits/stdc++.h> using namespace std; //////////////////////////////////////////////////////////////////////////////// // AMALGAMATE: "include/abbrevs.hpp" BEGINS HERE // #define UI unsigned int #define LL long long #define ULL unsigned long long #define PII pair<int,int> #define RI ri() #define RUI rui() #define RLL rll() #define RULL rull() #define RSTR rstr() #define FOR(i,n) for(int i=0; i<int(n); ++i) #define FO(i,a,b) for(int i=(a); i<int(b); ++i) #define OF(i,a,b) for(int i=(b)-1; i>=int(a); --i) #define MIN(a,b) ((a)<(b) ? (a) : (b)) #define MAX(a,b) ((b)<(a) ? (a) : (b)) #define REMIN(a,b) ((a) = min(a,b)) #define REMAX(a,b) ((a) = max(a,b)) #define ALL(c) (c).begin(),(c).end() #define SQR(x) ((x)*(x)) bool is_pow(int x) { return (x&(x-1)) == 0; } // // AMALGAMATE: "include/abbrevs.hpp" ENDS HERE //////////////////////////////////////////////////////////////////////////////// #if USE_FAST_IO //////////////////////////////////////////////////////////////////////////////// // AMALGAMATE: "include/fast-io.hpp" BEGINS HERE // //#define FREAD fread //#define FWRITE fwrite #define FREAD fread_unlocked #define FWRITE fwrite_unlocked struct Buffer { FILE* const stream; const int buffer_size; uint8_t* const buff; int pos = 0; Buffer(FILE* a_stream, int a_buffer_size) : stream( a_stream ), buffer_size( a_buffer_size ), buff( new uint8_t[ buffer_size ] ) { setvbuf(stream, NULL, _IONBF, 0); } ~Buffer() { delete[] buff; } }; class In_Buffer : private Buffer { public: In_Buffer(FILE* a_stream, int a_buffer_size) : Buffer(a_stream, a_buffer_size) { FREAD(buff, 1, buffer_size, stream); } public: void prepare(int num_chars) { auto remaining = buffer_size - pos; if(remaining >= num_chars) return; assert(remaining >= 0); // prevent compiler warning memcpy(buff, buff+pos, remaining); int read = FREAD(buff+remaining, 1, pos, stream); int block_end = remaining + read; memset(buff + block_end, 0, buffer_size - block_end); pos = 0; } public: char get_unchecked() { return buff[ pos++ ]; } }; template<class INT> INT read_unsigned(In_Buffer& buff) { buff.prepare(25); char c = buff.get_unchecked(); while(c < '-') c = buff.get_unchecked(); INT r = 0; for(;;) { if(c < '0') return r; c -= '0'; r = r*10 + c; c = buff.get_unchecked(); } } template<class INT> INT read_signed(In_Buffer& buff) { buff.prepare(25); char c = buff.get_unchecked(); while(c < '-') c = buff.get_unchecked(); bool minus = false; if(c=='-') { c = buff.get_unchecked(); minus = true; } INT r = 0; for(;;) { if(c < '0') return minus ? -r : r; r = r*10 + (c-'0'); c = buff.get_unchecked(); } } In_Buffer& operator>>( In_Buffer& buff, char& c) { buff.prepare(1); c = buff.get_unchecked(); return buff; } In_Buffer& operator>>( In_Buffer& buff, UI& r) { r = read_unsigned<UI>(buff); return buff; } In_Buffer& operator>>( In_Buffer& buff, ULL& r) { r = read_unsigned<ULL>(buff); return buff; } In_Buffer& operator>>( In_Buffer& buff, int& r) { r = read_signed<int>(buff); return buff; } In_Buffer& operator>>( In_Buffer& buff, LL& r) { r = read_signed<LL>(buff); return buff; } In_Buffer& operator>>( In_Buffer& buff, string& r) { r.clear(); char c = buff.get_unchecked(); while(c <= ' ') c = buff.get_unchecked(); do { r.push_back( c ); c = buff.get_unchecked(); } while(c > ' '); return buff; } class Out_Buffer : private Buffer { public: Out_Buffer(FILE* a_stream, int a_buffer_size) : Buffer(a_stream, a_buffer_size) {} ~Out_Buffer() { flush(); } public: void prepare(int num_chars) { if(buffer_size - pos >= num_chars) return; flush(); } void flush() { FWRITE(buff, 1, pos, stream); pos = 0; } public: void put_unchecked(const char& c) { buff[ pos++ ] = c; } void put_unchecked(const char* str, int len) { memcpy(buff+pos, str, len); pos += len; } }; template<class INT> void write_signed(Out_Buffer& buff, const INT& i) { buff.prepare(25); if(i == 0) { buff.put_unchecked('0'); return; } auto ci = i; if(ci < 0) { buff.put_unchecked('-'); ci = -ci; } const int sz = 25; char temp[sz]; int pos = sz; while(ci) { temp[ --pos ] = '0' + ci%10; ci/=10; } buff.put_unchecked(temp+pos, sz-pos); } template<class INT> void write_unsigned(Out_Buffer& buff, const INT& i) { buff.prepare(25); if(i==0) { buff.put_unchecked('0'); return; } const int sz = 25; char temp[sz]; int pos = sz; auto ci = i; while(ci) { temp[ --pos ] = '0' + ci%10; ci/=10; } buff.put_unchecked(temp+pos, sz-pos); } Out_Buffer& operator<<( Out_Buffer& buff, const char& c) { buff.prepare(1); buff.put_unchecked( c ); return buff; } Out_Buffer& operator<<( Out_Buffer& buff, const UI& r) { write_unsigned<UI>(buff, r); return buff; } Out_Buffer& operator<<( Out_Buffer& buff, const ULL& r) { write_unsigned<ULL>(buff, r); return buff; } Out_Buffer& operator<<( Out_Buffer& buff, const int& r) { write_signed<int>(buff, r); return buff; } Out_Buffer& operator<<( Out_Buffer& buff, const LL& r) { write_signed<LL>(buff, r); return buff; } Out_Buffer& operator<<( Out_Buffer& buff, const char* cstr) { auto len = strlen(cstr); buff.prepare(len); buff.put_unchecked(cstr, len); return buff; } Out_Buffer& operator<<( Out_Buffer& buff, const string& str) { buff.prepare( str.size() ); buff.put_unchecked(str.data(), str.size()); return buff; } #define BUFF_SIZE 32768 In_Buffer fast_cin( stdin, BUFF_SIZE ); Out_Buffer fast_cout( stdout, BUFF_SIZE ); //Out_Buffer fast_cerr( stderr, BUFF_SIZE ); char fast_endl = '\n'; // // AMALGAMATE: "include/fast-io.hpp" ENDS HERE //////////////////////////////////////////////////////////////////////////////// #define cin fast_cin #define cout fast_cout #define endl fast_endl #else //////////////////////////////////////////////////////////////////////////////// // AMALGAMATE: "include/slow-io.hpp" BEGINS HERE // struct Slow_IO_Singleton { Slow_IO_Singleton() { ios_base::sync_with_stdio( false ); std::cin.tie( nullptr ); std::cout.tie( nullptr ); setlocale(LC_ALL,"C"); const int buffer_size = 32768; static char stdin_buffer[ buffer_size ]; static char stdout_buffer[ buffer_size ]; cin.rdbuf()->pubsetbuf( stdin_buffer, buffer_size ); cout.rdbuf()->pubsetbuf( stdout_buffer, buffer_size ); } ~Slow_IO_Singleton() { } }; Slow_IO_Singleton slow_io_singleton; // // AMALGAMATE: "include/slow-io.hpp" ENDS HERE //////////////////////////////////////////////////////////////////////////////// #ifndef DEBUG #define endl '\n' #endif #endif //////////////////////////////////////////////////////////////////////////////// // AMALGAMATE: "include/abbrevs-io.hpp" BEGINS HERE // int ri() { int r; cin >> r; return r; } UI rui() { UI r; cin >> r; return r; } LL rll() { LL r; cin >> r; return r; } ULL rull() { ULL r; cin >> r; return r; } string rstr() {string s; cin >> s; return s; } // // AMALGAMATE: "include/abbrevs-io.hpp" ENDS HERE //////////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////////// // AMALGAMATE: "include/debug.hpp" BEGINS HERE // #define ASS(x) assert(x) // // AMALGAMATE: "include/debug.hpp" ENDS HERE //////////////////////////////////////////////////////////////////////////////// // // for salgo #define CONTEST_MODE namespace salgo {}; using namespace salgo; // // // AMALGAMATE: "include/template.hpp" ENDS HERE //////////////////////////////////////////////////////////////////////////////// struct Test_Case { struct Cup { int size = 0; int temp = 0; bool operator<(const Cup& o) const { return temp < o.temp; } }; vector<Cup> cups, want_cups; void solve() { const int n = RI; // cout << "Case #" << icase+1 << ": " << n << endl; FOR(i,n) { auto l = RI; auto a = RI; auto b = RI; cups.push_back({l,a}); want_cups.push_back({l,b}); } sort(ALL(cups)); sort(ALL(want_cups)); auto check = [&]() { LL cups_numer = 0; LL cups_denom = 0; int i = 0; int j = 0; FOR(x,n) { int missing_size = want_cups[x].size; while(missing_size > 0) { int take = MIN(cups[i].size-j, missing_size); missing_size -= take; // cout << "take " << take << " from " << i << endl; cups_numer += 1LL * take * cups[i].temp; cups_denom += take; j += take; if(j == cups[i].size) { j = 0; ++i; } } // cout << 1.0L * cups_numer / cups_denom << " vs " << want_cups[x].temp << endl; if(cups_numer > 1LL * want_cups[x].temp * cups_denom) { return false; } cups_numer -= 1LL * want_cups[x].temp * want_cups[x].size; cups_denom -= want_cups[x].size; } // cout << "end " << cups_numer << " " << cups_denom << endl; // if(cups_numer) return true; }; // cout << endl << "PASS 1" << endl; auto r = check(); if(r) { FOR(i,n) cups[i].temp *= -1; FOR(i,n) want_cups[i].temp *= -1; sort(ALL(cups)); sort(ALL(want_cups)); // cout << endl << "PASS 2" << endl; r = check(); } cout << (r ? "TAK" : "NIE") << endl; } int icase = -1; }; // struct Test_Case int main() { int num_cases = READ_NUM_TEST_CASES ? RI : 1; FOR(i, num_cases) { Test_Case tc; tc.icase = i; tc.solve(); } return 0; } |