QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#524741 | #6335. Belt Conveyor | Qwerty1232# | 15 | 238ms | 17380kb | C++23 | 1.2kb | 2024-08-20 03:44:04 | 2024-08-20 03:44:04 |
Judging History
answer
#include <bits/stdc++.h>
#include "conveyor.h"
void Solve(int n, std::vector<int> A, std::vector<int> B) {
std::vector<int> ans(n - 1, -1);
while (true) {
int it = std::find(ans.begin(), ans.end(), -1) - ans.begin();
if (it == ans.size()) {
break;
}
int u = A[it];
std::vector<int> rev(n - 1);
std::vector<int> put(n);
put[u] = 1;
for (int i = 0; i < n - 1; i++) {
if (ans[i] != -1) {
if ((ans[i] ? B[i] : A[i]) == u) {
rev[i] = 1;
}
}
}
auto res = Query(rev, put);
int ind = std::find(res.begin(), res.end(), 1) - res.begin();
if (ind == u) {
for (int i = 0; i < n - 1; i++) {
if (ans[i] == -1 && (A[i] == u || B[i] == u)) {
ans[i] = A[i] == u;
}
}
} else {
for (int i = 0; i < n - 1; i++) {
if (ans[i] == -1 && (A[i] == u && B[i] == ind || A[i] == ind && B[i] == u)) {
ans[i] = A[i] == ind;
}
}
}
}
Answer(ans);
}
详细
Subtask #1:
score: 1
Accepted
Test #1:
score: 1
Accepted
time: 0ms
memory: 4076kb
input:
random1 2 0 1 1 0xC321A02965AC2640
output:
Accepted: 1
result:
ok correct
Test #2:
score: 1
Accepted
time: 0ms
memory: 3804kb
input:
random1 2 1 0 0 0x8A99AD9552B2C218
output:
Accepted: 1
result:
ok correct
Test #3:
score: 1
Accepted
time: 0ms
memory: 3872kb
input:
random1 2 1 0 1 0x024D21FA307D148D
output:
Accepted: 1
result:
ok correct
Test #4:
score: 1
Accepted
time: 0ms
memory: 3740kb
input:
random1 2 0 1 0 0x3C96AB23CEB63F75
output:
Accepted: 1
result:
ok correct
Subtask #2:
score: 14
Accepted
Dependency #1:
100%
Accepted
Test #5:
score: 14
Accepted
time: 0ms
memory: 3808kb
input:
priority 30 10 29 10 13 17 11 2 15 15 27 9 26 18 0 14 1 22 24 29 28 6 22 4 20 15 5 28 4 21 24 3 13 1 8 13 12 8 19 16 3 1 10 24 29 12 8 4 7 2 7 28 25 12 7 2 23 27 22 89058848 6377689 24189123 31671827 205117644 254374430 56016068 6819602 212866321 246625321 274047319 230485311 202854776 280075001 203...
output:
Accepted: 27
result:
ok correct
Test #6:
score: 14
Accepted
time: 0ms
memory: 3808kb
input:
random1 30 18 20 12 0 13 2 9 11 24 7 15 26 17 19 23 10 20 16 3 11 24 1 18 19 1 28 22 6 6 26 21 5 27 27 14 15 8 0 17 5 16 3 10 29 13 14 25 28 25 23 8 9 4 2 4 12 7 22 1 0 0 0 1 0 0 1 0 0 0 1 0 1 0 1 1 0 1 1 0 0 0 1 1 1 1 0 1 0x139BEEDAC0AE4AFB
output:
Accepted: 27
result:
ok correct
Test #7:
score: 14
Accepted
time: 0ms
memory: 4080kb
input:
priority 30 15 20 29 0 10 9 28 26 23 6 19 20 8 13 27 27 1 7 16 26 10 4 16 1 18 8 5 14 13 9 22 15 24 29 2 3 19 2 3 17 0 7 14 12 5 6 25 18 25 24 11 4 12 23 11 17 21 28 155983625 867841392 695948077 619352269 127722564 849426565 618649370 326405673 698896139 727112455 131828530 787535071 635627968 4725...
output:
Accepted: 26
result:
ok correct
Test #8:
score: 14
Accepted
time: 0ms
memory: 4036kb
input:
random1 30 11 11 11 11 23 20 11 11 11 26 11 21 11 11 11 27 11 11 11 16 13 17 5 11 11 1 11 14 11 24 28 10 3 11 11 22 25 8 11 29 11 12 15 9 11 19 0 2 11 11 11 11 18 4 11 7 11 6 0 1 1 0 0 1 1 1 0 1 1 0 0 0 1 1 0 1 0 0 1 0 0 0 0 1 1 1 1 0xD66348F4E914D783
output:
Accepted: 16
result:
ok correct
Test #9:
score: 14
Accepted
time: 0ms
memory: 3784kb
input:
priority 30 1 7 19 19 21 3 16 25 19 2 4 19 19 22 19 19 27 18 19 24 19 19 19 19 19 19 19 19 28 19 19 29 0 19 19 19 19 15 19 19 10 5 19 6 14 19 19 23 19 8 11 9 26 17 12 13 20 19 175687064 613757478 145110402 817656856 712251185 850089290 510909115 900701092 956086121 136191567 90104148 72809899 345506...
output:
Accepted: 18
result:
ok correct
Test #10:
score: 14
Accepted
time: 0ms
memory: 3812kb
input:
priority 30 22 22 22 16 13 1 13 22 15 6 21 22 2 23 27 22 4 13 3 13 26 5 13 22 9 8 11 25 13 0 14 13 13 29 13 7 18 22 22 13 28 22 13 22 12 22 20 22 24 13 13 10 17 13 22 22 13 19 205508605 212446816 92507839 281454564 232828716 252753556 236784221 262865505 235145960 298570090 277536286 225110287 21565...
output:
Accepted: 22
result:
ok correct
Subtask #3:
score: 0
Wrong Answer
Test #11:
score: 0
Wrong Answer
time: 238ms
memory: 17380kb
input:
random1 100000 0 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 9...
output:
Wrong Answer [5]
result:
wrong answer Token "Wrong" doesn't correspond to pattern "Accepted:"
Subtask #4:
score: 0
Skipped
Dependency #1:
100%
Accepted
Dependency #2:
100%
Accepted
Dependency #3:
0%