結果
問題 | No.401 数字の渦巻き |
ユーザー | jp_ste |
提出日時 | 2016-08-07 12:32:54 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 168 ms / 2,000 ms |
コード長 | 4,146 bytes |
コンパイル時間 | 2,837 ms |
コンパイル使用メモリ | 84,304 KB |
実行使用メモリ | 41,980 KB |
最終ジャッジ日時 | 2024-04-24 22:05:21 |
合計ジャッジ時間 | 7,775 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 101 ms
40,780 KB |
testcase_01 | AC | 115 ms
40,900 KB |
testcase_02 | AC | 107 ms
40,900 KB |
testcase_03 | AC | 94 ms
40,264 KB |
testcase_04 | AC | 110 ms
40,092 KB |
testcase_05 | AC | 104 ms
40,924 KB |
testcase_06 | AC | 118 ms
41,028 KB |
testcase_07 | AC | 120 ms
40,992 KB |
testcase_08 | AC | 110 ms
41,240 KB |
testcase_09 | AC | 125 ms
41,180 KB |
testcase_10 | AC | 131 ms
41,332 KB |
testcase_11 | AC | 119 ms
41,224 KB |
testcase_12 | AC | 120 ms
41,104 KB |
testcase_13 | AC | 122 ms
41,700 KB |
testcase_14 | AC | 120 ms
41,536 KB |
testcase_15 | AC | 126 ms
41,312 KB |
testcase_16 | AC | 127 ms
41,408 KB |
testcase_17 | AC | 128 ms
41,096 KB |
testcase_18 | AC | 136 ms
41,272 KB |
testcase_19 | AC | 148 ms
41,336 KB |
testcase_20 | AC | 146 ms
41,640 KB |
testcase_21 | AC | 155 ms
41,716 KB |
testcase_22 | AC | 141 ms
41,504 KB |
testcase_23 | AC | 145 ms
41,912 KB |
testcase_24 | AC | 150 ms
41,764 KB |
testcase_25 | AC | 158 ms
41,632 KB |
testcase_26 | AC | 159 ms
41,596 KB |
testcase_27 | AC | 168 ms
41,796 KB |
testcase_28 | AC | 164 ms
41,896 KB |
testcase_29 | AC | 167 ms
41,980 KB |
ソースコード
import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.NoSuchElementException; public class Main { public static void main(String[] args) { FastScanner scan = new FastScanner(); PrintWriter out = new PrintWriter(System.out); final int RIGHT = 0, DOWN = 1, LEFT = 2, UP = 3; int dx[] = { 1, 0, -1, 0 }; int dy[] = { 0, 1, 0, -1 }; int direc = RIGHT; int n = scan.nextInt(); int list[][] = new int[n][n]; int nx = 0, ny = 0; int v = 1; while(true) { list[ny][nx] = v; if(v == n*n) break; v++; nx += dx[direc]; ny += dy[direc]; if(direc == RIGHT) { if(nx+1 == n || list[ny][nx+1] != 0) { direc = DOWN; } } if(direc == DOWN) { if(ny+1 == n || list[ny+1][nx] != 0) { direc = LEFT; } } if(direc == LEFT) { if(nx-1 < 0 || list[ny][nx-1] != 0) { direc = UP; } } if(direc == UP) { if(ny-1 < 0 || list[ny-1][nx] != 0) { direc = RIGHT; } } } 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(); } } } }