QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#611078	#8257. Marathon Race 2	liuziao	52	189ms	28228kb	C++23	2.3kb	2024-10-04 19:13:14	2024-10-04 19:13:17

Judging History

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

[2024-10-04 19:13:17]
评测

测评结果：52
用时：189ms
内存：28228kb

查看

[2024-10-04 19:13:14]
提交

answer

#include <bits/stdc++.h>

#define int int64_t

const int kMaxN = 5e5 + 5, kMaxT = 2e3 + 5;

int n, m, L, q;
int cnt[kMaxN], pos[kMaxN], sum[kMaxN], f[kMaxT][kMaxT][2];
int st[kMaxN], to[kMaxN], tm[kMaxN], ans[kMaxN];
std::vector<int> vec[kMaxN];

void solve(int s) {
  for (int i = 0; i <= m + 1; ++i) {
    for (int j = 0; j <= m + 1; ++j) {
      f[i][j][0] = f[i][j][1] = 1e12;
    }
  }
  f[s][s][0] = f[s][s][1] = 0;
  for (int len = 2; len <= m; ++len) {
    for (int i = 1; i <= m - len + 1; ++i) {
      int j = i + len - 1;
      for (int o1 = 0; o1 < 2; ++o1) {
        int p1 = (!o1 ? pos[i] : pos[j]);
        for (int o2 = 0; o2 < 2; ++o2) {
          int p2 = (!o2 ? pos[i] : pos[j - 1]);
          if (o1) f[i][j][o1] = std::min(f[i][j][o1], f[i][j - 1][o2] + (n - (sum[j - 1] - sum[i - 1]) + 1) * abs(p1 - p2));
        
          p2 = (!o2 ? pos[i + 1] : pos[j]);
          if (!o1) f[i][j][o1] = std::min(f[i][j][o1], f[i + 1][j][o2] + (n - (sum[j] - sum[i]) + 1) * abs(p1 - p2));
        }
      }
    }
  }
  for (int i = pos[s - 1]; i <= (s == m ? L : pos[s + 1]); ++i) {
    for (auto id : vec[i]) {
      int st = ::st[id], to = ::to[id];
      int val = std::min(f[1][m][0] + abs(st - pos[1]), f[1][m][1] + abs(st - pos[m])) + sum[m];
      val += (sum[m] + 1) * abs(pos[s] - to);
      ans[id] = std::min(ans[id], val);
    }
  }
}

void dickdreamer() {
  std::cin >> n >> L;
  for (int i = 1; i <= n; ++i) {
    int x;
    std::cin >> x;
    ++cnt[x];
  }
  for (int i = 0; i <= L; ++i) {
    if (cnt[i]) {
      pos[++m] = i;
    }
  }
  for (int i = 1; i <= m; ++i) sum[i] = sum[i - 1] + cnt[pos[i]];
  std::cin >> q;
  if (1ll * m * (m + 1) / 2 > 5e5) {
    for (int i = 1; i <= q; ++i) std::cout << "No\n";
    return;
  }
  for (int i = 1; i <= q; ++i) {
    std::cin >> st[i] >> to[i] >> tm[i];
    ans[i] = 1e18;
    vec[to[i]].emplace_back(i);
  }
  for (int i = 1; i <= m; ++i) solve(i);
  for (int i = 1; i <= q; ++i) std::cout << (ans[i] <= tm[i] ? "Yes\n" : "No\n");
}

int32_t main() {
#ifdef ORZXKR
  freopen("in.txt", "r", stdin);
  freopen("out.txt", "w", stdout);
#endif
  std::ios::sync_with_stdio(0), std::cin.tie(0), std::cout.tie(0);
  int T = 1;
  // std::cin >> T;
  while (T--) dickdreamer();
  // std::cerr << 1.0 * clock() / CLOCKS_PER_SEC << "s\n";
  return 0;
}

Source code, Language: C++23

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 7

Accepted

Test #1:

score: 7

Accepted

time: 2ms

memory: 17960kb

input:

output:

Yes
Yes
No
No
No
No
No
No
No
No

result:

ok 10 token(s): yes count is 2, no count is 8

Test #2:

score: 7

Accepted

time: 0ms

memory: 17996kb

input:

output:

Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes

result:

ok 10 token(s): yes count is 10, no count is 0

Test #3:

score: 7

Accepted

time: 3ms

memory: 17968kb

input:

output:

No
No
No
No
Yes
Yes
Yes
Yes
Yes
Yes

result:

ok 10 token(s): yes count is 6, no count is 4

Test #4:

score: 7

Accepted

time: 0ms

memory: 17972kb

input:

output:

No
No
No
No
No
Yes
Yes
Yes
Yes
Yes

result:

ok 10 token(s): yes count is 5, no count is 5

Test #5:

score: 7

Accepted

time: 0ms

memory: 18044kb

input:

output:

Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes

result:

ok 10 token(s): yes count is 10, no count is 0

Test #6:

score: 7

Accepted

time: 0ms

memory: 17976kb

input:

7 83382
35565 7347 27797 28072 31528 45377 43857
10
0 0 160004
0 0 224969
0 0 310304
0 0 354202
0 0 310303
0 0 493150
0 0 227687
0 0 448225
0 0 88396
0 0 155211

output:

No
No
Yes
Yes
No
Yes
No
Yes
No
No

result:

ok 10 token(s): yes count is 4, no count is 6

Test #7:

score: 7

Accepted

time: 3ms

memory: 20100kb

input:

7 83382
35212 3869 11565 53219 2927 45479 40671
10
0 0 189926
0 0 419739
0 0 245553
0 0 110218
0 0 299387
0 0 1986
0 0 473275
0 0 195521
0 0 299386
0 0 246039

output:

No
Yes
No
No
Yes
No
Yes
No
No
No

result:

ok 10 token(s): yes count is 3, no count is 7

Test #8:

score: 7

Accepted

time: 0ms

memory: 17952kb

input:

7 500000
6069 96930 28374 1275 53141 1423 6225
10
0 0 388080
0 0 73883
0 0 319880
0 0 141926
0 0 144641
0 0 67306
0 0 387304
0 0 387303
0 0 236649
0 0 130438

output:

Yes
No
No
No
No
No
Yes
No
No
No

result:

ok 10 token(s): yes count is 2, no count is 8

Test #9:

score: 7

Accepted

time: 0ms

memory: 17984kb

input:

7 500000
22379 39203 896 17806 23724 7599 153
10
0 0 492328
0 0 190173
0 0 315557
0 0 190172
0 0 138962
0 0 298883
0 0 246521
0 0 194070
0 0 252592
0 0 418531

output:

Yes
Yes
Yes
No
No
Yes
Yes
Yes
Yes
Yes

result:

ok 10 token(s): yes count is 8, no count is 2

Test #10:

score: 7

Accepted

time: 0ms

memory: 18052kb

input:

7 500000
0 0 0 0 0 0 0
10
0 0 124229
0 0 233729
0 0 306668
0 0 499999
0 0 220256
0 0 62117
0 0 115533
0 0 48137
0 0 160004
0 0 500000

output:

Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes

result:

ok 10 token(s): yes count is 10, no count is 0

Test #11:

score: 7

Accepted

time: 3ms

memory: 16004kb

input:

7 498000
498000 498000 498000 498000 498000 498000 498000
10
0 0 261154
0 0 235539
0 0 224636
0 0 283789
0 0 500000
0 0 480913
0 0 326331
0 0 499999
0 0 61700
0 0 280564

output:

No
No
No
No
No
No
No
No
No
No

result:

ok 10 token(s): yes count is 0, no count is 10

Subtask #2:

score: 7

Accepted

Dependency #1:

100%

Accepted

Test #12:

score: 7

Accepted

time: 3ms

memory: 17900kb

input:

output:

No
Yes
No
Yes
No
Yes
No
Yes

result:

ok 8 token(s): yes count is 4, no count is 4

Test #13:

score: 7

Accepted

time: 2ms

memory: 17992kb

input:

output:

No
Yes
No
Yes
No
Yes
No
Yes
Yes
Yes

result:

ok 10 token(s): yes count is 6, no count is 4

Test #14:

score: 7

Accepted

time: 0ms

memory: 17956kb

input:

output:

No
Yes
No
Yes
No
Yes
No
Yes
No
Yes

result:

ok 10 token(s): yes count is 5, no count is 5

Test #15:

score: 7

Accepted

time: 2ms

memory: 18028kb

input:

output:

No
Yes
No
Yes
No
Yes
No
Yes

result:

ok 8 token(s): yes count is 4, no count is 4

Test #16:

score: 7

Accepted

time: 3ms

memory: 15940kb

input:

