이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#pragma GCC optimize("Ofast,unroll-all-loops")
#pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")
#include <bits/stdc++.h>
using namespace std;
const unsigned short MAXM = 3e4+5, MAXN = 3e4+5;
unsigned short n, m, secloc, p[MAXM];
vector<int> a(MAXN, INT_MAX);
queue<unsigned short> b[MAXN];
struct triple {
unsigned short first, second;
char third;
triple() : first(0), second(0), third(0) {}
triple(unsigned short a, unsigned short b, char c) :first(a), second(b), third(c) {}
};
queue<triple> curr, oth;
signed main() {
cin.tie(0)->sync_with_stdio(0);
cin >> n >> m;
{
unsigned short tmp;
cin >> tmp >> p[0];
curr.push({tmp, p[0], 3});
b[tmp].push(0);
}
{
unsigned short tmp;
cin >> tmp >> p[1];
secloc = tmp;
b[tmp].push(1);
}
for(int i = 2; i < m; i++) {
unsigned short tmp;
cin >> tmp >> p[i];
b[tmp].push(i);
}
int curval = 0;
while(!curr.empty()) {
auto cur = curr.front(); curr.pop();
if(a[cur.first] == INT_MAX) {
while(!b[cur.first].empty()) {
int x = b[cur.first].front();
b[cur.first].pop();
if(p[x] != cur.second)
curr.push({cur.first, p[x], 3});
}
}
a[cur.first] = min(a[cur.first], curval);
unsigned short tmp = cur.first - cur.second;
if(tmp >= 0 && cur.third & 1)
oth.push({tmp, cur.second, 1});
tmp = cur.first + cur.second;
if(tmp < n && cur.third & 2)
oth.push({tmp, cur.second, 2});
if(curr.empty()) {
swap(curr, oth);
curval ++;
}
}
cout << (a[secloc] == INT_MAX ? -1 : a[secloc]) << '\n';
}
# | 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... |