Submission #1264916

#	Time	Username	Problem	Language	Result	Execution time	Memory
1264916		PlayVoltz	Bitaro's travel (JOI23_travel)	C++20	100 / 100	360 ms	4184 KiB

travel

#include <cstdio>
#include <stdio.h>
#include <stdbool.h>
#include <iostream>
#include <map>
#include <vector>
#include <climits>
#include <stack>
#include <string>
#include <queue>
#include <algorithm>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <cmath>
#include <cctype>
#include <bitset>
#include <iomanip>
#include <cstring>
#include <numeric>
#include <cassert>
using namespace std;
 
#define int long long
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second

int32_t main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n, q, c;
	cin>>n;
	vector<int> vect(n);
	for (int i=0; i<n; ++i)cin>>vect[i];
	cin>>q;
	while (q--){
		cin>>c;
		int r=upper_bound(vect.begin(), vect.end(), c)-vect.begin(), l=r-1, ans=0;
		if (l!=-1&&vect[l]==c)--l;
		while (1){
			if (l==-1){
				ans+=abs(c-vect[n-1]);
				break;
			}
			if (r==n){
				ans+=abs(c-vect[0]);
				break;
			}
			if (abs(vect[l]-c)<=abs(vect[r]-c)){
				int id=lower_bound(vect.begin(), vect.end(), c-abs(c-vect[r]))-vect.begin();
				ans+=abs(c-vect[id]);
				c=vect[id];
				l=id-1;
			}
			else{
				int id=lower_bound(vect.begin(), vect.end(), c+abs(c-vect[l]))-vect.begin()-1;
				ans+=abs(c-vect[id]);
				c=vect[id];
				r=id+1;
			}
		}
		cout<<ans<<"\n";
	}
}

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