답안 #428702

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
428702 2021-06-15T13:57:03 Z errorgorn Sparklers (JOI17_sparklers) C++17
0 / 100
1 ms 204 KB
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ii pair<ll,ll>
#define fi first
#define se second
#define endl '\n'

#define puf push_front
#define pof pop_front
#define pub push_back
#define pob pop_back
#define lb lower_bound
#define ub upper_bound

#define rep(x,s,e) for (auto x=s-(s>e);x!=e-(s>e);s<e?x++:x--)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int) (x).size()

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int n,k,t;
ll arr[100005];

bool memo[1005];

bool can(ll i){
	memset(memo,false,sizeof(memo));
	
	rep(x,1,k+1) if (arr[k]-arr[x]>2*i*(k-x)) memo[k]=true;
	
	rep(x,k+1,n+1){
		rep(y,1,x){
			//cout<<x<<" "<<y<<" "<<arr[x]-arr[y]<<endl;
			if (memo[y] && arr[x]-arr[y]>2*i*(x-y)) memo[x]=true;
			rep(z,x,0){
				if (memo[z]) break;
				memo[z]=true;
			}
		}
	}
	
	return !memo[n];
}

int main(){
	cin.tie(0);
	cout.tie(0);
	cin.sync_with_stdio(false);
	
	cin>>n>>k>>t;
	
	rep(x,1,n+1) cin>>arr[x];
	
	ll lo=-1,hi=1e9,mi;
	while (hi-lo>1){
		mi=hi+lo>>1;
		
		if (can(mi)) hi=mi;
		else lo=mi;
	}
	
	cout<<(hi+t-1)/t<<endl;
}

Compilation message

sparklers.cpp: In function 'int main()':
sparklers.cpp:58:8: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   58 |   mi=hi+lo>>1;
      |      ~~^~~
# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -