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++: #include <iostream>
#include <algorithm>
#include<cstdio>
#include<string>
#include<vector>
using namespace std;
int main() {
	long long int n, t;
	int q;
	cin >>n >>t >>q;
	vector<long long int> w;
	
	int home[100001] = { 0 };
	
	
	for (long long int i = 0; i < n; i++) {
		long long int a;
		cin >> a >> home[i];
		w.push_back(a);
	}
	
	int key[1005] = {0};
	for (int i = 0; i < q; i++) {
		int a;
		cin >> a;
		key[a - 1] = 1;
	}
	int west = 0;
	int east = 0;
	int west2 = 0;
	int east2 = 0;
	vector<long long int> talkpoint;
	long long int tp;
	for (long long int i = 0; i < n; i++) {
		if (i < 50000) {
			if (home[i]==2) {
				if (west==0) {
					
						long long int b = w[i] - t;
						talkpoint.push_back(b);
				
				}
				else {
					talkpoint.push_back(tp);
					
					east = 1;
				}
			}
			if (home[i]==1) {
				
					if (home[i + 1] == 2) {
						tp = (w[i] + w[i + 1]) / 2;
						for (long long int j = 0; j <= east2; j++) {
							talkpoint.push_back(tp);
						}
						west = 1;
					}
					else if (i == n - 1) {
						long long int d = w[i] + t;
						talkpoint.push_back(d);
					}
					else {
						east2++;
						west = 1;
					}
				

			}

		}
	}
	for (long long int i = 0; i < n; i++) {
		if (key[i] == 1) {
			
			long long int e;
			if (talkpoint[i] < w[i]) {
				e = w[i] - talkpoint[i];
			}
			else {
				e = talkpoint[i] - w[i];
			}
			if (e <= t) {
				cout << talkpoint[i] << endl;
			}
			else {
				if (home[i] == 1) {
					cout << w[i] + t << endl;
				}
				else {
					cout << w[i] - t << endl;
				}
			}
		}
	}
	return 0;
}

C++: #include <iostream>
using namespace std;

long long n, q, t;

int d[100000];
long long a[100000], v[1000];

int main()
{
	cin >> n >> t >> q;

	for (long long i = 0; i < n; i++)
		cin >> a[i] >> d[i];

	for (long long i = 0; i < q; i++)
		cin >> v[i];

	long long i = 0;
	while (d[i] == 2) {
		a[i] -= t;
		i++;
	}

	i = n - 1;
	while (d[i] == 1) {
		a[i] += t;
		i--;
	}

	for (long long i = 0; i < n - 1; i++) {
		if (d[i] == 1 && d[i + 1] == 2) {
			if (a[i + 1] - a[i] <= t * 2) {
				a[i] = a[i] / 2 + a[i + 1] / 2;
				a[i + 1] = a[i];
			}
			else {
				a[i] += t;
				a[i + 1] -= t;
			}
		}
	}

	for (long long i = 0; i < n - 1; i++) {
		if (d[i] == 1 && d[i + 1] == 1) {
			long long j = i + 1;

			while (d[j] == 1)
				j++;

			if (j < n - 1) {
				for (long long k = i; k < j; k++) {
					if (a[j] - a[k] <= t)
						a[k] = a[j];
					else
						a[k] += t;
				}
				i = j - 1;
			}
			else
				break;
		}
		else if (d[i] == 2 && d[i + 1] == 2) {
			long long j = i + 1;
			while (d[j] == 2)
				j++;
			if (i > 0) {
				for (long long k = j - 1; k >= i; k--) {
					if (a[k] - a[i] <= t)
						a[k] = a[i];
					else
						a[k] -= t;
				}
			}
			i = j - 1;
		}
	}

	for (int i = 0; i < q; i++)
		cout << a[v[i] - 1] << endl;

	return 0;
}