oj.uz

답안 #1041294

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1041294 2024-08-01T20:19:43 Z PCTprobability 커다란 상품 (IOI17_prize) C++17
20 / 100
 47 ms 12924 KB 
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
int ans=-1;
int m;
int N;
int cnt=0;
int v=0;
vector<int> memo[505050];
vector<int> query(int id){
  if(id==N) return {m,0};
  else{
    if(memo[id].size()) return memo[id];
    vector<int> a=ask(id);
    if(a[0]+a[1]==0) ans=id;
    return memo[id]=a;
  }
}
void solve(int l,int r,int x,int p,int q){
  if(x==0) return;
  if(r-l+1==x){
    for(int i=l;i<=r;i++){
      vector<int> a=query(i);
      if(a[0]+a[1]==0){
        ans=i;
        return;
      }
    }
    return;
  }
  if(ans!=-1) return;
  int mid=(l+r)/2;
  //mid+1 を聞く
  vector<int> a=query(mid+1);
  if(a[0]+a[1]==m){
    solve(l,mid,a[0]-p,p,a[1]);
    if(ans!=-1) return;
    solve(mid+1,r,a[1]-q,a[0],q);
  }
  else{
    int now=mid+1;
    int cnt=1;
    while(now<r){
      vector<int> a=query(now+1);
      if(a[0]+a[1]!=m){
        cnt++;
        now++;
      }
      else{
        break;
      }
    }
    if(now==r){
      //mid+1 から r は全部特殊
      solve(l,mid,x-cnt,p,q+cnt);
    }
    else{
      vector<int> a=query(now+1);
      //mid+1 から now は全部特殊
      solve(now+1,r,a[1]-q,a[0],q);
      if(ans!=-1) return;
      solve(l,mid,a[0]-cnt-p,p,a[1]+cnt);
      if(ans!=-1) return;
    }
  }
}
int find_best(int n) {
  N=n;
  if(n<=5000){
    for(int i=0;i<n;i++){
      vector<int> a=ask(i);
      if(a[0]+a[1]==0) return i;
    }
  }
  m=-1;
  for(int i=0;i<470;i++){
    int k=i%n;
    vector<int> a=query(k);
    if(a[0]+a[1]==0) return i;
    if(m<a[0]+a[1]) m=a[0]+a[1];
  }
  solve(0,n-1,m,0,0);
  return ans;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 12120 KB Output is correct
2 Correct 7 ms 12120 KB Output is correct
3 Correct 7 ms 12120 KB Output is correct
4 Correct 6 ms 12120 KB Output is correct
5 Correct 7 ms 12120 KB Output is correct
6 Correct 5 ms 12120 KB Output is correct
7 Correct 9 ms 12084 KB Output is correct
8 Correct 7 ms 12120 KB Output is correct
9 Correct 7 ms 12120 KB Output is correct
10 Correct 6 ms 12120 KB Output is correct
11 Correct 6 ms 12120 KB Output is correct
12 Correct 6 ms 12120 KB Output is correct
13 Correct 8 ms 12120 KB Output is correct
14 Correct 7 ms 12068 KB Output is correct
15 Correct 9 ms 12120 KB Output is correct
16 Correct 15 ms 12376 KB Output is correct
17 Correct 7 ms 12120 KB Output is correct
18 Correct 30 ms 12376 KB Output is correct
19 Correct 8 ms 12120 KB Output is correct
20 Correct 10 ms 12308 KB Output is correct
21 Correct 13 ms 12408 KB Output is correct
22 Correct 9 ms 12120 KB Output is correct
23 Correct 8 ms 12120 KB Output is correct
24 Correct 7 ms 12120 KB Output is correct
25 Correct 15 ms 12356 KB Output is correct
26 Correct 13 ms 12372 KB Output is correct
27 Correct 6 ms 12120 KB Output is correct
28 Correct 21 ms 12632 KB Output is correct
29 Correct 17 ms 12376 KB Output is correct
30 Correct 19 ms 12368 KB Output is correct
31 Correct 8 ms 12808 KB Output is correct
32 Correct 10 ms 12120 KB Output is correct
33 Correct 6 ms 12120 KB Output is correct
34 Correct 13 ms 12320 KB Output is correct
35 Correct 7 ms 12120 KB Output is correct
36 Correct 11 ms 12120 KB Output is correct
37 Correct 7 ms 12120 KB Output is correct
38 Correct 7 ms 12120 KB Output is correct
39 Correct 12 ms 12320 KB Output is correct
40 Correct 21 ms 12316 KB Output is correct
41 Correct 14 ms 12376 KB Output is correct
42 Correct 20 ms 12372 KB Output is correct
43 Correct 13 ms 12584 KB Output is correct
44 Correct 11 ms 12120 KB Output is correct
45 Correct 11 ms 12120 KB Output is correct
46 Correct 8 ms 12292 KB Output is correct
47 Correct 13 ms 12304 KB Output is correct
48 Correct 25 ms 12400 KB Output is correct
49 Correct 6 ms 12120 KB Output is correct
50 Correct 18 ms 12624 KB Output is correct
51 Correct 15 ms 12320 KB Output is correct
52 Correct 7 ms 12120 KB Output is correct
53 Correct 6 ms 12120 KB Output is correct
54 Correct 10 ms 12116 KB Output is correct
55 Correct 7 ms 12120 KB Output is correct
56 Correct 26 ms 12368 KB Output is correct
57 Correct 20 ms 12368 KB Output is correct
58 Correct 14 ms 12368 KB Output is correct
59 Correct 17 ms 12376 KB Output is correct
60 Correct 12 ms 12472 KB Output is correct
61 Correct 8 ms 12120 KB Output is correct
62 Correct 7 ms 12120 KB Output is correct
63 Correct 7 ms 12300 KB Output is correct
64 Correct 8 ms 12120 KB Output is correct
65 Correct 7 ms 12376 KB Output is correct
66 Correct 9 ms 12324 KB Output is correct
67 Correct 11 ms 12120 KB Output is correct
68 Correct 5 ms 12120 KB Output is correct
69 Correct 8 ms 12120 KB Output is correct
70 Correct 8 ms 12120 KB Output is correct
71 Partially correct 35 ms 12924 KB Partially correct - number of queries: 5228
72 Correct 7 ms 12120 KB Output is correct
73 Partially correct 26 ms 12376 KB Partially correct - number of queries: 5165
74 Partially correct 18 ms 12428 KB Partially correct - number of queries: 5192
75 Correct 7 ms 12120 KB Output is correct
76 Correct 22 ms 12372 KB Output is correct
77 Correct 24 ms 12352 KB Output is correct
78 Correct 8 ms 12120 KB Output is correct
79 Correct 13 ms 12408 KB Output is correct
80 Correct 18 ms 12368 KB Output is correct
81 Correct 25 ms 12368 KB Output is correct
82 Correct 23 ms 12376 KB Output is correct
83 Correct 8 ms 12120 KB Output is correct
84 Correct 18 ms 12368 KB Output is correct
85 Correct 19 ms 12376 KB Output is correct
86 Incorrect 47 ms 12368 KB Incorrect
87 Halted 0 ms 0 KB -