結果
問題 | No.401 数字の渦巻き |
ユーザー | jp_ste |
提出日時 | 2016-08-07 13:16:28 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 205 ms / 2,000 ms |
コード長 | 3,651 bytes |
コンパイル時間 | 2,349 ms |
コンパイル使用メモリ | 78,060 KB |
実行使用メモリ | 43,016 KB |
最終ジャッジ日時 | 2024-04-24 22:05:35 |
合計ジャッジ時間 | 8,188 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 110 ms
39,972 KB |
testcase_01 | AC | 132 ms
41,004 KB |
testcase_02 | AC | 123 ms
40,908 KB |
testcase_03 | AC | 128 ms
41,180 KB |
testcase_04 | AC | 127 ms
40,988 KB |
testcase_05 | AC | 130 ms
41,080 KB |
testcase_06 | AC | 118 ms
40,088 KB |
testcase_07 | AC | 137 ms
41,172 KB |
testcase_08 | AC | 139 ms
41,000 KB |
testcase_09 | AC | 148 ms
41,084 KB |
testcase_10 | AC | 139 ms
40,920 KB |
testcase_11 | AC | 150 ms
41,140 KB |
testcase_12 | AC | 145 ms
41,020 KB |
testcase_13 | AC | 160 ms
41,128 KB |
testcase_14 | AC | 157 ms
41,308 KB |
testcase_15 | AC | 155 ms
41,164 KB |
testcase_16 | AC | 156 ms
41,408 KB |
testcase_17 | AC | 167 ms
41,356 KB |
testcase_18 | AC | 158 ms
41,508 KB |
testcase_19 | AC | 177 ms
41,512 KB |
testcase_20 | AC | 173 ms
41,424 KB |
testcase_21 | AC | 170 ms
41,576 KB |
testcase_22 | AC | 174 ms
41,260 KB |
testcase_23 | AC | 177 ms
41,464 KB |
testcase_24 | AC | 179 ms
41,472 KB |
testcase_25 | AC | 192 ms
41,516 KB |
testcase_26 | AC | 186 ms
41,756 KB |
testcase_27 | AC | 191 ms
41,896 KB |
testcase_28 | AC | 196 ms
41,640 KB |
testcase_29 | AC | 205 ms
43,016 KB |
ソースコード
import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.NoSuchElementException; public class Main { public static void main(String[] args) { FastScanner scan = new FastScanner(); PrintWriter out = new PrintWriter(System.out); int dx[] = { 1, 0, -1, 0 }; int dy[] = { 0, 1, 0, -1 }; int direc = 0; int n = scan.nextInt(); int list[][] = new int[n][n]; int x = 0, y = 0; int v = 1; while(v <= n*n) { list[y][x] = v; int nx = x + dx[direc]; int ny = y + dy[direc]; if(nx >= 0 && nx < n && ny >= 0 && ny < n && list[ny][nx] == 0) { } else { direc = (direc + 1) % 4; nx = x + dx[direc]; ny = y + dy[direc]; } x = nx; y = ny; v ++; } for(int i=0; i<n; i++) { for(int j=0; j<n; j++) { if(j > 0) out.print(" "); out.printf("%03d", list[i][j]); } out.println(); } out.flush(); } static class FastScanner { private final InputStream in = System.in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; private boolean hasNextByte() { if (ptr < buflen) { return true; } else { ptr = 0; try { buflen = in.read(buffer); } catch (IOException e) { e.printStackTrace(); } if (buflen <= 0) { return false; } } return true; } private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1; } private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126; } private void skipUnprintable() { while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; } public boolean hasNext() { skipUnprintable(); return hasNextByte(); } public String next() { if (!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = readByte(); while (isPrintableChar(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public int nextInt() { return (int) nextLong(); } public long nextLong() { if (!hasNext()) throw new NoSuchElementException(); long n = 0; boolean minus = false; int b = readByte(); if (b == '-') { minus = true; b = readByte(); } if (b < '0' || '9' < b) { throw new NumberFormatException(); } while (true) { if ('0' <= b && b <= '9') { n *= 10; n += b - '0'; } else if (b == -1 || !isPrintableChar(b)) { return minus ? -n : n; } else { throw new NumberFormatException(); } b = readByte(); } } } }