제출 #290735

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
290735		abyyskit	커다란 상품 (IOI17_prize)	C++14	20 / 100	53 ms	496 KiB

prize

#include "prize.h"
#include<bits/stdc++.h>
using namespace std;
#define FOR(i, x, y) for(int i = x; i < y; ++i)
#define pb push_back

int ANS;
int SCORE;

void findAll(int l, int r, int L, int R){
	//cout << "findALL(" << l << ", " << r << ")\n";
	if (l == r) return;
	int mid = (l + r)/2;
	vector<int> tmp = ask(mid);
	if (tmp[0] + tmp[1] == 0){
		ANS = mid;
		return;
	}
	if (tmp[0] + tmp[1] == SCORE){
		if (tmp[0] - L != 0){
			findAll(l, mid, L, tmp[1]);
		}
		if (R - tmp[1] != 0){
			findAll(mid + 1, r, tmp[0], R);
		}
		return;
	}
	int rp = l;
	int rL;
	int rR;
	FOR(i, mid + 1, r){
		tmp = ask(i);
		if (tmp[0] + tmp[1] == 0){
			ANS = mid;
			return;
		}
		if (tmp[0] + tmp[1] == SCORE){
			rp = i;
			rL = tmp[0];
			rR = tmp[1];
			break;
		}
	}
	int lp = r;
	int lL;
	int lR;
	for (int i = mid - 1; i >= l; --i){
		tmp = ask(i);
		if (tmp[0] + tmp[1] == 0){
			ANS = mid;
			return;
		}
		if (tmp[0] + tmp[1] == SCORE){
			lp = i;
			lL = tmp[0];
			lR = tmp[1];
			break;
		}
	}
	if (rp != l){
		findAll(rp + 1, r, rL, R);
	}
	if (lp != r){
		findAll(l, lp, L, lR);
	}

}

int find_best(int n) {
	int score = 0;
	FOR(i, 0, min(474, n)){
		vector<int> tmp = ask(i);
		score = max(score, tmp[0] + tmp[1]);
		if (tmp[0] + tmp[1] == 0){
			return i;
		}
	}
	SCORE = score;
	findAll(0, n, 0, 0);
	return ANS;
}

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

prize.cpp: In function 'void findAll(int, int, int, int)':
prize.cpp:30:6: warning: variable 'rR' set but not used [-Wunused-but-set-variable]
   30 |  int rR;
      |      ^~
prize.cpp:45:6: warning: variable 'lL' set but not used [-Wunused-but-set-variable]
   45 |  int lL;
      |      ^~
prize.cpp:64:10: warning: 'lR' may be used uninitialized in this function [-Wmaybe-uninitialized]
   64 |   findAll(l, lp, L, lR);
      |   ~~~~~~~^~~~~~~~~~~~~~
prize.cpp:61:10: warning: 'rL' may be used uninitialized in this function [-Wmaybe-uninitialized]
   61 |   findAll(rp + 1, r, rL, R);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~

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