結果

問題 No.401 数字の渦巻き
ユーザー yuya178yuya178
提出日時 2017-11-25 23:36:57
言語 Java21
(openjdk 21)
結果
AC  
実行時間 206 ms / 2,000 ms
コード長 4,411 bytes
コンパイル時間 2,473 ms
コンパイル使用メモリ 87,076 KB
実行使用メモリ 45,004 KB
最終ジャッジ日時 2024-05-05 12:44:24
合計ジャッジ時間 8,118 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 116 ms
40,928 KB
testcase_01 AC 117 ms
40,808 KB
testcase_02 AC 116 ms
40,740 KB
testcase_03 AC 119 ms
40,940 KB
testcase_04 AC 118 ms
40,928 KB
testcase_05 AC 131 ms
40,028 KB
testcase_06 AC 125 ms
39,792 KB
testcase_07 AC 143 ms
40,964 KB
testcase_08 AC 138 ms
40,752 KB
testcase_09 AC 137 ms
40,864 KB
testcase_10 AC 139 ms
41,036 KB
testcase_11 AC 141 ms
41,352 KB
testcase_12 AC 140 ms
41,024 KB
testcase_13 AC 141 ms
41,072 KB
testcase_14 AC 142 ms
41,276 KB
testcase_15 AC 150 ms
41,320 KB
testcase_16 AC 149 ms
41,508 KB
testcase_17 AC 152 ms
41,428 KB
testcase_18 AC 155 ms
41,220 KB
testcase_19 AC 165 ms
41,272 KB
testcase_20 AC 165 ms
41,496 KB
testcase_21 AC 164 ms
41,304 KB
testcase_22 AC 182 ms
41,584 KB
testcase_23 AC 174 ms
41,856 KB
testcase_24 AC 186 ms
41,568 KB
testcase_25 AC 176 ms
41,884 KB
testcase_26 AC 191 ms
41,620 KB
testcase_27 AC 189 ms
41,724 KB
testcase_28 AC 179 ms
41,716 KB
testcase_29 AC 206 ms
45,004 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;
import java.math.*;
import java.awt.Point;

public class Main {
    InputStream is;
    PrintWriter out;
    String INPUT = "";
    void solve()
    {
        int n = ni();
        int[][] board = new int[n][n];
        boolean[][] seen = new boolean[n][n];
        int[] dx = {0,1,0,-1};
        int[] dy = {1,0,-1,0};
        int x = 0;
        int y = 0;
        int k = 0;
        int m = 0;
        while(true){
            board[x][y] = k;
            seen[x][y] = true;
            if(k==n*n-1) break;
            k++;
            x += dx[m];
            y += dy[m];
            if(x<0||x>n-1||y<0||y>n-1||seen[x][y]){
                x -= dx[m];
                y -= dy[m];
                m++;
                m%=4;
                x += dx[m];
                y += dy[m];
            }
        }
        for(int i = 0; i < n; i++){
            for(int j = 0; j < n; j++){
                out.print(String.format("%03d ", board[i][j]+1));
            }
            out.println();
        }
    }

    
    void run() throws Exception
    {
        is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
        out = new PrintWriter(System.out);
        
        long s = System.currentTimeMillis();
        solve();
        out.flush();
        if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
    }
    
    public static void main(String[] args) throws Exception { new Main().run(); }
    
    private byte[] inbuf = new byte[1024];
    private int lenbuf = 0, ptrbuf = 0;
    
    private int readByte()
    {
        if(lenbuf == -1)throw new InputMismatchException();
        if(ptrbuf >= lenbuf){
            ptrbuf = 0;
            try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
            if(lenbuf <= 0)return -1;
        }
        return inbuf[ptrbuf++];
    }
    
    private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
    private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
    
    private double nd() { return Double.parseDouble(ns()); }
    private char nc() { return (char)skip(); }
    
    private String ns()
    {
        int b = skip();
        StringBuilder sb = new StringBuilder();
        while(!(isSpaceChar(b) && b != ' ')){
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    
    private char[] ns(int n)
    {
        char[] buf = new char[n];
        int b = skip(), p = 0;
        while(p < n && !(isSpaceChar(b))){
            buf[p++] = (char)b;
            b = readByte();
        }
        return n == p ? buf : Arrays.copyOf(buf, p);
    }
    
    private char[][] nm(int n, int m)
    {
        char[][] map = new char[n][];
        for(int i = 0;i < n;i++)map[i] = ns(m);
        return map;
    }
    
    private int[] na(int n)
    {
        int[] a = new int[n];
        for(int i = 0;i < n;i++)a[i] = ni();
        return a;
    }
    
    private int ni()
    {
        int num = 0, b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-'){
            minus = true;
            b = readByte();
        }
        
        while(true){
            if(b >= '0' && b <= '9'){
                num = num * 10 + (b - '0');
            }else{
                return minus ? -num : num;
            }
            b = readByte();
        }
    }
    
    private long nl()
    {
        long num = 0;
        int b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-'){
            minus = true;
            b = readByte();
        }
        
        while(true){
            if(b >= '0' && b <= '9'){
                num = num * 10 + (b - '0');
            }else{
                return minus ? -num : num;
            }
            b = readByte();
        }
    }
    
    private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }

    static class ArrayUtils {
        public static void fill(double[][] array, double value) {
            for (double[] a : array) Arrays.fill(a, value);
        }
 
        public static void fill(double[][][] array, double value) {
            for (double[][] l : array) fill(l, value);
        } 
    }
}
0