ZOJ 3888 Twelves Monkeys

James Cole is a convicted criminal living beneath a post-apocalyptic Philadelphia. Many years ago, the Earth's surface had been contaminated by a virus so deadly that it forced the survivors to move underground. In the years that followed, scientists had engineered an imprecise form of time travel. To earn a pardon, Cole allows scientists to send him on dangerous missions to the past to collect information on the virus, thought to have been released by a terrorist organization known as the Army of the Twelve Monkeys.

The time travel is powerful so that sicentists can send Cole from year x[i] back to year y[i]. Eventually, Cole finds that Goines is the founder of the Army of the Twelve Monkeys, and set out in search of him. When they find and confront him, however, Goines denies any involvement with the viruscan. After that, Cole goes back and tells scientists what he knew. He wants to quit the mission to enjoy life. He wants to go back to the any year before current year, but scientists only allow him to use time travel once. In case of failure,Cole will find at least one route for backup. Please help him to calculate how many years he can go with at least two routes.

Input

The input file contains multiple test cases.

The first line contains three integers n,m,q(1≤ n ≤ 50000, 1≤ m ≤ 50000, 1≤ q ≤ 50000), indicating the maximum year, the number of time travel path and the number of queries.

The following m lines contains two integers x,y(1≤ y ≤ x ≤ 50000) indicating Cole can travel from year x to year y.

The following q lines contains one integers p(1≤ p ≤ n) indicating the year Cole is at now

Output

For each test case, you should output one line, contain a number which is the total number of the year Cole can go.

Sample Input

9 3 3

9 1

6 1

4 1

6

7

2

Sample Output

5

1

#include<cstdio>
#include<cmath>
#include<queue>
#include<vector>
#include<stack>
#include<map>
#include<string>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;
typedef long long ll;
const ll maxn = 100005;
vector<int> t[maxn];
int f[maxn][2];
int n, m, q, x, y;

int main()
{
	while (scanf("%d%d%d", &n, &m, &q) == 3)
	{
		for (int i = 1; i <= n; ++i) t[i].clear();
		while (m--)
		{
			scanf("%d%d", &x, &y);
			t[x].push_back(y);
		}
		f[n + 1][0] = f[n + 1][1] = n + 1;
		for (int i = n; i; --i)
		{
			f[i][0] = min(i, f[i + 1][0]);
			f[i][1] = min(i, f[i + 1][1]);
			for (int j = 0; j < t[i].size(); ++j)
			{
				if (f[i][0] >= t[i][j]) { f[i][1] = f[i][0]; f[i][0] = t[i][j]; }
				else f[i][1] = min(f[i][1], t[i][j]);
			}
		}
		while (q--)
		{
			scanf("%d", &x);
			printf("%d\n", x - f[x][1]);
		}
	}
	return 0;
}