QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#738974 | #9178. All-You-Can-Eat | ucup-team134# | WA | 26ms | 4096kb | C++14 | 2.0kb | 2024-11-12 20:27:31 | 2024-11-12 20:27:36 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
int main(){
int t;
scanf("%i",&t);
while(t--){
int n;
scanf("%i",&n);
vector<pair<int,int>> lo;
pair<int,int> hi={0,0};
int sum=0;
bool done=false;
for(int i=1;i<=n;i++){
int x;
scanf("%i",&x);
if(done){
printf("0\n");
fflush(stdout);
printf("IGNORE\n");
fflush(stdout);
}else{
vector<int> disc;
bool take=false;
if(x<=400){
take=true;
sum+=x;
lo.pb({i,x});
if(sum>=600)done=true;
}else if(x<600){
if(hi.first!=0 && hi.second+x<=1000){
take=true;
for(auto p:lo)disc.pb(p.first);
lo.clear();
done=true;
}else if(hi.first==0 || hi.second>x){
sum+=x;
if(hi.first!=0){
sum-=hi.second;
disc.pb(hi.first);
}
take=true;
if(sum>=600)done=true;
hi={i,x};
}
}else{
take=true;
for(auto p:lo)disc.pb(p.first);
lo.clear();
if(hi.first!=0)disc.pb(hi.first);
hi={0,0};
}
printf("%i",disc.size());
for(int y:disc)printf(" %i",y);
printf("\n");
fflush(stdout);
if(take)printf("TAKE\n");
else printf("IGNORE\n");
fflush(stdout);
}
}
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 4084kb
input:
1 5 10 13 450 585 465
output:
0 TAKE 0 TAKE 0 TAKE 0 IGNORE 2 1 2 TAKE
result:
ok OK, worst = 0.975480 (1 test case)
Test #2:
score: 0
Accepted
time: 0ms
memory: 4088kb
input:
1 1 100
output:
0 TAKE
result:
ok OK, worst = 1.000000 (1 test case)
Test #3:
score: 0
Accepted
time: 14ms
memory: 3804kb
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 IGNORE...
result:
ok OK, worst = 0.836394 (2000 test cases)
Test #4:
score: 0
Accepted
time: 22ms
memory: 4096kb
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 T...
result:
ok OK, worst = 0.836394 (500 test cases)
Test #5:
score: 0
Accepted
time: 6ms
memory: 3872kb
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 IG...
result:
ok OK, worst = 0.836394 (200 test cases)
Test #6:
score: 0
Accepted
time: 17ms
memory: 3764kb
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 IG...
result:
ok OK, worst = 0.836394 (100 test cases)
Test #7:
score: 0
Accepted
time: 17ms
memory: 3768kb
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 IG...
result:
ok OK, worst = 0.836394 (10 test cases)
Test #8:
score: 0
Accepted
time: 26ms
memory: 4048kb
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 IG...
result:
ok OK, worst = 0.836394 (1 test case)
Test #9:
score: 0
Accepted
time: 0ms
memory: 3860kb
input:
1 2 2 999
output:
0 TAKE 1 1 TAKE
result:
ok OK, worst = 1.000000 (1 test case)
Test #10:
score: -100
Wrong Answer
time: 1ms
memory: 3796kb
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 TAKE 0 TAKE 0...
result:
wrong output format Unexpected end of file - int32 expected (test case 50)