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>
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 ;
}

ll 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];
  }
  rep(i,q){
    cin >> obs[i];
    obs[i]--;
  }
  if(n == 1){
    if(p[0].dir == 1){
      cout << p[0].pos + t << endl;
    }
    else{
      cout << p[0].pos - t << endl;
    }
    return 0;
  }
  if(n > 1){
    p[0].b = nullptr;
    p[0].n = &p[1];
    p[n-1].b = &p[n-2];
    p[n-1].n = nullptr;
    while(1){
      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 <string.h>
using namespace std;

int n, q;
long t;

int d[100000], v[100000];
long long a[100000];
bool f[100000];

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

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

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

	memset(f, 0, sizeof(f));

	for (int j = 0; j < t; j++) {
		for (int i = 0; i < n; i++)
			if (!f[i])
				a[i] += 3 - d[i] * 2;
		for (int i = 0; i < n; i++) {
			if (i < n - 1 && a[i] == a[i + 1]) {
				f[i] = 1;
				f[i + 1] = 1;
			}
		}
	}

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

	return 0;
}

C++: #include <stdio.h>
long long dat[100010];
long long vec[100010][2];
int main()
{
  int num,query,i,j,z,zb;
  long long t,tt,za;
  i=0;
  scanf("%d%lld%d",&num,&t,&query);
  vec[0][0]=-3000000000000000000LL;
  vec[0][1]=1;
  for(;i<num;i++){
    scanf("%lld%d",&za,&zb);
    vec[i+1][0]=za;
    vec[i+1][1]=zb;
  }
  vec[num+1][0]=3000000000000000000LL;
  vec[num+1][1]=2;
  i=0;
  for(;i<=num;i++){
    if(vec[i][1]==1&&vec[i+1][1]==2){
      tt=(vec[i][0]+vec[i+1][0])/2;
      j=i;
      for(;j>=0;j--){
	if(vec[j][1]==1)dat[j]=tt;
	else break;
      }
      j=i+1;
      for(;j<num+2;j++){
	if(vec[j][1]==2)dat[j]=tt;
	else break;
      }
    }
  }
  i=0;
  for(;i<query;i++){
      scanf("%d",&z);
      if(vec[z][1]==1){
	printf("%lld\n",(vec[z][0]+t<dat[z])?(vec[z][0]+t):(dat[z]));
      }else{
	printf("%lld\n",(vec[z][0]-t<dat[z])?(dat[z]):(vec[z][0]-t));
      }
  }
  return 0;
}