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<vector>
#include<algorithm>
using namespace std;

typedef long long LL;
typedef pair<int, int> P;

int main() {
	int a, c;
	LL b;
	cin >> a >> b >> c;

	P m[100005];
	P q[1010];
	vector<int>st;

	for (int i = 0;i < a;i++)cin >> m[i].first >> m[i].second;
	for (int i = 0;i < c;i++) {
		int d;
		cin >> d;
		q[i] = m[d - 1];
	}

	sort(m, m + a);

	for (int i = 0;i < a - 1;i++) {
		if (m[i].second == 1 && m[i + 1].second == 2)st.push_back((m[i].first + m[i+1].first) / 2);
	}

	for (int i = 0;i < c;i++) {

		if (q[i].second == 1) {

			long long e = 3e13;

			for (int j = 0;j < st.size();j++) {

				if (q[i].first < st[j]) {
					if (q[i].first + b >= st[j])e = st[j];
					else e = q[i].first + b;
				}

			}
			if (e == 3e13)e = q[i].first + b;
			cout << e << endl;
		}

		else {

			long long e=3e13;

			for (int j = st.size() - 1;j > -1;j--) {

				if (q[i].first > st[j]) {
					if (q[i].first - b <= st[j])e = st[j];
					else e = q[i].first - b;
				}
				
			}
			if (e == 3e13)e = q[i].first - b;
			cout << e << endl;
		}
	}

	return 0;
}

C++: #include <bits/stdc++.h>
using namespace std ;

#define pb(n) push_back(n)
#define fi first
#define se second
#define all(r) (r).begin(),(r).end()
#define vmax(ary) *max_element(all(ary))
#define vmin(ary) *min_element(all(ary))
#define debug(x) cout<<#x<<": "<<x<<endl
#define fcout(n) cout<<fixed<<setprecision((n))
#define scout(n) cout<<setw(n)
#define vary(type,name,size,init) vector< type> name(size,init)
#define vvl(v,w,h,init) vector<vector<ll>> v(w,vector<ll>(h,init))
#define mp(a,b) make_pair(a,b)

#define rep(i,n) for(int i = 0; i < (int)(n);++i)
#define REP(i,a,b) for(int i = (a);i < (int)(b);++i)
#define repi(it,array) for(auto it = array.begin(),end = array.end(); it != end;++it)
#define repa(n,array) for(auto &n :(array))

using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using dict = map<string,int>;
using pii = pair<int,int> ;
using pll = pair<ll,ll> ;

const int mod = 1000000007;
constexpr int inf = ((1<<30)-1)*2+1 ;
constexpr double PI = acos(-1.0) ;
double eps = 1e-10 ;
const int dy[] = {-1,0,1,0,1,-1,1,-1};
const int dx[] = {0,-1,0,1,1,-1,-1,1};

inline bool value(int x,int y,int w,int h){
  return (x >= 0 && x < w && y >= 0 && y < h);
}

template<typename T>
void Unique(vector<T> &v){
  sort(all(v));
  v.erase(unique(all(v)),v.end());
}
template<typename T,typename U>
ll FindErase(T &v,U tar){
  ll cnt = 0;
  for(auto it = v.begin(); it != v.end();){
    if(*it == tar){
      it = v.erase(it);
      ++cnt;
    }
    else{
      ++it;
    }
  }
  return cnt;
}

template<typename T>
bool SuffixErase(T &v,size_t suf){
  if(suf > v.size()) return false;
  for(auto it = v.begin(); it != v.end();){
    if(distance(v.begin(),it) == suf){
      v.erase(it);
      return true;
    }
    else{
      ++it;
    }
  }
  return false;
}

template<typename T>
T ston(string& str, T n){
  istringstream sin(str) ;
  T num ;
  sin >> num ;
  return num ;
}

int n,t,q;
struct person{
  int id,dir;
  ll pos;
  person *b,*n;
  void move(){
    if(dir == 1){
      if(n == nullptr){
        pos += t;
        dir = 3;
      }
      else if(n->dir == 2){
        if(abs((pos + n->pos)/2 - pos) <= t){
          pos = n->pos = (pos+n->pos)/2;
        }
        else{
          pos += t;
          n->pos -= t;
        }
        dir = 3,n->dir = 3;
      }
      else if(n->dir == 3){
        if(abs(n->pos - pos) <= t){
          pos = n->pos;
        }
        else{
          pos += t;
        }
        dir = 3,n->dir = 3;
      }
    }
    else if(dir == 2){
      if(b == nullptr){
        pos -= t;
        dir = 3;
      }
      else if(b->dir == 3){
        if(abs(pos - b->pos) <= t){
          pos = b->pos;
        }
        else{
          pos -= t;
        }
        dir = 3,b->dir = 3;
      }
    }
  }
};

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> n >> t >> q;
  vector<person> p(n);
  vector<ll> obs(q);
  rep(i,n){
    p[i].id = i;
    cin >> p[i].pos >> p[i].dir;
  }
  REP(i,1,n-1){
    p[i].b = &p[i-1];
    p[i].n = &p[i+1];
  }
  p[0].b = nullptr;
  p[0].n = &p[1];
  p[n-1].b = &p[n-2];
  p[n-1].n = nullptr;
  rep(i,q){
    cin >> obs[i];
    obs[i]--;
  }
  ll k = 0;
  while(k < 100){
    ++k;
    ll cnt = 0;
    rep(i,n){
      p[i].move();
      if(p[i].dir == 3){
         ++cnt;
      }
    }
    if(cnt == n){
      break;
    }
  }
  rep(i,q){
    cout << p[obs[i]].pos << endl;
  }
  return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <climits>
#include <string>
#include <vector>
#include <cmath>
using namespace std;

int N, Q;
long long T;
long long A[100010];
bool dir[100010];
long long st[100010];

long long query(int i) {
  if (st[i] != -1) return st[i];
  long long ans;
  // ->
  if (dir[i]) {
    if (i == N-1)       ans = 0;
    else if (!dir[i+1]) ans = (A[i+1] - A[i]) / 2;
    else {
      long long t = query(i+1);
      if (t == 0) ans = 0;
      else        ans = (A[i+1] - A[i]) + t;
    }
  }
  // <-
  else {
    if (i == 0)        ans = 0;
    else if (dir[i-1]) ans = (A[i] - A[i-1]) / 2;
    else {
      long long t = query(i-1);
      if (t == 0) ans = 0;
      else        ans = (A[i] - A[i-1]) + t;
    }
  }
  return st[i] = ans;
}

int main() {
  cin >> N >> T >> Q;
  for (int i=0; i<N; i++) {
    int d;
    cin >> A[i] >> d;
    if (d == 1) dir[i] = true;
    st[i] = -1;
  }

  for (int i=0; i<Q; i++) {
    int x;
    cin >> x;
    long long t = query(x-1);
    cout << A[x-1] + (t == 0 ? T : min(t, T))*(dir[x-1]?1L:-1L) << "\n";
  }
  return 0;
}