結果

問題 No.1438 Broken Drawers
ユーザー neko_the_shadowneko_the_shadow
提出日時 2021-04-12 22:47:59
言語 Java21
(openjdk 21)
結果
AC  
実行時間 416 ms / 2,000 ms
コード長 4,845 bytes
コンパイル時間 2,640 ms
コンパイル使用メモリ 96,568 KB
実行使用メモリ 57,148 KB
最終ジャッジ日時 2024-06-28 18:14:17
合計ジャッジ時間 12,172 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 69 ms
37,892 KB
testcase_01 AC 69 ms
37,720 KB
testcase_02 AC 68 ms
38,064 KB
testcase_03 AC 68 ms
37,664 KB
testcase_04 AC 65 ms
38,080 KB
testcase_05 AC 63 ms
37,788 KB
testcase_06 AC 385 ms
56,708 KB
testcase_07 AC 382 ms
56,696 KB
testcase_08 AC 66 ms
38,080 KB
testcase_09 AC 70 ms
38,040 KB
testcase_10 AC 74 ms
37,992 KB
testcase_11 AC 109 ms
40,632 KB
testcase_12 AC 250 ms
46,956 KB
testcase_13 AC 278 ms
50,380 KB
testcase_14 AC 221 ms
46,868 KB
testcase_15 AC 367 ms
56,028 KB
testcase_16 AC 363 ms
55,848 KB
testcase_17 AC 386 ms
56,056 KB
testcase_18 AC 371 ms
55,644 KB
testcase_19 AC 365 ms
56,208 KB
testcase_20 AC 371 ms
56,076 KB
testcase_21 AC 364 ms
55,804 KB
testcase_22 AC 374 ms
56,008 KB
testcase_23 AC 374 ms
56,568 KB
testcase_24 AC 382 ms
56,840 KB
testcase_25 AC 416 ms
56,948 KB
testcase_26 AC 413 ms
57,148 KB
testcase_27 AC 414 ms
57,124 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.BufferedReader;
import java.io.EOFException;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintStream;
import java.io.PrintWriter;
import java.io.UncheckedIOException;
import java.math.BigInteger;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Deque;
import java.util.List;
import java.util.function.Supplier;
import java.util.regex.Pattern;

public class Main {
    public void exec() {
        int n = stdin.nextInt();
        int[] a = stdin.nextIntArray(n);
        
        int[] b = new int[n];
        for (int i = 0; i < n; i++) {
            b[a[i]-1] = i;
        }
        
        boolean[] ok = new boolean[n];
        Arrays.fill(ok, true);
        
        int c = 0;
        for (int i = 0; i < n; i++) {
            if (ok[b[i]]) {
                c++;
                ok[b[i]] = false;
                if (b[i]-1 >= 0) ok[b[i]-1] = false;
            }
        }
        stdout.println(c);
    }

    private static final Stdin stdin = new Stdin(System.in);
    private static final Stdout stdout = new Stdout(System.out);

    public static void main(String[] args) {
        try {
            new Main().exec();
        } finally {
            stdout.flush();
        }
    }

    public static class Stdin {
        private Deque<String> queue;
        private BufferedReader in;
        private Pattern space;

        public Stdin(InputStream in) {
            this.queue = new ArrayDeque<>();
            this.in = new BufferedReader(new InputStreamReader(in));
            this.space = Pattern.compile(" ");
        }

        public String nextString() {
            if (queue.isEmpty()) {
                try {
                    String line = in.readLine();
                    if (line == null) {
                        throw new EOFException();
                    }
                    space.splitAsStream(line).forEach(this.queue::addLast);
                } catch (IOException e) {
                    throw new UncheckedIOException(e);
                }
            }
            return queue.removeFirst();
        }

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

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

        public long nextLong() {
            return Long.parseLong(nextString());
        }
        
        public BigInteger nextBigInteger() {
            return new BigInteger(nextString());
        }

        public String[] nextStringArray(int n) {
            String[] a = new String[n];
            for (int i = 0; i < n; i++) a[i] = nextString();
            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 double[] nextDoubleArray(int n) {
            double[] a = new double[n];
            for (int i = 0; i < n; i++) a[i] = nextDouble();
            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 BigInteger[] nexBigIntegerArray(int n) {
            BigInteger[] a = new BigInteger[n];
            for (int i = 0; i < n; i++) a[i] = nextBigInteger();
            return a;
        }
        
        public List<Integer> nextIntegerList(int n) {
            return nextList(n, this::nextInt);
        }
        
        public List<Long> nextLongList(int n) {
            return nextList(n, this::nextLong);
        }
        
        public List<Double> nextDoubleList(int n) {
            return nextList(n, this::nextDouble);
        }
        
        public List<String> nextStringList(int n) {
            return nextList(n, this::nextString);
        }
        
        public List<BigInteger> nextBigIntegerList(int n) {
            return nextList(n, this::nextBigInteger);
        }
        
        private <T> List<T> nextList(int n, Supplier<T> supplier) {
            List<T> a = new ArrayList<>();
            for (int i = 0; i < n; i++) a.add(supplier.get());
            return a;
        }
    }

    public static class Stdout {
        private PrintWriter stdout;

        public Stdout(PrintStream stdout) {
            this.stdout =  new PrintWriter(stdout, false);
        }

        public void println(Object ... objs) {
            for (int i = 0, len = objs.length; i < len; i++) {
                stdout.print(objs[i]);
                if (i != len-1) stdout.print(' ');
            }
            stdout.println();
        }

        public void flush() {
            stdout.flush();
        }
    }
}
0