제출 #833930

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
833930		Josia	커다란 상품 (IOI17_prize)	C++17	20 / 100	3069 ms	460 KiB

prize

#include "prize.h"
using namespace std;
#include <bits/stdc++.h>


map<int, vector<int>> rem;
vector<int> myAsk(int pos) {
	if (rem.count(pos)) return rem[pos];
	return rem[pos] = ask(pos);
}



int getNumBetter(vector<int> x) {
	return x[0]+x[1];
}


int find_best(int n) {
	rem.clear();
	int numBetter = 0;
	int ind = 0;

	for (int i = 0; i<min(n, 1000); i++) {
		int hereBetter = getNumBetter(myAsk(i));
		if (hereBetter > numBetter) {
			numBetter = hereBetter;
			ind = i;
		}
	}

	set<int> candidates;
	for (int i=0; i<ind; i++) candidates.insert(i);

	int pos = ind;

	int oldL=-1, oldR=-1;
	while (true) {
		int l = pos+1, r = n-1;
		while (l<r) {
			int m = (l+r)/2;
			vector<int> ans = myAsk(m);

			if (getNumBetter(ans) < numBetter) {
				r = m;
				continue;
			}

			if (ans[1] < numBetter-candidates.size()) {
				r = m;
			}
			else l = m+1;
		}

		int pos = l;

		while (pos < n && getNumBetter(myAsk(pos)) < numBetter) {
			candidates.insert(pos);
			pos++;
		}

		if (candidates.size() == numBetter) break;

	}

	for (int i: candidates) {
		if (getNumBetter(myAsk(i)) == 0) return i;
	}

	assert(0);
}

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

prize.cpp: In function 'int find_best(int)':
prize.cpp:49:15: warning: comparison of integer expressions of different signedness: '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'} and 'std::set<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |    if (ans[1] < numBetter-candidates.size()) {
prize.cpp:62:25: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   62 |   if (candidates.size() == numBetter) break;
      |       ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
prize.cpp:37:6: warning: unused variable 'oldL' [-Wunused-variable]
   37 |  int oldL=-1, oldR=-1;
      |      ^~~~
prize.cpp:37:15: warning: unused variable 'oldR' [-Wunused-variable]
   37 |  int oldL=-1, oldR=-1;
      |               ^~~~

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