답안 #328218

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
328218 2020-11-15T21:24:30 Z anishrajeev Mecho (IOI09_mecho) Java 11
50 / 100
1000 ms 65536 KB
import java.io.*;
import java.util.*;

public class mecho {
    public static LinkedList<pair> q = new LinkedList<>();
    public static int[] dx = new int[]{0, 1, 0, -1};
    public static int[] dy = new int[]{1, 0, -1, 0};
    public static boolean[][] visited;
    public static void main(String[] args) throws IOException {
        BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
        //BufferedReader bf = new BufferedReader(new FileReader("tester.in"));
        PrintWriter pw = new PrintWriter(new OutputStreamWriter(System.out));
        StringTokenizer stk = new StringTokenizer(bf.readLine());
        int N = Integer.parseInt(stk.nextToken());
        int S = Integer.parseInt(stk.nextToken());
        String[][] grid = new String[N][N];
        int[][] bees = new int[N][N];
        visited = new boolean[N][N];
        int startx = 0, starty = 0, homex = 0, homey = 0;
        for(int i = 0; i < N; i++){
            String line = bf.readLine();
            String[] str = line.split("");
            Arrays.fill(bees[i], Integer.MAX_VALUE);
            for(int c = 0; c < N; c++){
                grid[i][c] = str[c];
                if(grid[i][c].equals("H")){
                    q.add(new pair(i, c, 0));
                    visited[i][c] = true;
                    bees[i][c] = 0;
                }
                if(grid[i][c].equals("M")){
                    startx = i;
                    starty = c;
                }
                if(grid[i][c].equals("D")){
                    homex = i;
                    homey = c;
                }
            }
        }
        int[] dx = new int[]{0, 1, 0, -1};
        int[] dy = new int[]{1, 0, -1, 0};
        while(!q.isEmpty()){
            pair p = q.pop();
            if(p.x == homex && p.y == homey)continue;
            if(grid[p.x][p.y].equals("T"))continue;
            bees[p.x][p.y] = Math.min(bees[p.x][p.y], p.t+S);
            for(int i = 0; i < 4; i++){
                int nx = p.x+dx[i];
                int ny = p.y+dy[i];
                if(N <= nx || nx < 0 || N <= ny || ny < 0 || visited[nx][ny])continue;
                q.add(new pair(nx, ny, bees[p.x][p.y]));
                visited[nx][ny] = true;

            }
        }
        bees[homex][homey] = Integer.MAX_VALUE;
        int start = 0, end = 10000000;
        while(start != end){
            int mid = (start+end+1)/2;
            if(verify(bees, grid, mid, startx, starty, homex, homey, N, S))start = mid;
            else end = mid-1;
        }
        if(!verify(bees, grid, 0, startx, starty, homex, homey, N, S))System.out.println(-1);
        else System.out.println(start);
    }
    public static boolean verify(int[][] bees, String[][] grid, int time, int startx, int starty, int homex, int homey, int N, int S){
        q.add(new pair(startx, starty, time*S));
        for(int i = 0; i < N; i++)Arrays.fill(visited[i], false);
        visited[startx][starty] = true;
        while(!q.isEmpty()){
            pair p = q.poll();
            if(p.t >= bees[p.x][p.y])continue;
            for(int i = 0; i < 4; i++){
                int nx = p.x+dx[i];
                int ny = p.y+dy[i];
                if(N <= nx || nx < 0 || N <= ny || ny < 0)continue;
                if(grid[nx][ny].equals("T")||grid[nx][ny].equals("H"))continue;
                if(bees[nx][ny] <= p.t+1 || visited[nx][ny])continue;
                q.add(new pair(nx, ny, p.t+1));
                visited[nx][ny] = true;
            }
        }
        return visited[homex][homey];
    }
    public static class pair implements Comparable<pair>{
        int x, y, t;
        public pair(int a, int b, int c){
            x = a;
            y = b;
            t = c;
        }

