제출 #891257

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
891257		vjudge1	Bitaro's travel (JOI23_travel)	C++17	0 / 100	1 ms	348 KiB

travel

#include <bits/stdc++.h>
using namespace std;/*
<<<<It's never too late for a new beginning in your life>>>>
Today is hard
  tomorrow will worse
  but the day after tomorrow will be the sunshine..
 
HARD WORK BEATS TALENT WHEN TALENT DOESN'T WORK HARD............
Never give up  */
//The most CHALISHKANCHIK
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define int long long
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef vector<pair<int,int> > vii;
const long long N = 1e5+50, inf = 1e18, mod = 1e9+7;
void solve(){
	int n;
	cin >> n;
	vi v(n);
	for(int i = 0; i < n; i++){
		cin >> v[i];
	}
	int q;
	cin >> q;
////////////////////////////////psd vajno
	n--;
////////////////////////////////
	while(q--){
		int x, ans = 0;
		cin >> x;
		int l = lower_bound(all(v), x) - v.begin();
		int r = l+1;
		if(l >= n)l=n-1;
		bool ok = 1;
		while(ok){
			//~ cout << v[l] << ' ' << v[r] << '\n';
			if(x - v[l] <= v[r] - x){
				int _l = lower_bound(all(v), x-(v[r]-x))-v.begin();
				if(v[_l] < x-(v[r]-x))_l++;
				if(_l > n)_l--;
				//~ cout << "_L   " << _l << '\n';
				ans += x-v[_l];
				if(_l == 0){
					ans += v[n]-v[0];
					ok = 0;
					break;
				}
				x = v[_l];
				l = _l-1;
			}
			else{
				int _r = lower_bound(all(v), x+(x-v[l]))-v.begin();
				if(_r > n)_r--;
				//~ cout << "_R   " << _r << '\n';
				ans += v[_r]-x;
				if(_r == n){
					ans += v[n]-v[0];
					ok = 0;
					break;
				}
				x = v[_r];
				r = _r+1;
			}
			//~ cout << x << ' ' << l << ' ' << r << ' ' << ans << '\n';
		}
		cout << ans << '\n';
	}
}
main(){
	ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
	int t = 1;
	//~ cin >> t;
	while(t--){
		solve();
	}
}

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

travel.cpp:74:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   74 | main(){
      | ^~~~

• Subtask 1: 0 / 5
• Subtask 2: 0 / 10
• Subtask 3: 0 / 30
• Subtask 4: 0 / 55