結果
問題 | No.478 一般門松列列 |
ユーザー | uwi |
提出日時 | 2017-01-28 01:28:26 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 98 ms / 2,000 ms |
コード長 | 3,341 bytes |
コンパイル時間 | 3,690 ms |
コンパイル使用メモリ | 77,040 KB |
実行使用メモリ | 52,576 KB |
最終ジャッジ日時 | 2023-08-25 11:48:59 |
合計ジャッジ時間 | 8,075 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 41 ms
49,448 KB |
testcase_01 | AC | 42 ms
49,376 KB |
testcase_02 | AC | 41 ms
49,260 KB |
testcase_03 | AC | 42 ms
49,704 KB |
testcase_04 | AC | 42 ms
49,312 KB |
testcase_05 | AC | 43 ms
49,264 KB |
testcase_06 | AC | 43 ms
49,368 KB |
testcase_07 | AC | 43 ms
49,360 KB |
testcase_08 | AC | 41 ms
49,376 KB |
testcase_09 | AC | 40 ms
49,488 KB |
testcase_10 | AC | 42 ms
49,408 KB |
testcase_11 | AC | 96 ms
52,192 KB |
testcase_12 | AC | 85 ms
51,732 KB |
testcase_13 | AC | 97 ms
52,248 KB |
testcase_14 | AC | 88 ms
52,576 KB |
testcase_15 | AC | 98 ms
51,972 KB |
testcase_16 | AC | 85 ms
50,712 KB |
testcase_17 | AC | 98 ms
51,736 KB |
testcase_18 | AC | 97 ms
52,364 KB |
testcase_19 | AC | 96 ms
51,984 KB |
testcase_20 | AC | 96 ms
51,448 KB |
testcase_21 | AC | 94 ms
51,300 KB |
testcase_22 | AC | 88 ms
50,828 KB |
testcase_23 | AC | 86 ms
50,864 KB |
testcase_24 | AC | 93 ms
51,788 KB |
testcase_25 | AC | 95 ms
51,452 KB |
testcase_26 | AC | 64 ms
50,660 KB |
testcase_27 | AC | 78 ms
50,916 KB |
testcase_28 | AC | 58 ms
49,584 KB |
testcase_29 | AC | 57 ms
49,908 KB |
testcase_30 | AC | 90 ms
50,888 KB |
testcase_31 | AC | 87 ms
51,656 KB |
testcase_32 | AC | 76 ms
50,924 KB |
testcase_33 | AC | 85 ms
51,148 KB |
ソースコード
package contest170127; 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 N478 { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int o = 100000; int n = ni(), K = ni(); int last = -1; for(int i = 0;i < n-K;i++){ if(i % 2 == 0){ out.print(o+i/2); last = o+i/2; }else{ out.print(o-i/2-1); last = o-i/2-1; } out.print(" "); } for(int i = 0;i < K;i++){ out.print(last); out.print(" "); } 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"); // Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){ // @Override // public void run() { // long s = System.currentTimeMillis(); // solve(); // out.flush(); // if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // } // }; // t.start(); // t.join(); } public static void main(String[] args) throws Exception { new N478().run(); } private byte[] inbuf = new byte[1024]; public 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 int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private long[] nal(int n) { long[] a = new long[n]; for(int i = 0;i < n;i++)a[i] = nl(); return a; } 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[][] nmi(int n, int m) { int[][] map = new int[n][]; for(int i = 0;i < n;i++)map[i] = na(m); return map; } private int ni() { return (int)nl(); } 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)); } }