이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#define fr first
#define sc second
#define pii pair<int, int>
#define pb push_back
#define szof(s) (int)s.size()
#define all(s) s.begin(), s.end()
#define fastInp ios_base::sync_with_stdio(0); cin.tie(0);
//#define int long long
using namespace std;
const int MAXN = (int)2e5 + 5;
const int INF = 1e18;
int pos[MAXN], p[MAXN];
vector <pii> g[MAXN];
int n, m;
bool in(int pos) {
return 0 <= pos && pos < n;
}
void crt(int pos, int x) {
if (x == 0) { // wtf
return;
}
if (!in(pos)) {
return;
}
int l = pos;
while (l >= 0) {
if (l != pos) {
g[pos].pb({abs(pos - l) / x, l});
}
l -= x;
}
int r = pos;
while (r < n) {
if (r != pos) {
g[pos].pb({abs(r - pos) / x, r});
}
r += x;
}
}
int dist[MAXN];
signed main() {
fastInp;
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> pos[i] >> p[i];
crt(pos[i], p[i]);
}
//for (int i = 1; i <= 1e5; i++) {
//cerr << "ok" << endl;
//}
memset(dist, -1, sizeof(dist));
dist[pos[0]] = 0;
queue <pii> pq;
pq.push({0, pos[0]});
while (!pq.empty()) {
int v = pq.front().sc;
int cost = -pq.front().fr;
pq.pop();
if (cost > dist[v]) {
continue;
}
for (auto el : g[v]) {
int c = el.fr, to = el.sc;
if (dist[to] == -1 || dist[to] > dist[v] + c) {
dist[to] = dist[v] + c;
pq.push({-dist[to], to});
}
}
}
if (in(pos[1])) {
cout << dist[pos[1]] << endl;
} else {
cout << -1 << endl;
}
}
/*
4 4
1 1
0 1
3 4
2 0
*/
컴파일 시 표준 에러 (stderr) 메시지
skyscraper.cpp:13:17: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
13 | const int INF = 1e18;
| ^~~~
# | 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... |