結果

問題 No.905 Sorted?
ユーザー OlandOland
提出日時 2019-10-12 01:30:53
言語 Java21
(openjdk 21)
結果
AC  
実行時間 441 ms / 2,000 ms
コード長 5,879 bytes
コンパイル時間 2,012 ms
コンパイル使用メモリ 87,404 KB
実行使用メモリ 67,708 KB
最終ジャッジ日時 2024-05-04 14:23:39
合計ジャッジ時間 8,391 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 66 ms
51,116 KB
testcase_01 AC 69 ms
50,960 KB
testcase_02 AC 73 ms
51,244 KB
testcase_03 AC 82 ms
51,488 KB
testcase_04 AC 71 ms
51,308 KB
testcase_05 AC 129 ms
54,228 KB
testcase_06 AC 102 ms
53,352 KB
testcase_07 AC 137 ms
55,808 KB
testcase_08 AC 344 ms
57,904 KB
testcase_09 AC 297 ms
57,844 KB
testcase_10 AC 369 ms
62,100 KB
testcase_11 AC 331 ms
60,776 KB
testcase_12 AC 350 ms
58,896 KB
testcase_13 AC 420 ms
62,776 KB
testcase_14 AC 433 ms
62,072 KB
testcase_15 AC 309 ms
60,756 KB
testcase_16 AC 382 ms
61,212 KB
testcase_17 AC 441 ms
67,708 KB
testcase_18 AC 377 ms
67,504 KB
testcase_19 AC 70 ms
51,180 KB
testcase_20 AC 75 ms
52,788 KB
testcase_21 AC 70 ms
50,908 KB
testcase_22 AC 84 ms
51,300 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.lang.reflect.Array;
import java.util.*;

@SuppressWarnings("unused")
public class Main {
    private FastScanner in = new FastScanner(System.in);
    private PrintWriter out = new PrintWriter(System.out);
    final int MOD = (int)1e9+7;
    long ceil(long a, long b){return (a + b - 1) / b;}

    //A + sumA = B + sumB
    void solve() throws Exception{
        int N = in.nextInt();
        long[] A = new long[N];
        int[][] label = new int[N][2];
        for(int i = 0; i < N; i++){
            A[i] = in.nextLong();
            if(i >= 1){
                label[i][0] = label[i-1][0] + (A[i-1] <= A[i] ? 0 : 1);
                label[i][1] = label[i-1][1] + (A[i-1] >= A[i] ? 0 : 1);
            }
        }
        int Q = in.nextInt();
        for(int i = 0; i < Q; i++){
            int L = in.nextInt(), R = in.nextInt();
            out.println((label[L][0] == label[R][0] ? "1" : "0") + " " + (label[L][1] == label[R][1] ? "1" : "0"));
        }
    }

    //end solve

    public static void main(String[] args) throws Exception {
        new Main().m();
    }

    private void m() throws Exception {
        solve();
        out.flush();
    }

    static class FastScanner {
        Reader input;

        FastScanner() {this(System.in);}
        FastScanner(InputStream stream) {this.input = new BufferedReader(new InputStreamReader(stream));}

        int nextInt() {return (int) nextLong();}

        long nextLong() {
            try {
                int sign = 1;
                int b = input.read();
                while ((b < '0' || '9' < b) && b != '-' && b != '+') {
                    b = input.read();
                }
                if (b == '-') {
                    sign = -1;
                    b = input.read();
                } else if (b == '+') {
                    b = input.read();
                }
                long ret = b - '0';
                while (true) {
                    b = input.read();
                    if (b < '0' || '9' < b) return ret * sign;
                    ret *= 10;
                    ret += b - '0';
                }
            } catch (IOException e) {
                e.printStackTrace();
                return -1;
            }
        }

        double nextDouble() {
            try {
                double sign = 1;
                int b = input.read();
                while ((b < '0' || '9' < b) && b != '-' && b != '+') {
                    b = input.read();
                }
                if (b == '-') {
                    sign = -1;
                    b = input.read();
                } else if (b == '+') {
                    b = input.read();
                }
                double ret = b - '0';
                while (true) {
                    b = input.read();
                    if (b < '0' || '9' < b) break;
                    ret *= 10;
                    ret += b - '0';
                }
                if (b != '.') return sign * ret;
                double div = 1;
                b = input.read();
                while ('0' <= b && b <= '9') {
                    ret *= 10;
                    ret += b - '0';
                    div *= 10;
                    b = input.read();
                }
                return sign * ret / div;
            } catch (IOException e) {
                e.printStackTrace();
                return Double.NaN;
            }
        }

        char nextChar() {
            try {
                int b = input.read();
                while (Character.isWhitespace(b)) {
                    b = input.read();
                }
                return (char) b;
            } catch (IOException e) {
                e.printStackTrace();
                return 0;
            }
        }

        String nextStr() {
            try {
                StringBuilder sb = new StringBuilder();
                int b = input.read();
                while (Character.isWhitespace(b)) {
                    b = input.read();
                }
                while (b != -1 && !Character.isWhitespace(b)) {
                    sb.append((char) b);
                    b = input.read();
                }
                return sb.toString();
            } catch (IOException e) {
                e.printStackTrace();
                return "";
            }
        }

        public int[] nextIntArray(int n) {
            int[] res = new int[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextInt();
            }
            return res;
        }

        public int[] nextIntArrayDec(int n) {
            int[] res = new int[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextInt() - 1;
            }
            return res;
        }

        public int[] nextIntArray1Index(int n) {
            int[] res = new int[n + 1];
            for (int i = 0; i < n; i++) {
                res[i + 1] = nextInt();
            }
            return res;
        }

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

        public long[] nextLongArrayDec(int n) {
            long[] res = new long[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextLong() - 1;
            }
            return res;
        }

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

        public double[] nextDoubleArray(int n) {
            double[] res = new double[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextDouble();
            }
            return res;
        }
    }
}
0