Submission #69945

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
69945	2018-08-22 05:56:13	Diuven	The Big Prize (IOI17_prize)	C++14	98.84 / 100	85 ms	2240 KiB

prize

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
const int MX=200010;
 
bool up[MX];
int L[MX], R[MX], sum, n, ans=-1;
 
void my_ask(int i){
  if(L[i]>=0) return;
  vi now=ask(i);
  L[i]=now[0], R[i]=now[1];
}
 
void search(int s, int e, int lc, int mc, int rc){
  if(s>e || mc<=0) return;
 
  int m=(s+e)/2;
 
  for(int i=m; i<=e; i++){
    my_ask(i);
    if(L[i]+R[i]==0){ ans=i; return; }
    if(L[i]+R[i]==sum){
      search(s,m-1, lc, L[i]-(i-m)-lc, R[i]+i-m);
      search(i+1,e, L[i], R[i]-rc, rc);
      return;
    }
  }
  for(int i=m; i>=s; i--){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 20 / 20
• Subtask 2: 78.84 / 80