We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent b56bbb3 commit 6c41c15Copy full SHA for 6c41c15
uva/1600/src/Main.java
@@ -69,11 +69,12 @@ private void solveCase() throws IOException {
69
pq.add(np);
70
} else {
71
for (int v = 1; v <= k; v++) {
72
- int vdx = p.x + dx[d] * v;
73
- int vdy = p.y + dy[d] * v;
74
- if (vdx >= 0 && vdx < m && vdy >= 0 && vdy < n && dists[vdx][vdy] >= p.dist + v) {
75
- dists[vdx][vdy] = p.dist + v;
76
- Pos vp = new Pos(vdx, vdy, p.dist + v);
+ int dv = v + 1;
+ int vdx = p.x + dx[d] * dv;
+ int vdy = p.y + dy[d] * dv;
+ if (vdx >= 0 && vdx < m && vdy >= 0 && vdy < n && grid[vdx][vdy] == 0 && dists[vdx][vdy] >= p.dist + v) {
+ dists[vdx][vdy] = p.dist + dv;
77
+ Pos vp = new Pos(vdx, vdy, p.dist + dv);
78
pq.add(vp);
79
}
80
0 commit comments