제출 #919669

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
919669		boris_mihov	Hotter Colder (IOI10_hottercolder)	C++17	78 / 100	635 ms	16464 KiB

hottercolder

#include "grader.h"
#include <iostream>
#include <random>

std::mt19937 rng(69420);
int HC(int N)
{
    int lastAsked = -1;
    int l = 0, r = N + 1;
    while (l < r - 2)
    {
        int mid = (l + r) / 2;
        if (lastAsked != l + 1 && lastAsked != r - 1)
        {
            int mid = (l + r) / 2;
            if (rng() % 2)
            {
                Guess(l + 1);
                int res = Guess(r - 1);
                lastAsked = r - 1;
                
                if (res == 0) 
                {
                    return mid;
                }

                if (res == -1)
                {
                    r = mid + ((l + r) % 2 == 1); 
                } else
                {
                    l = mid;
                }
            } else
            {
                Guess(r - 1);
                int res = Guess(l + 1);
                lastAsked = l + 1;
                
                if (res == 0) 
                {
                    return mid;
                }

                if (res == 1)
                {
                    r = mid + ((l + r) % 2 == 1); 
                } else
                {
                    l = mid;
                }
            }

            continue;
        }

        if (lastAsked == l + 1)
        {
            int res = Guess(r - 1);
            lastAsked = r - 1;
            
            if (res == 0) 
            {
                return mid;
            }

            if (res == -1)
            {
                r = mid + ((l + r) % 2 == 1); 
            } else
            {
                l = mid;
            }
        } else
        {
            int res = Guess(l + 1);
            lastAsked = l + 1;
            
            if (res == 0) 
            {
                return mid;
            }

            if (res == 1)
            {
                r = mid + ((l + r) % 2 == 1); 
            } else
            {
                l = mid;
            }
        }
    }

    return l + 1;
}

• Subtask 1: 25 / 25
• Subtask 2: 25 / 25
• Subtask 3: 25 / 25
• Subtask 4: 3 / 25