제출 #1247314

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1247314		thdh__	Bitaro's travel (JOI23_travel)	C++20	100 / 100	472 ms	4108 KiB

travel

#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define eb emplace_back
#define pu push
#define ins insert
#define fi first
#define se second
#define all(a) a.begin(),a.end()
#define bruh ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define fu(x,a,b) for (auto x=a;x<=b;x++)
#define fd(x,a,b) for (auto x=a;x>=b;x--)
#define int ll

using namespace std;
//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());

/*
Competitive Programming notes that I need to study & fix my dumbass self:

1. Coding:
- Always be sure to check the memory of arrays (maybe use vectors), for loops
- Always try to maximize the memory if possible, even if you are going for subtasks
- Do not exploit #define int long long, it will kill you

2. Stress: 
- Always try generating big testcases and try if they run

3. Time management:
- Don't overcommit or undercommit, always spend a certain amount of time to think a problem, don't just look at it and say I'm fucked
- Do not spend too much time coding brute-force solutions, they should be easily-codable solutions that don't take up too much time

Time management schedule:
Offline / LAH days (4 problems - 3h):
15' thinking of solution / idea
1. no idea: skip
2. yes idea: continue thinking for <= 15'

+ implementing: <= 20'
+ brute-force: <= 5'
+ test generator: <= 5'

I hate offline because I am dumb
*/

typedef pair<int, int> ii;
const int N = 2e5+5;
const int B = 750;
const int mod = 1e9+7;
const int inf = 1e18;
using cd = complex<double>;
const long double PI = acos(-1);
int power(int a,int b) {ll x = 1;if (a >= mod) a%=mod; while (b) {if (b & 1) x = x*a % mod;a = a*a % mod;b>>=1;}return x;} 

int n, q;
int x[N];

void solve()
{
	cin>>n;
	for (int i = 1; i <= n; i++) cin>>x[i];
	cin>>q;
	while (q--) 
	{
		int s; cin>>s;
		int pos = lower_bound(x+1, x+n+1, s) - x;
		int l, r;
		if (pos == n+1) l = r = pos-1;
		else if (x[pos] == s || pos == 1 || ((x[pos] - s) < (s - x[pos-1]))) l = r = pos;
		else l = r = pos-1;
		int ans = abs(s-x[l]);
		s = x[l];
		while (true) 
		{
			if (l == 1) 
			{
				ans += abs(x[n] - s);
				break;
			} 
			if (r == n) 
			{
				ans += abs(s - x[1]);
				break;
			}
			int le = x[l-1], ri = x[r+1];
			if (abs(s - le) <= abs(s - ri)) 
			{
				int p = lower_bound(x+1, x+n+1, 2*s-ri) - x;
				ans += abs(s - x[p]);
				s = x[p];
				l = p;
			} else 
			{
				int p = upper_bound(x+1, x+n+1, 2*s-le) - x - 1;
				ans += abs(s - x[p]);
				s = x[p];
				r = p;
			}
		}
		cout<<ans<<endl;
	}
}

/*
Go through the mistakes you usually make and revise your code, for god's sake...
*/

signed main()
{
	bruh
	//freopen("input.inp","r",stdin);
	//freopen("output.inp","w",stdout);
	int t = 1;
	// cin>>t;
	while (t--)
	{
		solve();
		cout<<"\n";
	}
}

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