oj.uz

Submission #969094

# Submission time Handle Problem Language Result Execution time Memory
969094 2024-04-24T13:33:23 Z dong_gas Bitaro's travel (JOI23_travel) C++17
0 / 100
 373 ms 6964 KB 
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/extc++.h>
#define all(v) v.begin(), v.end()
#define zip(v) sort(all(v)), v.erase(unique(all(v)), v.end())
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pint;
typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

ll n, q;

void solve() {
    cin>>n;
	vector<ll> x(n);
	for(ll& xx: x) cin>>xx;
	cin>>q;
	while(q --> 0) {
		ll s; cin>>s;
		ll idx=lower_bound(all(x),s)-x.begin(), ans=0;
		ll l, r;
		if(idx==0) {
			cout<<x[n-1]-s<<'\n';
			continue;
		}
		else if(idx==n) {
			cout<<s-x[0]<<'\n';
			continue;
		}
		else {
			ll rd=x[idx]-s, ld=s-x[idx-1];
			if(ld<=rd) ans+=ld, l=r=idx-1, s=x[idx-1];
			else ans+=rd, l=r=idx, s=x[idx];
		}
		//l~r까지 완료 함...
		while(1) {
			if(l==0) {
				ans+=x[n-1]-s;
				break;
			}
			if(r==n-1) {
				ans+=s-x[0];
				break;
			}
			bool chk=false;
			if(l==1 && r==3) chk=true;
			if(s-x[l-1]<=x[r+1]-s) {//좌
				ll i=lower_bound(all(x),2*s-x[r+1])-x.begin();
				ans+=s-x[i];
				s=x[i];
				l=i;
			}
			else {				
				ll i=lower_bound(all(x),2*s-x[l-1])-x.begin();
				if(i==n) i--;
				//if(chk) cout<<i<<endl;
				ans+=x[i]-s;
				s=x[i];
				r=i;
			}
			if(chk) {
				//cout<<ans<<' '<<l<<' '<<r<<' '<<s<<endl;
				//return;
			}
			
		}
		cout<<ans<<'\n';
	}
}
 
int main() {
    cin.tie(0)->sync_with_stdio(0);
    int tc=1; //cin>>tc;
    while(tc--) solve();
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Incorrect 1 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Incorrect 1 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 347 ms 5896 KB Output is correct
8 Correct 340 ms 5808 KB Output is correct
9 Correct 373 ms 5892 KB Output is correct
10 Correct 339 ms 5944 KB Output is correct
11 Correct 357 ms 6060 KB Output is correct
12 Correct 346 ms 5956 KB Output is correct
13 Correct 33 ms 4176 KB Output is correct
14 Correct 26 ms 1884 KB Output is correct
15 Incorrect 231 ms 6964 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Incorrect 1 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -