답안 #1049612

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1049612 2024-08-09T02:21:29 Z LittleOrange 커다란 상품 (IOI17_prize) C++17
20 / 100
2 ms 2136 KB
#include "prize.h"
#include<bits/stdc++.h>
using namespace std;
using ll = int;
int find_best(int n) {
	mt19937_64 mt(random_device{}());
	vector<array<ll,2>> mem(n,{-1,-1});
	auto qry = [&](ll i){
		if (mem[i][0]==-1){
			auto a = ask(i);
			mem[i] = {a[0],a[1]};
		}
		return mem[i];
	};
	/*
	ll cnt = 0;
	vector<ll> a(n);
	iota(a.begin(),a.end(),0);
	shuffle(a.begin(),a.end(),mt);*/
	ll ans = -1;
	function<void(ll,ll,ll,ll)> dfs;
	dfs = [&](ll l, ll r,ll dl, ll dr){
		if (ans != -1) return;
		if (l == r){
			ans = l;
			return;
		}
		ll m = l+r>>1;
		auto o = qry(m);
		if (o[0]+o[1]==0) {
			ans = m;
			return;
		}
		if (o[0]-dl>0){
			dfs(l,m-1,dl,dr+o[1]);
		}
		if(o[1]-dr>0){
			dfs(m+1,r,dl+o[0],dr);
		}
	};
	dfs(0,n-1,0,0);
	return ans;
}

Compilation message

prize.cpp: In lambda function:
prize.cpp:28:11: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   28 |   ll m = l+r>>1;
      |          ~^~
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1880 KB Output is correct
2 Correct 1 ms 1880 KB Output is correct
3 Correct 1 ms 1880 KB Output is correct
4 Correct 1 ms 1880 KB Output is correct
5 Correct 1 ms 1880 KB Output is correct
6 Correct 2 ms 1880 KB Output is correct
7 Correct 1 ms 1960 KB Output is correct
8 Correct 2 ms 1880 KB Output is correct
9 Correct 1 ms 1880 KB Output is correct
10 Correct 1 ms 1880 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1880 KB Output is correct
2 Correct 1 ms 1960 KB Output is correct
3 Correct 1 ms 1880 KB Output is correct
4 Correct 1 ms 1880 KB Output is correct
5 Correct 1 ms 1964 KB Output is correct
6 Correct 1 ms 1880 KB Output is correct
7 Correct 1 ms 1880 KB Output is correct
8 Correct 1 ms 1880 KB Output is correct
9 Correct 1 ms 1880 KB Output is correct
10 Correct 1 ms 2136 KB Output is correct
11 Incorrect 1 ms 1880 KB Integer -1 violates the range [0, 199999]
12 Halted 0 ms 0 KB -