Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
	"strings"
)

func main() {

	sc := bufio.NewScanner(os.Stdin)
	sc.Scan()
	args := strings.Split(sc.Text(), " ")
	n, _ := strconv.Atoi(args[0])
	t, _ := strconv.ParseInt(args[1], 10, 64)

	q, _ := strconv.Atoi(args[2])

	pos := make([]int64, n)
	direction := make([]bool, n)

	for i := 0; i < n; i++ {
		sc.Scan()
		args = strings.Split(sc.Text(), " ")

		pos[i], _ = strconv.ParseInt(args[0], 10, 64)
		q, _ := strconv.Atoi(args[1])
		if q == 1 {
			direction[i] = true
		}
	}

	qq := make([]int, q)
	for i := 0; i < q; i++ {
		sc.Scan()
		args = strings.Split(sc.Text(), " ")

		qq[i], _ = strconv.Atoi(args[0])
	}

	ans(n, q, t, pos, direction, qq)

}

func ans(n, q int, t int64, pos []int64, dir []bool, qq []int) {

	colleation := []int64{} // syoutotu positon

	for i := 1; i < n; i++ {
		if dir[i-1] == dir[i] {
			continue
		}
		colleation = append(colleation, (pos[i-1]+pos[i])/2)

	}
	//fmt.Println(colleation)
	for i := 0; i < q; i++ {
		var ans int64
		ans = int64(-9999999)
		if dir[qq[i]-1] == true {
			// 東向きなら現ポジから＋方向で一番近い衝突点との距離を求めて、Tとの差が
			for _, v := range colleation {
				if v <= pos[qq[i]-1] {
					continue
				} else {
					// 衝突予定点が確定。衝突点との距離がT以下なら衝突点で停止
					if v-pos[qq[i]-1] <= t {
						ans = v
					} else {
						ans = pos[qq[i]-1] + int64(t)
					}
					break
				}
			}
			if ans == -9999999 {
				ans = pos[qq[i]-1] + int64((t))
			}

		} else {
			// nishi向きなら現ポジから-方向で一番近い衝突点との距離を求めて、Tとの差が
			for j := len(colleation); j > 0; j-- {
				if colleation[j-1] >= pos[qq[i]-1] {
					continue
				}
				v := colleation[j-1]
				//fmt.Printf("hoge=%d\n", v)
				// 衝突予定点が確定
				if pos[qq[i]-1]-v <= t {
					ans = v
				} else {
					ans = pos[qq[i]-1] - int64((t))
				}
				break

			}
			if ans == -9999999 {
				ans = pos[qq[i]-1] - int64((t))
			}

		}
		fmt.Printf("%d\n", ans)

	}

}

C++: //q4.cpp

#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>

#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>

#include <functional>
#include <cassert>

typedef long long ll;
using namespace std;

#define debug(x) cerr << #x << " = " << x << endl;


#define mod 1000000007 //1e9+7
#define INF 1000000000 //1e9
#define LLINF 2000000000000000000LL //2e18
#define SIZE 100010


int n,q,d[SIZE];
ll t,a[SIZE],ans[SIZE] = {0};

void check(int l,int r){
    // [l,c] ???
    // (c,r] ???
    
    int c = -1;
    ll c_a = 0;
    
    for(int i=l;i<r;i++){
        if(d[i]==1 && d[i+1]==2){
            c = i;
            c_a = (a[i]+a[i+1])/2;
            break;
        }
    }
    
    assert(c!=-1);
    
    for(int i=l;i<=r;i++){
        if(abs(a[i]-c_a) <= t){
            ans[i] = c_a;
        }else{
            if(d[i]==1)
                ans[i] = a[i] + t;
            else
                ans[i] = a[i] - t;
        }
    }
}

