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 <bits/stdc++.h>

#define whole(xs) xs.begin(),xs.end()

using namespace std;

namespace {

    typedef double real;
    typedef long long ll;

    const ll INF = LLONG_MAX / 2LL;

    template<class T> ostream& operator<<(ostream& os, const vector<T>& vs) {
        if (vs.empty()) return os << "[]";
        os << "[" << vs[0];
        for (int i = 1; i < vs.size(); i++) os << " " << vs[i];
        return os << "]";
    }
    template<class T> istream& operator>>(istream& is, vector<T>& vs) {
        for (auto it = vs.begin(); it != vs.end(); it++) is >> *it;
        return is;
    }

    struct P {
        int index;
        int a, d;
        P() {}
        P(int index, int a, int d) : index(index), a(a), d(d) {}
    };
    bool operator<(const P& a, const P& b) {
        return a.a < b.a;
    }

    ll N, T, Q;
    vector<P> X;
    vector<int> I;
    void input() {
        cin >> N >> T >> Q;
        X.clear(); X.resize(N);
        for (int i = 0; i < N; i++) {
            X[i].index = i;
            cin >> X[i].a >> X[i].d;
        }
        I.clear(); I.resize(Q);
        for (int i = 0; i < N; i++) {
            int q; cin >> q; q--;
            I[i] = q;
        }
    }


    void solve() {
        sort(whole(X));
        vector<ll> stop(N);
        vector<P> es;
        ll p = -INF;
        for (int i = 0; i < N; i++) {
            const P& a = X[i];
            if (a.d == 1) {
                es.push_back(a);
            } else {
                if (es.empty()) {
                    stop[a.index] = p;
                } else {
                    ll s = (es.back().a + a.a) / 2;
                    stop[a.index] = s;
                    p = s;
                    for (const auto& e : es) {
                        stop[e.index] = s;
                    }
                    es.clear();
                }
            }
        }
        for (auto e : es) {
            stop[e.index] = INF;
        }

        for (int q = 0; q < Q; q++) {
            int i = I[q];
            if (X[i].d == 1) {
                cout << min(stop[i], X[i].a + T) << endl;
            } else {
                cout << max(stop[i], X[i].a - T) << endl;
            }
        }

    }
}

int main() {
    input(); solve();
    return 0;
}

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[100005] = { 0 };


	for (long long int i = 0; i < n; i++) {
		long long int a;
		cin >> a >> home[i];
		w.push_back(a);
	}

	int key[100005] = { 0 };
	for (int i = 0; i < q; i++) {
		int a;
		cin >> a;
		key[a - 1] = 1;
	}
	int west = 0;
	int east = 0;

	long long int east2 = 0;
	vector<long long int> talkpoint;
	long long int tp;
	for (long long int i = 0; i < n; i++) {
		
			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;
					east2 = 0;
				}
				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>
#include <vector>

using namespace std;

int main()
{
    int N; cin>>N;
    long long T; cin>>T;
    int Q; cin>>Q;

    vector<long long> A(N);
    vector<int> D(N);
    for (int i=0; i<N; i++)
        cin>>A[i]>>D[i];
    //  ????????¢???????????????P[i]=A[i]????????°??¢????????????
    vector<long long> P = A;

    for (int i=0; i<N-1; i++)
    if (D[i]==1 && D[i+1]==2)
    {
        long long p = (A[i]+A[i+1])/2;
        for (int j=i; j>=0 && D[j]==1; j--)
            P[j] = p;
        for (int j=i+1; j<N && D[j]==2; j++)
            P[j] = p;
    }

    for (int i=0; i<Q; i++)
    {
        int X; cin>>X;
        X--;

        long long t = A[X] + (D[X]==1 ? T : -T);
        if (P[X]==A[X])
            cout<<t<<endl;
        else if (D[X]==1)
            cout<<min(P[X], t)<<endl;
        else
            cout<<max(P[X], t)<<endl;
    }
}