답안 #54222

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
54222 2018-07-02T20:56:59 Z radoslav11 커다란 상품 (IOI17_prize) C++14
20 / 100
97 ms 25400 KB
#include <bits/stdc++.h>
#include "prize.h"
//#include "Lgrader.cpp"

using namespace std;
template<class T, class T2> inline int chkmax(T &x, const T2 &y) { return x < y ? x = y, 1 : 0; }
template<class T, class T2> inline int chkmin(T &x, const T2 &y) { return x > y ? x = y, 1 : 0; }
const int MAXN = (1 << 20);

vector<int> memo[MAXN];

vector<int> query(int i) 
{
	if(memo[i].empty()) memo[i] = ask(i);
	return memo[i];
}

int find_best(int n) 
{
	int i = 0;
	while(i < n)
	{
		auto curr = query(i);

		if(curr[0] == 0 && curr[1] == 0)
			return i;

		int low = i, high = n, mid, ret;
		while(low <= high)
		{
			mid = (low + high) >> 1;
			if(curr == query(mid))
				low = mid + 1, ret = mid;
			else
				high = mid - 1;
		}

		i = ret + 1;
	}

	return -1;
}

Compilation message

prize.cpp: In function 'int find_best(int)':
prize.cpp:38:5: warning: 'ret' may be used uninitialized in this function [-Wmaybe-uninitialized]
   i = ret + 1;
   ~~^~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 24824 KB Output is correct
2 Correct 27 ms 24912 KB Output is correct
3 Correct 23 ms 24992 KB Output is correct
4 Correct 24 ms 25092 KB Output is correct
5 Correct 24 ms 25092 KB Output is correct
6 Correct 23 ms 25092 KB Output is correct
7 Correct 24 ms 25108 KB Output is correct
8 Correct 23 ms 25108 KB Output is correct
9 Correct 27 ms 25108 KB Output is correct
10 Correct 24 ms 25240 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 25240 KB Output is correct
2 Correct 24 ms 25240 KB Output is correct
3 Correct 25 ms 25240 KB Output is correct
4 Correct 28 ms 25240 KB Output is correct
5 Correct 22 ms 25240 KB Output is correct
6 Correct 23 ms 25240 KB Output is correct
7 Correct 23 ms 25240 KB Output is correct
8 Correct 23 ms 25240 KB Output is correct
9 Correct 23 ms 25240 KB Output is correct
10 Correct 22 ms 25240 KB Output is correct
11 Correct 34 ms 25240 KB Output is correct
12 Correct 28 ms 25240 KB Output is correct
13 Correct 29 ms 25240 KB Output is correct
14 Correct 26 ms 25240 KB Output is correct
15 Correct 37 ms 25240 KB Output is correct
16 Incorrect 97 ms 25400 KB Incorrect
17 Halted 0 ms 0 KB -