oj.uz

Submission #1082309

# Submission time Handle Problem Language Result Execution time Memory
1082309 2024-08-31T06:36:06 Z MMihalev The Big Prize (IOI17_prize) C++14
0 / 100
 67 ms 980 KB 
#include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
#include "prize.h"
using namespace std;
const int MAX_N=2e5+4;
int asked[MAX_N][2];
bool used[MAX_N];
pair<int,int>query(int pos)
{
    if(used[pos])return {asked[pos][0],asked[pos][1]};

    used[pos]=1;
    auto ve=ask(pos);
    asked[pos][0]=ve[0];
    asked[pos][1]=ve[1];
    return {ve[0],ve[1]};
}
int find_best(int n)
{
    long long N=n;
    int prevpos=-1;
    while(1)
    {
        prevpos++;
        if(prevpos>=n)break;
        auto cur=query(prevpos);
        long long all=cur.first+cur.second;
        if(all*all>=N)
        {
            int l=prevpos,r=n-1;
            while(l<=r)
            {
                int mid=(l+r)/2;
                auto cur2=query(mid);
                if(cur2.first==cur.first && cur2.second==cur.second)
                {
                    prevpos=mid;
                    l=mid+1;
                }
                else r=mid-1;
            }
        }
        else
        {
            if(all==0)return prevpos;
        }
    }
	while(1);
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 67 ms 728 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Incorrect 51 ms 980 KB Incorrect
2 Halted 0 ms 0 KB -