結果

問題 No.1831 Parasol
ユーザー shojin_proshojin_pro
提出日時 2022-02-04 23:39:17
言語 Java21
(openjdk 21)
結果
AC  
実行時間 136 ms / 2,000 ms
コード長 4,143 bytes
コンパイル時間 2,532 ms
コンパイル使用メモリ 79,068 KB
実行使用メモリ 52,844 KB
最終ジャッジ日時 2024-06-11 13:02:40
合計ジャッジ時間 5,391 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 49 ms
50,528 KB
testcase_01 AC 136 ms
52,844 KB
testcase_02 AC 50 ms
50,192 KB
testcase_03 AC 50 ms
50,444 KB
testcase_04 AC 136 ms
52,780 KB
testcase_05 AC 50 ms
50,128 KB
testcase_06 AC 53 ms
50,504 KB
testcase_07 AC 129 ms
52,268 KB
testcase_08 AC 51 ms
50,504 KB
testcase_09 AC 50 ms
50,292 KB
testcase_10 AC 123 ms
52,392 KB
testcase_11 AC 134 ms
52,824 KB
testcase_12 AC 100 ms
51,776 KB
testcase_13 AC 134 ms
52,548 KB
testcase_14 AC 75 ms
50,876 KB
testcase_15 AC 82 ms
51,808 KB
testcase_16 AC 51 ms
50,300 KB
testcase_17 AC 51 ms
50,632 KB
testcase_18 AC 83 ms
51,020 KB
testcase_19 AC 51 ms
50,496 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.*;
import java.io.*;

public class Main {
    static FastScanner sc = new FastScanner(System.in);
    static PrintWriter pw = new PrintWriter(System.out);
    static StringBuilder sb = new StringBuilder();
    static long mod = (long) 1e9 + 7;

    public static void main(String[] args) throws Exception {
        solve();
        pw.flush();
    }

    public static void solve() {
        int N = sc.nextInt();
        int patch = N*2-1;
        int[][] ans = new int[N][patch];
        for(int i = 0; i < N-1; i++){
            int now = patch-i;
            int cnt = now;
            for(int j = 0; j < patch; j++){
                ans[i][j] = now;
                cnt--;
                if(cnt == 0){
                    now = N;
                }else if(cnt < 0){
                    now--;
                }
            }
        }
        int now = 1;
        for(int j = 0; j < patch; j++){
            if(j < N){
                ans[N-1][j] = now;
                now++;
            }else{
                ans[N-1][j] = N-(j-N);
            }
        }
        pw.println(patch);
        for(int i = 0; i < patch; i++){
            for(int j = 0; j < N; j++){
                sb.append(ans[j][i]).append(" ");
            }
            pw.println(sb.toString());
            sb.setLength(0);
        }
    }

    static class GeekInteger {
        public static void save_sort(int[] array) {
            shuffle(array);
            Arrays.sort(array);
        }

        public static int[] shuffle(int[] array) {
            int n = array.length;
            Random random = new Random();
            for (int i = 0, j; i < n; i++) {
                j = i + random.nextInt(n - i);
                int randomElement = array[j];
                array[j] = array[i];
                array[i] = randomElement;
            }
            return array;
        }

        public static void save_sort(long[] array) {
            shuffle(array);
            Arrays.sort(array);
        }

        public static long[] shuffle(long[] array) {
            int n = array.length;
            Random random = new Random();
            for (int i = 0, j; i < n; i++) {
                j = i + random.nextInt(n - i);
                long randomElement = array[j];
                array[j] = array[i];
                array[i] = randomElement;
            }
            return array;
        }

    }
}

class FastScanner {
    private BufferedReader reader = null;
    private StringTokenizer tokenizer = null;

    public FastScanner(InputStream in) {
        reader = new BufferedReader(new InputStreamReader(in));
        tokenizer = null;
    }

    public FastScanner(FileReader in) {
        reader = new BufferedReader(in);
        tokenizer = null;
    }

    public String next() {
        if (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                tokenizer = new StringTokenizer(reader.readLine());
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken();
    }

    public String nextLine() {
        if (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                return reader.readLine();
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken("\n");
    }

    public long nextLong() {
        return Long.parseLong(next());
    }

    public int nextInt() {
        return Integer.parseInt(next());
    }

    public double nextDouble() {
        return Double.parseDouble(next());
    }

    public String[] nextArray(int n) {
        String[] a = new String[n];
        for (int i = 0; i < n; i++)
            a[i] = next();
        return a;
    }

    public int[] nextIntArray(int n) {
        int[] a = new int[n];
        for (int i = 0; i < n; i++)
            a[i] = nextInt();
        return a;
    }

    public long[] nextLongArray(int n) {
        long[] a = new long[n];
        for (int i = 0; i < n; i++)
            a[i] = nextLong();
        return a;
    }
}
0