Codeforces 909E-Coprocessor

Coprocessor

time limit per test

1.5 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

You are given a program you want to execute as a set of tasks organized in a dependency graph. The dependency graph is a directed acyclic graph: each task can depend on results of one or several other tasks, and there are no directed circular dependencies between tasks. A task can only be executed if all tasks it depends on have already completed.

Some of the tasks in the graph can only be executed on a coprocessor, and the rest can only be executed on the main processor. In one coprocessor call you can send it a set of tasks which can only be executed on it. For each task of the set, all tasks on which it depends must be either already completed or be included in the set. The main processor starts the program execution and gets the results of tasks executed on the coprocessor automatically.

Find the minimal number of coprocessor calls which are necessary to execute the given program.

Input

The first line contains two space-separated integers N (1 ≤ N ≤ 105) — the total number of tasks given, and M (0 ≤ M ≤ 105) — the total number of dependencies between tasks.

The next line contains N space-separated integers . If Ei = 0, task i can only be executed on the main processor, otherwise it can only be executed on the coprocessor.

The next M lines describe the dependencies between tasks. Each line contains two space-separated integers T1 and T2 and means that task T1 depends on task T2 (T1 ≠ T2). Tasks are indexed from 0 to N - 1. All M pairs (T1, T2) are distinct. It is guaranteed that there are no circular dependencies between tasks.

Output

Output one line containing an integer — the minimal number of coprocessor calls necessary to execute the program.

Examples

input

4 3
0 1 0 1
0 1
1 2
2 3

output

2

input

4 3
1 1 1 0
0 1
0 2
3 0

output

1

Note

In the first test, tasks 1 and 3 can only be executed on the coprocessor. The dependency graph is linear, so the tasks must be executed in order 3 -> 2 -> 1 -> 0. You have to call coprocessor twice: first you call it for task 3, then you execute task 2 on the main processor, then you call it for for task 1, and finally you execute task 0 on the main processor.

In the second test, tasks 0, 1 and 2 can only be executed on the coprocessor. Tasks 1 and 2 have no dependencies, and task 0 depends on tasks 1 and 2, so all three tasks 0, 1 and 2 can be sent in one coprocessor call. After that task 3 is executed on the main processor.

题意：n 个任务，每个任务在 主 / 副 处理器上执行。每个任务可能依赖于其它的一些任务，副处理器每次可以处理多个任务。但如果一个任务要在副处理器上执行，那它所依赖的任务要么已执行完了，要么和它一起在这个副处理器上同时执行。问副处理器最少调用多少次。

解题思路：拓扑排序，有能在主处理器上执行的话就一直先处理能在主处理器上执行的，否则处理能在副处理器上处理的

#include <iostream>    
#include <cstdio>    
#include <cstring>    
#include <string>    
#include <algorithm>    
#include <map>    
#include <set>    
#include <stack>    
#include <queue>    
#include <vector>    
#include <bitset>    
#include <functional>    

using namespace std;

#define LL long long    
const int INF = 0x3f3f3f3f;

int n, m;
int x[100009], u, v, in[100009];
int s[100009], nt[100009], e[100009];

int main()
{
	while (~scanf("%d%d", &n, &m))
	{
		for (int i = 0; i < n; i++) scanf("%d", &x[i]);
		memset(s, -1, sizeof s);
		memset(in, 0, sizeof in);
		int cnt = 0;
		for (int i = 0; i < m; i++)
		{
			scanf("%d%d", &u, &v);
			nt[cnt] = s[v], s[v] = cnt, e[cnt++] = u;
			in[u]++;
		}
		int ans = 0;
		queue<int>q[2];
		for (int i = 0; i < n; i++)
			if (!in[i]) q[x[i]].push(i);
		cnt = 0;
		while (cnt < n)
		{
			if (!q[0].empty())
			{
				while (!q[0].empty())
				{
					int pre = q[0].front();
					q[0].pop();
					cnt++;
					for (int i = s[pre]; ~i; i = nt[i])
					{
						int ee = e[i];
						if (!(--in[ee])) q[x[ee]].push(ee);
					}
				}
			}
			else
			{
				ans++;
				while (!q[1].empty())
				{
					int pre = q[1].front();
					q[1].pop();
					cnt++;
					for (int i = s[pre]; ~i; i = nt[i])
					{
						int ee = e[i];
						if (!(--in[ee])) q[x[ee]].push(ee);
					}
				}
			}
		}
		printf("%d\n", ans);
	}
	return 0;
}