結果

問題 No.2742 Car Flow
ユーザー Yu_212Yu_212
提出日時 2024-04-20 13:10:56
言語 Java21
(openjdk 21)
結果
AC  
実行時間 165 ms / 2,000 ms
コード長 13,810 bytes
コンパイル時間 3,806 ms
コンパイル使用メモリ 92,216 KB
実行使用メモリ 47,712 KB
最終ジャッジ日時 2024-04-20 13:11:12
合計ジャッジ時間 11,025 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 153 ms
47,184 KB
testcase_01 AC 134 ms
47,428 KB
testcase_02 AC 144 ms
47,348 KB
testcase_03 AC 152 ms
47,632 KB
testcase_04 AC 165 ms
47,456 KB
testcase_05 AC 151 ms
47,544 KB
testcase_06 AC 154 ms
47,476 KB
testcase_07 AC 139 ms
47,336 KB
testcase_08 AC 137 ms
47,444 KB
testcase_09 AC 140 ms
47,160 KB
testcase_10 AC 120 ms
43,868 KB
testcase_11 AC 132 ms
44,368 KB
testcase_12 AC 126 ms
44,480 KB
testcase_13 AC 113 ms
44,432 KB
testcase_14 AC 107 ms
44,504 KB
testcase_15 AC 71 ms
38,044 KB
testcase_16 AC 159 ms
47,712 KB
testcase_17 AC 158 ms
47,460 KB
testcase_18 AC 82 ms
37,928 KB
testcase_19 AC 152 ms
47,060 KB
testcase_20 AC 92 ms
40,712 KB
testcase_21 AC 91 ms
40,052 KB
testcase_22 AC 148 ms
44,596 KB
testcase_23 AC 156 ms
47,140 KB
testcase_24 AC 108 ms
44,664 KB
testcase_25 AC 140 ms
46,928 KB
testcase_26 AC 153 ms
47,284 KB
testcase_27 AC 96 ms
40,852 KB
testcase_28 AC 96 ms
41,332 KB
testcase_29 AC 59 ms
37,616 KB
testcase_30 AC 135 ms
47,472 KB
testcase_31 AC 101 ms
40,052 KB
testcase_32 AC 147 ms
47,148 KB
testcase_33 AC 149 ms
44,340 KB
testcase_34 AC 104 ms
44,372 KB
testcase_35 AC 88 ms
40,204 KB
testcase_36 AC 59 ms
37,212 KB
testcase_37 AC 90 ms
40,548 KB
testcase_38 AC 141 ms
44,004 KB
testcase_39 AC 76 ms
38,772 KB
testcase_40 AC 55 ms
37,048 KB
testcase_41 AC 55 ms
37,240 KB
testcase_42 AC 81 ms
37,216 KB
testcase_43 AC 57 ms
36,856 KB
testcase_44 AC 56 ms
37,212 KB
testcase_45 AC 56 ms
37,356 KB
testcase_46 AC 56 ms
37,160 KB
testcase_47 AC 57 ms
37,092 KB
testcase_48 AC 56 ms
36,856 KB
testcase_49 AC 55 ms
37,312 KB
testcase_50 AC 55 ms
37,048 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.BufferedInputStream;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.*;
import java.util.concurrent.ThreadLocalRandom;
import java.util.function.IntUnaryOperator;
import java.util.function.LongUnaryOperator;
import java.util.stream.Collectors;
import java.util.stream.IntStream;

import static java.lang.Math.min;

public class Main {
    static In in = new In();
    static Out out = new Out(false, false);
    static final long inf = 0x1fffffffffffffffL;
    static final int iinf = 0x3fffffff;
    static final double eps = 1e-9;
    static long mod = 998244353;

    void solve() {
        int n = in.nextInt();
        int[] a = in.nextIntArray(n);
        int c0 = 0;
        for (int i = 0; i < n; i++) {
            if (a[i] == 0) {
                c0++;
            }
        }
        int c1 = n - c0;
        out.println(min(c0, c1) * Comb.inv(n) % mod);
    }

    int[] naive(int[] a) {
        int n = a.length;
        int[] b = new int[n];
        for (int i = 0; i < n; i++) {
            b[i] = (a[i] == 0 ? a[(i + n - 1) % n] == 1 : a[(i + 1) % n] == 1) ? 1 : 0;
        }
        return b;
    }

    public static void main(String... args) {
        new Main().solve();
        out.flush();
    }
}

class Comb {
    private static final int MEMO_THRESHOLD = 1000000;
    static long mod = Main.mod;
    private static final List<Long> inv = new ArrayList<>();
    private static final List<Long> fact = new ArrayList<>();
    private static final List<Long> invFact = new ArrayList<>();
    private static final Map<Long, List<Long>> pow = new HashMap<>();

    private static void buildInvTable(int n) {
        if (inv.isEmpty()) {
            inv.add(null);
            inv.add(1L);
        }
        for (int i = inv.size(); i <= n; i++) {
            inv.add(mod - inv.get((int)(mod % i)) * (mod / i) % mod);
        }
    }

    private static void buildFactTable(int n) {
        if (fact.isEmpty()) {
            fact.add(1L);
            invFact.add(1L);
        }
        for (int i = fact.size(); i <= n; i++) {
            fact.add(fact.get(i - 1) * i % mod);
            invFact.add(inv(fact.get(i)));
        }
    }

    public static void setupPowTable(long a) {
        pow.put(a, new ArrayList<>(Collections.singleton(1L)));
    }

    private static void rangeCheck(long n, long r) {
        if (n < r) {
            throw new IllegalArgumentException("n < r");
        }
        if (n < 0) {
            throw new IllegalArgumentException("n < 0");
        }
        if (r < 0) {
            throw new IllegalArgumentException("r < 0");
        }
    }

    static long fact(int n) {
        buildFactTable(n);
        return fact.get(n);
    }

    static long invFact(int n) {
        buildFactTable(n);
        return invFact.get(n);
    }

    private static long comb0(int n, int r) {
        rangeCheck(n, r);
        return fact(n) * invFact(r) % mod * invFact(n - r) % mod;
    }

    static long comb(long n, long r) {
        rangeCheck(n, r);
        if (n < MEMO_THRESHOLD) {
            return comb0((int)n, (int)r);
        }
        r = min(r, n - r);
        long x = 1, y = 1;
        for (long i = 1; i <= r; i++) {
            x = x * (n - r + i) % mod;
            y = y * i % mod;
        }
        return x * inv(y) % mod;
    }

    private static long perm0(int n, int r) {
        rangeCheck(n, r);
        return fact(n) * invFact(n - r) % mod;
    }

    static long perm(long n, long r) {
        rangeCheck(n, r);
        if (n < MEMO_THRESHOLD) {
            return perm0((int)n, (int)r);
        }
        long x = 1;
        for (long i = 1; i <= r; i++) {
            x = x * (n - r + i) % mod;
        }
        return x;
    }

    static long homo(long n, long r) {
        return r == 0 ? 1 : comb(n + r - 1, r);
    }

    private static long inv0(int a) {
        buildInvTable(a);
        return inv.get(a);
    }

    static long inv(long a) {
        if (a < MEMO_THRESHOLD) {
            return inv0((int)a);
        }
        long b = mod;
        long u = 1, v = 0;
        while (b >= 1) {
            long t = a / b;
            a -= t * b;
            u -= t * v;
            if (a < 1) {
                return (v %= mod) < 0 ? v + mod : v;
            }
            t = b / a;
            b -= t * a;
            v -= t * u;
        }
        return (u %= mod) < 0 ? u + mod : u;
    }

    static long pow(long a, long b) {
        if (pow.containsKey(a) && b < MEMO_THRESHOLD) {
            return powMemo(a, (int)b);
        }
        long x = 1;
        while (b > 0) {
            if (b % 2 == 1) {
                x = x * a % mod;
            }
            a = a * a % mod;
            b >>= 1;
        }
        return x;
    }

    static long powMemo(long a, int b) {
        List<Long> powMemo = pow.get(a);
        while (powMemo.size() <= b) {
            powMemo.add(powMemo.get(powMemo.size() - 1) * a % mod);
        }
        return powMemo.get(b);
    }

    static long sqrt(long x) {
        if (x < 2) {
            return x;
        }
        long p = (mod - 1) / 2;
        if (pow(x, p) != 1) {
            return -1;
        }
        while (true) {
            long a = ThreadLocalRandom.current().nextLong(mod);
            long w = (a * a + mod - x) % mod;
            if (pow(w, p) == 1) {
                continue;
            }
            long n = p + 1;
            long k = Long.highestOneBit(n);
            long r = 1;
            long i = 0;
            while (k > 0) {
                long nr = (r * r + i * i % mod * w) % mod;
                long ni = r * i * 2 % mod;
                r = nr;
                i = ni;
                if ((n & k) > 0) {
                    nr = (r * a + i * w) % mod;
                    ni = (i * a + r) % mod;
                    r = nr;
                    i = ni;
                }
                k >>= 1;
            }
            return min(r, mod - r);
        }
    }
}

class In {
    private final BufferedInputStream reader = new BufferedInputStream(System.in);
    private final byte[] buffer = new byte[0x10000];
    private int i = 0;
    private int length = 0;

    public int read() {
        if (i == length) {
            i = 0;
            try {
                length = reader.read(buffer);
            } catch (IOException ignored) {
            }
            if (length == -1) {
                return 0;
            }
        }
        if (length <= i) {
            throw new RuntimeException();
        }
        return buffer[i++];
    }

    public String next() {
        StringBuilder builder = new StringBuilder();
        int b = read();
        while (b < '!' || '~' < b) {
            b = read();
        }
        while ('!' <= b && b <= '~') {
            builder.appendCodePoint(b);
            b = read();
        }
        return builder.toString();
    }

    public String nextLine() {
        StringBuilder builder = new StringBuilder();
        int b = read();
        while (b != 0 && b != '\r' && b != '\n') {
            builder.appendCodePoint(b);
            b = read();
        }
        if (b == '\r') {
            read();
        }
        return builder.toString();
    }

    public int nextInt() {
        long val = nextLong();
        if (val < Integer.MIN_VALUE || Integer.MAX_VALUE < val) {
            throw new NumberFormatException();
        }
        return (int)val;
    }

    public long nextLong() {
        int b = read();
        while (b < '!' || '~' < b) {
            b = read();
        }
        boolean neg = false;
        if (b == '-') {
            neg = true;
            b = read();
        }
        long n = 0;
        int c = 0;
        while ('0' <= b && b <= '9') {
            n = n * 10 + b - '0';
            b = read();
            c++;
        }
        if (c == 0 || c >= 2 && n == 0) {
            throw new NumberFormatException();
        }
        return neg ? -n : n;
    }

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

    public char[] nextCharArray() {
        return next().toCharArray();
    }

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

    public char[][] nextCharMatrix(int n, int m) {
        char[][] a = new char[n][m];
        for (int i = 0; i < n; i++) {
            a[i] = next().toCharArray();
        }
        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 int[] nextIntArray(int n, IntUnaryOperator op) {
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = op.applyAsInt(nextInt());
        }
        return a;
    }

    public int[][] nextIntMatrix(int h, int w) {
        int[][] a = new int[h][w];
        for (int i = 0; i < h; i++) {
            a[i] = nextIntArray(w);
        }
        return a;
    }

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

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

    public long[][] nextLongMatrix(int h, int w) {
        long[][] a = new long[h][w];
        for (int i = 0; i < h; i++) {
            a[i] = nextLongArray(w);
        }
        return a;
    }

