結果
問題 | No.1895 Mod 2 |
ユーザー | tenten |
提出日時 | 2023-01-18 08:27:40 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 186 ms / 2,000 ms |
コード長 | 3,169 bytes |
コンパイル時間 | 4,508 ms |
コンパイル使用メモリ | 92,344 KB |
実行使用メモリ | 55,372 KB |
最終ジャッジ日時 | 2023-09-02 04:48:12 |
合計ジャッジ時間 | 7,770 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 47 ms
49,356 KB |
testcase_01 | AC | 156 ms
54,576 KB |
testcase_02 | AC | 174 ms
54,944 KB |
testcase_03 | AC | 150 ms
54,904 KB |
testcase_04 | AC | 162 ms
54,820 KB |
testcase_05 | AC | 186 ms
55,024 KB |
testcase_06 | AC | 175 ms
55,040 KB |
testcase_07 | AC | 178 ms
54,920 KB |
testcase_08 | AC | 159 ms
55,372 KB |
testcase_09 | AC | 153 ms
55,096 KB |
testcase_10 | AC | 149 ms
54,496 KB |
testcase_11 | AC | 168 ms
53,280 KB |
ソースコード
import java.io.*; import java.util.*; import java.util.stream.*; public class Main { static final long MAX = 1000000000000000L; public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); int t = sc.nextInt(); StringBuilder sb = new StringBuilder(); while (t-- > 0) { long left = sc.nextLong(); long right = sc.nextLong(); long ans = getUpperCount1(right) + getUpperCount2(right) - getLowerCount1(left) - getLowerCount2(left); sb.append(ans % 2).append("\n"); } System.out.print(sb); } static long getUpperCount1(long x) { long left = 0; long right = 1000000000; while (right - left > 1) { long m = (left + right) / 2; if (m * m <= x) { left = m; } else { right = m; } } return left; } static long getUpperCount2(long x) { long left = 0; long right = 1000000000; while (right - left > 1) { long m = (left + right) / 2; if (m * m * 2 <= x) { left = m; } else { right = m; } } return left; } static long getLowerCount1(long x) { long left = 0; long right = 1000000000; while (right - left > 1) { long m = (left + right) / 2; if (m * m < x) { left = m; } else { right = m; } } return left; } static long getLowerCount2(long x) { long left = 0; long right = 1000000000; while (right - left > 1) { long m = (left + right) / 2; if (m * m * 2 < x) { left = m; } else { right = m; } } return left; } } class Utilities { static String arrayToLineString(Object[] arr) { return Arrays.stream(arr).map(x -> x.toString()).collect(Collectors.joining("\n")); } static String arrayToLineString(int[] arr) { return String.join("\n", Arrays.stream(arr).mapToObj(String::valueOf).toArray(String[]::new)); } } class Scanner { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(""); StringBuilder sb = new StringBuilder(); public Scanner() throws Exception { } public int nextInt() throws Exception { return Integer.parseInt(next()); } public long nextLong() throws Exception { return Long.parseLong(next()); } public double nextDouble() throws Exception { return Double.parseDouble(next()); } public int[] nextIntArray() throws Exception { return Stream.of(br.readLine().split(" ")).mapToInt(Integer::parseInt).toArray(); } public String next() throws Exception { while (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } return st.nextToken(); } }