# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1228388 | Jer | Railway Trip 2 (JOI22_ho_t4) | C++20 | 2094 ms | 106056 KiB |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2005;
vector<int> con[MAXN];
int n, k, m, q;
int query(int s, int t)
{
set<int> vis;
queue<int> q;
q.push(s);
int l = 0;
while (!q.empty())
{
int len = q.size();
for (int z = 0; z < len; z++)
{
int curr = q.front();
q.pop();
if (vis.find(curr) != vis.end())
continue;
vis.insert(curr);
if (curr == t)
return l;
for (auto i : con[curr])
q.push(i);
}
l++;
}
return -1;
}
int main()
{
scanf("%d%d%d", &n, &k, &m);
int a, b;
for (int i = 0; i < m; i++)
{
scanf("%d%d", &a, &b);
a--, b--;
if (a < b)
{
for (int s = a; s <= min(a + k - 1, b - 1); s++)
for (int j = s + 1; j <= b; j++)
con[s].push_back(j);
}
else
{
for (int s = a; s >= max(a - k + 1, b + 1); s--)
for (int j = s - 1; j >= b; j--)
con[s].push_back(j);
}
}
scanf("%d", &q);
while (q--)
{
int s, t;
scanf("%d%d", &s, &t);
s--, t--;
printf("%d\n", query(s, t));
}
return 0;
}
컴파일 시 표준 에러 (stderr) 메시지
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |