結果

問題 No.1434 Make Maze
ユーザー shojin_proshojin_pro
提出日時 2021-03-19 22:54:53
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 8,183 bytes
コンパイル時間 2,857 ms
コンパイル使用メモリ 83,184 KB
実行使用メモリ 43,016 KB
最終ジャッジ日時 2024-11-19 00:23:04
合計ジャッジ時間 8,732 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 52 ms
37,160 KB
testcase_01 AC 51 ms
37,296 KB
testcase_02 AC 164 ms
43,016 KB
testcase_03 AC 163 ms
42,852 KB
testcase_04 AC 50 ms
36,864 KB
testcase_05 AC 52 ms
37,296 KB
testcase_06 AC 51 ms
36,992 KB
testcase_07 AC 51 ms
37,344 KB
testcase_08 WA -
testcase_09 AC 50 ms
37,216 KB
testcase_10 AC 52 ms
36,900 KB
testcase_11 AC 51 ms
37,060 KB
testcase_12 AC 58 ms
37,120 KB
testcase_13 AC 52 ms
37,344 KB
testcase_14 AC 58 ms
37,424 KB
testcase_15 AC 102 ms
39,648 KB
testcase_16 AC 63 ms
38,552 KB
testcase_17 AC 56 ms
37,472 KB
testcase_18 AC 86 ms
39,060 KB
testcase_19 AC 138 ms
41,344 KB
testcase_20 AC 57 ms
37,524 KB
testcase_21 AC 68 ms
39,860 KB
testcase_22 AC 60 ms
38,388 KB
testcase_23 AC 54 ms
37,324 KB
testcase_24 AC 120 ms
40,260 KB
testcase_25 AC 144 ms
41,876 KB
testcase_26 AC 64 ms
37,552 KB
testcase_27 AC 110 ms
40,932 KB
testcase_28 AC 66 ms
38,496 KB
testcase_29 AC 53 ms
37,140 KB
testcase_30 AC 83 ms
38,932 KB
testcase_31 AC 91 ms
39,616 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.*;
import java.io.*;

public class Main {
    static FastScanner sc = new FastScanner(System.in);
    static PrintWriter pw = new PrintWriter(System.out);
    static StringBuilder sb = new StringBuilder();

    public static void main(String[] args) throws Exception {
        if (args.length == 1 && args[0].equals("debug")) {
            FileReader filereader;
            BufferedReader is;
            String path = new File(".").getAbsoluteFile().getParent();
            String input = path + File.separator + "_debug_";
            String output = path + File.separator + "_answer_" + File.separator;
            File[] list = new File(input).listFiles();
            for (File file : list) {
                filereader = new FileReader(file);
                sc = new FastScanner(filereader);
                pw.println(file.getName());
                pw.println("----------------------------------------");
                pw.println("output");
                long start = System.currentTimeMillis();
                solve();
                if (new File(output + file.getName()).exists()) {
                    pw.println("----------------------------------------");
                    pw.println("expect");
                    filereader = new FileReader(new File(output + file.getName()));
                    is = new BufferedReader(filereader);
                    String s;
                    while ((s = is.readLine()) != null) {
                        pw.println(s);
                    }
                }
                pw.println("----------------------------------------");
                pw.println((System.currentTimeMillis() - start) + "ms\n");
            }
        } else {
            solve();
        }
        pw.flush();
    }

