結果
問題 | No.365 ジェンガソート |
ユーザー | MoominPaz |
提出日時 | 2016-05-15 13:16:53 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 4,169 bytes |
コンパイル時間 | 2,036 ms |
コンパイル使用メモリ | 79,064 KB |
実行使用メモリ | 62,344 KB |
最終ジャッジ日時 | 2024-10-06 03:19:40 |
合計ジャッジ時間 | 7,267 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 49 ms
56,860 KB |
testcase_01 | AC | 48 ms
49,956 KB |
testcase_02 | AC | 47 ms
49,840 KB |
testcase_03 | AC | 50 ms
49,680 KB |
testcase_04 | AC | 48 ms
50,076 KB |
testcase_05 | AC | 48 ms
49,900 KB |
testcase_06 | AC | 47 ms
49,704 KB |
testcase_07 | AC | 47 ms
50,076 KB |
testcase_08 | AC | 49 ms
49,968 KB |
testcase_09 | AC | 47 ms
50,080 KB |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | AC | 46 ms
49,884 KB |
testcase_15 | AC | 46 ms
50,072 KB |
testcase_16 | WA | - |
testcase_17 | TLE | - |
testcase_18 | -- | - |
testcase_19 | -- | - |
testcase_20 | -- | - |
testcase_21 | -- | - |
testcase_22 | -- | - |
testcase_23 | -- | - |
testcase_24 | -- | - |
testcase_25 | -- | - |
testcase_26 | -- | - |
testcase_27 | -- | - |
testcase_28 | -- | - |
testcase_29 | -- | - |
testcase_30 | -- | - |
testcase_31 | -- | - |
testcase_32 | -- | - |
testcase_33 | -- | - |
testcase_34 | -- | - |
testcase_35 | -- | - |
testcase_36 | -- | - |
testcase_37 | -- | - |
testcase_38 | -- | - |
testcase_39 | -- | - |
testcase_40 | -- | - |
ソースコード
import java.io.IOException; import java.io.InputStream; import java.util.ArrayList; import java.util.Collections; import java.util.List; import java.util.NoSuchElementException; public class Main { FastScanner fs = new FastScanner(); public static void main(String[] args) { new Main().solve(); } void solve() { int N = fs.nextInt(); List<Integer> a = new ArrayList<>(); //List<Integer> sorta = new ArrayList<>(); int Count = 0; int nowIndex = 0; int nowNumber = 0; boolean endFlg = true; for (int i = 0; i < N; i++) { a.add(fs.nextInt()); // sorta.add(a.get(i)); if(a.get(i) != i + 1) { endFlg = false; } } if(a.size() == 1 || endFlg == true) { System.out.println(0); return; } //Collections.sort(sorta); if(a.get(0) == 1) { nowNumber = a.get(a.size() - 2); } else { nowNumber = a.get(0) - 1; } while(true) { if(a.get(nowIndex) == nowNumber) { int Temp = a.get(nowIndex); a.remove(nowIndex); a.add(0, Temp); nowIndex = 0; nowNumber--; Count++; } else { nowIndex++; } if(nowIndex == N) { break; } } System.out.println(Count); } } 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 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(); } } public int nextInt() { if (!hasNext()) throw new NoSuchElementException(); int 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(); } } }