結果
問題 | No.366 ロボットソート |
ユーザー | uwi |
提出日時 | 2016-04-29 22:22:33 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 59 ms / 2,000 ms |
コード長 | 3,153 bytes |
コンパイル時間 | 3,634 ms |
コンパイル使用メモリ | 78,048 KB |
実行使用メモリ | 51,064 KB |
最終ジャッジ日時 | 2023-08-28 15:02:43 |
合計ジャッジ時間 | 5,471 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 41 ms
49,228 KB |
testcase_01 | AC | 40 ms
49,548 KB |
testcase_02 | AC | 40 ms
49,372 KB |
testcase_03 | AC | 40 ms
49,400 KB |
testcase_04 | AC | 40 ms
49,288 KB |
testcase_05 | AC | 41 ms
49,552 KB |
testcase_06 | AC | 41 ms
49,360 KB |
testcase_07 | AC | 40 ms
49,396 KB |
testcase_08 | AC | 40 ms
49,316 KB |
testcase_09 | AC | 40 ms
49,256 KB |
testcase_10 | AC | 41 ms
49,484 KB |
testcase_11 | AC | 43 ms
49,364 KB |
testcase_12 | AC | 43 ms
49,576 KB |
testcase_13 | AC | 42 ms
49,788 KB |
testcase_14 | AC | 42 ms
49,384 KB |
testcase_15 | AC | 41 ms
49,328 KB |
testcase_16 | AC | 42 ms
49,708 KB |
testcase_17 | AC | 43 ms
49,224 KB |
testcase_18 | AC | 47 ms
49,328 KB |
testcase_19 | AC | 45 ms
49,588 KB |
testcase_20 | AC | 40 ms
49,384 KB |
testcase_21 | AC | 56 ms
51,064 KB |
testcase_22 | AC | 59 ms
51,024 KB |
ソースコード
import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.InputMismatchException; public class Q1077 { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int n = ni(), K = ni(); int[] a = na(n); int ct = 0; for(int i = 0;i < K;i++){ for(int u = 0;u < n/K+1;u++){ for(int j = i;j+K < n;j+=K){ if(a[j] > a[j+K]){ int d = a[j]; a[j] = a[j+K]; a[j+K] = d; ct++; } } } } int[] b = Arrays.copyOf(a, n); Arrays.sort(b); if(Arrays.equals(a, b)){ out.println(ct); }else{ out.println(-1); } } 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 Q1077().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))){ // when nextLine, (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)); } }