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"
#include<unordered_map>
#include<unordered_set>
#pragma warning(disable:4996)
using namespace std;
using ld = long double;
template<class T>
using Table = vector<vector<T>>;
const ld eps=1e-9;

//// < "D:\D_Download\Visual Studio 2015\Projects\programing_contest_c++\Debug\a.txt" > "D:\D_Download\Visual Studio 2015\Projects\programing_contest_c++\Debug\b.answer"
vector<long long int>xs;
vector<int>islefts;
vector<long long int>anss;
vector<int>oks;

int N, T, Q;
long long int getans(const int q) {
	if (oks[q])return anss[q];
	else {
		oks[q] = true;
		if (islefts[q]) {
			if (q == 0) {
				return anss[q] = xs[q] - T;
			}
			else {
				long long int leftx = getans(q - 1);
				return anss[q] = max(leftx, xs[q] - T);
			}
		}
		else {
			if (q == N - 1) {
				return anss[q] = xs[q] + T;
			}
			else {
				long long int rightx = getans(q + 1);
				return anss[q] = min(rightx, xs[q] + T);
			}
		}
	}
}

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

	anss.resize(N);
	for (int i = 0; i < N; ++i) {
		long long int a,isleft; cin >> a >> isleft;
		isleft--;
		xs.push_back(a); islefts.push_back(isleft);
		oks.push_back(false);
	}
	for (int i = 0; i < N-1; ++i) {
		if (!islefts[i] && islefts[i + 1]) {
			long long int dis = xs[i + 1] - xs[i];
			oks[i] = true; oks[i + 1] = true;
			if (dis < 2 * T) {
				anss[i] = xs[i] + dis / 2;
				anss[i + 1] = xs[i + 1] - dis / 2;
			}
			else {
				anss[i] = xs[i] + T;
				anss[i + 1] = xs[i + 1] - T;
			}
		}
	}
	while (Q--) {
		int q; cin >> q; q--;
		long long int ans = getans(q);
		cout << ans << endl;
	}
	
	return 0;
}

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


int n,t,q;
int a[M],d[M];
int x;
int m[M]={0};

int meet(int i){
    for (int j=i+1; j<n; j++) {
        if(d[j]==2){
            m[i]=(a[j]+a[j-1])/2;
            return m[i];
        }
    }
    m[i]=a[i]+t;
    return m[i];
}

void output(){
    for (int i=0; i<q; i++) {
        cin>>x;
        x--;
        if(d[x]==1){
            if(a[x]+t<m[x])cout<<a[x]+t<<endl;
            else cout<<m[x]<<endl;
        }
        else{
            if(a[x]-t>=m[x])cout<<a[x]-t<<endl;
            else cout<<m[x]<<endl;
        }
    }
}

int main(){
    cin>>n>>t>>q;
    for (int i=0; i<n; i++)cin>>a[i]>>d[i];
    int tt=a[0];
    for (int i=0; i<n-1; i++) {
        if(d[i]==1)tt=meet(i);
        if(d[i]==2)m[i]=tt-t;
    }
    if(d[n-1]==1)m[n-1]=a[n-1]+t;
    else m[n-1]=tt;
    output();
    return 0;
}

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;
        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] = -INF;
                } else {
                    ll s = (es.back().a + a.a) / 2;
                    stop[a.index] = 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<bits/stdc++.h>
using namespace std;

using LL = long long;

int main() {
  LL N, T, Q;
  cin >> N >> T >> Q;

  vector<LL> A(N), D(N);
  set<LL> s[2];
  for(auto i = 0; i < N; ++i) {
    cin >> A[i] >> D[i];
    s[--D[i]].emplace(A[i]);
  }
  s[0].emplace(-2e18);
  s[1].emplace(2e18);

  for(auto q = 0; q < Q; ++q) {
    int X;
    cin >> X;
    if(D[--X]) {
      auto x = *--s[0].upper_bound(A[X]);
      auto y = *s[1].upper_bound(x);
      cout << max(A[X]-T, x+(y-x)/2) << endl;
    } else {
      auto x = *s[1].upper_bound(A[X]);
      auto y = *--s[0].upper_bound(x);
      cout << min(A[X]+T, x-(x-y)/2) << endl;
    }
  }
}