이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "wombats.h"
#include <algorithm>
#include <vector>
#include <queue>
#include <cassert>
using namespace std;
int n, m;
vector<vector<pair<int, int>>> g;
int calc[200][200];
int dist[5000 * 200];
bool used[5000 * 200];
const int inf = 2e9;
void djkstra(int v, vector<vector<pair<int, int>>> &g, int* arr) {
priority_queue<pair<int, int>> q;
fill(dist, dist + n * m, inf);
fill(used, used + n * m, false);
dist[v] = 0;
q.push({ -dist[v], v });
while (!q.empty()) {
int u = q.top().second;
q.pop();
if (used[u]) continue;
used[u] = true;
for (auto [c, w] : g[u]) {
if (dist[c] > dist[u] + w) {
dist[c] = dist[u] + w;
q.push({ -dist[c], c });
}
}
}
for (int i = (n - 1) * m; i < n * m; ++i) {
arr[i - (n - 1) * m] = dist[i];
}
}
void recalc() {
for (int i = 0; i < m; ++i) {
djkstra(i, g, calc[i]);
}
}
void init(int R, int C, int H[5000][200], int V[5000][200]) {
n = R;
m = C;
g.resize(n * m);
for (int i = 0; i < n; ++i) {
for (int j = 0; j + 1 < m; ++j) {
g[i * m + j].push_back({ i * m + j + 1, H[i][j] });
g[i * m + j + 1].push_back({ i * m + j, H[i][j] });
}
}
for (int i = 0; i + 1 < n; ++i) {
for (int j = 0; j < m; ++j) {
g[i * m + j].push_back({ i * m + j + m, V[i][j] });
}
}
recalc();
}
void changeH(int P, int Q, int W) {
if (Q == 0) {
g[P * m + Q][0].second = W;
} else {
g[P * m + Q][1].second = W;
}
g[P * m + Q + 1][0].second = W;
recalc();
}
void changeV(int P, int Q, int W) {
g[P * m + Q].back().second = W;
recalc();
}
int escape(int V1, int V2) {
assert(V1 < m);
assert(V2 < m);
return calc[V1][V2];
}
컴파일 시 표준 에러 (stderr) 메시지
grader.c: In function 'int main()':
grader.c:15:6: warning: variable 'res' set but not used [-Wunused-but-set-variable]
15 | int res;
| ^~~
# | 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... |