結果

問題 No.1830 Balanced Majority
ユーザー shojin_proshojin_pro
提出日時 2022-02-04 22:17:12
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 5,008 bytes
コンパイル時間 2,758 ms
コンパイル使用メモリ 79,392 KB
実行使用メモリ 67,568 KB
平均クエリ数 7.35
最終ジャッジ日時 2024-06-11 12:00:33
合計ジャッジ時間 6,653 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 78 ms
53,712 KB
testcase_01 AC 77 ms
53,792 KB
testcase_02 AC 75 ms
53,824 KB
testcase_03 AC 77 ms
53,924 KB
testcase_04 AC 77 ms
53,936 KB
testcase_05 AC 74 ms
53,684 KB
testcase_06 AC 76 ms
53,892 KB
testcase_07 AC 77 ms
54,052 KB
testcase_08 AC 78 ms
53,776 KB
testcase_09 AC 77 ms
53,664 KB
testcase_10 AC 77 ms
54,220 KB
testcase_11 WA -
testcase_12 AC 77 ms
53,380 KB
testcase_13 AC 83 ms
54,328 KB
testcase_14 AC 78 ms
54,376 KB
testcase_15 AC 79 ms
54,424 KB
testcase_16 AC 78 ms
53,880 KB
testcase_17 AC 79 ms
53,504 KB
testcase_18 AC 77 ms
53,672 KB
testcase_19 AC 77 ms
54,448 KB
testcase_20 AC 80 ms
53,908 KB
testcase_21 AC 84 ms
54,328 KB
testcase_22 WA -
testcase_23 WA -
testcase_24 AC 87 ms
54,172 KB
testcase_25 AC 81 ms
53,680 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.*;
import java.io.*;

public class Main {
    static FastScanner sc = new FastScanner(System.in);
    static PrintWriter pw = new PrintWriter(System.out);
    static StringBuilder sb = new StringBuilder();
    static long mod = (long) 1e9 + 7;

    public static void main(String[] args) throws Exception {
        solve();
        pw.flush();
    }

    public static void solve() {
        int N = sc.nextInt();
        int v1 = quest(1);
        int v2 = 1 - (quest(N - 1) - (N / 2 - 1));
        boolean flg = false;
        if (v1 == v2 && v1 == 0) {
            int left = 2;
            int right = N - 1;
            while (right - left > 1) {
                int mid = (right + left) / 2;
                int omote = quest(mid);
                if (omote * 2 == mid) {
                    answer(1, mid);
                    flg = true;
                    break;
                } else if (omote * 2 > mid) {
                    right = mid;
                } else {
                    left = mid;
                }
            }
            if (!flg)
                answer(1, left % 2 == 0 ? left : right);
        } else if (v1 == v2 && v1 == 1) {
            int left = 2;
            int right = N - 1;
            while (right - left > 1) {
                int mid = (right + left) / 2;
                int ura = mid - quest(mid);
                if (ura * 2 == mid) {
                    answer(1, mid);
                    flg = true;
                    break;
                } else if (ura * 2 > mid) {
                    right = mid;
                } else {
                    left = mid;
                }
            }
            if (!flg)
                answer(1, left % 2 == 0 ? left : right);
        } else {
            answer(2, N - 1);
        }
    }

    public static int quest(int v) {
        sb.append("?").append(" ").append(v);
        System.out.println(sb.toString());
        sb.setLength(0);
        return sc.nextInt();
    }

    public static void answer(int v1, int v2) {
        sb.append("!").append(" ").append(v1).append(" ").append(v2);
        System.out.println(sb.toString());
        sb.setLength(0);
        return;
    }

    static class GeekInteger {
        public static void save_sort(int[] array) {
            shuffle(array);
            Arrays.sort(array);
        }

        public static int[] shuffle(int[] array) {
            int n = array.length;
            Random random = new Random();
            for (int i = 0, j; i < n; i++) {
                j = i + random.nextInt(n - i);
                int randomElement = array[j];
                array[j] = array[i];
                array[i] = randomElement;
            }
            return array;
        }

        public static void save_sort(long[] array) {
            shuffle(array);
            Arrays.sort(array);
        }

        public static long[] shuffle(long[] array) {
            int n = array.length;
            Random random = new Random();
            for (int i = 0, j; i < n; i++) {
                j = i + random.nextInt(n - i);
                long randomElement = array[j];
                array[j] = array[i];
                array[i] = randomElement;
            }
            return array;
        }

    }
}

class FastScanner {
    private BufferedReader reader = null;
    private StringTokenizer tokenizer = null;

    public FastScanner(InputStream in) {
        reader = new BufferedReader(new InputStreamReader(in));
        tokenizer = null;
    }

    public FastScanner(FileReader in) {
        reader = new BufferedReader(in);
        tokenizer = null;
    }

    public String next() {
        if (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                tokenizer = new StringTokenizer(reader.readLine());
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken();
    }

    public String nextLine() {
        if (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                return reader.readLine();
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken("\n");
    }

    public long nextLong() {
        return Long.parseLong(next());
    }

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

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

    public String[] nextArray(int n) {
        String[] a = new String[n];
        for (int i = 0; i < n; i++)
            a[i] = next();
        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 long[] nextLongArray(int n) {
        long[] a = new long[n];
        for (int i = 0; i < n; i++)
            a[i] = nextLong();
        return a;
    }
}
0