QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#414398 | #6749. Target | OneWan | WA | 1ms | 7060kb | C++23 | 981b | 2024-05-18 22:41:29 | 2024-05-18 22:41:29 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
int __OneWan_2024 = [](){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
return 0;
}();
int dist[500005];
array<int, 2> pre[500005];
int main() {
double a, b;
cin >> a >> b;
int ta = a * 10000, tb = b * 10000;
fill(dist, dist + 500005, 200);
dist[ta] = 0;
queue<int> que;
que.push(ta);
pre[ta] = {-1, -1};
while (!que.empty()) {
int x = que.front();
que.pop();
{
int tx = x * 0.5;
if (dist[tx] > dist[x] + 1) {
dist[tx] = dist[x] + 1;
pre[tx] = {x, 1};
que.push(tx);
}
}
{
int tx = (x / 2 + 5000);
if (tx < 500005) {
if (dist[tx] > dist[x] + 1) {
dist[tx] = dist[x] + 1;
pre[tx] = {x, 2};
que.push(tx);
}
}
}
}
vector<int> ans;
int now = tb;
while (pre[tb][0] != -1) {
ans.push_back(pre[tb][1]);
tb = pre[tb][0];
}
for (auto &x : ans) {
cout << x;
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 7012kb
input:
0.5 0.25
output:
1
result:
ok ok
Test #2:
score: -100
Wrong Answer
time: 0ms
memory: 7060kb
input:
1 0.75
output:
21
result:
wrong answer wa