Submission #23434474

---

Source Code Expand

#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define pf push_front
#define ft first
#define sec second
#define pr pair<int,int>
#define ISCC ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
using namespace std; 
int t ,n ,m;
ll a[100005] ,k ,sum[100005];
vector<ll> vec;
int sol()
{
	int l = 0 ,r = n+1 ,mid;
	while(l<r)
	{
		mid = (l+r)>>1;
		//cout << sum[mid] << ' ' << l <<'\n';
		if(sum[mid] >= k) r = mid;
		else l = mid+1;
	}
	return l;
}
int main()
{ 
	ISCC;
	cin >> n >> m;
	for(int i=1 ;i<=n ;i++)
	{
		cin >> a[i];
		sum[i] = sum[i-1] + (a[i]-a[i-1]-1);
	}sum[n+1] = sum[n] + (1e18-a[n]-1);
	for(int i=1 ,now ;i<=m ;i++)
	{
		cin >> k;  now = sol()-1;
		cout << a[now] + abs(k-sum[now]) << '\n';
	}
	
	return 0;
}

Submission Info

Judge Result