    public static void solve() {
        int h = sc.nextInt();
        int w = sc.nextInt();
        int x = sc.nextInt();
        char[][] map = new char[h][w];
        for(int i = 0; i < h; i++){
            for(int j = 0; j < w; j++){
                if(i % 2 == 0 && j % 2 == 0){
                    map[i][j] = '.';
                }else if(i % 2 == 1 && j % 2 == 1){
                    map[i][j] = '#';
                }else{
                    map[i][j] = '?';
                }
            }
        }
        int hmax = ((h-1)/2) % 2 == 0 ? (h+1)/2 : (h-1)/2;  
        int wmax = ((w-1)/2) % 2 == 0 ? (w+1)/2 : (w-1)/2;  
        int max = Math.max(hmax*(w-1)+(h-1),wmax*(h-1)+(w-1));
        if((h-1+w-1) > x || max < x || x % 2 != 0){
            pw.println(-1);
            return;
        }else{
            int rem = x - (h-1+w-1);
            if(rem % 4 != 0){
                pw.println(-1);
                return;
            }
            if(hmax*(w-1)+(h-1) >= wmax*(h-1)+(w-1)){
                int j = 0;
                for(int i = 0; i < h; i++){
                    if(i == h-1){
                        for(int k = 0; k < w; k++){
                            if(map[i][k] != '?') continue;
                            map[i][k] = '.';
                        }
                    }else if(i % 2 != 0){
                        for(int k = 0; k < w; k++){
                            if(map[i][k] != '?') continue;
                            if(k != j){
                                map[i][k] = '#';
                            }else{
                                map[i][k] = '.';
                            }
                        }
                    }else{
                        int next = Math.min(rem/2,Math.max(w-1-j,j));
                        if(j+next < w && (i/2) % 2 == 0){
                            for(int k = 0; k < w; k++){
                                map[i][k] = '.';
                            }
                            j += next;
                        }else{
                            for(int k = 0; k < w; k++){
                                map[i][k] = '.';
                            }
                            j -= next;
                            rem -= next*2;
                        }
                    }
                }
            }else{
                int i = 0;
                for(int j = 0; j < w; j++){
                    if(j == w-1){
                        for(int k = 0; k < h; k++){
                            if(map[k][j] != '?') continue;
                            map[k][j] = '.';
                        }
                    }else if(j % 2 != 0){
                        for(int k = 0; k < h; k++){
                            if(map[k][j] != '?') continue;
                            if(k != i){
                                map[k][j] = '#';
                            }else{
                                map[k][j] = '.';
                            }
                        }
                    }else{
                        int next = Math.min(rem/2,Math.max(h-1-i,i));
                        for(int k = 0; k < h; k++){
                            map[k][j] = '.';
                        }
                        if(i+next < h && (j/2) % 2 == 0){
                            i += next;
                        }else{
                            i -= next;
                            rem -= next*2;
                        }
                    }
                }
            }
        }
        for(int i = 0; i < h; i++) pw.println(new String(map[i]));
    }

    static class GeekInteger {
        public static void save_sort(int[] array) {
            shuffle(array);
            Arrays.sort(array);
        }

        public static int[] shuffle(int[] array) {
            int n = array.length;
            Random random = new Random();
            for (int i = 0, j; i < n; i++) {
                j = i + random.nextInt(n - i);
                int randomElement = array[j];
                array[j] = array[i];
                array[i] = randomElement;
            }
            return array;
        }

        public static void save_sort(long[] array) {
            shuffle(array);
            Arrays.sort(array);
        }

        public static long[] shuffle(long[] array) {
            int n = array.length;
            Random random = new Random();
            for (int i = 0, j; i < n; i++) {
                j = i + random.nextInt(n - i);
                long randomElement = array[j];
                array[j] = array[i];
                array[i] = randomElement;
            }
            return array;
        }
    }
}

class FastScanner {
    private BufferedReader reader = null;
    private StringTokenizer tokenizer = null;

    public FastScanner(InputStream in) {
        reader = new BufferedReader(new InputStreamReader(in));
        tokenizer = null;
    }

    public FastScanner(FileReader in) {
        reader = new BufferedReader(in);
        tokenizer = null;
    }

    public String next() {
        if (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                tokenizer = new StringTokenizer(reader.readLine());
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken();
    }

    public String nextLine() {
        if (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                return reader.readLine();
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken("\n");
    }

    public long nextLong() {
        return Long.parseLong(next());
    }

    public int nextInt() {
        return Integer.parseInt(next());
    }

    public double nextDouble() {
        return Double.parseDouble(next());
    }

    public String[] nextArray(int n) {
        String[] a = new String[n];
        for (int i = 0; i < n; i++)
            a[i] = next();
        return a;
    }

    public int[] nextIntArray(int n) {
        int[] a = new int[n];
        for (int i = 0; i < n; i++)
            a[i] = nextInt();
        return a;
    }

    public long[] nextLongArray(int n) {
        long[] a = new long[n];
        for (int i = 0; i < n; i++)
            a[i] = nextLong();
        return a;
    }
}
0