제출 #129634

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
129634		DanerZein	커다란 상품 (IOI17_prize)	C++14	0 / 100	2 ms	248 KiB

prize

#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int>ii;
vector<int>as;
int encontrar_diamond(int l,int r,ii left,ii right){
    if(l>r){
        return -1;
    }
    int mi=(l+r)/2;
    if(l==r){
        return -1;
    }
    as=ask(mi);
    if(as[0]==0 and as[1]==0){
        return mi;
    }
    int re=-1;
    pair<int,int>c;
    c=ii(as[0],as[1]);
    if(c.first>0 and c!=left){
        re=encontrar_diamond(l,mi-1,left,c);
    }
    if(r==-1 and c.second>0 and c!=right){
        re=encontrar_diamond(mi+1,r,c,right);
    }
    return re;
}

int find_best(int n) {
	int ans=encontrar_diamond(0,n-1,ii(-1,-1),ii(-1,-1));
	return ans;
}
/*
static const int max_q = 10000;
static int n;
static int query_count = 0;
static vector<int> g;
static vector<vector<int> > rank_count;

vector<int> ask(int i) {
	query_count++;
	if(query_count > max_q) {
		cerr << "Query limit exceeded" << endl;
		exit(0);
	}

	if(i < 0 || i >= n) {
		cerr << "Bad index: " << i << endl;
		exit(0);
	}

	vector<int> res(2);
	res[0] = rank_count[g[i] - 1][i + 1];
	res[1] = rank_count[g[i] - 1][n] - res[0];
	return res;
}

int main() {
	cin >> n;

	g.resize(n);
	for(int i = 0; i < n; i++) {
		cin >> g[i];
		if(g[i] < 1) {
			cerr << "Invalid rank " << g[i] << " at index " << i << endl;
			exit(0);
		}
	}

	int max_rank = *max_element(g.begin(), g.end());

	rank_count.resize(max_rank + 1, vector<int>(n + 1, 0));
	for(int r = 0; r <= max_rank; r++) {
		for(int i = 1; i <= n; i++) {
			rank_count[r][i] = rank_count[r][i - 1];
			if(g[i - 1] == r)
			  rank_count[r][i]++;
		}
	}

	for(int i = 0; i <= n; i++)
		for(int r = 1; r <= max_rank; r++)
			rank_count[r][i] += rank_count[r - 1][i];

	int res = find_best(n);
	cout << res << endl << "Query count: " << query_count << endl;

	return 0;
}*/

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