QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#352089 | #8226. 堆操作练习题2 | JCY_ | 100 ✓ | 832ms | 217380kb | C++14 | 4.3kb | 2024-03-12 20:40:36 | 2024-03-12 20:40:37 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using i128 = __int128;
using u128 = unsigned __int128;
template <typename T>
void chkmax(T &x, const T &y) {
if (x < y) x = y;
}
template <typename T>
void chkmin(T &x, const T &y) {
if (y < x) x = y;
}
template <typename T, typename cmp = less<T>>
struct deletable_heap {
priority_queue<T, vector<T>, cmp> pq1, pq2;
void push(const T &x) { pq1.emplace(x); }
void erase(const T &x) {
pq2.emplace(x);
while (!pq2.empty() && pq1.top() == pq2.top()) {
pq1.pop();
pq2.pop();
}
}
T top() const { return pq1.top(); }
bool empty() const { return pq1.empty(); }
};
template <typename T>
struct fenwick_tree {
T sum;
vector<T> bit, val;
void resize(int siz) {
bit.resize(siz);
val.resize(siz);
}
void update(int p, T x) {
val[p] += x;
sum += x;
for (++p; p <= (int)bit.size(); p += p & -p) bit[p - 1] += x;
}
T query(int p) const {
T ret = 0;
for (++p; p >= 1; p -= p & -p) ret += bit[p - 1];
return ret;
}
};
constexpr int MAXH = 18, MOD = 1e9 + 7;
int add(int x, int y) {
x += y;
return x >= MOD ? x - MOD : x;
}
int h, a[1 << MAXH], rk1[1 << MAXH][MAXH + 1], rk2[1 << MAXH][MAXH + 1];
int pw2[1 << MAXH];
pair<int, int> ord[1 << MAXH];
vector<int> ord1[1 << MAXH], ord2[1 << MAXH];
deletable_heap<int> pq[1 << MAXH];
fenwick_tree<int> tr[1 << MAXH];
void dfs(int u, int d) {
if (d == h - 1) {
ord1[u] = ord2[u] = {u};
} else {
int ls = u << 1, rs = u << 1 | 1, pl = 0, pr = 0;
dfs(ls, d + 1);
dfs(rs, d + 1);
ord1[u].reserve(ord1[ls].size() + ord1[rs].size() + 1);
ord2[u].reserve(ord1[ls].size() + ord1[rs].size() + 1);
ord2[u].emplace_back(u);
while (pl < (int)ord1[ls].size() || pr < (int)ord1[rs].size()) {
if (pl < (int)ord1[ls].size() && (pr == (int)ord1[rs].size() ||
a[ord1[ls][pl]] < a[ord1[rs][pr]])) {
ord1[u].emplace_back(ord1[ls][pl]);
ord2[u].emplace_back(ord2[ls][pl++]);
} else {
ord1[u].emplace_back(ord1[rs][pr]);
ord2[u].emplace_back(ord2[rs][pr++]);
}
}
ord1[u].emplace_back(u);
for (int i = 0; i < (int)ord1[u].size(); ++i) {
rk1[ord1[u][i]][d] = i;
rk2[ord2[u][i]][d] = i;
}
}
tr[u].resize(ord1[u].size());
// cout << u << ":\n";
// for (auto i : ord1[u]) cout << i << " ";
// cout << "\n";
// for (auto i : ord2[u]) cout << i << " ";
// cout << "\n";
}
bool in_tree(int u, int v) {
int cu = __builtin_clz(u), cv = __builtin_clz(v);
return cu <= cv && u >> (cv - cu) == v;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> h;
for (int i = 1; i < 1 << h; ++i) {
cin >> a[i];
ord[i] = {a[i], i};
}
sort(ord + 1, ord + (1 << h));
dfs(1, 0);
pw2[0] = 1;
for (int i = 1; i < 1 << h; ++i) pw2[i] = add(pw2[i - 1], pw2[i - 1]);
int q;
cin >> q;
int s2 = 0;
while (q--) {
int typ, x, y;
cin >> typ >> x >> y;
if (typ == 1) {
if (y == 1) {
for (int i = x, d = __lg(x); i; i >>= 1, --d)
pq[i].push(a[ord1[i][rk2[x][d]]]);
} else {
++s2;
for (int i = x, d = __lg(x); i; i >>= 1, --d)
tr[i].update(rk2[x][d], 1);
}
} else if (typ == 2) {
if (y == 1) {
for (int i = x, d = __lg(x); i; i >>= 1, --d)
pq[i].erase(a[ord1[i][rk2[x][d]]]);
} else {
--s2;
for (int i = x, d = __lg(x); i; i >>= 1, --d)
tr[i].update(rk2[x][d], -1);
}
} else {
auto it = lower_bound(ord + 1, ord + (1 << h), make_pair(y, 0));
if (it == ord + (1 << h) || it->first != y || !in_tree(it->second, x) ||
(!pq[x].empty() && pq[x].top() > y)) {
cout << "0\n";
continue;
}
int u = it->second, d = __lg(x);
if (!pq[x].empty() && pq[x].top() == y) {
cout << pw2[s2 - tr[x].sum + tr[x].query(rk1[u][d])] << "\n";
} else {
cout << (tr[x].val[rk1[u][d]] ? pw2[s2 - tr[x].sum + tr[x].query(rk1[u][d]) - 1] : 0) << "\n";
}
}
}
return 0;
}
/*
g++ C.cpp -o C -std=c++14 -O2 -Wall -Wextra -Wshadow -g -fsanitize=address,undefined
*/
/*
3
10 7 9 3 4 1 2
3
1 2 2
1 1 2
3 1 3
*/
这程序好像有点Bug,我给组数据试试?
詳細信息
Subtask #1:
score: 10
Accepted
Test #1:
score: 10
Accepted
time: 8ms
memory: 46716kb
input:
2 3 2 1 50 3 3 1 1 1 2 1 2 1 2 2 1 1 2 2 2 1 2 1 1 1 1 3 2 2 1 1 2 2 2 3 1 2 3 1 3 2 3 2 1 3 2 1 2 2 2 2 2 1 2 1 1 1 2 3 1 1 2 1 2 1 1 1 2 1 1 3 1 2 3 1 3 2 3 2 1 3 2 2 2 1 1 2 1 1 1 1 3 1 2 2 1 1 1 1 1 3 3 1 2 1 1 2 3 2 1 3 1 2 3 1 1 1 2 3 1 3 2 1 2 3 3 1 3 1 3 3 1 1 3 1 1 1 3 2 1 1 1 2 1 1 3 1 1 2...
output:
0 1 0 0 0 2 0 1 2 0 1 0 0 0 0
result:
ok 15 numbers
Test #2:
score: 0
Accepted
time: 6ms
memory: 46612kb
input:
2 3 1 2 50 1 2 2 3 3 2 2 2 2 1 3 1 1 1 1 3 3 2 2 1 1 3 1 3 2 3 1 1 3 1 1 1 1 1 2 2 2 1 1 3 1 3 2 3 1 2 2 2 1 1 2 1 2 1 1 3 1 2 1 2 3 3 2 1 1 1 2 3 1 1 3 2 2 3 2 1 3 1 2 2 1 3 3 2 3 1 1 2 3 1 2 1 1 1 3 1 2 3 1 3 1 3 3 1 3 3 1 3 1 1 1 2 1 1 3 1 2 1 2 1 3 1 1 3 3 2 3 1 3 2 2 1 1 1 1 2 1 1 1 2 1 1 1 2 2...
output:
0 1 1 2 1 1 0 0 0 0 0 0 0 0 0
result:
ok 15 numbers
Subtask #2:
score: 10
Accepted
Dependency #1:
100%
Accepted
Test #3:
score: 10
Accepted
time: 4ms
memory: 46624kb
input:
4 15 14 13 9 10 11 12 2 7 4 5 1 6 8 3 500 3 1 15 3 1 13 1 9 1 1 6 2 1 15 2 1 14 1 1 10 2 1 5 2 3 12 1 1 1 1 1 4 1 3 6 6 3 10 4 1 3 1 3 13 6 1 11 2 2 4 1 2 14 1 3 6 6 3 1 11 3 1 14 3 2 4 2 6 2 2 15 2 3 1 9 3 7 12 1 13 2 2 9 1 2 5 2 3 14 8 1 15 2 1 12 1 3 11 5 1 5 2 3 1 15 3 5 10 3 1 11 1 14 1 2 13 2 ...
output:
0 0 0 0 8 0 0 8 0 0 0 0 0 8 16 16 0 0 0 32 0 0 32 16 0 0 16 0 0 0 0 4 0 0 0 0 8 0 0 0 0 0 64 64 0 128 0 0 0 128 64 256 0 64 64 0 0 0 8 4 2 0 2 0 0 0 0 8 4 16 0 0 2 0 2 8 0 0 16 0 8 0 0 16 32 0 32 0 4 4 0 4 0 0 0 0 4 0 0 0 2 0 0 0 0 0 4 2 0 0 0 16 8 0 0 0 0 8 2 4 0 4 4 4 16 0 8 8 16 16 0 0 8 0 0 0 0 ...
result:
ok 171 numbers
Test #4:
score: 0
Accepted
time: 7ms
memory: 46716kb
input:
4 15 13 14 7 12 8 11 3 4 9 2 5 6 1 10 500 1 2 1 1 14 2 1 4 1 3 1 12 1 15 2 3 1 15 1 9 2 2 4 1 1 13 1 3 7 1 2 13 1 2 15 2 1 7 2 1 13 1 3 15 10 2 2 1 3 2 2 1 2 2 2 2 2 1 15 2 1 11 1 2 9 2 3 3 11 1 1 1 1 12 2 3 10 9 3 4 3 3 7 1 2 7 2 1 4 1 1 5 1 2 15 2 2 12 2 1 10 2 3 2 7 3 2 13 1 3 1 3 1 15 2 1 1 3 14...
output:
1 2 0 0 0 2 0 0 2 0 2 0 2 0 8 4 0 0 8 4 0 4 4 4 1 0 0 4 0 0 8 0 0 0 32 128 0 0 0 16 0 16 0 0 0 0 8 0 0 0 0 0 16 0 32 0 0 0 8 4 0 0 4 0 0 0 0 0 8 8 0 8 0 0 0 8 0 0 16 0 0 0 0 0 0 2 0 2 0 0 2 0 0 2 1 0 0 0 0 8 16 16 0 0 0 0 0 0 0 0 0 0 0 16 0 0 16 32 0 0 16 0 32 0 0 64 0 4 0 8 0 0 0 4 1 0 0 16 4 0 0 0...
result:
ok 148 numbers
Subtask #3:
score: 20
Accepted
Test #5:
score: 20
Accepted
time: 3ms
memory: 47016kb
input:
9 511 509 510 504 507 505 508 501 503 506 502 494 500 499 493 473 483 495 475 491 497 461 487 490 489 498 496 478 485 480 488 378 469 482 477 462 448 422 470 424 467 421 492 439 454 484 451 376 385 458 464 463 486 411 472 449 474 459 468 479 413 457 455 371 315 432 437 466 453 476 418 433 363 434 38...
output:
0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 1 1 1 0 0 0 0 1 0 0 1 1 1 1 0 1 1 1 1 0 1 1 0 0 0 0 1 0 0 1 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 1 1 0 1 0 0 1 0 0 0 0 1 1 0 0 1 1 1 1 1 0 0 1 1 1 1 1 0 1 0 0 1 1 0 1 0 0 1 0 0 0 0 1 0 1 1 0 1 0 0 1 0 0 1 1 1 0 0 1 1 1 0 0 0 0 1 1 0 1 1 1 1 0 1 0 0 0 1 0 1 1 1 0 0 1 0 0 0 1 1 ...
result:
ok 1644 numbers
Test #6:
score: 0
Accepted
time: 7ms
memory: 47028kb
input:
9 511 510 506 509 508 505 504 500 507 501 503 497 498 502 484 454 495 485 494 488 496 493 474 491 460 487 490 486 499 468 467 408 448 451 469 479 478 412 492 482 476 440 466 489 411 462 470 384 407 438 452 430 464 439 481 456 483 449 422 420 446 441 370 372 376 404 443 369 417 405 416 465 444 275 45...
output:
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 1 0 0 1 1 0 1 0 1 0 1 0 1 0 1 1 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 1 1 0 0 1 0 1 0 0 1 1 1 1 0 1 0 1 0 0 1 0 1 0 1 1 1 1 0 1 1 0 1 1 0 1 0 0 1 1 1 0 1 1 1 1 1 1 0 0 1 1 1 0 1 0 0 0 1 1 1 1 0 0 1 1 1 0 1 1 1 1 1 0 0 1 1 1 1 1 1 0 1 1 1 1 0 0 1 1 1 1 1 0 0 0 0 1 ...
result:
ok 1657 numbers
Test #7:
score: 0
Accepted
time: 7ms
memory: 47076kb
input:
9 511 508 510 502 505 506 509 497 489 501 504 496 500 507 499 494 486 466 482 472 442 503 453 492 469 481 477 488 491 483 484 493 416 480 485 420 465 436 471 353 447 437 384 490 498 399 381 487 468 461 457 478 479 474 473 248 430 412 448 429 421 449 475 423 476 338 410 435 444 438 462 379 415 372 39...
output:
0 0 0 1 0 0 1 0 1 0 0 0 0 0 1 0 0 0 0 0 1 0 1 1 0 0 1 1 1 0 0 0 0 0 1 1 0 1 0 1 1 1 0 0 1 0 0 1 0 0 1 1 1 1 0 1 1 0 0 1 0 0 0 1 0 1 1 1 0 0 1 1 0 0 0 0 1 0 0 0 0 1 0 1 1 0 1 1 0 1 0 0 0 1 0 1 1 1 0 1 0 0 1 1 0 1 1 0 1 1 0 0 1 1 1 1 1 0 0 0 1 0 1 1 0 1 0 1 1 1 1 1 0 1 1 1 1 1 0 0 0 0 1 1 1 1 1 0 0 0 ...
result:
ok 1644 numbers
Test #8:
score: 0
Accepted
time: 3ms
memory: 46976kb
input:
9 511 509 510 505 506 508 490 499 484 497 501 507 504 477 481 494 469 479 468 458 486 496 487 503 495 498 449 461 467 476 480 448 470 424 459 413 478 441 466 429 446 485 438 489 463 473 483 502 500 491 492 474 493 443 430 385 433 453 447 460 472 379 408 363 415 367 445 401 405 426 259 383 351 322 45...
output:
0 0 0 0 0 0 0 0 0 1 1 0 1 0 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 1 0 1 0 0 0 1 0 1 1 1 1 0 0 1 0 0 1 0 0 0 0 1 0 0 0 1 1 0 0 0 1 0 0 1 0 0 1 1 0 0 0 1 0 1 0 1 0 0 0 0 1 1 1 0 0 0 0 1 0 1 0 1 1 0 1 1 1 0 1 0 0 0 1 1 1 1 0 1 1 1 0 1 0 0 0 1 1 1 1 1 1 1 1 0 1 1 ...
result:
ok 1620 numbers
Subtask #4:
score: 20
Accepted
Dependency #1:
100%
Accepted
Dependency #2:
100%
Accepted
Dependency #3:
100%
Accepted
Test #9:
score: 20
Accepted
time: 3ms
memory: 46960kb
input:
9 511 509 510 504 507 508 503 488 502 493 501 505 506 481 483 468 476 495 498 490 487 491 496 447 500 482 499 474 462 453 464 465 461 457 428 448 427 492 472 471 454 484 478 459 489 485 494 393 440 470 497 463 475 477 480 445 473 452 399 436 419 443 396 407 348 409 423 451 397 420 357 435 366 389 33...
output:
0 0 0 128 128 0 512 256 2048 8192 0 0 32768 0 0 524288 524288 0 0 0 0 4194304 0 4194304 0 8388608 0 0 67108864 0 0 0 536870912 0 0 0 0 0 147483634 0 0 589934536 0 589934536 179869065 179869065 0 0 438952513 0 438952513 877905026 0 0 0 511620083 511620083 46480318 23240159 92960636 92960636 0 0 0 371...
result:
ok 1703 numbers
Test #10:
score: 0
Accepted
time: 8ms
memory: 46916kb
input:
9 511 509 510 505 508 506 507 492 503 496 501 498 504 493 502 484 491 480 482 494 489 476 495 469 490 500 483 467 473 464 497 481 423 478 485 326 440 444 436 391 487 474 406 466 472 486 471 373 454 475 477 451 499 479 432 458 460 393 470 433 463 400 462 414 468 410 384 358 363 402 456 271 325 275 42...
output:
0 0 0 0 0 0 256 0 0 0 0 0 131072 16384 0 0 0 524288 524288 0 0 0 16777216 16777216 16777216 0 0 0 147483634 0 0 294967268 294967268 0 438952513 0 0 0 0 0 0 0 0 0 0 511620083 0 0 0 0 92960636 0 0 92960636 0 974740338 974740338 949480669 0 898961331 949480669 0 0 0 383381198 533524785 533524785 0 5363...
result:
ok 1648 numbers
Test #11:
score: 0
Accepted
time: 8ms
memory: 46976kb
input:
9 511 508 510 504 507 501 509 497 503 499 506 487 495 494 505 474 464 493 452 467 498 500 489 460 482 468 490 491 488 496 502 463 465 360 440 459 492 450 445 453 466 483 476 485 448 443 477 402 436 469 480 417 438 426 456 415 442 429 486 470 481 437 449 458 405 409 455 310 357 368 397 420 457 421 47...
output:
0 0 4 0 0 32 0 0 0 1024 0 0 65536 524288 2097152 0 0 0 0 0 0 0 0 0 16777216 0 0 73741817 73741817 536870912 134217728 0 0 0 0 0 0 147483634 294967268 359738130 359738130 0 0 755810045 0 185921272 185921272 0 371842544 0 0 0 743685088 371842544 974740338 0 0 0 743685088 743685088 0 487370169 97474033...
result:
ok 1641 numbers
Test #12:
score: 0
Accepted
time: 10ms
memory: 46928kb
input:
9 511 508 510 499 502 506 509 494 497 495 489 501 504 498 507 490 480 492 496 488 481 485 482 443 484 500 503 475 487 486 505 419 464 453 471 447 472 466 493 436 477 462 431 438 476 456 470 374 433 412 463 430 425 435 483 410 452 417 468 444 451 478 491 403 418 432 460 309 442 465 389 407 421 382 39...
output:
0 0 0 4 0 0 0 0 0 0 1024 2048 0 0 0 0 4096 0 0 0 0 0 0 0 2097152 2097152 0 0 0 0 0 0 147483634 589934536 589934536 0 0 438952513 511620083 371842544 0 0 0 743685088 371842544 0 0 743685088 487370169 743685088 0 0 0 0 487370169 743685088 974740338 0 0 0 0 974740338 0 0 898961331 797922655 0 797922655...
result:
ok 1656 numbers
Subtask #5:
score: 20
Accepted
Dependency #3:
100%
Accepted
Test #13:
score: 20
Accepted
time: 821ms
memory: 217184kb
input:
18 262143 262142 262141 262135 262134 262140 262137 262119 262122 262133 262117 262136 262139 262129 262130 262114 262088 262099 262080 262126 262131 262091 262101 262128 262132 262138 262115 262103 262121 262069 262094 262111 262078 261968 262042 262032 262097 262059 262074 262086 262113 262124 262...
output:
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 ...
result:
ok 166527 numbers
Test #14:
score: 0
Accepted
time: 832ms
memory: 217380kb
input:
18 262143 262141 262142 262139 262135 262140 262136 262138 262126 262129 262130 262132 262134 262122 262118 262137 262082 262090 262083 262103 262112 262121 262123 262131 262128 262133 262127 262105 262111 262085 262106 262124 262125 262066 262080 262055 262048 262069 261865 262096 262102 262068 262...
output:
0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...
result:
ok 166874 numbers
Test #15:
score: 0
Accepted
time: 793ms
memory: 217260kb
input:
18 262143 262141 262142 262135 262139 262134 262140 262123 262120 262130 262125 262128 262127 262138 262136 262108 262102 262077 262112 262099 262122 262117 262124 262113 262116 262126 262110 262137 262104 262131 262121 262039 262092 262035 262078 262004 262073 262109 262106 262087 262046 262076 262...
output:
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...
result:
ok 166762 numbers
Test #16:
score: 0
Accepted
time: 808ms
memory: 217204kb
input:
18 262143 262141 262142 262133 262140 262138 262137 262130 262125 262135 262139 262117 262136 262120 262124 262083 262128 262086 262118 262129 262131 262116 262121 262097 262115 262127 262134 262103 262107 262122 262119 262077 262044 262114 262042 262081 262053 262079 262109 262101 262108 262070 262...
output:
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 ...
result:
ok 166661 numbers
Subtask #6:
score: 20
Accepted
Dependency #1:
100%
Accepted
Dependency #2:
100%
Accepted
Dependency #3:
100%
Accepted
Dependency #4:
100%
Accepted
Dependency #5:
100%
Accepted
Test #17:
score: 20
Accepted
time: 769ms
memory: 202832kb
input:
18 262143 262142 262140 262139 262141 262138 262134 262133 262136 262137 262132 262128 262127 262098 262129 262130 262131 262111 262135 262118 262120 262112 262124 262104 262126 262125 262122 262093 262094 262089 262091 262068 262113 262116 262071 262080 262107 262042 262081 262100 262114 262030 262...
output:
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 294967268 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 216755367 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...
result:
ok 166366 numbers
Test #18:
score: 0
Accepted
time: 776ms
memory: 202736kb
input:
18 262143 262141 262142 262134 262138 262128 262140 262131 262132 262135 262137 262116 262125 262121 262139 262120 262089 262101 262127 262122 262114 262124 262136 262094 262102 262118 262119 262112 262117 262130 262133 262065 262093 262073 262045 262096 262046 262108 262051 262083 262115 262025 262...
output:
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 383381198 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 892516375 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 96...
result:
ok 166525 numbers
Test #19:
score: 0
Accepted
time: 792ms
memory: 202792kb
input:
18 262143 262139 262142 262138 262135 262140 262141 262133 262126 262129 262118 262120 262137 262123 262136 262131 262130 262113 262125 262090 262115 262112 262109 262052 262106 262121 262124 262100 262103 262132 262134 262127 262093 262015 262099 262079 262098 262097 262122 262076 262089 262114 262...
output:
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 438952513 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 373798577 0 0 0 0 ...
result:
ok 166541 numbers
Test #20:
score: 0
Accepted
time: 785ms
memory: 202728kb
input:
18 262143 262137 262142 262136 262125 262141 262139 262135 262127 262122 262119 262140 262134 262124 262138 262114 262130 262095 262126 262091 262109 262062 262112 262115 262133 262123 262131 262121 262118 262027 262132 262107 262104 262097 262128 262086 262031 262084 262093 261998 262083 262039 262...
output:
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...
result:
ok 165999 numbers
Extra Test:
score: 0
Extra Test Passed