oj.uz

답안 #1018832

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1018832 2024-07-10T10:05:15 Z vjudge1 커다란 상품 (IOI17_prize) C++17
20 / 100
 53 ms 1200 KB 
#include "prize.h"
#include<bits/stdc++.h>
using namespace std;
#define lli long long int


int find_best(int n){
    vector<int>a(2);
    vector<int>vb(n,0);
    int x=0,y=n-1,z,xx=0,yy=n-1,p;
    int c=9877;
    while(x!=y){
        z=(xx+yy)/2;
        p=z;
        if(vb[z]){
            z++;
            while(vb[z]){
                z++;
                if(z>yy){
                    z=xx;
                }
            }
            if(p==z){
                if(yy==y){
                    y=xx+1;
                    yy=y;
                }
                if(xx==x){
                    x=yy-1;
                    xx=x;
                }
                z=xx;
                while(vb[z]){
                    x++;
                    xx++;
                    z++;
                }
            }
        }
        a=ask(z);
        vb[z]=1;
        if(a[0]+a[1]==0){
            return z;
        }
        else if(a[1]+a[0]==1){
            if(a[1]){
                x=z+1;
            }
            else{
                y=z-1;
            }
            xx=x;
            yy=y;
        }
        else{
            a[0]=(9347*c)%a[0];
            a[1]=(9347*c)%a[1];
            if(a[0]>a[1]){
                xx=x;
                yy=z-1;
            }
            else{
                xx=z+1;
                yy=y;
            }
        }
    }
    return x;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1112 KB Output is correct
2 Correct 1 ms 1196 KB Output is correct
3 Correct 1 ms 1200 KB Output is correct
4 Correct 1 ms 1112 KB Output is correct
5 Correct 1 ms 1200 KB Output is correct
6 Correct 1 ms 1196 KB Output is correct
7 Correct 1 ms 1192 KB Output is correct
8 Correct 1 ms 1112 KB Output is correct
9 Correct 1 ms 1112 KB Output is correct
10 Correct 1 ms 1112 KB Output is correct
11 Incorrect 53 ms 1196 KB Incorrect
12 Halted 0 ms 0 KB -