답안 #1076156

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1076156 2024-08-26T11:30:03 Z amin 커다란 상품 (IOI17_prize) C++14
20 / 100
77 ms 6744 KB
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
vector<int>q;
int a[1000000],b[1000000];
int find_best(int n) {
    int cur=0;
q=ask(0);
a[0]=q[0];
b[0]=q[1];
    while(cur!=n)
    {
      //  cout<<cur<<endl;


 int p=a[cur];
 int pp=b[cur];
 if(p==0&&pp==0)
    return cur;
        int l=0;
        int r=n-cur;
        while(l<r-1)
        {
            int mid=(l+r)/2;
           q=ask(cur+mid);
           a[cur+mid]=q[0];
           b[cur+mid]=q[1];
           if(p==q[0]&&pp==q[1])
           {
               l=mid;
           }else
           r=mid;
        }
        cur=r+cur;
    }

}

Compilation message

prize.cpp: In function 'int find_best(int)':
prize.cpp:37:1: warning: control reaches end of non-void function [-Wreturn-type]
   37 | }
      | ^
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 1 ms 4440 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 6488 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 1 ms 2648 KB Output is correct
10 Correct 1 ms 4440 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 4440 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 1 ms 6488 KB Output is correct
5 Correct 1 ms 6488 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 6484 KB Output is correct
8 Correct 1 ms 6488 KB Output is correct
9 Correct 1 ms 6488 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 5 ms 6488 KB Output is correct
12 Correct 1 ms 6488 KB Output is correct
13 Correct 5 ms 3416 KB Output is correct
14 Correct 3 ms 344 KB Output is correct
15 Correct 18 ms 6744 KB Output is correct
16 Incorrect 77 ms 1984 KB Incorrect
17 Halted 0 ms 0 KB -