oj.uz

Submission #116062

# Submission time Handle Problem Language Result Execution time Memory
116062 2019-06-10T09:59:07 Z someone_aa Hotter Colder (IOI10_hottercolder) C++17
50 / 100
 8080 ms 110608 KB 
#include "grader.h"
#include <bits/stdc++.h>
using namespace std;


int HC(int N){
    mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

    int l = 1, r = N;

    int lst = 1;
    Guess(lst);

    for(int i=0;i<30;i++) {
        if(l == r) return l;

        int curr = (l + r) / 2;
        if(curr == lst) {
            while(curr == lst) {
                curr = uniform_int_distribution<int>(l, r)(rng);
            }
        }
        int q = Guess(curr);

        //cout<<i<<" - Previous was: "<<lst<<"\n";
        //cout<<l<<", "<<r<<" - "<<curr<<" --> "<<q<<"\n";

        if(curr < lst) {
            if(q == -1) {
                int sz = (lst - curr + 1) / 2;
                int cl = lst - sz + 1;
                int cr = N;

                l = max(l,cl);
                r = min(r,cr);
            }
            else if(q == 0) {
                int mid = (lst + curr) / 2;
                return mid;
            }
            else {
                int sz = (lst - curr + 1) / 2;
                int cl = 1;
                int cr = curr + sz - 1;

                l = max(l,cl);
                r = min(r,cr);
            }
        }
        else if(curr > lst) {
            if(q == -1) {
                int sz = (curr - lst + 1) / 2;
                int cl = 1;
                int cr = lst + sz - 1;

                l = max(l,cl);
                r = min(r,cr);
            }
            else if(q == 0) {
                int mid = (lst + curr) / 2;
                return mid;
            }
            else {
                int sz = (curr - lst + 1) / 2;
                int cl = curr - sz + 1;
                int cr = N;

                l = max(l,cl);
                r = min(r,cr);
            }
        }
        lst = curr;
    }

    return 1;
}

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 865 ms 1404 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 853 ms 1400 KB Output is correct

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 855 ms 1400 KB Output isn't correct

Subtask #4
0.0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 8080 ms 110608 KB Output isn't correct - alpha = 0.000000000000