int main(){
    int x;
    
    scanf("%d%lld%d",&n,&t,&q);
    
    for(int i=1;i<=n;i++){
        scanf("%lld%d",a+i,d+i);
    }
    
    a[0] = -LLINF*2;
    d[0] = 1;
    a[n+1] = LLINF*2;
    d[n+1] = 2;
    a[n+2] = LLINF*2;
    d[n+2] = 1;
    
    
    int l = 0;
    
    for(int i=0;i<=n+1;i++){
        
        if(d[i]==2 && d[i+1]==1){
            
            check(l,i);
            
            l = i+1;
        }
    }
    
    for(int i=0;i<q;i++){
        scanf("%d",&x);
        
        printf("%lld\n",ans[x]);
    }
    
    return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
const int dx[]={1,0,-1,0,1,-1,-1,1};
const int dy[]={0,1,0,-1,1,1,-1,-1};
const int INF = 1e9;
const long long LINF = 1e18;
const double EPS = 1e-8;
#define PB push_back
#define mk make_pair
#define fr first
#define sc second
#define ll long long
#define reps(i,j,k) for(int i = (j); i < (k); ++i)
#define rep(i,j) reps(i,0,j)
#define all(a) (a).begin(),(a).end()
#define MOD 1000000007
typedef pair<int,int> Pii;
typedef vector<int> vi;
typedef pair<string, int> Psi;
typedef pair<ll, ll> Pll;
 
ll A[100001];
int way[100001];
 
vector<ll> points;
 
ll search(int idx,ll T){
    ll l = 0;
    ll r = points.size();
    while(l + 1 != r){
        int med = (l+r)/2;
        if(points[med] > A[idx]){
            r = med;
        }
        else{
            l = med;
        }
    }
 
    int s;
    ll c;
    if(way[idx] == 1){
        s = l + 1;
        c = 1;
    }
    else if(way[idx] == 2){
        s = l;
        c = -1;
    }
    if(T >= abs(A[idx]-points[s])){
        return points[s];
    }
    return A[idx]+c*T;
}
 
int main(){
    int N,Q;
    ll T;
    scanf("%d%lld%d",&N,&T,&Q);
    points.PB(-LINF);
    rep(i,N){
        scanf("%lld%d",&A[i],&way[i]);
        if(i > 0 && way[i-1] == 1 && way[i] == 2){
            points.PB(A[i-1]+(A[i]-A[i-1])/2);
        }
    }
 
    points.PB(LINF);
    rep(i,Q){
        int x;
        scanf("%d",&x);
        --x;
        printf("%lld\n",search(x,T));
    }
 
    return 0;
}

C++: #include<bits/stdc++.h>
#define rep(i,n)for(ll i=0;i<n;i++)
using namespace std;
typedef long long ll;

ll n, t, q, x[100000], a[100000];
int d[100000];
vector<ll>v;


int main() {
	scanf("%lld%lld%lld", &n, &t, &q);
	rep(i, n)scanf("%lld%d", &a[i], &d[i]);
	rep(i, q)scanf("%lld", &x[i]);
	rep(i, n - 1) {
		if (d[i] == 1 && d[i + 1] == 2 && a[i + 1] - a[i] <= t * 2) {
			d[i] = d[i + 1] = 0;
			a[i] = a[i + 1] = (a[i + 1] + a[i]) / 2;
			v.push_back(a[i]);
		}
	}
	rep(i, n) {
		if (!d[i])continue;
		ll j = lower_bound(v.begin(), v.end(), a[i]) - v.begin();
		if (j < v.size() && d[i] == 1 && v[j] - a[i] <= t) {
			a[i] = v[j];
			d[i] = 0;
		}
		j--;
		if (0 <= j&&d[i] == 2 && a[i] - v[j] <= t) {
			a[i] = v[j];
			d[i] = 0;
		}
	}
	rep(j, q) {
		int i = x[j] - 1;
		if (d[i] == 1)printf("%lld\n", a[i] + t);
		else if (d[i])printf("%lld\n", a[i] - t);
		else printf("%lld\n", a[i]);
	}
}