814B - An express train to reveries ——暴力枚举

谁践踏了优雅 2022-06-14 03:41 227阅读 0赞

Think:
1题意：输入两个序列，判断原始序列，原始序列与输入的两个序列最多只有1个对应元素不相等，且原始序列不会出现重复元素，序列长度2 ≤ n ≤ 1 000，元素范围1 ≤ ai ≤ n
2思路：暴力枚举两种情况（因为原始序列不重复，且输入的序列与原始序列最多只有一个元素对应不相等，因此可以两个输入序列最多只有两个元素对应不相等，然后将未出现的至多两个元素不同顺序放进去，进而之多产生两种可能的原始序列），再判断符合对应元素不相等的个数小于等于1的条件
3感悟：桶思想——建立数组下标与元素大小的关系

B. An express train to reveries
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Sengoku still remembers the mysterious “colourful meteoroids” she discovered with Lala-chan when they were little. In particular, one of the nights impressed her deeply, giving her the illusion that all her fancies would be realized.

On that night, Sengoku constructed a permutation p1, p2, …, pn of integers from 1 to n inclusive, with each integer representing a colour, wishing for the colours to see in the coming meteor outburst. Two incredible outbursts then arrived, each with n meteorids, colours of which being integer sequences a1, a2, …, an and b1, b2, …, bn respectively. Meteoroids’ colours were also between 1 and n inclusive, and the two sequences were not identical, that is, at least one i (1 ≤ i ≤ n) exists, such that ai ≠ bi holds.

Well, she almost had it all — each of the sequences a and b matched exactly n - 1 elements in Sengoku’s permutation. In other words, there is exactly one i (1 ≤ i ≤ n) such that ai ≠ pi, and exactly one j (1 ≤ j ≤ n) such that bj ≠ pj.

For now, Sengoku is able to recover the actual colour sequences a and b through astronomical records, but her wishes have been long forgotten. You are to reconstruct any possible permutation Sengoku could have had on that night.
Input

The first line of input contains a positive integer n (2 ≤ n ≤ 1 000) — the length of Sengoku’s permutation, being the length of both meteor outbursts at the same time.

The second line contains n space-separated integers a1, a2, …, an (1 ≤ ai ≤ n) — the sequence of colours in the first meteor outburst.

The third line contains n space-separated integers b1, b2, …, bn (1 ≤ bi ≤ n) — the sequence of colours in the second meteor outburst. At least one i (1 ≤ i ≤ n) exists, such that ai ≠ bi holds.
Output

Output n space-separated integers p1, p2, …, pn, denoting a possible permutation Sengoku could have had. If there are more than one possible answer, output any one of them.

Input guarantees that such permutation exists.
Examples
Input

5
1 2 3 4 3
1 2 5 4 5

Output

1 2 5 4 3

Input

5
4 4 2 3 1
5 4 5 3 1

Output

5 4 2 3 1

Input

4
1 1 3 4
1 4 3 4

Output

1 2 3 4

Note

In the first sample, both 1, 2, 5, 4, 3 and 1, 2, 3, 4, 5 are acceptable outputs.

In the second sample, 5, 4, 2, 3, 1 is the only permutation to satisfy the constraints.

以下为Accepted代码

  1. #include <bits/stdc++.h>
  3. using namespace std;
  5. int op, tp, link[4];
  7. int main(){
  8.     int n, i, a[1004], b[1004], c[1004], d[1004];
  9.     bool v[1004];
  10.     while(scanf("%d", &n) != EOF){
  11.         tp = 0;
  12.         memset(v, false, sizeof(v));
  13.         memset(c, -1, sizeof(c));
  14.         for(i = 0; i < n; i++)
  15.             scanf("%d", &a[i]);
  16.         for(i = 0; i < n; i++){
  17.             scanf("%d", &b[i]);
  18.             if(a[i] == b[i] && !v[a[i]]){
  19.                 v[a[i]] = true;
  20.                 c[i] = d[i] = a[i];
  21.             }
  22.         }
  23.         for(i = 1; i <= n; i++){
  24.             if(!v[i]){
  25.                 link[tp++] = i;
  26.             }
  27.         }
  28.         op = 0;
  29.         for(i = 0; i < n; i++){
  30.             if(c[i] == -1){
  31.                 c[i] = link[op++];
  32.                 tp--;
  33.                 d[i] = link[tp];
  34.             }
  35.         }
  37.         int cnt1 = 0, cnt2 = 0;
  38.         for(i = 0; i < n; i++){
  39.             if(c[i] != a[i])
  40.                 cnt1++;
  41.             if(c[i] != b[i])
  42.                 cnt2++;
  43.         }
  44.         if(cnt1 <= 1 && cnt2 <= 1){
  45.             for(i = 0; i < n; i++)
  46.                 printf("%d%c", c[i], i == n-1? '\n': ' ');
  47.         }
  48.         else {
  49.             for(i = 0; i < n; i++)
  50.                 printf("%d%c", d[i], i == n-1? '\n': ' ');
  51.         }
  52.     }
  53.     return 0;
  54. }

