oj.uz

Submission #815848

# Submission time Handle Problem Language Result Execution time Memory
815848 2023-08-09T01:12:13 Z powervic08 Mecho (IOI09_mecho) Java 11
77 / 100
 642 ms 48372 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] != 2) {
                        q.add(new Node(newi, newj, p.dist + 1));
                    }
                }
            }
        }
        int l = -1;
        int r = 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] != 2 && dists[newi][newj] > (p.dist + 1) / S || newi == endi && newj == endj && dists[newi][newj] == (p.dist + 1) / S) {
                        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
77.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 8772 KB Output is correct
2 Incorrect 52 ms 8476 KB Output isn't correct
3 Correct 48 ms 8364 KB Output is correct
4 Incorrect 47 ms 8380 KB Output isn't correct
5 Correct 49 ms 8364 KB Output is correct
6 Incorrect 50 ms 8572 KB Output isn't correct
7 Correct 598 ms 33628 KB Output is correct
8 Correct 50 ms 8320 KB Output is correct
9 Correct 52 ms 8540 KB Output is correct
10 Correct 50 ms 8708 KB Output is correct
11 Correct 49 ms 8424 KB Output is correct
12 Incorrect 58 ms 8664 KB Output isn't correct
13 Incorrect 67 ms 9160 KB Output isn't correct
14 Correct 101 ms 12320 KB Output is correct
15 Correct 52 ms 8512 KB Output is correct
16 Correct 52 ms 8480 KB Output is correct
17 Correct 50 ms 8428 KB Output is correct
18 Correct 50 ms 8392 KB Output is correct
19 Correct 52 ms 8416 KB Output is correct
20 Correct 52 ms 8384 KB Output is correct
21 Correct 52 ms 8600 KB Output is correct
22 Correct 56 ms 8752 KB Output is correct
23 Correct 55 ms 8472 KB Output is correct
24 Correct 56 ms 8576 KB Output is correct
25 Correct 57 ms 8760 KB Output is correct
26 Correct 68 ms 8748 KB Output is correct
27 Correct 60 ms 8588 KB Output is correct
28 Correct 63 ms 8956 KB Output is correct
29 Correct 62 ms 8820 KB Output is correct
30 Correct 63 ms 9240 KB Output is correct
31 Correct 75 ms 10168 KB Output is correct
32 Correct 84 ms 11236 KB Output is correct
33 Correct 145 ms 14920 KB Output is correct
34 Correct 205 ms 15012 KB Output is correct
35 Correct 253 ms 16212 KB Output is correct
36 Correct 145 ms 15300 KB Output is correct
37 Correct 223 ms 15432 KB Output is correct
38 Correct 277 ms 16936 KB Output is correct
39 Correct 162 ms 15716 KB Output is correct
40 Correct 214 ms 15892 KB Output is correct
41 Correct 311 ms 18028 KB Output is correct
42 Correct 151 ms 16496 KB Output is correct
43 Correct 219 ms 16352 KB Output is correct
44 Correct 344 ms 18944 KB Output is correct
45 Correct 167 ms 16892 KB Output is correct
46 Correct 202 ms 17060 KB Output is correct
47 Correct 370 ms 19860 KB Output is correct
48 Correct 156 ms 17344 KB Output is correct
49 Correct 227 ms 17676 KB Output is correct
50 Correct 416 ms 20324 KB Output is correct
51 Correct 166 ms 17776 KB Output is correct
52 Correct 220 ms 18272 KB Output is correct
53 Correct 449 ms 21872 KB Output is correct
54 Correct 164 ms 18528 KB Output is correct
55 Correct 233 ms 19152 KB Output is correct
56 Correct 490 ms 24032 KB Output is correct
57 Correct 166 ms 19416 KB Output is correct
58 Correct 231 ms 21840 KB Output is correct
59 Correct 514 ms 26176 KB Output is correct
60 Correct 171 ms 21076 KB Output is correct
61 Correct 249 ms 22120 KB Output is correct
62 Correct 575 ms 26336 KB Output is correct
63 Correct 371 ms 26268 KB Output is correct
64 Correct 610 ms 27324 KB Output is correct
65 Correct 491 ms 26892 KB Output is correct
66 Correct 438 ms 26380 KB Output is correct
67 Correct 404 ms 26320 KB Output is correct
68 Correct 285 ms 25932 KB Output is correct
69 Correct 294 ms 25436 KB Output is correct
70 Correct 275 ms 24028 KB Output is correct
71 Correct 290 ms 25360 KB Output is correct
72 Incorrect 262 ms 22608 KB Output isn't correct
73 Incorrect 433 ms 48248 KB Output isn't correct
74 Correct 514 ms 48328 KB Output is correct
75 Correct 554 ms 48372 KB Output is correct
76 Correct 553 ms 48176 KB Output is correct
77 Correct 514 ms 48252 KB Output is correct
78 Correct 619 ms 45072 KB Output is correct
79 Correct 491 ms 45256 KB Output is correct
80 Correct 489 ms 45316 KB Output is correct
81 Correct 561 ms 45216 KB Output is correct
82 Correct 507 ms 45084 KB Output is correct
83 Correct 615 ms 41272 KB Output is correct
84 Correct 582 ms 41308 KB Output is correct
85 Correct 588 ms 41076 KB Output is correct
86 Correct 576 ms 41324 KB Output is correct
87 Correct 591 ms 41260 KB Output is correct
88 Correct 607 ms 37512 KB Output is correct
89 Correct 616 ms 37336 KB Output is correct
90 Correct 619 ms 37384 KB Output is correct
91 Correct 611 ms 37336 KB Output is correct
92 Correct 642 ms 37596 KB Output is correct