제출 #581750

#제출 시각아이디문제언어결과실행 시간메모리
581750alireza_kaviani커다란 상품 (IOI17_prize)C++17
97.42 / 100
76 ms2000 KiB
#include <bits/stdc++.h>
#include "prize.h"
using namespace std;

typedef pair<int, int> pii;

#define X		first
#define Y		second
#define sep		' '

const int MAXN = 2e5 + 10;

int n , mx;
pii res[MAXN];
vector<int> ans;

pii query(int x){
	if(res[x] != pii(-1 , -1)){
		return res[x];
	}
	vector<int> a = ask(x - 1);
	res[x].X = a[0];
	res[x].Y = a[1];
	return res[x];
}

void solve(int l , int r){ // (l , r]
	pii A = query(r);
	if(A.X + A.Y == mx && A.X == ans.size()){
		return;
	}
	if(r - l == 1){
		ans.push_back(r);
		return;
	}
	int mid = l + r >> 1;
	solve(l , mid);
	solve(mid , r);
}

int find_best(int n) {
	fill(res + 1 , res + MAXN , pii(-1 , -1));
	for(int i = 0 ; i < min(500 , n) ; i++){
		pii cnt = query(i);
		mx = max(mx , cnt.X + cnt.Y);
	}
	solve(0 , n);
	for(int i : ans){
		pii A = query(i);
		if(A.X + A.Y == 0){
			return i - 1;
		}
	}
	return -1;
}

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

prize.cpp: In function 'void solve(int, int)':
prize.cpp:29:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |  if(A.X + A.Y == mx && A.X == ans.size()){
      |                        ~~~~^~~~~~~~~~~~~
prize.cpp:36:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   36 |  int mid = l + r >> 1;
      |            ~~^~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...