oj.uz

답안 #977042

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
977042 2024-05-07T10:41:22 Z Error404 커다란 상품 (IOI17_prize) C++17
0 / 100
 57 ms 1880 KB 
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
#define pi pair<int,int>
#define f first
#define s second
 
const int  MAX = 2e5;
int ans[MAX][2];
int a;
 
 
pi query(int pos){
 
    if(ans[pos][0]!=-1) return {ans[pos][0], ans[pos][1]};
    auto hold = ask(pos);
    ans[pos][0] = hold[0];
    ans[pos][1] = hold[1];
    if(hold[0]+hold[1]==0){
        a = pos;
    }
    return {hold[0],hold[1]};
}
 
 
 
int sum(int pos){
    query(pos);
    return ans[pos][0]+ ans[pos][1];
}
 
void solve(int l, int r){
    if(a!=-1) return;
 
    if(l==r){
        query(l);
    }
 
    while(sum(l)!= sum(r)){
        if(sum(l)< sum(r)) l++;
        else r++;
    }
 
    if(ans[l][0]==ans[r][0]) return;
    int m = (l+r)/2;
    solve(l,m);
    solve(m,r);
 
}
 
 
int find_best( int n ) {
 
 
 
    for(int i = 0; i < n; i++){
        ans[i][0]=-1;
    }
    a=-1;
    solve(0,n-1);
    return a;
 
}

Subtask #1
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1880 KB Output is correct
2 Correct 1 ms 1880 KB Output is correct
3 Correct 1 ms 1880 KB Output is correct
4 Incorrect 49 ms 1880 KB Incorrect
5 Halted 0 ms 0 KB -

Subtask #2
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1880 KB Output is correct
2 Correct 1 ms 1880 KB Output is correct
3 Correct 1 ms 1880 KB Output is correct
4 Incorrect 57 ms 1880 KB Incorrect
5 Halted 0 ms 0 KB -