結果

問題 No.2740 Old Maid
ユーザー Yu_212Yu_212
提出日時 2024-04-20 10:52:46
言語 Java21
(openjdk 21)
結果
AC  
実行時間 379 ms / 2,000 ms
コード長 9,572 bytes
コンパイル時間 3,629 ms
コンパイル使用メモリ 96,504 KB
実行使用メモリ 62,972 KB
最終ジャッジ日時 2024-10-12 06:28:56
合計ジャッジ時間 18,606 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 340 ms
62,312 KB
testcase_01 AC 346 ms
62,624 KB
testcase_02 AC 338 ms
62,808 KB
testcase_03 AC 341 ms
62,088 KB
testcase_04 AC 351 ms
62,388 KB
testcase_05 AC 349 ms
61,892 KB
testcase_06 AC 342 ms
62,668 KB
testcase_07 AC 379 ms
62,476 KB
testcase_08 AC 341 ms
59,588 KB
testcase_09 AC 348 ms
62,664 KB
testcase_10 AC 348 ms
62,748 KB
testcase_11 AC 342 ms
62,972 KB
testcase_12 AC 283 ms
57,064 KB
testcase_13 AC 299 ms
56,252 KB
testcase_14 AC 154 ms
45,000 KB
testcase_15 AC 163 ms
46,132 KB
testcase_16 AC 230 ms
52,868 KB
testcase_17 AC 146 ms
43,172 KB
testcase_18 AC 303 ms
55,772 KB
testcase_19 AC 177 ms
45,364 KB
testcase_20 AC 315 ms
57,796 KB
testcase_21 AC 154 ms
45,800 KB
testcase_22 AC 223 ms
53,724 KB
testcase_23 AC 132 ms
42,108 KB
testcase_24 AC 173 ms
45,640 KB
testcase_25 AC 315 ms
57,716 KB
testcase_26 AC 76 ms
38,620 KB
testcase_27 AC 124 ms
41,212 KB
testcase_28 AC 223 ms
53,108 KB
testcase_29 AC 223 ms
50,392 KB
testcase_30 AC 107 ms
39,680 KB
testcase_31 AC 343 ms
59,052 KB
testcase_32 AC 194 ms
49,784 KB
testcase_33 AC 332 ms
58,264 KB
testcase_34 AC 224 ms
50,408 KB
testcase_35 AC 175 ms
45,676 KB
testcase_36 AC 175 ms
45,648 KB
testcase_37 AC 209 ms
49,784 KB
testcase_38 AC 170 ms
46,504 KB
testcase_39 AC 140 ms
42,720 KB
testcase_40 AC 250 ms
53,188 KB
testcase_41 AC 326 ms
57,512 KB
testcase_42 AC 69 ms
38,092 KB
testcase_43 AC 70 ms
38,140 KB
testcase_44 AC 68 ms
38,248 KB
testcase_45 AC 71 ms
38,288 KB
testcase_46 AC 68 ms
37,976 KB
testcase_47 AC 70 ms
37,912 KB
testcase_48 AC 66 ms
37,816 KB
testcase_49 AC 67 ms
38,076 KB
testcase_50 AC 67 ms
38,048 KB
testcase_51 AC 67 ms
38,244 KB
testcase_52 AC 70 ms
38,280 KB
testcase_53 AC 71 ms
38,140 KB
testcase_54 AC 68 ms
38,336 KB
testcase_55 AC 69 ms
38,180 KB
testcase_56 AC 66 ms
38,408 KB
testcase_57 AC 68 ms
37,960 KB
testcase_58 AC 68 ms
38,364 KB
testcase_59 AC 68 ms
37,832 KB
testcase_60 AC 67 ms
38,016 KB
testcase_61 AC 66 ms
37,912 KB
testcase_62 AC 65 ms
38,124 KB
testcase_63 AC 67 ms
38,152 KB
testcase_64 AC 68 ms
38,076 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.BufferedInputStream;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.StringJoiner;
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;

    void solve() {
        int n = in.nextInt();
        int[] p = in.nextIntArray(n, i -> i - 1);
        int[] inv = new int[n];
        for (int i = 0; i < n; i++) {
            inv[p[i]] = i;
        }
        boolean[] used = new boolean[n];
        int[] next = new int[n];
        int[] prev = new int[n];
        for (int i = 0; i < n; i++) {
            next[p[i]] = i + 1 == n ? n : p[i + 1];
            prev[p[i]] = i == 0 ? -1 : p[i - 1];
        }
        List<Integer> q = new ArrayList<>();
        for (int i = 0; i < n; i++) {
            if (used[i]) continue;
            if (next[i] == n) continue;
            q.add(i);
            q.add(next[i]);
            used[i] = true;
            used[next[i]] = true;
            if (prev[i] != -1) {
                next[prev[i]] = next[next[i]];
            }
            if (next[next[i]] != n) {
                prev[next[next[i]]] = prev[i];
            }
        }
        out.println(q.stream().map(v -> v + 1 + "").collect(Collectors.joining(" ")));
    }

    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