    public List<List<Integer>> nextGraph(int n, int m, boolean directed) {
        List<List<Integer>> res = new ArrayList<>();
        for (int i = 0; i < n; i++) {
            res.add(new ArrayList<>());
        }
        for (int i = 0; i < m; i++) {
            int u = nextInt() - 1;
            int v = nextInt() - 1;
            res.get(u).add(v);
            if (!directed) {
                res.get(v).add(u);
            }
        }
        return res;
    }
}

class Out {
    private final PrintWriter out = new PrintWriter(System.out);
    private final PrintWriter err = new PrintWriter(System.err);
    public boolean autoFlush;
    public boolean enableDebug;

    public Out(boolean autoFlush, boolean enableDebug) {
        this.autoFlush = autoFlush;
        this.enableDebug = enableDebug;
    }

    public void debug(Object... args) {
        if (!enableDebug) {
            return;
        }
        if (args == null || args.getClass() != Object[].class) {
            args = new Object[] {args};
        }
        err.println(Arrays.stream(args).map(obj -> format(obj, true)).collect(Collectors.joining(" ")));
        err.flush();
    }

    private String format(Object obj, boolean canMultiline) {
        if (obj == null) return "null";
        Class<?> clazz = obj.getClass();
        if (clazz == Double.class) return String.format("%.10f", obj);
        if (clazz == int[].class) return Arrays.toString((int[])obj);
        if (clazz == long[].class) return Arrays.toString((long[])obj);
        if (clazz == char[].class) return String.valueOf((char[])obj);
        if (clazz == boolean[].class) return IntStream.range(0, ((boolean[])obj).length).mapToObj(i -> ((boolean[])obj)[i] ? "1" : "0").collect(Collectors.joining());
        if (clazz == double[].class) return Arrays.toString(Arrays.stream((double[])obj).mapToObj(a -> format(a, false)).toArray());
        if (canMultiline && clazz.isArray() && clazz.componentType().isArray()) return Arrays.stream((Object[])obj).map(a -> format(a, false)).collect(Collectors.joining("\n"));
        if (clazz == Object[].class) return Arrays.toString(Arrays.stream((Object[])obj).map(a -> format(a, false)).toArray());
        if (clazz.isArray()) return Arrays.toString((Object[])obj);
        return String.valueOf(obj);
    }

    public void println(Object... args) {
        if (args == null || args.getClass() != Object[].class) {
            args = new Object[] {args};
        }
        out.println(Arrays.stream(args)
                .map(obj -> obj instanceof Double ? String.format("%.10f", obj) : String.valueOf(obj))
                .collect(Collectors.joining(" ")));
        if (autoFlush) {
            out.flush();
        }
    }

    public void println(char a) {
        out.println(a);
        if (autoFlush) {
            out.flush();
        }
    }

    public void println(int a) {
        out.println(a);
        if (autoFlush) {
            out.flush();
        }
    }

    public void println(long a) {
        out.println(a);
        if (autoFlush) {
            out.flush();
        }
    }

    public void println(double a) {
        out.println(String.format("%.10f", a));
        if (autoFlush) {
            out.flush();
        }
    }

    public void println(String s) {
        out.println(s);
        if (autoFlush) {
            out.flush();
        }
    }

    public void println(char[] s) {
        out.println(String.valueOf(s));
        if (autoFlush) {
            out.flush();
        }
    }

    public void println(int[] a) {
        StringJoiner joiner = new StringJoiner(" ");
        for (int i : a) {
            joiner.add(Integer.toString(i));
        }
        out.println(joiner);
        if (autoFlush) {
            out.flush();
        }
    }

    public void println(long[] a) {
        StringJoiner joiner = new StringJoiner(" ");
        for (long i : a) {
            joiner.add(Long.toString(i));
        }
        out.println(joiner);
        if (autoFlush) {
            out.flush();
        }
    }

    public void flush() {
        err.flush();
        out.flush();
    }
}
0