#737042 (Java21) No.1831 Parasol

• 問題: No.1831 Parasol
• ユーザー: shojin_pro
• 提出日時: 2022-02-04 23:10:06
• 言語: Java21 (openjdk 21)
• 結果: WA
• 実行時間: -
• コード長: 4,848 bytes
• コンパイル時間: 3,955 ms
• コンパイル使用メモリ: 92,600 KB
• 実行使用メモリ: 62,852 KB
• 最終ジャッジ日時: 2024-06-11 12:44:33
• 合計ジャッジ時間: 9,992 ms
• ジャッジサーバーID （参考情報）: judge1 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	WA	-
testcase_01	WA	-
testcase_02	WA	-
testcase_03	WA	-
testcase_04	WA	-
testcase_05	WA	-
testcase_06	WA	-
testcase_07	WA	-
testcase_08	WA	-
testcase_09	WA	-
testcase_10	WA	-
testcase_11	WA	-
testcase_12	WA	-
testcase_13	WA	-
testcase_14	WA	-
testcase_15	WA	-
testcase_16	WA	-
testcase_17	WA	-
testcase_18	WA	-
testcase_19	AC	69 ms; 38,512 KB

ソースコード

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 total = N*patch;
        int[] arr = new int[patch+1];
        for(int i = 0; i <= patch; i++){
            arr[i] = i;
        }
        ArrayList<String> ans = new ArrayList<>();
        for(int i = 1; i <= patch; i++){
            for(int j = patch; j >= 1; j--){
                for(int k = patch; k >= 1; k--){
                    if(arr[i] == 0 || arr[j] == 0 || arr[k] == 0 || i == j || j == k || k == i){
                        continue;
                    }
                    total-=3;
                    arr[i]--;
                    arr[j]--;
                    arr[k]--;
                    ans.add(i + " " + j + " " + k);
                    if(arr[i] == 0 || arr[j] == 0) break;
                }
                if(arr[i] == 0) break;
            }
        }
        if(total >= 3){
            ArrayList<Integer> rem = new ArrayList<>();
            for(int i = 1; i <= patch; i++){
                if(arr[i] != 0) rem.add(i);
            }
            if(rem.size() >= 3){
                ans.add(rem.get(0) + " " + rem.get(1) + " " + rem.get(2));
            }
        }
        pw.println(ans.size());
        for(String s : ans) pw.println(s);
    }

    public static int quest(int v) {
        sb.append("?").append(" ").append(v);
        System.out.println(sb.toString());
        sb.setLength(0);
        return sc.nextInt();
    }

    public static void answer(int v1, int v2) {
        sb.append("!").append(" ").append(v1).append(" ").append(v2);
        System.out.println(sb.toString());
        sb.setLength(0);
        return;
    }

    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;
    }
}