結果

問題 No.478 一般門松列列
ユーザー yuya178yuya178
提出日時 2017-11-13 20:48:38
言語 Java21
(openjdk 21)
結果
AC  
実行時間 139 ms / 2,000 ms
コード長 4,088 bytes
コンパイル時間 2,814 ms
コンパイル使用メモリ 82,668 KB
実行使用メモリ 48,168 KB
最終ジャッジ日時 2024-05-03 20:29:00
合計ジャッジ時間 7,850 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 73 ms
38,296 KB
testcase_01 AC 81 ms
38,360 KB
testcase_02 AC 76 ms
37,772 KB
testcase_03 AC 71 ms
38,180 KB
testcase_04 AC 73 ms
38,268 KB
testcase_05 AC 74 ms
37,956 KB
testcase_06 AC 74 ms
38,088 KB
testcase_07 AC 73 ms
38,356 KB
testcase_08 AC 74 ms
37,564 KB
testcase_09 AC 74 ms
38,272 KB
testcase_10 AC 73 ms
37,964 KB
testcase_11 AC 119 ms
39,112 KB
testcase_12 AC 127 ms
40,036 KB
testcase_13 AC 136 ms
39,468 KB
testcase_14 AC 138 ms
39,584 KB
testcase_15 AC 139 ms
39,628 KB
testcase_16 AC 106 ms
38,864 KB
testcase_17 AC 126 ms
39,576 KB
testcase_18 AC 124 ms
39,108 KB
testcase_19 AC 139 ms
39,708 KB
testcase_20 AC 133 ms
39,552 KB
testcase_21 AC 133 ms
38,964 KB
testcase_22 AC 115 ms
39,388 KB
testcase_23 AC 104 ms
39,424 KB
testcase_24 AC 139 ms
40,372 KB
testcase_25 AC 129 ms
48,168 KB
testcase_26 AC 104 ms
38,464 KB
testcase_27 AC 94 ms
38,756 KB
testcase_28 AC 105 ms
38,384 KB
testcase_29 AC 88 ms
38,392 KB
testcase_30 AC 127 ms
39,892 KB
testcase_31 AC 127 ms
39,184 KB
testcase_32 AC 110 ms
39,240 KB
testcase_33 AC 117 ms
39,240 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;
import java.math.*;
import java.awt.Point;

public class Main {
    InputStream is;
    PrintWriter out;
    String INPUT = "";

    long MOD = 1_000_000_007;
    int inf = 10000000;
    int w,h;
    char[][] board;
    boolean[][] seen;
    void solve()
    {
        int n = ni();
        int k = ni();
        for(int i = 1; i <= k+2 ; i++){
            out.print(i+" ");
        }
        for(int i = 0; i < n-k-2; i++){
            if(i==0) out.print(0+" ");
            else if(i%4==1)out.print(1000000+" ");
            else if(i%4==2)out.print(800000+" ");
            else if(i%4==3)out.print(900000+" ");
            else if(i%4==0)out.print(700000+" ");
        }

    }
   
    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 Main().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) && 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)); }

    static class ArrayUtils {
        public static void fill(double[][] array, double value) {
            for (double[] a : array) Arrays.fill(a, value);
        }
 
        public static void fill(double[][][] array, double value) {
            for (double[][] l : array) fill(l, value);
        } 
    }
}
0