oj.uz

답안 #1013390

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1013390 2024-07-03T13:47:04 Z NintsiChkhaidze 커다란 상품 (IOI17_prize) C++17
0 / 100
 7 ms 10328 KB 
#include <bits/stdc++.h>
#define pb push_back
#include "prize.h"
using namespace std;

bool fix[200003];
int Q;
vector <int> dp[200003];

vector <int> askk(int x){
	if (dp[x].size()) return dp[x];
	++Q;
 	if (Q > 10000) assert(0);
	return dp[x] = ask(x);
}

int find_best(int n){
	
	int block = 500,mx = -1,idx = -1;
	vector <int> opt;
		
	for (int i = 0; i < min(n,block); i++){
		vector <int> vec = askk(i);
		int sum = vec[0] + vec[1];
		if (sum == 0) return i;
		
		if (sum > mx){
			mx = sum;
			opt = vec;
			idx = i;
		}
	}
	
	for (int i = idx; i < n; i++){
		vector <int> vec = askk(i);
		if (vec[0] + vec[1] == 0) return i;
		if (vec[0] + vec[1] != mx) continue;
		
		int id = i;
		int l = i + 1, r = n - 1,res = i;
		while (l <= r){
			int mid = (l + r)/2;
			vector <int> vec = askk(mid);
			if (vec[0] + vec[1] == 0) return mid;
			if (vec[0] + vec[1] != mx){
				r = mid - 1;
			}else{
				res = mid;
				l = mid + 1;
			}
		}
		
		for (int j = id; j <= res; j++)	
			fix[j] = 1;
			
		i = res;
	}
	
	for (int i = 0; i < n; i++){
		if (!fix[i]){
			vector <int> vec = askk(i);
			if (vec[0] + vec[1] == 0) return i; 
		}
	}
}

Compilation message

prize.cpp: In function 'int find_best(int)':
prize.cpp:20:15: warning: control reaches end of non-void function [-Wreturn-type]
   20 |  vector <int> opt;
      |               ^~~

Subtask #1
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 7 ms 10328 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #2
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 7 ms 10328 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -