QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#597461 | #9178. All-You-Can-Eat | mojimoon | WA | 18ms | 3956kb | C++14 | 4.6kb | 2024-09-28 17:52:25 | 2024-09-28 17:52:28 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
vector<pii> s, m, l;
vector<int> ids;
int main() {
int t;
scanf("%d", &t);
while (t--) {
int n, sum = 0, a;
scanf("%d", &n);
s.clear(); m.clear(); l.clear();
for (int i = 1; i <= n; i++) {
scanf("%d", &a);
if (sum >= 600) {
printf("0\nIGNORE\n");
fflush(stdout);
continue;
}
if (a >= 600 && a <= 1000) {
printf("%d ", s.size() + m.size() + l.size());
while (s.size()) {
printf("%d ", s.back().second);
s.pop_back();
}
while (m.size()) {
printf("%d ", m.back().second);
m.pop_back();
}
while (l.size()) {
printf("%d ", l.back().second);
l.pop_back();
}
printf("\nTAKE\n");
sum = a;
fflush(stdout);
continue;
}
if (sum + a >= 600 && sum + a <= 1000) {
printf("0\nTAKE\n");
sum += a;
fflush(stdout);
continue;
}
if (a >= 400 && m.size()) {
printf("%d ", s.size() + m.size() + l.size() - 1);
while (s.size()) {
printf("%d ", s.back().second);
s.pop_back();
}
while (m.size() > 1) {
printf("%d ", m.back().second);
m.pop_back();
}
while (l.size()) {
printf("%d ", l.back().second);
l.pop_back();
}
printf("\nTAKE\n");
sum = m.back().first + a;
fflush(stdout);
continue;
}
if (a >= 200 && a < 400 && l.size()) {
printf("%d ", s.size() + m.size() + l.size() - 1);
while (s.size()) {
printf("%d ", s.back().second);
s.pop_back();
}
while (m.size()) {
printf("%d ", m.back().second);
m.pop_back();
}
while (l.size() > 1) {
printf("%d ", l.back().second);
l.pop_back();
}
printf("\nTAKE\n");
sum = l.back().first + a;
fflush(stdout);
continue;
}
if (a < 200) {
s.push_back({a, i});
sum += a;
printf("0\nTAKE\n");
fflush(stdout);
} else if (a < 400) {
m.push_back({a, i});
sum += a;
printf("0\nTAKE\n");
fflush(stdout);
} else if (!l.size()) { // 400 <= a < 600
l.push_back({a, i});
sum += a;
ids.clear();
while (sum > 1000) {
sum -= s.back().first;
ids.push_back(s.back().second);
s.pop_back();
}
printf("%d ", ids.size());
for (auto id : ids) printf("%d ", id);
printf("\nTAKE\n");
fflush(stdout);
} else {
if (l[0].first <= a) {
if (l[0].first + a > 1000) {
printf("0\nIGNORE\n");
fflush(stdout);
} else {
l.push_back({a, i});
sum += a;
ids.clear();
while (sum > 1000) {
sum -= s.back().first;
ids.push_back(s.back().second);
s.pop_back();
}
printf("%d ", ids.size());
for (auto id : ids) printf("%d ", id);
printf("\nTAKE\n");
fflush(stdout);
}
} else {
printf("1 %d\nTAKE\n", l[0].second);
sum += a;
sum -= l[0].first;
l.pop_back();
l.push_back({a, i});
fflush(stdout);
}
}
}
}
}
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 3848kb
input:
1 5 10 13 450 585 465
output:
0 TAKE 0 TAKE 0 TAKE 0 IGNORE 0 TAKE
result:
ok OK, worst = 1.000000 (1 test case)
Test #2:
score: 0
Accepted
time: 1ms
memory: 3844kb
input:
1 1 100
output:
0 TAKE
result:
ok OK, worst = 1.000000 (1 test case)
Test #3:
score: 0
Accepted
time: 8ms
memory: 3956kb
input:
2000 5 535 529 536 588 558 5 515 525 599 507 549 5 561 567 504 557 596 5 592 503 549 549 536 5 590 572 589 540 544 5 524 553 545 555 543 5 523 571 577 506 594 5 519 527 521 587 539 5 561 569 573 552 587 5 571 515 585 525 589 5 512 572 565 516 527 5 573 579 564 514 557 5 518 595 509 518 549 5 549 541...
output:
0 TAKE 1 1 TAKE 0 IGNORE 0 IGNORE 0 IGNORE 0 TAKE 0 IGNORE 0 IGNORE 1 1 TAKE 0 IGNORE 0 TAKE 0 IGNORE 1 1 TAKE 0 IGNORE 0 IGNORE 0 TAKE 1 1 TAKE 0 IGNORE 0 IGNORE 0 IGNORE 0 TAKE 1 1 TAKE 0 IGNORE 1 2 TAKE 0 IGNORE 0 TAKE 0 IGNORE 0 IGNORE 0 IGNORE 0 IGNORE 0 TAKE 0 IGNORE 0 IGNORE 1 1 TAKE 0...
result:
ok OK, worst = 0.836394 (2000 test cases)
Test #4:
score: 0
Accepted
time: 14ms
memory: 3908kb
input:
500 20 535 529 536 588 558 515 525 599 507 549 561 567 504 557 596 592 503 549 549 536 20 590 572 589 540 544 524 553 545 555 543 523 571 577 506 594 519 527 521 587 539 20 561 569 573 552 587 571 515 585 525 589 512 572 565 516 527 573 579 564 514 557 20 518 595 509 518 549 549 541 580 535 531 540 ...
output:
0 TAKE 1 1 TAKE 0 IGNORE 0 IGNORE 0 IGNORE 1 2 TAKE 0 IGNORE 0 IGNORE 1 6 TAKE 0 IGNORE 0 IGNORE 0 IGNORE 1 9 TAKE 0 IGNORE 0 IGNORE 0 IGNORE 1 13 TAKE 0 IGNORE 0 IGNORE 0 IGNORE 0 TAKE 1 1 TAKE 0 IGNORE 1 2 TAKE 0 IGNORE 1 4 TAKE 0 IGNORE 0 IGNORE 0 IGNORE 0 IGNORE 1 6 TAKE 0 IGNORE 0 IGNORE 1 11...
result:
ok OK, worst = 0.836394 (500 test cases)
Test #5:
score: 0
Accepted
time: 18ms
memory: 3812kb
input:
200 50 535 529 536 588 558 515 525 599 507 549 561 567 504 557 596 592 503 549 549 536 590 572 589 540 544 524 553 545 555 543 523 571 577 506 594 519 527 521 587 539 561 569 573 552 587 571 515 585 525 589 50 512 572 565 516 527 573 579 564 514 557 518 595 509 518 549 549 541 580 535 531 540 596 51...
output:
0 TAKE 1 1 TAKE 0 IGNORE 0 IGNORE 0 IGNORE 1 2 TAKE 0 IGNORE 0 IGNORE 1 6 TAKE 0 IGNORE 0 IGNORE 0 IGNORE 1 9 TAKE 0 IGNORE 0 IGNORE 0 IGNORE 1 13 TAKE 0 IGNORE 0 IGNORE 0 IGNORE 0 IGNORE 0 IGNORE 0 IGNORE 0 IGNORE 0 IGNORE 0 IGNORE 0 IGNORE 0 IGNORE 0 IGNORE 0 IGNORE 0 IGNORE 0 IGNORE 0 IGNORE 0 I...
result:
ok OK, worst = 0.836394 (200 test cases)
Test #6:
score: 0
Accepted
time: 12ms
memory: 3904kb
input:
100 100 535 529 536 588 558 515 525 599 507 549 561 567 504 557 596 592 503 549 549 536 590 572 589 540 544 524 553 545 555 543 523 571 577 506 594 519 527 521 587 539 561 569 573 552 587 571 515 585 525 589 512 572 565 516 527 573 579 564 514 557 518 595 509 518 549 549 541 580 535 531 540 596 516 ...
output:
0 TAKE 1 1 TAKE 0 IGNORE 0 IGNORE 0 IGNORE 1 2 TAKE 0 IGNORE 0 IGNORE 1 6 TAKE 0 IGNORE 0 IGNORE 0 IGNORE 1 9 TAKE 0 IGNORE 0 IGNORE 0 IGNORE 1 13 TAKE 0 IGNORE 0 IGNORE 0 IGNORE 0 IGNORE 0 IGNORE 0 IGNORE 0 IGNORE 0 IGNORE 0 IGNORE 0 IGNORE 0 IGNORE 0 IGNORE 0 IGNORE 0 IGNORE 0 IGNORE 0 IGNORE 0 I...
result:
ok OK, worst = 0.836394 (100 test cases)
Test #7:
score: 0
Accepted
time: 4ms
memory: 3896kb
input:
10 1000 535 529 536 588 558 515 525 599 507 549 561 567 504 557 596 592 503 549 549 536 590 572 589 540 544 524 553 545 555 543 523 571 577 506 594 519 527 521 587 539 561 569 573 552 587 571 515 585 525 589 512 572 565 516 527 573 579 564 514 557 518 595 509 518 549 549 541 580 535 531 540 596 516 ...
output:
0 TAKE 1 1 TAKE 0 IGNORE 0 IGNORE 0 IGNORE 1 2 TAKE 0 IGNORE 0 IGNORE 1 6 TAKE 0 IGNORE 0 IGNORE 0 IGNORE 1 9 TAKE 0 IGNORE 0 IGNORE 0 IGNORE 1 13 TAKE 0 IGNORE 0 IGNORE 0 IGNORE 0 IGNORE 0 IGNORE 0 IGNORE 0 IGNORE 0 IGNORE 0 IGNORE 0 IGNORE 0 IGNORE 0 IGNORE 0 IGNORE 0 IGNORE 0 IGNORE 0 IGNORE 0 I...
result:
ok OK, worst = 0.836394 (10 test cases)
Test #8:
score: 0
Accepted
time: 4ms
memory: 3844kb
input:
1 10000 535 529 536 588 558 515 525 599 507 549 561 567 504 557 596 592 503 549 549 536 590 572 589 540 544 524 553 545 555 543 523 571 577 506 594 519 527 521 587 539 561 569 573 552 587 571 515 585 525 589 512 572 565 516 527 573 579 564 514 557 518 595 509 518 549 549 541 580 535 531 540 596 516 ...
output:
0 TAKE 1 1 TAKE 0 IGNORE 0 IGNORE 0 IGNORE 1 2 TAKE 0 IGNORE 0 IGNORE 1 6 TAKE 0 IGNORE 0 IGNORE 0 IGNORE 1 9 TAKE 0 IGNORE 0 IGNORE 0 IGNORE 1 13 TAKE 0 IGNORE 0 IGNORE 0 IGNORE 0 IGNORE 0 IGNORE 0 IGNORE 0 IGNORE 0 IGNORE 0 IGNORE 0 IGNORE 0 IGNORE 0 IGNORE 0 IGNORE 0 IGNORE 0 IGNORE 0 IGNORE 0 I...
result:
ok OK, worst = 0.836394 (1 test case)
Test #9:
score: 0
Accepted
time: 1ms
memory: 3908kb
input:
1 2 2 999
output:
0 TAKE 1 1 TAKE
result:
ok OK, worst = 1.000000 (1 test case)
Test #10:
score: 0
Accepted
time: 4ms
memory: 3952kb
input:
100 3 551 450 550 3 552 449 551 3 553 448 552 3 554 447 553 3 555 446 554 3 556 445 555 3 557 444 556 3 558 443 557 3 559 442 558 3 560 441 559 3 561 440 560 3 562 439 561 3 563 438 562 3 564 437 563 3 565 436 564 3 566 435 565 3 567 434 566 3 568 433 567 3 569 432 568 3 570 431 569 3 571 430 570 3 ...
output:
0 TAKE 1 1 TAKE 0 TAKE 0 TAKE 1 1 TAKE 0 TAKE 0 TAKE 1 1 TAKE 0 TAKE 0 TAKE 1 1 TAKE 0 TAKE 0 TAKE 1 1 TAKE 0 TAKE 0 TAKE 1 1 TAKE 0 TAKE 0 TAKE 1 1 TAKE 0 TAKE 0 TAKE 1 1 TAKE 0 TAKE 0 TAKE 1 1 TAKE 0 TAKE 0 TAKE 1 1 TAKE 0 TAKE 0 TAKE 1 1 TAKE 0 TAKE 0 TAKE 1 1 TAKE 0 TAKE 0 TAKE 1 1 ...
result:
ok OK, worst = 0.600000 (100 test cases)
Test #11:
score: 0
Accepted
time: 12ms
memory: 3892kb
input:
41 238 1 0 0 4 1 2 0 5 0 5 1 5 2 3 5 1 1 5 5 2 1 3 4 1 5 0 4 1 5 3 1 4 4 1 1 4 2 2 1 0 4 1 5 1 2 4 3 4 0 2 2 0 3 3 4 2 2 1 2 0 3 5 3 3 1 2 4 3 3 3 0 3 1 1 0 4 5 4 1 3 5 2 0 1 0 2 3 0 5 4 5 5 5 1 5 5 5 2 1 4 0 0 4 3 2 5 0 4 1 1 5 3 5 2 3 1 3 3 0 2 3 1 2 3 5 0 5 2 3 5 3 0 3 4 1 0 1 3 1 2 0 4 5 4 3 0 4...
output:
0 TAKE 0 TAKE 0 TAKE 0 TAKE 0 TAKE 0 TAKE 0 TAKE 0 TAKE 0 TAKE 0 TAKE 0 TAKE 0 TAKE 0 TAKE 0 TAKE 0 TAKE 0 TAKE 0 TAKE 0 TAKE 0 TAKE 0 TAKE 0 TAKE 0 TAKE 0 TAKE 0 TAKE 0 TAKE 0 TAKE 0 TAKE 0 TAKE 0 TAKE 0 TAKE 0 TAKE 0 TAKE 0 TAKE 0 TAKE 0 TAKE 0 TAKE 0 TAKE 0 TAKE 0 TAKE 0 TAKE 0 TAKE 0 TAKE 0 TAKE...
result:
ok OK, worst = 0.996000 (41 test cases)
Test #12:
score: -100
Wrong Answer
time: 4ms
memory: 3768kb
input:
2000 5 174 966 564 649 8 5 58 211 929 70 340 5 481 864 73 407 722 5 181 417 607 419 28 5 429 40 935 257 913 5 387 532 505 446 80 5 187 486 713 23 81 5 61 330 611 918 736 5 939 19 164 889 679 5 847 644 540 944 848 5 618 224 362 561 336 5 504 875 211 808 227 5 104 528 433 537 106 5 997 485 442 729 421...
output:
0 TAKE 1 1 TAKE 0 IGNORE 0 IGNORE 0 IGNORE 0 TAKE 0 TAKE 2 1 2 TAKE 0 IGNORE 0 IGNORE 0 TAKE 1 1 TAKE 0 IGNORE 0 IGNORE 0 IGNORE 0 TAKE 0 TAKE 2 1 2 TAKE 0 IGNORE 0 IGNORE 0 TAKE 0 TAKE 2 2 1 TAKE 0 IGNORE 0 IGNORE 0 TAKE 0 TAKE 0 IGNORE 0 IGNORE 0 IGNORE 0 TAKE 0 TAKE 0 IGNORE 0 IGNORE 0 IG...
result:
wrong answer alg = 574 opt = 972 (test case 82)