제출 #615700

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
615700		IvanJ	커다란 상품 (IOI17_prize)	C++17	0 / 100	73 ms	95636 KiB

prize

#include<bits/stdc++.h>
#include "prize.h"

#define pb push_back
#define x first
#define y second

using namespace std;

typedef pair<int, int> ii;

const int maxn = 2e6 + 5;

vector<int> A[maxn];
vector<int> V;

void find(int lo, int hi) {
	return;
	int mid = (lo + hi) / 2;
	if(A[mid].size() == 0) A[mid] = ask(mid);
	if(A[mid][0] + A[mid][1] < A[hi][0] + A[hi][1]) {V.pb(mid);return;}
	if(A[mid][1] == A[hi][1]) hi = mid;
	else lo = mid + 1;
}

map<ii, int> vis;

void solve(int lo, int hi) {
	if(vis[{lo, hi}]) {
		while(1) {}
	}
	vis[{lo, hi}] = 1;
	if(lo == hi) return;
	if(lo == 0 && A[hi][0] == 0) return;
	if(lo == 0 && A[hi][0] == 1) {find(lo, hi);return;}
	if(lo && A[lo - 1][1] == A[hi][1]) return;
	if(lo && A[lo - 1][1] == A[hi][1] + 1) {find(lo, hi);return;} 
	
	int mid = (lo + hi) / 2;
	int mid1 = mid;
	while(1) {
		if(A[mid1].size() == 0) A[mid1] = ask(mid1);
		if(A[mid1][0] + A[mid1][1] < A[hi][0] + A[hi][1]) V.pb(mid1), mid1--;
		else break;
		if(mid1 < lo) break;
	}
	
	if(lo < mid1) solve(lo, mid1);
	solve(mid + 1, hi);
}

int find_best(int n) {
	if(n <= 5000) {
		for(int i = 0;i < n;i++) {
			A[i] = ask(i);
			if(A[i][0] + A[i][1] == 0) return i;
		}
	}
	int pos = -1;
	int s = 500;
	for(int i = n - 1;i >= n - s;i--) {
		A[i] = ask(i);
		if(pos == -1 || A[i][0] + A[i][1] > A[pos][0] + A[pos][1])
			pos = i;
	}
	
	for(int i = pos + 1;i < n;i++) V.pb(i);
	
	solve(0, pos);
	for(int i : V) {
		A[i] = ask(i);
		if(A[i][0] + A[i][1] == 0) return i;
	}
}

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

prize.cpp: In function 'int find_best(int)':
prize.cpp:74:1: warning: control reaches end of non-void function [-Wreturn-type]
   74 | }
      | ^

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