CF164A.Variable, or There and Back Again

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

Life is not easy for the perfectly common variable named Vasya. Wherever it goes, it is either assigned a value, or simply ignored, or is being used!

Vasya's life goes in states of a program. In each state, Vasya can either be used (for example, to calculate the value of another variable), or be assigned a value, or ignored. Between some states are directed (oriented) transitions.

A path is a sequence of states v1,v2,...,vxv_{1},v_{2},...,v_{x} , where for any 1<=i<x exists a transition from viv_{i} to vi+1v_{i+1} .

Vasya's value in state vv is interesting to the world, if exists path p1,p2,...,pkp_{1},p_{2},...,p_{k} such, that pi=vp_{i}=v for some ii (1<=i<=k)(1<=i<=k) , in state p1p_{1} Vasya gets assigned a value, in state pkp_{k} Vasya is used and there is no state pip_{i} (except for p1p_{1} ) where Vasya gets assigned a value.

Help Vasya, find the states in which Vasya's value is interesting to the world.

输入格式

The first line contains two space-separated integers nn and mm ( 1<=n,m<=1051<=n,m<=10^{5} ) — the numbers of states and transitions, correspondingly.

The second line contains space-separated nn integers f1,f2,...,fnf_{1},f_{2},...,f_{n} ( 0<=fi<=20<=f_{i}<=2 ), fif_{i} described actions performed upon Vasya in state ii : 00 represents ignoring, 11 — assigning a value, 22 — using.

Next mm lines contain space-separated pairs of integers ai,bia_{i},b_{i} ( 1<=ai,bi<=n1<=a_{i},b_{i}<=n , aibia_{i}≠b_{i} ), each pair represents the transition from the state number aia_{i} to the state number bib_{i} . Between two states can be any number of transitions.

输出格式

Print nn integers r1,r2,...,rnr_{1},r_{2},...,r_{n} , separated by spaces or new lines. Number rir_{i} should equal 11 , if Vasya's value in state ii is interesting to the world and otherwise, it should equal 00 . The states are numbered from 11 to nn in the order, in which they are described in the input.

输入输出样例

  • 输入#1

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

    输出#1

    1
    1
    1
    1
    
  • 输入#2

    3 1
    1 0 2
    1 3
    

    输出#2

    1
    0
    1
    
  • 输入#3

    3 1
    2 0 1
    1 3
    

    输出#3

    0
    0
    0
    

说明/提示

In the first sample the program states can be used to make the only path in which the value of Vasya interests the world, 1 2 3 4; it includes all the states, so in all of them Vasya's value is interesting to the world.

The second sample the only path in which Vasya's value is interesting to the world is , — 1 3; state 2 is not included there.

In the third sample we cannot make from the states any path in which the value of Vasya would be interesting to the world, so the value of Vasya is never interesting to the world.

首页