제출 #382185

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
382185		MODDI	새로운 문제 (POI11_pio)	C++14	27 / 100	1094 ms	4572 KiB

pio

#include <bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vi vector<int>
#define vl vector<ll>
#define mp make_pair
#define pb push_back
using namespace std;
int n;
vl arr;
bool check(int height, int pos){
	for(int i = 0; i < n; i++){
		if(i == pos)
			continue;
		else{
			if(arr[i]<= arr[pos] + height - sqrt(abs(i - pos)))
				continue;
			else
				return false;
		}
	}
	return true;
}	
int main(){
	
	cin>>n;
	for(int i = 0; i < n; i++){
		int a;
		cin>>a;
		arr.pb(a);
	}
	for(int i = 0; i < n; i++){
		int l = 1, r = 1000000, mid;
		while(l <= r){
		    mid = (l + r) / 2;
			bool good = check(mid, i);
			if(good)
				r = mid - 1;
			else
				l = mid + 1;
		}
		cout<<l<<endl;
	}
	return 0;
}

• Subtask 1: 9 / 9
• Subtask 2: 9 / 9
• Subtask 3: 9 / 9
• Subtask 4: 0 / 9
• Subtask 5: 0 / 9
• Subtask 6: 0 / 9
• Subtask 7: 0 / 9
• Subtask 8: 0 / 9
• Subtask 9: 0 / 9
• Subtask 10: 0 / 9
• Subtask 11: 0 / 10