oj.uz

답안 #977382

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
977382 2024-05-07T20:27:49 Z mariaclara 커다란 상품 (IOI17_prize) C++17
20 / 100
 51 ms 2136 KB 
#include "prize.h"
#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
#define mk make_pair
#define pb push_back
#define fr first
#define sc second

int find_best(int n) {
	int i = 0, at = 0;

	vector<pii> resp(n, mk(-1,-1));
	while(1) {
		// achar primeiro cara mais valioso doq um pirulito de indice maior que i
		int l = i, r = n-1;
		while(l <= r) {
			int mid = (l+r)/2;
			vector<int> aux;
			if(resp[mid] == mk(-1,-1)) aux = ask(mid), resp[mid] = {aux[0],aux[1]};
			else aux = {resp[mid].fr};
			if(aux[0] > at) r = mid-1;
			else l = mid+1;
		}
		i = r;
		while(i >= 0) {
			vector<int> aux;
			if(resp[i] == mk(-1,-1)) aux = ask(i), resp[i] = {aux[0], aux[1]};
			else aux = {resp[i].fr, resp[i].sc};
			if(aux[0] + aux[1] == 0) return i;
			if(aux[0] + aux[1] == resp[r+1].fr + resp[r+1].sc or aux[0] == 0) break;
			i--;
		}

		i = r+1;
		at = resp[r+1].fr;
	}
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 1876 KB Output is correct
5 Correct 1 ms 1880 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 1880 KB Output is correct

Subtask #2
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 1 ms 2132 KB Output is correct
7 Correct 1 ms 2136 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 1880 KB Output is correct
11 Correct 2 ms 1880 KB Output is correct
12 Correct 1 ms 1880 KB Output is correct
13 Correct 3 ms 1880 KB Output is correct
14 Incorrect 51 ms 852 KB Incorrect
15 Halted 0 ms 0 KB -