        @Override
        public int compareTo(pair o) {
            if(x==o.x&&y==o.y)return Integer.compare(t, o.t);
            if(x==o.x)return Integer.compare(y, o.y);
            return Integer.compare(x, o.x);
        }
        public boolean equals(pair o){
            if(x == o.x && y == o.y && t == o.t)return true;
            return false;
        }
    }
}
# 결과 실행 시간 메모리 Grader output
1 Correct 74 ms 8680 KB Output is correct
2 Correct 75 ms 8576 KB Output is correct
3 Correct 73 ms 8684 KB Output is correct
4 Correct 76 ms 8684 KB Output is correct
5 Correct 75 ms 8704 KB Output is correct
6 Correct 74 ms 8684 KB Output is correct
7 Runtime error 854 ms 65536 KB Execution killed with signal 9 (could be triggered by violating memory limits)
8 Correct 76 ms 8684 KB Output is correct
9 Correct 78 ms 8684 KB Output is correct
10 Correct 75 ms 8684 KB Output is correct
11 Correct 78 ms 8776 KB Output is correct
12 Correct 114 ms 9580 KB Output is correct
13 Correct 109 ms 9436 KB Output is correct
14 Correct 176 ms 12648 KB Output is correct
15 Correct 81 ms 8836 KB Output is correct
16 Correct 82 ms 8796 KB Output is correct
17 Correct 91 ms 9196 KB Output is correct
18 Correct 93 ms 9324 KB Output is correct
19 Correct 97 ms 9196 KB Output is correct
20 Correct 101 ms 9068 KB Output is correct
21 Correct 111 ms 9216 KB Output is correct
22 Correct 118 ms 9308 KB Output is correct
23 Correct 110 ms 9452 KB Output is correct
24 Correct 182 ms 12096 KB Output is correct
25 Correct 127 ms 9580 KB Output is correct
26 Correct 161 ms 12884 KB Output is correct
27 Correct 133 ms 9820 KB Output is correct
28 Correct 169 ms 13024 KB Output is correct
29 Correct 178 ms 12988 KB Output is correct
30 Correct 200 ms 13104 KB Output is correct
31 Correct 180 ms 11788 KB Output is correct
32 Correct 174 ms 13052 KB Output is correct
33 Correct 577 ms 24524 KB Output is correct
34 Correct 629 ms 24548 KB Output is correct
35 Correct 703 ms 25420 KB Output is correct
36 Correct 564 ms 27008 KB Output is correct
37 Correct 597 ms 27240 KB Output is correct
38 Correct 777 ms 27756 KB Output is correct
39 Correct 616 ms 32352 KB Output is correct
40 Correct 725 ms 33140 KB Output is correct
41 Execution timed out 1087 ms 33324 KB Time limit exceeded
42 Correct 671 ms 36612 KB Output is correct
43 Correct 688 ms 36780 KB Output is correct
44 Execution timed out 1063 ms 37416 KB Time limit exceeded
45 Correct 658 ms 39264 KB Output is correct
46 Correct 711 ms 39056 KB Output is correct
47 Execution timed out 1091 ms 39948 KB Time limit exceeded
48 Correct 688 ms 43636 KB Output is correct
49 Correct 718 ms 43892 KB Output is correct
50 Execution timed out 1088 ms 44320 KB Time limit exceeded
51 Correct 764 ms 52188 KB Output is correct
52 Correct 809 ms 53472 KB Output is correct
53 Execution timed out 1100 ms 54084 KB Time limit exceeded
54 Correct 742 ms 55688 KB Output is correct
55 Correct 803 ms 55932 KB Output is correct
56 Execution timed out 1099 ms 56908 KB Time limit exceeded
57 Correct 761 ms 60448 KB Output is correct
58 Correct 843 ms 60548 KB Output is correct
59 Execution timed out 1062 ms 61068 KB Time limit exceeded
60 Runtime error 647 ms 65536 KB Execution killed with signal 9 (could be triggered by violating memory limits)
61 Runtime error 680 ms 65536 KB Execution killed with signal 9 (could be triggered by violating memory limits)
62 Runtime error 654 ms 65536 KB Execution killed with signal 9 (could be triggered by violating memory limits)
63 Runtime error 706 ms 65536 KB Execution killed with signal 9 (could be triggered by violating memory limits)
64 Runtime error 723 ms 65536 KB Execution killed with signal 9 (could be triggered by violating memory limits)
65 Runtime error 720 ms 65536 KB Execution killed with signal 9 (could be triggered by violating memory limits)
66 Runtime error 733 ms 65536 KB Execution killed with signal 9 (could be triggered by violating memory limits)
67 Runtime error 693 ms 65536 KB Execution killed with signal 9 (could be triggered by violating memory limits)
68 Runtime error 814 ms 65536 KB Execution killed with signal 9 (could be triggered by violating memory limits)
69 Runtime error 819 ms 65536 KB Execution killed with signal 9 (could be triggered by violating memory limits)
70 Runtime error 832 ms 65536 KB Execution killed with signal 9 (could be triggered by violating memory limits)
71 Runtime error 822 ms 65536 KB Execution killed with signal 9 (could be triggered by violating memory limits)
72 Runtime error 812 ms 65536 KB Execution killed with signal 9 (could be triggered by violating memory limits)
73 Runtime error 694 ms 65536 KB Execution killed with signal 9 (could be triggered by violating memory limits)
74 Runtime error 697 ms 65536 KB Execution killed with signal 9 (could be triggered by violating memory limits)
75 Runtime error 694 ms 65536 KB Execution killed with signal 9 (could be triggered by violating memory limits)
76 Runtime error 705 ms 65536 KB Execution killed with signal 9 (could be triggered by violating memory limits)
77 Runtime error 693 ms 65536 KB Execution killed with signal 9 (could be triggered by violating memory limits)
78 Runtime error 743 ms 65536 KB Execution killed with signal 9 (could be triggered by violating memory limits)
79 Runtime error 748 ms 65536 KB Execution killed with signal 9 (could be triggered by violating memory limits)
80 Runtime error 756 ms 65536 KB Execution killed with signal 9 (could be triggered by violating memory limits)
81 Runtime error 744 ms 65536 KB Execution killed with signal 9 (could be triggered by violating memory limits)
82 Runtime error 752 ms 65536 KB Execution killed with signal 9 (could be triggered by violating memory limits)
83 Runtime error 725 ms 65536 KB Execution killed with signal 9 (could be triggered by violating memory limits)
84 Runtime error 735 ms 65536 KB Execution killed with signal 9 (could be triggered by violating memory limits)
85 Runtime error 745 ms 65536 KB Execution killed with signal 9 (could be triggered by violating memory limits)
86 Runtime error 709 ms 65536 KB Execution killed with signal 9 (could be triggered by violating memory limits)
87 Runtime error 747 ms 65536 KB Execution killed with signal 9 (could be triggered by violating memory limits)
88 Runtime error 743 ms 65536 KB Execution killed with signal 9 (could be triggered by violating memory limits)
89 Runtime error 748 ms 65536 KB Execution killed with signal 9 (could be triggered by violating memory limits)
90 Runtime error 730 ms 65536 KB Execution killed with signal 9 (could be triggered by violating memory limits)
91 Runtime error 742 ms 65536 KB Execution killed with signal 9 (could be triggered by violating memory limits)
92 Runtime error 739 ms 65536 KB Execution killed with signal 9 (could be triggered by violating memory limits)