oj.uz

Submission #815877

# Submission time Handle Problem Language Result Execution time Memory
815877 2023-08-09T01:55:27 Z powervic08 Mecho (IOI09_mecho) Java 11
84 / 100
 616 ms 47932 KB 
import java.util.*;
import java.io.*;

public class mecho {

    static int[] dx = {-1, 1, 0, 0};
    static int[] dy = {0, 0, -1, 1};
    static int S;

    public static void main(String[] args) throws IOException {
        BufferedReader f = new BufferedReader(new InputStreamReader(System.in));
        PrintWriter out = new PrintWriter(System.out);
        StringTokenizer st = new StringTokenizer(f.readLine());
        int n = Integer.parseInt(st.nextToken());
        S = Integer.parseInt(st.nextToken());
        int[][] grid = new int[n][n];
        int starti = 0, startj = 0, endi = 0, endj = 0;
        for (int i = 0; i < n; i++) {
            String s = f.readLine();
            for (int j = 0; j < n; j++) {
                if (s.charAt(j) == 'H') grid[i][j] = 1;
                else if (s.charAt(j) == 'T') grid[i][j] = 2;
                else if (s.charAt(j) == 'M') {
                    starti = i;
                    startj = j;
                } else if (s.charAt(j) == 'D') {
                    endi = i;
                    endj = j;
                }
            }
        }
        out.println(maximumMinutes(grid, starti, startj, endi, endj));
        out.close();
        f.close();
    }

    public static int maximumMinutes(int[][] grid, int starti, int startj, int endi, int endj) {
        int n = grid.length;
        int m = grid[0].length;
        Queue<Node> q = new LinkedList<>();
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                if (grid[i][j] == 1) {
                    q.add(new Node(i, j, 0));
                }
            }
        }
        int[][] dists = new int[n][m];
        for (int i = 0; i < n; i++) {
            Arrays.fill(dists[i], Integer.MAX_VALUE);
        }
        while (!q.isEmpty()) {
            Node p = q.poll();
            if (p.dist >= dists[p.i][p.j]) {
                continue;
            }
            dists[p.i][p.j] = (int) p.dist;
            for (int i = 0; i < 4; i++) {
                int newi = dx[i] + p.i;
                int newj = dy[i] + p.j;
                if (inRange(newi, newj, grid)) {
                    if (grid[newi][newj] == 0) {
                        q.add(new Node(newi, newj, p.dist + S));
                    }
                }
            }
        }
        dists[endi][endj] = Integer.MAX_VALUE;
        int l = -1;
        int r = 2 * n * n;
        while (l < r) {
            int mid = (l + r + 1) / 2;
            if (works(mid, dists, grid, starti, startj, endi, endj)) {
                l = mid;
            } else {
                r = mid - 1;
            }
        }
        return l;
    }

    public static boolean works(int mid, int[][] dists, int[][] grid, int starti, int startj, int endi, int endj) {
        Queue<Node> q = new LinkedList<>();
        q.add(new Node(starti, startj, (long) mid * S));
        boolean[][] visited = new boolean[grid.length][grid[0].length];
        while (!q.isEmpty()) {
            Node p = q.poll();
            if (p.i == endi && p.j == endj) {
                return true;
            }
            if (visited[p.i][p.j]) {
                continue;
            }
            visited[p.i][p.j] = true;
            for (int i = 0; i < 4; i++) {
                int newi = dx[i] + p.i;
                int newj = dy[i] + p.j;
                if (inRange(newi, newj, grid)) {
                    if (grid[newi][newj] == 0 && dists[newi][newj] > p.dist + 1 || newi == endi && newj == endj && dists[newi][newj] == p.dist + 1) {
                        q.add(new Node(newi, newj, p.dist + 1));
                    }
                }
            }
        }
        return false;
    }

    public static boolean inRange(int i, int j, int[][] grid) {
        return i >= 0 && j >= 0 && i < grid.length && j < grid[0].length;
    }

    static class Node {
        int i, j;
        long dist;

        public Node(int a, int b, long c) {
            i = a;
            j = b;
            dist = c;
        }
    }

}

Subtask #1
84.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 8560 KB Output is correct
2 Correct 50 ms 8264 KB Output is correct
3 Correct 51 ms 8132 KB Output is correct
4 Correct 54 ms 8336 KB Output is correct
5 Correct 51 ms 8292 KB Output is correct
6 Correct 49 ms 8220 KB Output is correct
7 Correct 614 ms 33428 KB Output is correct
8 Correct 53 ms 8748 KB Output is correct
9 Correct 53 ms 8428 KB Output is correct
10 Correct 56 ms 8412 KB Output is correct
11 Correct 49 ms 8252 KB Output is correct
12 Incorrect 60 ms 8764 KB Output isn't correct
13 Incorrect 64 ms 8964 KB Output isn't correct
14 Correct 101 ms 12584 KB Output is correct
15 Correct 48 ms 8308 KB Output is correct
16 Correct 49 ms 8580 KB Output is correct
17 Correct 56 ms 8324 KB Output is correct
18 Correct 53 ms 8400 KB Output is correct
19 Correct 64 ms 8492 KB Output is correct
20 Correct 52 ms 8596 KB Output is correct
21 Correct 54 ms 8472 KB Output is correct
22 Correct 55 ms 8452 KB Output is correct
23 Correct 55 ms 8728 KB Output is correct
24 Correct 58 ms 8508 KB Output is correct
25 Correct 61 ms 8924 KB Output is correct
26 Correct 64 ms 9064 KB Output is correct
27 Correct 61 ms 8540 KB Output is correct
28 Correct 62 ms 9116 KB Output is correct
29 Correct 63 ms 8904 KB Output is correct
30 Correct 73 ms 8832 KB Output is correct
31 Correct 71 ms 10192 KB Output is correct
32 Correct 77 ms 11208 KB Output is correct
33 Correct 143 ms 14752 KB Output is correct
34 Correct 226 ms 14912 KB Output is correct
35 Correct 257 ms 16068 KB Output is correct
36 Correct 141 ms 15080 KB Output is correct
37 Correct 207 ms 15628 KB Output is correct
38 Correct 278 ms 16712 KB Output is correct
39 Correct 152 ms 15784 KB Output is correct
40 Correct 214 ms 15608 KB Output is correct
41 Correct 317 ms 17476 KB Output is correct
42 Correct 154 ms 15984 KB Output is correct
43 Correct 212 ms 16224 KB Output is correct
44 Correct 339 ms 18484 KB Output is correct
45 Correct 155 ms 16224 KB Output is correct
46 Correct 203 ms 16680 KB Output is correct
47 Correct 380 ms 19112 KB Output is correct
48 Correct 155 ms 16812 KB Output is correct
49 Correct 218 ms 16988 KB Output is correct
50 Correct 418 ms 19520 KB Output is correct
51 Correct 161 ms 17472 KB Output is correct
52 Correct 222 ms 17508 KB Output is correct
53 Correct 453 ms 21156 KB Output is correct
54 Correct 167 ms 18188 KB Output is correct
55 Correct 221 ms 18212 KB Output is correct
56 Correct 463 ms 22896 KB Output is correct
57 Correct 167 ms 18844 KB Output is correct
58 Correct 240 ms 20436 KB Output is correct
59 Correct 505 ms 25136 KB Output is correct
60 Correct 174 ms 20688 KB Output is correct
61 Correct 226 ms 22040 KB Output is correct
62 Correct 561 ms 25524 KB Output is correct
63 Correct 368 ms 25712 KB Output is correct
64 Correct 597 ms 26588 KB Output is correct
65 Correct 494 ms 26352 KB Output is correct
66 Correct 427 ms 26120 KB Output is correct
67 Correct 405 ms 26356 KB Output is correct
68 Correct 280 ms 25096 KB Output is correct
69 Correct 298 ms 24676 KB Output is correct
70 Correct 290 ms 23240 KB Output is correct
71 Correct 278 ms 24436 KB Output is correct
72 Incorrect 254 ms 22016 KB Output isn't correct
73 Incorrect 440 ms 47660 KB Output isn't correct
74 Correct 501 ms 47932 KB Output is correct
75 Correct 568 ms 47712 KB Output is correct
76 Correct 526 ms 47928 KB Output is correct
77 Correct 537 ms 47688 KB Output is correct
78 Correct 578 ms 44608 KB Output is correct
79 Correct 500 ms 44628 KB Output is correct
80 Correct 481 ms 44664 KB Output is correct
81 Correct 540 ms 44748 KB Output is correct
82 Correct 516 ms 44772 KB Output is correct
83 Correct 585 ms 40564 KB Output is correct
84 Correct 553 ms 40624 KB Output is correct
85 Correct 584 ms 40564 KB Output is correct
86 Correct 563 ms 40628 KB Output is correct
87 Correct 567 ms 40436 KB Output is correct
88 Correct 595 ms 36888 KB Output is correct
89 Correct 588 ms 36596 KB Output is correct
90 Correct 608 ms 36680 KB Output is correct
91 Correct 595 ms 36624 KB Output is correct
92 Correct 616 ms 36732 KB Output is correct