oj.uz

답안 #1082317

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1082317 2024-08-31T06:49:38 Z MMihalev 커다란 상품 (IOI17_prize) C++14
20 / 100
 59 ms 1920 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!=0)
        {
            int l=prevpos,r=n-1;
            while(l<=r)
            {
                int mid=(l+r)/2;
                auto cur2=query(mid);
                if(cur2.first==cur.first)
                {
                    prevpos=mid;
                    l=mid+1;
                }
                else r=mid-1;
            }
        }
        else
        {
            return prevpos;
        }
        cur=query(prevpos);
        all=cur.first+cur.second;
        if(all==0)return prevpos;
    }
}

Compilation message

prize.cpp: In function 'int find_best(int)':
prize.cpp:22:15: warning: unused variable 'N' [-Wunused-variable]
   22 |     long long N=n;
      |               ^
prize.cpp:53:1: warning: control reaches end of non-void function [-Wreturn-type]
   53 | }
      | ^

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct

Subtask #2
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 440 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 3 ms 856 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 6 ms 1428 KB Output is correct
14 Correct 4 ms 476 KB Output is correct
15 Correct 10 ms 1132 KB Output is correct
16 Incorrect 59 ms 1920 KB Incorrect
17 Halted 0 ms 0 KB -