Submission #253835

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
253835	2020-07-28 21:04:14	TadijaSebez	Hotter Colder (IOI10_hottercolder)	C++11	100 / 100	1075 ms	22880 KiB

hottercolder

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 "grader.h"
#include <bits/stdc++.h>
using namespace std;
const int L=30;
int n,magic[L];
int Search(int l,int r,int last){
  if(l==r)return l;
  if(l>r)swap(l,r);
  int sz=3;
  while(sz<r-l+1)sz=sz*2+1;
  int mid;
  if(r-sz+1>last)mid=r-sz/2;
  else if(l+sz-1<last)mid=l+sz/2;
  else if(last<=l)mid=last+sz/2;
  else mid=last-sz/2;
  int nxt=mid*2-last;
  int g=Guess(nxt);
  if(g==0)return mid;
  if((g>0)^(last<nxt))return Search(l,max(l,mid-1),nxt);
  else return Search(min(r,mid+1),r,nxt);
}
int get(int x,bool inv){return inv?n-x+1:x;}
int Solve(int sz,bool inv){
  if(sz==1)return get(1,inv);
  if(sz==2)return Guess(get(1,inv))>0?get(1,inv):get(2,inv);
  if(sz==3){
    int g=Guess(get(1,inv));
    return g==0?get(2,inv):g>0?get(1,inv):get(3,inv);
  }
  if(sz==4){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 25 / 25
• Subtask 2: 25 / 25
• Subtask 3: 25 / 25
• Subtask 4: 25 / 25