제출 #204761

#제출 시각아이디문제언어결과실행 시간메모리
204761jasony123123Hotter Colder (IOI10_hottercolder)C++11
52 / 100
828 ms24560 KiB
#include "grader.h"

#include <bits/stdc++.h>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
//using namespace __gnu_pbds;
#define FOR(i,start,end) for(int i=start;i<(int)(end);i++)
#define FORE(i,start,end) for(int i=start;i<=(int)end;i++)
#define RFORE(i,start,end) for(int i = start; i>=end; i--)
#define all(a) a.begin(), a.end()
#define v vector
typedef long long ll;
typedef pair<int, int > pii;
//template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T> void minn(T &a, T b) { a = min(a, b); }
template<class T> void maxx(T &a, T b) { a = max(a, b); }


int go(int L, int R){
/*	LIMIT--;
	if(!LIMIT){
		exit(0);
	}

	cout << "go " << L << " to " << R << endl;
*/
	if(L==R) return L;

	int M = (L+R)/2;
	int Q1 = (L+M)/2;
	int Q3 = max((M+R)/2, Q1+1);

	Guess(Q1);
	int res = Guess(Q3);

	int X = (Q1+Q3)/2;
	int XL, XR;
	if((Q1+Q3)%2 == 0) 
		XL = X-1, XR = X+1;
	else 
		XL = X, XR = X+1;

	if(res == 0) return (Q1+Q3)/2;
	else if (res == 1) return go(XR,R); // hotter
	else go(L,XL); // colder
}

int HC(int N){
	return go(1,N);
}

컴파일 시 표준 에러 (stderr) 메시지

hottercolder.cpp: In function 'int go(int, int)':
hottercolder.cpp:47:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...