結果

問題 No.565 回転拡大
ユーザー hiromi_ayasehiromi_ayase
提出日時 2017-09-08 23:59:38
言語 Java21
(openjdk 21)
結果
AC  
実行時間 84 ms / 2,000 ms
コード長 3,470 bytes
コンパイル時間 2,585 ms
コンパイル使用メモリ 81,428 KB
実行使用メモリ 38,492 KB
最終ジャッジ日時 2024-11-07 12:25:35
合計ジャッジ時間 6,291 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 81 ms
37,952 KB
testcase_01 AC 79 ms
38,020 KB
testcase_02 AC 79 ms
37,936 KB
testcase_03 AC 78 ms
38,180 KB
testcase_04 AC 80 ms
38,492 KB
testcase_05 AC 78 ms
38,332 KB
testcase_06 AC 79 ms
38,448 KB
testcase_07 AC 82 ms
37,972 KB
testcase_08 AC 83 ms
38,024 KB
testcase_09 AC 77 ms
38,228 KB
testcase_10 AC 80 ms
38,104 KB
testcase_11 AC 78 ms
38,260 KB
testcase_12 AC 82 ms
37,984 KB
testcase_13 AC 75 ms
38,068 KB
testcase_14 AC 77 ms
38,476 KB
testcase_15 AC 81 ms
38,448 KB
testcase_16 AC 79 ms
38,100 KB
testcase_17 AC 79 ms
38,288 KB
testcase_18 AC 76 ms
38,068 KB
testcase_19 AC 82 ms
38,116 KB
testcase_20 AC 78 ms
38,216 KB
testcase_21 AC 78 ms
38,100 KB
testcase_22 AC 79 ms
38,320 KB
testcase_23 AC 78 ms
38,316 KB
testcase_24 AC 82 ms
38,364 KB
testcase_25 AC 82 ms
38,244 KB
testcase_26 AC 79 ms
38,100 KB
testcase_27 AC 81 ms
38,088 KB
testcase_28 AC 79 ms
37,984 KB
testcase_29 AC 84 ms
38,356 KB
testcase_30 AC 77 ms
38,236 KB
testcase_31 AC 76 ms
37,976 KB
testcase_32 AC 75 ms
38,372 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

public class Main {
  private static void solve() {
    int r = ni();
    int k = ni();
    int h = ni();
    int w = ni();
    
    char[][] map = new char[h][w];
    for (int i = 0; i < h; i ++) {
      map[i] = ns();
    }
    
    r /= 90;
    

    for (int i = 0; i < r; i ++) {
      map = rotate(map);
    }
    map = scale(map, k);
    for (int i = 0; i < map.length; i ++) {
      System.out.println(map[i]);
    }
  }
  
  private static char[][] rotate(char[][] src) {
    int h = src.length;
    int w = src[0].length;
    char[][] ret = new char[w][h];
    for (int i = 0; i < h; i ++) {
      for (int j = 0; j < w; j ++) {
            ret[j][h - i - 1] = src[i][j];
      }
    }
    return ret;
    
  }

  private static char[][] scale(char[][] src, int k) {
    int h = src.length;
    int w = src[0].length;

    char[][] ret = new char[h * k][w * k];
    for (int i = 0; i < h; i ++) {
      for (int j = 0; j < w; j ++) {
        for (int x = 0; x < k ; x ++) {
          for (int y = 0; y < k; y ++) {
            ret[i * k + x][j * k + y] = src[i][j];
          }
        }
      }
    }
    return ret;
  }

  public static void main(String[] args) {
    new Thread(null, new Runnable() {
      @Override
      public void run() {
        long start = System.currentTimeMillis();
        String debug = System.getProperty("debug");
        if (debug != null) {
          try {
            is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug));
          } catch (Exception e) {
            throw new RuntimeException(e);
          }
        }
        reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768);
        solve();
        out.flush();
        tr((System.currentTimeMillis() - start) + "ms");
      }
    }, "", 64000000).start();
  }

  private static java.io.InputStream is = System.in;
  private static java.io.PrintWriter out = new java.io.PrintWriter(System.out);
  private static java.util.StringTokenizer tokenizer = null;
  private static java.io.BufferedReader reader;

  public static String next() {
    while (tokenizer == null || !tokenizer.hasMoreTokens()) {
      try {
        tokenizer = new java.util.StringTokenizer(reader.readLine());
      } catch (Exception e) {
        throw new RuntimeException(e);
      }
    }
    return tokenizer.nextToken();
  }

  private static double nd() {
    return Double.parseDouble(next());
  }

  private static long nl() {
    return Long.parseLong(next());
  }

  private static int[] na(int n) {
    int[] a = new int[n];
    for (int i = 0; i < n; i++)
      a[i] = ni();
    return a;
  }

  private static char[] ns() {
    return next().toCharArray();
  }

  private static long[] nal(int n) {
    long[] a = new long[n];
    for (int i = 0; i < n; i++)
      a[i] = ni();
    return a;
  }

  private static int[][] ntable(int n, int m) {
    int[][] table = new int[n][m];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[i][j] = ni();
      }
    }
    return table;
  }

  private static int[][] nlist(int n, int m) {
    int[][] table = new int[m][n];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[j][i] = ni();
      }
    }
    return table;
  }

  private static int ni() {
    return Integer.parseInt(next());
  }

  private static void tr(Object... o) {
    if (is != System.in)
      System.out.println(java.util.Arrays.deepToString(o));
  }
}
0