Uva_Problems/Uva614.java at master · mostafamt/Uva_Problems · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
import java.util.*;
import java.io.*;

public class Uva614
{
    static int R , C , y , x ;
    static int [][] path ;
    static boolean block[][][] ;
    static int [] dy = { 0 , -1 , 0 , 1 };
    static int [] dx = {-1 ,  0 , 1 , 0 };


    static boolean valid(int y , int x)
    {
        if( y >= R || x >= C || y < 0 || x < 0 ){
            return false ;
        }
        return true ;
    }

    public static void main(String[] args) throws IOException
    {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        PrintWriter pr = new PrintWriter(System.out);
        StringBuilder sb = new StringBuilder();
        int maze = 1 ;

        while( true ){
            StringTokenizer st = new StringTokenizer(br.readLine());
            while(!st.hasMoreTokens()){
                st = new StringTokenizer(br.readLine());
            }
            R = Integer.parseInt(st.nextToken());
            if(R==0){
                break ;
            }
            while(!st.hasMoreTokens()){
                st = new StringTokenizer(br.readLine());
            }
            C = Integer.parseInt(st.nextToken());
            while(!st.hasMoreTokens()){
                st = new StringTokenizer(br.readLine());
            }
            int a = Integer.parseInt(st.nextToken())-1 ;
            while(!st.hasMoreTokens()){
                st = new StringTokenizer(br.readLine());
            }
            int b = Integer.parseInt(st.nextToken())-1 ;
            while(!st.hasMoreTokens()){
                st = new StringTokenizer(br.readLine());
            }
            y = Integer.parseInt(st.nextToken())-1 ;
            while(!st.hasMoreTokens()){
                st = new StringTokenizer(br.readLine());
            }
            x = Integer.parseInt(st.nextToken())-1 ;
            path = new int[R][C];
            block = new boolean[R][C][4];

            for(int i = 0 ; i < R ; i++){
                st = new StringTokenizer(br.readLine());
                for(int j = 0 ; j < C ; j++){
                    int c = Integer.parseInt(st.nextToken());
                    switch (c){
                        case 1 :
                            block[i][j][2] = true ;
                            if( valid(i,j+1) ){
                                block[i][j+1][0] = true ;
                            }
                            break ;
                        case 3 :
                            block[i][j][2] = true ;
                            if( valid(i,j+1) ){
                                block[i][j+1][0] = true ;
                            }
                        case 2:
                            block[i][j][3] = true ;
                            if( valid(i+1,j) ){
                                block[i+1][j][1] = true ;
                            }
                            break ;
                    }
                }
            }

            for(int i = 0 ; i < R ; i++){
                block[i][0][0] = true ;
                block[i][C-1][2] = true ;
            }
            for(int i = 0 ; i < C ; i++){
                block[0][i][1] = true ;
                block[R-1][i][3] = true ;
            }
            path[a][b] = 1 ;
            dfs(a,b);

            sb.append("Maze ").append(maze++).append("\n\n");
            for(int i = 0 ; i < C ; i++){
                sb.append("+---");
            }
            sb.append("+\n");

            for(int i = 0 ; i < R ; i++){
                sb.append("|");
                for(int j = 0 ; j < C ; j++){
                    if( path[i][j] == -1 ){
                        sb.append("???");
                    } else if ( path[i][j] == 0 ){
                        sb.append("   ");
                    } else {
                        sb.append( String.format("%3d" , path[i][j]) );
                    }
                    sb.append( block[i][j][2] ? "|" : " " );

                }
                sb.append('\n');
                for(int j = 0 ; j < C ; j++){
                    if( block[i][j][3] ){
                        sb.append("+---");
                    } else {
                        sb.append("+   ");
                    }
                }
                sb.append("+\n");
            }
            sb.append("\n\n");

            br.readLine();

        }
        pr.print(sb.toString());
        pr.close();
        br.close();
    }


    static boolean dfs(int u , int v)
    {
        if( u == y && v == x ){
            return true ;
        }
        for(int i = 0 ; i < 4 ; i++){
            int r = u + dy[i] ;
            int c = v + dx[i] ;
            if( !block[u][v][i]  && path[r][c] == 0 ){
                path[r][c] = path[u][v] + 1 ;
                if(dfs(r,c)){
                    return true ;
                }
            }
        }
        path[u][v] = -1 ;
        return false ;
    }


}