QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#523304#4930. LCS of PermutationsModyKachef0 24ms3680kbC++23467b2024-08-18 04:18:552024-08-18 04:18:55

Judging History

你现在查看的是最新测评结果

  • [2024-08-18 04:18:55]
  • 评测
  • 测评结果:0
  • 用时:24ms
  • 内存:3680kb
  • [2024-08-18 04:18:55]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
#define int long long 

void doWork(){
   int n , a , b , c , o;
   cin >> n >> a >> b >> c >> o; 
   for (int i = n ; i > 0 ; i--) cout << i << ' ';
   for (int i = 1 ; i <= n ; i++) cout << i << ' ' ;
   for (int i = 1;  i<= n ; i++) cout << i << ' '; 
}

signed main(){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int t; cin >> t;
    while(t--){
        doWork(); cout << '\n';
    }
}

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 0
Wrong Answer

Test #1:

score: 0
Wrong Answer
time: 19ms
memory: 3616kb

input:

632
512 1 1 512 1
201 1 1 201 1
155 1 1 155 1
129 1 1 129 1
345 1 1 345 1
454 1 1 454 1
614 1 1 614 1
11 1 1 11 1
492 1 1 492 1
357 1 1 357 1
300 1 1 300 1
295 1 1 295 1
607 1 1 607 1
442 1 1 442 1
14 1 1 14 1
79 1 1 79 1
584 1 1 584 1
431 1 1 431 1
343 1 1 343 1
64 1 1 64 1
548 1 1 548 1
101 1 1 10...

output:

512 511 510 509 508 507 506 505 504 503 502 501 500 499 498 497 496 495 494 493 492 491 490 489 488 487 486 485 484 483 482 481 480 479 478 477 476 475 474 473 472 471 470 469 468 467 466 465 464 463 462 461 460 459 458 457 456 455 454 453 452 451 450 449 448 447 446 445 444 443 442 441 440 439 438 ...

result:

wrong answer Token parameter [name=yes/no] equals to "512", doesn't correspond to pattern "[yY][eE][sS]|[nN][oO]" (test case 1)

Subtask #2:

score: 0
Wrong Answer

Test #9:

score: 0
Wrong Answer
time: 24ms
memory: 3672kb

input:

40011
1 1 1 1 1
2 1 1 1 1
2 1 1 2 1
2 1 2 2 1
2 2 2 2 1
3 1 1 1 1
3 1 1 2 1
3 1 1 3 1
3 1 2 2 1
3 1 2 3 1
3 1 3 3 1
3 2 2 2 1
3 2 2 3 1
3 2 3 3 1
3 3 3 3 1
4 1 1 1 1
4 1 1 2 1
4 1 1 3 1
4 1 1 4 1
4 1 2 2 1
4 1 2 3 1
4 1 2 4 1
4 1 3 3 1
4 1 3 4 1
4 1 4 4 1
4 2 2 2 1
4 2 2 3 1
4 2 2 4 1
4 2 3 3 1
4 2 ...

output:

1 1 1 
2 1 1 2 1 2 
2 1 1 2 1 2 
2 1 1 2 1 2 
2 1 1 2 1 2 
3 2 1 1 2 3 1 2 3 
3 2 1 1 2 3 1 2 3 
3 2 1 1 2 3 1 2 3 
3 2 1 1 2 3 1 2 3 
3 2 1 1 2 3 1 2 3 
3 2 1 1 2 3 1 2 3 
3 2 1 1 2 3 1 2 3 
3 2 1 1 2 3 1 2 3 
3 2 1 1 2 3 1 2 3 
3 2 1 1 2 3 1 2 3 
4 3 2 1 1 2 3 4 1 2 3 4 
4 3 2 1 1 2 3 4 1 2 3 4 
4...

result:

wrong answer Token parameter [name=yes/no] equals to "1", doesn't correspond to pattern "[yY][eE][sS]|[nN][oO]" (test case 1)

Subtask #3:

score: 0
Skipped

Dependency #1:

0%

Subtask #4:

score: 0
Skipped

Dependency #1:

0%

Subtask #5:

score: 0
Wrong Answer

Test #58:

score: 0
Wrong Answer
time: 17ms
memory: 3680kb

input:

11753
20 10 12 19 0
21 3 4 18 0
21 5 12 14 0
7 1 1 3 0
16 9 10 13 0
13 3 4 9 0
21 11 13 14 0
16 15 16 16 0
20 10 10 13 0
19 3 9 13 0
18 1 17 18 0
15 2 4 4 0
14 2 4 5 0
19 3 9 16 0
16 10 12 15 0
18 2 7 17 0
18 1 1 12 0
14 1 1 1 0
9 1 2 5 0
17 8 15 15 0
18 2 2 14 0
19 9 14 17 0
20 2 10 16 0
20 8 9 17 ...

output:

20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 
21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16...

result:

wrong answer Token parameter [name=yes/no] equals to "20", doesn't correspond to pattern "[yY][eE][sS]|[nN][oO]" (test case 1)

Subtask #6:

score: 0
Skipped

Dependency #2:

0%