1 499999
499999
10
0 499999 500000
0 499999 499999
0 499999 499998
0 499999 499997
0 499999 499996
0 499999 5
0 499999 4
0 499999 3
0 499999 2
0 499999 1

output:

Yes
No
No
No
No
No
No
No
No
No

result:

ok 10 token(s): yes count is 1, no count is 9

Test #17:

score: 7

Accepted

time: 0ms

memory: 17960kb

input:

1 249999
0
10
0 249999 500000
0 249999 499999
0 249999 499998
0 249999 499997
0 249999 499996
0 249999 5
0 249999 4
0 249999 3
0 249999 2
0 249999 1

output:

Yes
Yes
No
No
No
No
No
No
No
No

result:

ok 10 token(s): yes count is 2, no count is 8

Test #18:

score: 7

Accepted

time: 2ms

memory: 17968kb

input:

output:

No
No
No
No
No
No
No
Yes
Yes
Yes

result:

ok 10 token(s): yes count is 3, no count is 7

Test #19:

score: 7

Accepted

time: 0ms

memory: 17940kb

input:

7 114381
99629 67979 86546 56087 63139 108255 68436
10
93017 26947 457994
68416 90149 398467
35162 8224 500000
93764 99122 353377
43358 112463 306282
26831 9795 500000
42369 15002 500000
6450 16746 500000
7483 81534 451399
104077 82098 359317

output:

No
No
No
No
Yes
No
No
No
Yes
Yes

result:

ok 10 token(s): yes count is 3, no count is 7

Test #20:

score: 7

Accepted

time: 0ms

memory: 17936kb

input:

7 156904
86214 84720 39018 38747 41086 17361 72963
10
20487 60246 473628
64601 77908 402948
131834 36311 458711
44757 12551 407379
137740 152086 500000
13822 41710 384936
54564 100719 445492
114985 55047 500000
93241 143516 500000
70481 91989 391569

output:

No
No
No
Yes
No
Yes
Yes
No
No
Yes

result:

ok 10 token(s): yes count is 4, no count is 6

Test #21:

score: 7

Accepted

time: 0ms

memory: 17904kb

input:

7 500000
250139 246072 286282 248011 246676 255434 285229
10
256986 250000 185280
249410 250000 192856
272916 250000 169350
248178 250000 194088
251192 250000 191073
282235 250000 160030
275248 250000 167017
286012 250000 156253
258808 250000 183458
281242 250000 161023

output:

Yes
Yes
Yes
Yes
No
No
No
No
Yes
No

result:

ok 10 token(s): yes count is 5, no count is 5

Test #22:

score: 7

Accepted

time: 3ms

memory: 17960kb

input:

7 500000
251721 246007 273667 246631 272904 242371 259470
10
259134 250000 187249
258860 250000 187524
266929 250000 179454
273220 250000 173163
264425 250000 181958
244659 250000 201725
262924 250000 183459
270049 250000 176334
252586 250000 193798
260138 250000 186246

output:

No
Yes
No
No
No
Yes
No
No
Yes
Yes

result:

ok 10 token(s): yes count is 4, no count is 6

Test #23:

score: 7

Accepted

time: 2ms

memory: 17964kb

input:

output:

No
Yes
No
Yes
Yes
No
No
Yes
Yes
No

result:

ok 10 token(s): yes count is 5, no count is 5

Test #24:

score: 7

Accepted

time: 0ms

memory: 17956kb

input:

7 11559
11559 3854 5780 5459 0 5450 5395
10
1 5449 56325
1 5451 56325
1 5450 56317
1 5451 56324
1 5450 56316
1 5449 56324
1 5452 56318
1 5453 56310
1 5452 56319
1 5453 56311

output:

Yes
Yes
Yes
No
No
No
No
No
Yes
Yes

result:

ok 10 token(s): yes count is 5, no count is 5

Test #25:

score: 7

Accepted

time: 4ms

memory: 20128kb

input:

7 500000
406504 89878 390399 370409 54693 476604 453724
10
126698 445272 440210
351011 218369 87645
428029 290511 178440
420476 425145 401909
135002 472110 132021
464516 234410 2940
377365 27345 249120
117317 225894 16595
405890 313165 275519
182674 23770 82121

output:

No
No
No
No
No
No
No
No
No
No

result:

ok 10 token(s): yes count is 0, no count is 10

Subtask #3:

score: 10

Accepted