以下为测试数据

  1. →Judgement Protocol
  2. Test: #1, time: 0 ms., memory: 8 KB, exit code: 0, checker exit code: 0, verdict: OK
  3. Input
  5. 5
  7. 1 2 3 4 3
  9. 1 2 5 4 5
  11. Output
  13. 1 2 3 4 5
  15. Answer
  17. 1 2 5 4 3
  19. Checker Log
  21. ok Correct ^ ^
  23. Test: #2, time: 15 ms., memory: 12 KB, exit code: 0, checker exit code: 0, verdict: OK
  24. Input
  26. 5
  28. 4 4 2 3 1
  30. 5 4 5 3 1
  32. Output
  34. 5 4 2 3 1
  36. Answer
  38. 5 4 2 3 1
  40. Checker Log
  42. ok Correct ^ ^
  44. Test: #3, time: 15 ms., memory: 16 KB, exit code: 0, checker exit code: 0, verdict: OK
  45. Input
  47. 4
  49. 1 1 3 4
  51. 1 4 3 4
  53. Output
  55. 1 2 3 4
  57. Answer
  59. 1 2 3 4
  61. Checker Log
  63. ok Correct ^ ^
  65. Test: #4, time: 15 ms., memory: 8 KB, exit code: 0, checker exit code: 0, verdict: OK
  66. Input
  68. 10
  70. 1 2 3 4 7 6 7 8 9 10
  72. 1 2 3 4 5 6 5 8 9 10
  74. Output
  76. 1 2 3 4 5 6 7 8 9 10
  78. Answer
  80. 1 2 3 4 5 6 7 8 9 10
  82. Checker Log
  84. ok Correct ^ ^
  86. Test: #5, time: 15 ms., memory: 16 KB, exit code: 0, checker exit code: 0, verdict: OK
  87. Input
  89. 10
  91. 1 2 3 4 5 6 7 8 7 10
  93. 1 2 3 4 5 6 7 8 9 9
  95. Output
  97. 1 2 3 4 5 6 7 8 9 10
  99. Answer
  101. 1 2 3 4 5 6 7 8 9 10
  103. Checker Log
  105. ok Correct ^ ^
  107. Test: #6, time: 15 ms., memory: 4 KB, exit code: 0, checker exit code: 0, verdict: OK
  108. Input
  110. 10
  112. 1 2 3 4 5 6 7 8 4 10
  114. 1 2 3 4 5 6 7 6 9 10
  116. Output
  118. 1 2 3 4 5 6 7 8 9 10
  120. Answer
  122. 1 2 3 4 5 6 7 8 9 10
  124. Checker Log
  126. ok Correct ^ ^
  128. Test: #7, time: 15 ms., memory: 20 KB, exit code: 0, checker exit code: 0, verdict: OK
  129. Input
  131. 10
  133. 8 6 1 7 9 3 5 2 10 9
  135. 8 6 1 7 4 3 5 2 10 4
  137. Output
  139. 8 6 1 7 4 3 5 2 10 9
  141. Answer
  143. 8 6 1 7 4 3 5 2 10 9
  145. Checker Log
  147. ok Correct ^ ^
  149. Test: #8, time: 15 ms., memory: 12 KB, exit code: 0, checker exit code: 0, verdict: OK
  150. Input
  152. 10
  154. 2 9 7 7 8 5 4 10 6 1
  156. 2 8 7 3 8 5 4 10 6 1
  158. Output
  160. 2 9 7 3 8 5 4 10 6 1
  162. Answer
  164. 2 9 7 3 8 5 4 10 6 1
  166. Checker Log
  168. ok Correct ^ ^
  170. Test: #9, time: 0 ms., memory: 12 KB, exit code: 0, checker exit code: 0, verdict: OK
  171. Input
  173. 500
  175. 346 422 445 172 378 34 209 410 119 444 279 222 65 414 228 385 386 427 75 178 243 19 27 488 127 467 94 153 162 46 379 334 238 225 301 7 234 271 68 241 406 257 483 302 419 45 329 55 300 124 203 305 282 106 442 371 129 36 183 431 166 437 76 403 50 469 404 288 58 89 370 205 407 196 52 323 110 366 37 230 353 493 214 169 457 318 413 120 207 274 314 18 66 8 486 14 485 421 461 396 310 393 272 143 328 199 57 202 104 325 480 358 471 99 111 307 236 331 446 281 268 362 336 344 324 428 47 40 48 53 286 150 273 70 3...
  177. Output
  179. 346 422 445 172 378 34 209 410 119 444 279 222 65 414 228 385 386 427 75 178 243 19 27 488 127 467 94 153 162 46 379 334 238 225 301 7 234 271 68 241 406 257 483 302 419 45 329 55 300 124 203 305 282 106 442 371 129 36 183 431 166 437 76 403 50 469 404 288 58 89 370 205 407 196 52 323 110 366 37 230 353 493 214 169 457 318 413 120 207 274 314 18 66 8 486 14 485 421 461 396 310 393 272 143 328 199 57 202 104 325 480 358 471 99 111 307 236 331 446 281 268 362 336 344 324 428 47 40 48 53 286 150 273 70 327 13...
  181. Answer
  183. 346 422 445 172 378 34 209 410 119 444 279 222 65 414 228 385 386 427 75 178 243 19 27 488 127 467 94 153 162 46 379 334 238 225 301 7 234 271 68 241 406 257 483 302 419 45 329 55 300 124 203 305 282 106 442 371 129 36 183 431 166 437 76 403 50 469 404 288 58 89 370 205 407 196 52 323 110 366 37 230 353 493 214 169 457 318 413 120 207 274 314 18 66 8 486 14 485 421 461 396 310 393 272 143 328 199 57 202 104 325 480 358 471 99 111 307 236 331 446 281 268 362 336 344 324 428 47 40 48 53 286 150 273 70 327 13...
  185. Checker Log
  187. ok Correct ^ ^
  189. Test: #10, time: 0 ms., memory: 16 KB, exit code: 0, checker exit code: 0, verdict: OK
  190. Input
  192. 1000
  194. 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 440 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 1...
  196. Output
  198. 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...
  200. Answer
  202. 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...
  204. Checker Log
  206. ok Correct ^ ^
  208. Test: #11, time: 0 ms., memory: 12 KB, exit code: 0, checker exit code: 0, verdict: OK
  209. Input
  211. 2
  213. 2 2
  215. 1 1
  217. Output
  219. 1 2
  221. Answer
  223. 1 2
  225. Checker Log
  227. ok Correct ^ ^
  229. Test: #12, time: 15 ms., memory: 16 KB, exit code: 0, checker exit code: 0, verdict: OK
  230. Input
  232. 3
  234. 1 2 2
  236. 1 3 3
  238. Output
  240. 1 2 3
  242. Answer
  244. 1 3 2
  246. Checker Log
  248. ok Correct ^ ^
  250. Test: #13, time: 0 ms., memory: 16 KB, exit code: 0, checker exit code: 0, verdict: OK
  251. Input
  253. 3
  255. 2 2 3
  257. 1 2 1
  259. Output
  261. 1 2 3
  263. Answer
  265. 1 2 3
  267. Checker Log
  269. ok Correct ^ ^
  271. Test: #14, time: 0 ms., memory: 12 KB, exit code: 0, checker exit code: 0, verdict: OK
  272. Input
  274. 3
  276. 1 3 3
  278. 1 1 3
  280. Output
  282. 1 2 3
  284. Answer
  286. 1 2 3
  288. Checker Log
  290. ok Correct ^ ^
  292. Test: #15, time: 0 ms., memory: 16 KB, exit code: 0, checker exit code: 0, verdict: OK
  293. Input
  295. 3
  297. 2 1 1
  299. 2 3 3
  301. Output
  303. 2 1 3
  305. Answer
  307. 2 3 1
  309. Checker Log
  311. ok Correct ^ ^
  313. Test: #16, time: 0 ms., memory: 8 KB, exit code: 0, checker exit code: 0, verdict: OK
  314. Input
  316. 3
  318. 3 3 2
  320. 1 1 2
  322. Output
  324. 1 3 2
  326. Answer
  328. 1 3 2
  330. Checker Log
  332. ok Correct ^ ^
  334. Test: #17, time: 0 ms., memory: 16 KB, exit code: 0, checker exit code: 0, verdict: OK
  335. Input
  337. 3
  339. 1 3 3
  341. 3 3 2
  343. Output
  345. 1 3 2
  347. Answer
  349. 1 3 2
  351. Checker Log
  353. ok Correct ^ ^
  355. Test: #18, time: 0 ms., memory: 8 KB, exit code: 0, checker exit code: 0, verdict: OK
  356. Input
  358. 4
  360. 3 2 3 4
  362. 1 2 1 4
  364. Output
  366. 1 2 3 4
  368. Answer
  370. 1 2 3 4
  372. Checker Log
  374. ok Correct ^ ^
  376. Test: #19, time: 15 ms., memory: 16 KB, exit code: 0, checker exit code: 0, verdict: OK
  377. Input
  379. 4
  381. 2 2 3 4
  383. 1 2 3 2
  385. Output
  387. 1 2 3 4
  389. Answer
  391. 1 2 3 4
  393. Checker Log
  395. ok Correct ^ ^
  397. Test: #20, time: 0 ms., memory: 12 KB, exit code: 0, checker exit code: 0, verdict: OK
  398. Input
  400. 4
  402. 1 2 4 4
  404. 2 2 3 4
  406. Output
  408. 1 2 3 4
  410. Answer
  412. 1 2 3 4
  414. Checker Log
  416. ok Correct ^ ^
  418. Test: #21, time: 15 ms., memory: 12 KB, exit code: 0, checker exit code: 0, verdict: OK
  419. Input
  421. 4
  423. 4 1 3 4
  425. 2 1 3 2
  427. Output
  429. 2 1 3 4
  431. Answer
  433. 2 1 3 4
  435. Checker Log
  437. ok Correct ^ ^
  439. Test: #22, time: 0 ms., memory: 12 KB, exit code: 0, checker exit code: 0, verdict: OK
  440. Input
  442. 4
  444. 3 2 1 3
  446. 4 2 1 2
  448. Output
  450. 4 2 1 3
  452. Answer
  454. 4 2 1 3
  456. Checker Log
  458. ok Correct ^ ^
  460. Test: #23, time: 15 ms., memory: 16 KB, exit code: 0, checker exit code: 0, verdict: OK
  461. Input
  463. 4
  465. 1 4 1 3
  467. 2 4 1 4
  469. Output
  471. 2 4 1 3
  473. Answer
  475. 2 4 1 3
  477. Checker Log
  479. ok Correct ^ ^
  481. Test: #24, time: 0 ms., memory: 20 KB, exit code: 0, checker exit code: 0, verdict: OK
  482. Input
  484. 4
  486. 1 3 4 4
  488. 3 3 2 4
  490. Output
  492. 1 3 2 4
  494. Answer
  496. 1 3 2 4
  498. Checker Log
  500. ok Correct ^ ^
  502. Test: #25, time: 15 ms., memory: 12 KB, exit code: 0, checker exit code: 0, verdict: OK
  503. Input
  505. 100
  507. 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 41 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
  509. 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 28 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 ...
  511. Output
  513. 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
  515. Answer
  517. 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
  519. Checker Log
  521. ok Correct ^ ^
  523. Test: #26, time: 15 ms., memory: 20 KB, exit code: 0, checker exit code: 0, verdict: OK
  524. Input
  526. 997
  528. 309 225 598 599 353 132 597 350 273 519 85 977 51 384 452 834 761 256 702 861 136 920 349 642 774 777 155 991 815 42 43 181 315 798 553 804 54 740 839 911 635 108 953 105 163 340 746 981 357 482 297 573 756 984 966 168 493 547 764 148 937 758 397 370 22 388 197 733 323 334 101 221 114 343 445 930 171 6 721 568 454 867 66 39 266 4 290 294 208 747 448 962 824 572 919 455 95 347 975 291 708 952 150 282 477 669 835 485 933 44 973 253 671 144 94 29 229 86 627 212 757 143 501 305 980 355 576 860 20 56 375 6...
  530. Output
  532. 309 225 598 599 353 132 597 350 273 519 85 977 51 384 452 834 761 256 702 861 136 920 349 642 774 777 155 991 815 42 43 181 315 798 553 804 54 740 839 911 635 108 953 105 163 340 746 981 357 482 297 573 756 984 966 168 493 547 764 148 937 758 397 370 22 388 197 733 323 334 101 221 114 343 445 930 171 6 721 568 454 867 66 39 266 4 290 294 208 747 448 962 824 572 919 455 95 347 975 291 708 952 150 282 477 669 835 485 933 44 973 253 671 144 94 29 229 86 627 212 757 143 501 305 980 355 576 860 20 56 375 629 99...
  534. Answer
  536. 309 225 598 599 353 132 597 350 273 519 85 977 51 384 452 834 761 256 702 861 136 920 349 642 774 777 155 991 815 42 43 181 315 798 553 804 54 740 839 911 635 108 953 105 163 340 746 981 357 482 297 573 756 984 966 168 493 547 764 148 937 758 397 370 22 388 197 733 323 334 101 221 114 343 445 930 171 6 721 568 454 867 66 39 266 4 290 294 208 747 448 962 824 572 919 455 95 347 975 291 708 952 150 282 477 669 835 485 933 44 973 253 671 144 94 29 229 86 627 212 757 143 501 305 980 355 576 860 20 56 375 629 99...
  538. Checker Log
  540. ok Correct ^ ^
  542. Test: #27, time: 15 ms., memory: 16 KB, exit code: 0, checker exit code: 0, verdict: OK
  543. Input
  545. 1000
  547. 59 615 47 121 265 619 776 404 556 783 348 417 57 440 112 152 419 293 262 110 328 973 989 273 55 41 590 267 278 523 504 921 264 239 869 756 584 162 130 336 644 697 226 257 801 194 774 968 449 297 557 574 94 12 54 181 271 933 286 979 462 207 390 133 817 992 938 35 766 488 163 704 354 323 999 447 787 459 382 374 770 638 50 806 963 46 37 623 797 9 335 742 737 127 694 617 682 845 145 477 710 380 838 715 599 446 332 236 23 405 900 641 886 100 955 942 917 344 318 512 549 312 809 892 799 169 438 319 22 637 7...
  549. Output
  551. 59 615 47 121 265 619 776 404 556 783 348 417 57 440 112 152 419 293 262 110 328 973 989 273 55 41 590 267 278 523 504 921 264 239 869 756 584 162 130 336 644 697 226 257 801 194 774 968 449 297 557 574 94 12 54 181 271 933 286 979 462 207 390 133 817 992 938 35 766 488 163 704 354 323 999 447 787 459 382 374 770 638 50 806 963 46 37 623 797 9 335 742 737 127 694 617 682 845 145 477 710 380 838 715 599 446 332 236 23 405 900 641 886 100 955 942 917 344 318 512 549 312 809 892 799 169 438 319 22 637 703 176...
  553. Answer
  555. 59 615 47 121 265 619 776 404 556 783 348 417 57 440 112 152 419 293 262 110 328 973 989 273 55 41 590 267 278 523 504 921 264 239 869 756 584 162 856 336 644 697 226 257 801 194 774 968 449 297 557 574 94 12 54 181 271 933 286 979 462 207 390 133 817 992 938 35 766 488 163 704 354 323 999 447 787 459 382 374 770 638 50 806 963 46 37 623 797 9 335 742 737 127 694 617 682 845 145 477 710 380 838 715 599 446 332 236 23 405 900 641 886 100 955 942 917 344 318 512 549 312 809 892 799 169 438 319 22 637 703 176...
  557. Checker Log
  559. ok Correct ^ ^
  561. Test: #28, time: 0 ms., memory: 8 KB, exit code: 0, checker exit code: 0, verdict: OK
  562. Input
  564. 1000
  566. 909 600 221 766 834 874 872 231 696 801 164 124 335 591 953 451 200 492 531 345 113 980 774 326 562 671 35 500 603 706 922 984 354 141 809 85 269 427 5 739 320 921 937 502 956 239 137 796 125 624 14 353 483 182 38 838 761 460 179 845 620 153 202 473 175 719 149 621 526 268 212 948 165 535 541 901 784 480 736 807 658 364 109 73 698 494 176 857 416 93 21 65 132 193 769 101 111 951 36 810 324 734 381 978 674 800 462 408 866 717 484 390 919 48 783 42 368 229 292 854 487 103 903 435 663 186 831 806 799 62...
  568. Output
  570. 909 600 221 766 834 874 872 231 696 801 164 124 335 591 953 451 200 492 531 345 113 980 774 326 562 671 35 500 603 706 922 984 354 141 809 85 269 427 5 739 320 921 937 502 956 239 137 796 125 624 14 353 483 182 38 838 761 460 179 845 620 153 202 473 175 719 149 621 526 268 212 948 165 535 541 901 784 480 736 807 658 364 109 73 698 494 176 857 416 93 21 65 132 193 769 101 111 951 36 810 324 734 381 978 674 800 462 408 866 717 484 390 919 48 783 42 368 229 292 854 487 103 903 435 663 186 831 806 799 627 151 ...
  572. Answer
  574. 909 600 221 766 834 874 872 231 696 801 164 124 335 591 953 451 200 492 531 345 113 980 774 326 562 671 35 500 603 706 922 984 354 141 809 85 269 427 5 739 320 921 937 502 956 239 137 796 125 624 14 353 483 182 38 838 761 460 179 845 620 153 202 473 175 719 149 621 526 268 212 948 165 535 541 901 784 480 736 807 658 364 109 73 698 494 176 857 416 93 21 65 132 193 769 101 111 951 36 810 324 734 381 978 674 800 462 408 866 717 484 390 919 48 783 42 368 229 292 854 487 103 903 435 663 186 831 806 799 627 151 ...
  576. Checker Log
  578. ok Correct ^ ^
  580. Test: #29, time: 15 ms., memory: 12 KB, exit code: 0, checker exit code: 0, verdict: OK
  581. Input
  583. 1000
  585. 283 699 619 182 607 82 537 768 961 778 996 737 409 19 565 636 149 526 734 359 133 845 622 876 124 903 430 726 389 958 302 797 323 501 433 914 391 708 398 798 733 879 488 61 138 74 38 589 579 80 523 203 921 902 752 599 627 472 646 675 479 759 205 327 452 163 113 727 559 812 151 179 438 94 76 159 218 881 469 566 442 392 450 500 289 528 895 468 423 412 856 612 115 519 928 624 723 195 918 401 132 255 214 328 546 314 634 202 748 108 164 816 991 22 843 147 524 735 658 63 839 720 175 847 373 506 679 199 334...
  587. Output
  589. 283 699 619 182 607 82 537 768 961 778 996 737 409 19 565 636 149 526 734 359 133 845 622 876 124 903 430 726 389 958 302 797 323 501 433 914 391 708 398 798 733 879 488 61 138 74 38 589 579 80 523 203 921 902 752 599 627 472 646 675 479 759 205 327 452 163 113 727 559 812 151 179 438 94 76 159 218 881 469 566 442 392 450 500 289 528 895 468 423 412 856 612 115 519 928 624 723 195 918 401 132 255 214 328 546 314 634 202 748 108 164 816 991 22 843 147 524 735 658 63 839 720 175 847 373 506 679 199 334 907 9...
  591. Answer
  593. 283 699 619 182 607 82 537 768 961 778 996 737 409 19 565 636 149 526 734 359 133 845 622 876 124 903 430 726 389 958 302 797 323 501 433 914 391 708 398 798 733 879 488 61 138 74 38 589 579 80 523 203 921 902 752 599 627 472 646 675 479 759 205 327 452 163 113 727 559 812 151 179 438 94 76 159 218 881 469 566 442 392 450 500 289 528 895 468 423 412 856 612 115 519 928 624 723 195 918 401 132 255 214 328 546 314 634 202 748 108 164 816 991 22 843 147 524 735 658 63 839 720 175 847 373 506 679 199 334 907 9...
  595. Checker Log
  597. ok Correct ^ ^
  599. Test: #30, time: 0 ms., memory: 8 KB, exit code: 0, checker exit code: 0, verdict: OK
  600. Input
  602. 1000
  604. 268 75 593 697 195 401 434 279 256 65 81 156 599 917 186 761 154 381 445 961 879 353 386 522 193 868 705 228 24 260 990 801 592 105 874 382 887 533 209 722 505 764 366 143 510 614 810 281 72 74 735 13 146 122 20 934 376 803 663 31 259 875 113 941 90 174 600 563 559 134 2 394 757 189 598 607 685 144 246 965 306 59 739 866 940 704 527 954 98 88 474 861 988 102 254 579 83 571 18 512 613 759 730 876 891 771 28 983 955 914 203 909 245 286 267 395 804 417 257 942 756 633 199 556 499 283 87 403 995 750 464 ...
  606. Output
  608. 268 75 593 697 195 401 434 279 256 65 81 156 599 917 186 761 154 381 445 961 879 353 386 522 193 868 705 228 24 260 990 801 592 105 874 382 887 533 209 722 505 764 366 143 510 614 810 281 72 74 735 13 146 122 20 934 376 803 663 31 259 875 113 941 90 174 600 563 559 134 2 394 757 189 598 607 685 144 246 965 306 59 739 866 940 704 527 954 98 88 474 861 988 102 254 579 83 571 18 512 613 759 730 876 891 771 28 983 955 914 203 909 245 286 267 395 804 417 257 942 756 633 199 556 499 283 87 403 995 750 464 160 89...
  610. Answer
  612. 268 75 593 697 195 401 434 279 256 65 81 156 599 917 186 761 154 381 445 961 879 353 386 522 193 868 705 228 24 260 990 801 592 105 874 382 887 533 209 722 505 764 366 143 510 614 810 281 72 74 735 13 146 122 20 934 376 803 663 31 259 875 113 941 90 174 600 563 559 134 2 394 757 189 598 607 685 144 246 965 306 59 739 866 940 704 527 954 98 88 474 861 988 102 254 579 83 571 18 512 613 759 730 876 891 771 28 983 955 914 203 909 245 286 267 395 804 417 257 942 756 633 199 556 499 283 87 403 995 750 464 160 89...
  614. Checker Log
  616. ok Correct ^ ^
  618. Test: #31, time: 0 ms., memory: 20 KB, exit code: 0, checker exit code: 0, verdict: OK
  619. Input
  621. 5
  623. 5 4 5 3 1
  625. 4 4 2 3 1
  627. Output
  629. 5 4 2 3 1
  631. Answer
  633. 5 4 2 3 1
  635. Checker Log
  637. ok Correct ^ ^
  639. Test: #32, time: 15 ms., memory: 8 KB, exit code: 0, checker exit code: 0, verdict: OK
  640. Input
  642. 5
  644. 4 1 2 4 5
  646. 3 1 2 5 5
  648. Output
  650. 3 1 2 4 5
  652. Answer
  654. 3 1 2 4 5
  656. Checker Log
  658. ok Correct ^ ^
  660. Test: #33, time: 15 ms., memory: 12 KB, exit code: 0, checker exit code: 0, verdict: OK
  661. Input
  663. 3
  665. 2 2 3
  667. 1 3 3
  669. Output
  671. 1 2 3
  673. Answer
  675. 1 2 3
  677. Checker Log
  679. ok Correct ^ ^
  681. Test: #34, time: 15 ms., memory: 16 KB, exit code: 0, checker exit code: 0, verdict: OK
  682. Input
  684. 3
  686. 1 1 3
  688. 2 3 3
  690. Output
  692. 2 1 3
  694. Answer
  696. 2 1 3
  698. Checker Log
  700. ok Correct ^ ^
  702. Test: #35, time: 15 ms., memory: 16 KB, exit code: 0, checker exit code: 0, verdict: OK
  703. Input
  705. 5
  707. 5 4 5 3 1
  709. 2 4 4 3 1
  711. Output
  713. 2 4 5 3 1
  715. Answer
  717. 2 4 5 3 1
  719. Checker Log
  721. ok Correct ^ ^
  723. Test: #36, time: 15 ms., memory: 8 KB, exit code: 0, checker exit code: 0, verdict: OK
  724. Input
  726. 3
  728. 3 3 1
  730. 2 1 1
  732. Output
  734. 2 3 1
  736. Answer
  738. 2 3 1
  740. Checker Log
  742. ok Correct ^ ^
  744. Test: #37, time: 15 ms., memory: 20 KB, exit code: 0, checker exit code: 0, verdict: OK
  745. Input
  747. 5
  749. 5 4 3 5 2
  751. 5 4 1 1 2
  753. Output
  755. 5 4 3 1 2
  757. Answer
  759. 5 4 3 1 2
  761. Checker Log
  763. ok Correct ^ ^
  765. Test: #38, time: 15 ms., memory: 12 KB, exit code: 0, checker exit code: 0, verdict: OK
  766. Input
  768. 6
  770. 1 2 3 4 2 5
  772. 1 6 3 4 4 5
  774. Output
  776. 1 6 3 4 2 5
  778. Answer
  780. 1 6 3 4 2 5
  782. Checker Log
  784. ok Correct ^ ^
  786. Test: #39, time: 0 ms., memory: 12 KB, exit code: 0, checker exit code: 0, verdict: OK
  787. Input
  789. 4
  791. 1 3 2 1
  793. 2 3 2 1
  795. Output
  797. 4 3 2 1
  799. Answer
  801. 4 3 2 1
  803. Checker Log
  805. ok Correct ^ ^
  807. Test: #40, time: 0 ms., memory: 16 KB, exit code: 0, checker exit code: 0, verdict: OK
  808. Input
  810. 4
  812. 1 3 3 4
  814. 1 4 3 4
  816. Output
  818. 1 2 3 4
  820. Answer
  822. 1 2 3 4
  824. Checker Log
  826. ok Correct ^ ^
  828. Test: #41, time: 0 ms., memory: 20 KB, exit code: 0, checker exit code: 0, verdict: OK
  829. Input
  831. 11
  833. 1 2 3 4 5 6 7 8 9 10 10
  835. 1 2 3 4 5 6 7 8 9 10 3
  837. Output
  839. 1 2 3 4 5 6 7 8 9 10 11
  841. Answer
  843. 1 2 3 4 5 6 7 8 9 10 11
  845. Checker Log
  847. ok Correct ^ ^
  849. Test: #42, time: 15 ms., memory: 8 KB, exit code: 0, checker exit code: 0, verdict: OK
  850. Input
  852. 5
  854. 1 2 3 2 5
  856. 1 4 3 3 5
  858. Output
  860. 1 4 3 2 5
  862. Answer
  864. 1 4 3 2 5
  866. Checker Log
  868. ok Correct ^ ^
  870. Test: #43, time: 0 ms., memory: 12 KB, exit code: 0, checker exit code: 0, verdict: OK
  871. Input
  873. 5
  875. 1 2 3 4 3
  877. 1 2 5 4 2
  879. Output
  881. 1 2 5 4 3
  883. Answer
  885. 1 2 5 4 3
  887. Checker Log
  889. ok Correct ^ ^
  891. Test: #44, time: 0 ms., memory: 8 KB, exit code: 0, checker exit code: 0, verdict: OK
  892. Input
  894. 5
  896. 1 2 3 4 4
  898. 1 2 3 4 3
  900. Output
  902. 1 2 3 4 5
  904. Answer
  906. 1 2 3 4 5
  908. Checker Log
  910. ok Correct ^ ^
  912. Test: #45, time: 0 ms., memory: 12 KB, exit code: 0, checker exit code: 0, verdict: OK
  913. Input
  915. 4
  917. 1 3 1 4
  919. 1 3 4 4
  921. Output
  923. 1 3 2 4
  925. Answer
  927. 1 3 2 4
  929. Checker Log
  931. ok Correct ^ ^
  933. Test: #46, time: 0 ms., memory: 16 KB, exit code: 0, checker exit code: 0, verdict: OK
  934. Input
  936. 5
  938. 2 5 3 2 1
  940. 4 5 3 3 1
  942. Output
  944. 4 5 3 2 1
  946. Answer
  948. 4 5 3 2 1
  950. Checker Log
  952. ok Correct ^ ^
  954. Test: #47, time: 0 ms., memory: 8 KB, exit code: 0, checker exit code: 0, verdict: OK
  955. Input
  957. 5
  959. 1 2 3 2 5
  961. 1 3 3 4 5
  963. Output
  965. 1 2 3 4 5
  967. Answer
  969. 1 2 3 4 5
  971. Checker Log
  973. ok Correct ^ ^
  975. Test: #48, time: 15 ms., memory: 20 KB, exit code: 0, checker exit code: 0, verdict: OK
  976. Input
  978. 5
  980. 5 2 3 4 5
  982. 2 2 3 4 5
  984. Output
  986. 1 2 3 4 5
  988. Answer
  990. 1 2 3 4 5
  992. Checker Log
  994. ok Correct ^ ^
  996. Test: #49, time: 0 ms., memory: 8 KB, exit code: 0, checker exit code: 0, verdict: OK
  997. Input
  999. 5
  1001. 5 4 1 1 2
  1003. 5 4 3 5 2
  1005. Output
  1007. 5 4 3 1 2
  1009. Answer
  1011. 5 4 3 1 2
  1013. Checker Log
  1015. ok Correct ^ ^
  1017. Test: #50, time: 0 ms., memory: 8 KB, exit code: 0, checker exit code: 0, verdict: OK
  1018. Input
  1020. 4
  1022. 1 4 3 4
  1024. 1 3 3 4
  1026. Output
  1028. 1 2 3 4
  1030. Answer
  1032. 1 2 3 4
  1034. Checker Log
  1036. ok Correct ^ ^
  1038. Test: #51, time: 15 ms., memory: 12 KB, exit code: 0, checker exit code: 0, verdict: OK
  1039. Input
  1041. 4
  1043. 1 2 3 1
  1045. 1 2 3 2
  1047. Output
  1049. 1 2 3 4
  1051. Answer
  1053. 1 2 3 4
  1055. Checker Log
  1057. ok Correct ^ ^
  1059. Test: #52, time: 0 ms., memory: 16 KB, exit code: 0, checker exit code: 0, verdict: OK
  1060. Input
  1062. 5
  1064. 4 5 3 3 1
  1066. 2 5 3 2 1
  1068. Output
  1070. 4 5 3 2 1
  1072. Answer
  1074. 4 5 3 2 1
  1076. Checker Log
  1078. ok Correct ^ ^
  1080. Test: #53, time: 15 ms., memory: 16 KB, exit code: 0, checker exit code: 0, verdict: OK
  1081. Input
  1083. 5
  1085. 1 2 3 5 5
  1087. 1 2 3 4 3
  1089. Output
  1091. 1 2 3 4 5
  1093. Answer
  1095. 1 2 3 4 5
  1097. Checker Log
  1099. ok Correct ^ ^
  1101. Test: #54, time: 15 ms., memory: 16 KB, exit code: 0, checker exit code: 0, verdict: OK
  1102. Input
  1104. 4
  1106. 2 3 3 4
  1108. 2 4 3 4
  1110. Output
  1112. 2 1 3 4
  1114. Answer
  1116. 2 1 3 4
  1118. Checker Log
  1120. ok Correct ^ ^

发表评论

表情：
评论列表 （有 0 条评论，227人围观）

还没有评论，来说两句吧...

相关阅读

    相关 ACM.暴力枚举

    \有一类问题可以采用一种盲目的搜索方法，在搜索结果的过程中，把各种可能的情况都考虑到，并对所得的结果逐一进行判断，过滤掉那些不符合要求的，保留那些符合要求的，这种方法叫枚举算法

    我就是我我就是我/ 0 赞/ 97 阅读

    相关 暴力枚举

    Problem Description 小埋今天出门准备买一堆漫画书回来，书的套餐类型有 3 种，第一种书是单本的，第二种书是两本捆在一起的，第三种是三本书捆在一起的。每

    矫情吗；*矫情吗；*/ 0 赞/ 340 阅读