結果

問題 No.2748 Strange Clock
ユーザー Yu_212Yu_212
提出日時 2024-04-21 12:14:32
言語 Java21
(openjdk 21)
結果
TLE  
実行時間 -
コード長 10,613 bytes
コンパイル時間 2,973 ms
コンパイル使用メモリ 102,224 KB
実行使用メモリ 322,568 KB
最終ジャッジ日時 2024-10-13 10:39:09
合計ジャッジ時間 16,971 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 58 ms
42,620 KB
testcase_01 AC 56 ms
37,384 KB
testcase_02 AC 57 ms
37,448 KB
testcase_03 AC 57 ms
36,776 KB
testcase_04 AC 56 ms
37,204 KB
testcase_05 AC 57 ms
37,560 KB
testcase_06 AC 57 ms
37,496 KB
testcase_07 AC 57 ms
36,912 KB
testcase_08 AC 59 ms
36,936 KB
testcase_09 AC 58 ms
36,976 KB
testcase_10 AC 62 ms
37,504 KB
testcase_11 AC 62 ms
37,588 KB
testcase_12 AC 75 ms
38,960 KB
testcase_13 AC 85 ms
39,352 KB
testcase_14 AC 108 ms
40,644 KB
testcase_15 AC 97 ms
40,620 KB
testcase_16 AC 120 ms
42,904 KB
testcase_17 AC 129 ms
45,648 KB
testcase_18 AC 208 ms
49,588 KB
testcase_19 AC 211 ms
49,576 KB
testcase_20 AC 459 ms
62,888 KB
testcase_21 AC 453 ms
63,484 KB
testcase_22 AC 1,000 ms
101,380 KB
testcase_23 AC 1,001 ms
101,428 KB
testcase_24 TLE -
testcase_25 TLE -
testcase_26 TLE -
testcase_27 -- -
testcase_28 -- -
testcase_29 -- -
testcase_30 -- -
testcase_31 -- -
testcase_32 -- -
testcase_33 -- -
testcase_34 -- -
testcase_35 -- -
testcase_36 -- -
testcase_37 -- -
testcase_38 -- -
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

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;

    int n;
    void solve() {
        n = in.nextInt();
        long m = in.nextLong();
        long p3 = pow(3, n);
        long p4 = pow(4, n);
        long p6 = pow(6, n);
        long p12 = pow(12, n);
        Map<Long, TreeSet<Long>> mp = new HashMap<>();
        for (long v3 = 0; v3 < p3; v3++) {
            long v4 = conv(v3, 4);
            long v6 = conv(v3, 6);
            long v12 = crt(v3, p3, v4, p4)[0];
            long diff = (v12 % p6 + p6 - v6) % p6;
            mp.computeIfAbsent(diff, key -> new TreeSet<>()).add(v12);
        }
        long ans = 0;
        for (Map.Entry<Long, TreeSet<Long>> entry : mp.entrySet()) {
            TreeSet<Long> ts = entry.getValue();
            long last = ts.last() - p12;
            for (long v : ts) {
                if (v - m > last) {
                    ans++;
                }
                last = v;
            }
        }
        out.println(ans);
    }

    public long[] crt(long r1, long m1, long r2, long m2) {
        long[] dpq = extgcd(m1, m2);
        if ((r2 - r1) % dpq[0] != 0) {
            return null;
        }
        long m = m1 / dpq[0] * m2;
        long temp = (r2 - r1) / dpq[0] * dpq[1] % (m2 / dpq[0]);
        long r = ((r1 + m1 * temp) % m + m) % m;
        return new long[] {r, m};
    }

    public long[] extgcd(long a, long b) {
        long x0 = 1, x1 = 0, y0 = 0, y1 = 1;
        while (b != 0) {
            long q = a / b;
            long r = a % b;
            long x2 = x0 - q * x1;
            long y2 = y0 - q * y1;
            a = b;
            b = r;
            x0 = x1;
            x1 = x2;
            y0 = y1;
            y1 = y2;
        }
        return new long[] {a, x0, y0};
    }

    long conv(long v, int c) {
        long r = 0;
        long pc = 1;
        for (int i = 0; i < n; i++) {
            r += v % 3 * pc;
            pc *= c;
            v /= 3;
        }
        return r;
    }

    public long pow(long a, long b) {
        long x = 1;
        while (b > 0) {
            if ((b & 1) == 1) {
                x = x * a;
            }
            a = a * a;
            b >>= 1;
        }
        return x;
    }

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

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