Dependency #1:

100%

Accepted

Dependency #2:

100%

Accepted

Test #26:

score: 10

Accepted

time: 0ms

memory: 18012kb

input:

14 49234
4353 33883 17839 23172 2565 2001 8926 10827 27712 24128 13160 16114 19986 27152
10
36174 40125 402243
28576 6147 297365
9792 2662 268578
14678 26965 306810
21548 41236 404281
23206 33793 296994
332 32354 299043
43712 26967 297405
41578 26759 298391
6834 38663 350972

output:

Yes
Yes
Yes
No
No
No
No
Yes
Yes
No

result:

ok 10 token(s): yes count is 5, no count is 5

Test #27:

score: 10

Accepted

time: 2ms

memory: 17960kb

input:

14 49234
35357 48876 29294 47912 36888 34478 44998 30220 8017 9998 3011 33083 23921 24890
10
20474 4736 468945
47725 13547 500000
4873 39322 454688
9333 39593 455083
4988 6332 500000
40610 27777 475727
6083 10941 500000
578 39990 445239
27011 21260 462001
42787 7013 480786

output:

Yes
No
Yes
Yes
No
No
No
Yes
No
No

result:

ok 10 token(s): yes count is 4, no count is 6

Test #28:

score: 10

Accepted

time: 0ms

memory: 17980kb

input:

14 500000
254591 246898 268510 259754 242758 245928 253337 249866 234405 242095 269427 235264 252766 241719
10
253094 250000 373556
266269 250000 360381
247752 250000 378897
239143 250000 387507
243837 250000 382812
266284 250000 360365
256010 250000 370639
246874 250000 379776
249027 250000 377623
...

output:

Yes
Yes
No
Yes
No
No
No
Yes
Yes
Yes

result:

ok 10 token(s): yes count is 6, no count is 4

Test #29:

score: 10

Accepted

time: 0ms

memory: 20032kb

input:

14 500000
235818 249056 242255 249428 252698 248009 248826 242766 261563 247430 241881 216634 250418 245970
10
218417 250000 294040
236009 250000 311632
244058 250000 319682
244444 250000 320067
229429 250000 305052
257307 250000 316050
224198 250000 299821
258537 250000 314821
221287 250000 296910
...

output:

No
No
Yes
No
No
No
No
Yes
No
Yes

result:

ok 10 token(s): yes count is 3, no count is 7

Test #30:

score: 10

Accepted

time: 3ms

memory: 17900kb

input:

8 102279
48228 34094 0 48218 48299 51140 47731 102279
10
1 48227 498414
1 48227 498415
1 48228 498406
1 48225 498399
1 48229 498415
1 48226 498407
1 48225 498398
1 48226 498408
1 48229 498414
1 48228 498405

output:

No
Yes
Yes
Yes
Yes
No
No
Yes
No
No

result:

ok 10 token(s): yes count is 5, no count is 5

Test #31:

score: 10

Accepted

time: 0ms

memory: 22132kb

input:

14 500000
103088 143766 204273 435727 174096 366266 158520 28965 446289 495003 373615 229459 323969 117713
10
321968 416395 78738
118842 181846 106626
240655 41869 325999
147511 19476 215749
490202 92477 306569
302617 8225 350578
101210 494049 12408
102039 352144 222467
126714 428479 351252
66348 40...

output:

No
No
No
No
No
No
No
No
No
No

result:

ok 10 token(s): yes count is 0, no count is 10

Test #32:

score: 10

Accepted

time: 2ms

memory: 17924kb

input:

14 30000
5 29994 29997 6 4 2 29998 3 29999 0 30000 29996 1 29995
10
15000 15000 479972
15003 15000 479969
14997 15000 479969
14996 15000 479968
15005 15000 479967
15002 15000 479970
14999 15000 479971
14998 15000 479970
15004 15000 479968
15001 15000 479971

output:

Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes

result:

ok 10 token(s): yes count is 10, no count is 0

Subtask #4:

score: 28

Accepted

Dependency #1:

100%

Accepted

Dependency #2:

100%

Accepted

Dependency #3:

100%

Accepted

Test #33:

score: 28

Accepted

time: 3ms

memory: 22084kb

input:

97 6647
2603 1696 5660 220 3836 1237 2529 3084 4206 5217 4505 1659 4358 6016 828 4601 757 5423 527 2355 393 4183 2597 6354 4489 5869 3178 4953 2141 1666 6031 4245 6022 6433 50 2911 1008 229 5334 402 6403 488 625 1136 3908 5583 1398 6374 3998 1000 1055 5437 588 2618 1012 5147 5185 5126 5995 4373 6238...

output:

No
Yes
No
No
Yes
No
Yes
Yes
Yes
No

result:

ok 10 token(s): yes count is 5, no count is 5

Test #34:

score: 28

Accepted

time: 3ms

memory: 19984kb

input:

100 6647
5679 833 5059 1113 2905 3249 5084 492 3460 6011 6281 3992 525 1654 641 3861 2370 6478 6168 1473 4402 2041 6009 295 5678 2301 1403 2407 12 1426 1724 3789 4785 114 754 2145 1163 5986 4595 2217 6260 85 1334 2607 998 1422 1712 4458 87 4823 275 4501 2669 4663 2807 4819 2565 2523 931 2086 2151 56...

output:

No
Yes
No
No
Yes
No
Yes
No
Yes
Yes

result:

ok 10 token(s): yes count is 5, no count is 5

Test #35:

score: 28

Accepted

time: 7ms

memory: 19968kb

input:

98 500000
249593 249971 249810 249768 249739 249550 250017 249558 247629 249928 248598 249915 249818 249898 249341 250273 242654 249949 250143 249854 250210 249903 257398 250079 246802 249292 249783 249156 250009 256058 248869 255127 250761 249941 249658 250275 248464 249221 249600 249914 249059 249...

output:

Yes
Yes
No
No
Yes
Yes
No
Yes
No
No

result:

ok 10 token(s): yes count is 5, no count is 5

Test #36:

score: 28

Accepted

time: 7ms

memory: 20008kb

input:

99 500000
250265 250465 248524 241711 249889 249962 249687 250064 256378 239774 242154 250015 250470 249900 249880 243388 249083 249184 249991 252923 249991 250065 250349 250406 253052 249142 249201 249847 249208 250134 249051 249327 249964 249729 250372 250000 243498 249946 249081 249821 245900 249...

output:

No
Yes
Yes
No
Yes
Yes
Yes
Yes
Yes
Yes

result:

ok 10 token(s): yes count is 8, no count is 2

Test #37:

score: 28

Accepted

time: 6ms

memory: 22080kb

input:

100 100000
99988 98583 97519 99255 98930 95578 99551 97209 99273 99887 95793 78552 95515 99726 98163 97262 99497 99737 83718 99077 93612 99576 98813 69987 99851 99700 98931 98867 98823 99661 99935 98297 96589 99655 68783 98946 99653 99936 96739 98662 97960 97890 81460 99978 99678 98061 95334 99951 9...

output:

No
No
Yes
No
No
Yes
No
Yes
No
No

result:

ok 10 token(s): yes count is 3, no count is 7

Test #38:

score: 28

Accepted

time: 8ms

memory: 24112kb

input:

100 500000
226748 315353 147247 489284 59180 135687 471934 360869 456251 280874 327516 138729 166382 180807 87410 497399 205532 436198 471204 282107 378262 388850 372073 88485 381405 449452 173300 40157 294418 197754 386016 301740 320197 13947 287366 71738 200507 247745 188893 261255 453551 325969 2...

output:

No
No
No
No
No
No
No
No
No
No

result:

ok 10 token(s): yes count is 0, no count is 10

Test #39:

score: 28

Accepted

time: 6ms

memory: 19968kb

input:

100 4000
49 29 3960 3983 3965 3957 42 3956 3973 3968 3991 3994 3981 35 3975 3955 13 19 1 3952 3986 3982 41 3990 14 44 4000 6 3979 3999 3985 3989 3953 3988 40 34 3 46 17 3962 3964 3969 3992 3974 3993 3954 39 3997 16 8 37 3961 3963 3998 33 18 3995 45 3959 48 10 2 20 32 21 22 3977 11 3978 9 24 38 26 47...

output:

Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes

result:

ok 10 token(s): yes count is 10, no count is 0

Subtask #5:

score: 0

Time Limit Exceeded

Dependency #1:

100%

Accepted

Dependency #2:

100%

Accepted

Dependency #3:

100%

Accepted

Dependency #4:

100%

Accepted

Test #40:

score: 10

Accepted

time: 109ms

memory: 28172kb

input:

1997 308
70 61 57 307 81 83 26 224 107 133 59 146 277 283 272 287 177 168 57 81 54 160 190 277 218 272 144 29 70 296 80 189 53 290 192 71 285 44 80 176 119 283 110 187 49 208 136 5 19 212 203 67 287 239 35 266 283 134 50 147 221 281 78 93 94 104 308 191 233 12 29 61 90 28 253 150 175 284 242 151 218...

output:

No
No
Yes
No
No
Yes
No
Yes
No
Yes

result:

ok 10 token(s): yes count is 4, no count is 6

Test #41:

score: 10

Accepted

time: 108ms

memory: 26252kb

input:

2000 308
69 44 96 134 287 229 252 80 121 166 192 65 227 58 263 278 238 118 64 195 132 17 191 30 200 216 44 188 182 304 159 200 123 35 195 228 132 6 240 154 3 82 180 261 276 243 28 114 178 97 120 12 299 297 152 293 28 300 297 148 125 302 50 120 285 180 155 234 32 230 41 122 58 196 234 296 2 211 83 65...

output:

Yes
No
No
Yes
No
Yes
Yes
No
Yes
Yes

result:

ok 10 token(s): yes count is 6, no count is 4

Test #42:

score: 10

Accepted

time: 86ms

memory: 26248kb

input:

1998 500000
249995 250029 249993 249994 250002 249999 250002 249961 249996 249994 249995 249999 250019 249991 250008 250003 250005 249985 249971 249938 249962 249990 249998 249998 249990 249978 249930 249999 249846 250028 249987 250018 250012 249997 250005 249989 249996 249977 249984 249994 250008 2...

output:

No
Yes
No
Yes
Yes
Yes
No
Yes
Yes
Yes

result:

ok 10 token(s): yes count is 7, no count is 3

Test #43:

score: 10

Accepted

time: 127ms

memory: 28228kb

input:

1999 500000
249999 249996 250094 249968 249984 249986 249983 250017 249971 250085 250004 250000 250002 250016 249975 249969 249997 249985 250006 249988 249958 249998 249901 249845 249929 250000 249999 250062 242705 250000 250001 250015 249979 250000 249997 250002 250020 251735 249985 249991 250004 2...

output:

No
No
Yes
Yes
No
Yes
Yes
Yes
No
No

result:

ok 10 token(s): yes count is 5, no count is 5

Test #44:

score: 10

Accepted

time: 189ms

memory: 28224kb

input:

2000 100000
99941 99997 99997 99997 99933 99999 99973 99963 99976 99999 99920 99798 99997 99563 99998 99966 99993 99970 99859 99979 99868 99995 99857 99992 99945 99997 99954 99941 99412 99912 99940 99987 99879 99515 99923 99928 99969 99993 99932 99955 99986 99896 99994 99904 99997 99968 99945 99984 ...

output:

Yes
No
Yes
No
Yes
No
Yes
Yes
Yes
No

result:

ok 10 token(s): yes count is 6, no count is 4

Test #45:

score: 10

Accepted

time: 0ms

memory: 10364kb

input:

2000 500000
98183 491659 428308 43612 213911 374412 19875 308579 157109 313454 260849 345903 217623 72284 52571 95320 222125 308112 36456 431427 317939 195083 326380 243609 79455 231286 269778 260016 203554 246351 405192 24502 63996 288901 18264 399299 238004 107940 317868 357710 210106 52980 116956...

output:

No
No
No
No
No
No
No
No
No
No

result:

ok 10 token(s): yes count is 0, no count is 10

Test #46:

score: 0

Time Limit Exceeded

input:

998 997
507 640 129 788 71 415 979 769 434 974 727 214 276 263 332 83 352 19 719 577 607 108 902 435 368 645 990 334 654 792 95 45 744 622 291 92 728 757 424 708 4 182 330 495 827 762 519 651 1 438 910 378 852 790 431 618 776 781 689 249 745 969 541 267 179 554 35 242 859 430 97 857 832 377 462 707 ...

output:

result:

Subtask #6:

score: 0

Skipped

Dependency #1:

100%

Accepted

Dependency #2:

100%

Accepted

Dependency #3:

100%

Accepted

Dependency #4:

100%

Accepted

Dependency #5:

Subtask #7:

score: 0

Skipped

Dependency #1:

100%

Accepted

Dependency #2:

100%

Accepted

Dependency #3:

100%

Accepted

Dependency #4:

100%

Accepted