QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#289884 | #7866. Teleportation | ucup-team1766# | RE | 0ms | 3792kb | C++23 | 874b | 2023-12-24 03:40:55 | 2023-12-24 03:40:55 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int main() {
int n, x; cin >> n >> x;
vector<int> a(n); for (int &i : a) cin >> i;
vector<bool> seen(n); seen[0] = true;
set<int> next = {a[0]};
for (int _ = 1; _ <= n; _++) {
set<int> next2;
for (int i : next) {
if (i == x) {
cout << _ << '\n';
return 0;
}
seen[i] = true;
if (!seen[a[i]]) {
next2.emplace(a[i]);
} else if (!seen[(i+1) % n]) {
next2.emplace((i+1) % n);
}
}
next = next2;
}
assert(0);
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3628kb
input:
4 3 0 1 2 3
output:
4
result:
ok 1 number(s): "4"
Test #2:
score: 0
Accepted
time: 0ms
memory: 3792kb
input:
4 3 0 0 0 0
output:
4
result:
ok 1 number(s): "4"
Test #3:
score: 0
Accepted
time: 0ms
memory: 3624kb
input:
4 3 2 2 2 2
output:
2
result:
ok 1 number(s): "2"
Test #4:
score: 0
Accepted
time: 0ms
memory: 3624kb
input:
2 1 0 0
output:
2
result:
ok 1 number(s): "2"
Test #5:
score: 0
Accepted
time: 0ms
memory: 3596kb
input:
2 1 1 1
output:
1
result:
ok 1 number(s): "1"
Test #6:
score: -100
Runtime Error
input:
300 25 182 9 13 211 258 132 27 42 218 200 271 258 164 121 8 84 29 195 141 290 110 0 272 93 142 134 140 32 232 99 162 199 297 287 212 29 182 53 61 98 116 282 75 245 230 165 22 4 179 89 274 231 46 299 248 208 200 285 221 50 221 199 294 241 195 138 22 204 113 100 132 276 158 146 238 178 100 94 131 157 ...