結果
問題 | No.905 Sorted? |
ユーザー | k_6101 |
提出日時 | 2019-12-05 17:53:37 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 927 ms / 2,000 ms |
コード長 | 1,869 bytes |
コンパイル時間 | 3,188 ms |
コンパイル使用メモリ | 75,576 KB |
実行使用メモリ | 68,220 KB |
最終ジャッジ日時 | 2023-08-23 10:02:50 |
合計ジャッジ時間 | 15,794 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 123 ms
55,880 KB |
testcase_01 | AC | 130 ms
56,132 KB |
testcase_02 | AC | 125 ms
55,644 KB |
testcase_03 | AC | 128 ms
55,816 KB |
testcase_04 | AC | 127 ms
55,760 KB |
testcase_05 | AC | 186 ms
58,196 KB |
testcase_06 | AC | 178 ms
56,696 KB |
testcase_07 | AC | 227 ms
60,640 KB |
testcase_08 | AC | 773 ms
68,220 KB |
testcase_09 | AC | 625 ms
63,012 KB |
testcase_10 | AC | 866 ms
67,660 KB |
testcase_11 | AC | 650 ms
67,852 KB |
testcase_12 | AC | 701 ms
67,696 KB |
testcase_13 | AC | 873 ms
67,728 KB |
testcase_14 | AC | 927 ms
66,352 KB |
testcase_15 | AC | 710 ms
67,452 KB |
testcase_16 | AC | 754 ms
67,756 KB |
testcase_17 | AC | 759 ms
67,544 KB |
testcase_18 | AC | 648 ms
66,396 KB |
testcase_19 | AC | 119 ms
55,804 KB |
testcase_20 | AC | 119 ms
55,740 KB |
testcase_21 | AC | 117 ms
56,024 KB |
testcase_22 | AC | 117 ms
55,844 KB |
ソースコード
import java.io.InputStream; import java.io.PrintWriter; import java.lang.reflect.Array; import java.util.ArrayList; import java.util.Arrays; import java.util.HashSet; import java.util.List; import java.util.Scanner; import java.util.Set; import java.util.TreeSet; import static java.util.Comparator.*; public class Main { public static void main(String[] args) { PrintWriter out = new PrintWriter(System.out); Solver solver = new Solver(System.in, out); solver.solve(); out.close(); } } class Solver { Scanner sc; PrintWriter out; public Solver(InputStream in, PrintWriter out) { sc = new Scanner(in); this.out = out; } // ================================================================== public void solve() { int N = Integer.parseInt(sc.next()); long a, sv; int[] up = new int[N]; int[] down = new int[N]; sv = Long.parseLong(sc.next()); for (int i = 1; i < N; i++) { a = Long.parseLong(sc.next()); if(sv < a) up[i] = 1; else if(sv > a) down[i] = 1; sv = a; } for (int i = 1; i < N; i++) { up[i] += up[i-1]; down[i] += down[i-1]; } int Q = Integer.parseInt(sc.next()); int l, r, uCnt, dCnt; for (int i = 0; i < Q; i++) { l = Integer.parseInt(sc.next()); r = Integer.parseInt(sc.next()); uCnt = up[r] - up[l]; dCnt = down[r] - down[l]; if(uCnt == 0 && dCnt == 0) out.println("1 1"); else if(uCnt > 0 && dCnt == 0) out.println("1 0"); else if(uCnt == 0 && dCnt > 0) out.println("0 1"); else out.println("0 0"); } } // ================================================================== } class PP{ public int key, val; public PP(int key, int val) { this.key = key; this.val = val; } public int getKey() { return key; } public int getVal() { return val; } }