zoukankan      html  css  js  c++  java
  • codeforces164A

    Variable, or There and Back Again

     CodeForces - 164A 

    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.

    path is a sequence of states v1, v2, ..., vx, where for any 1 ≤ i < x exists a transition from vi to vi + 1.

    Vasya's value in state v is interesting to the world, if exists path p1, p2, ..., pksuch, that pi = v for some i (1 ≤ i ≤ k), in state p1 Vasya gets assigned a value, in state pk Vasya is used and there is no state pi (except for p1) where Vasya gets assigned a value.

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

    Input

    The first line contains two space-separated integers n and m (1 ≤ n, m ≤ 105) — the numbers of states and transitions, correspondingly.

    The second line contains space-separated n integers f1, f2, ..., fn (0 ≤ fi ≤ 2), fidescribed actions performed upon Vasya in state i0 represents ignoring, 1 — assigning a value, 2 — using.

    Next m lines contain space-separated pairs of integers ai, bi (1 ≤ ai, bi ≤ nai ≠ bi), each pair represents the transition from the state number ai to the state number bi. Between two states can be any number of transitions.

    Output

    Print n integers r1, r2, ..., rn, separated by spaces or new lines. Number ri should equal 1, if Vasya's value in state i is interesting to the world and otherwise, it should equal 0. The states are numbered from 1 to n in the order, in which they are described in the input.

    Examples
    Input
    4 3
    1 0 0 2
    1 2
    2 3
    3 4
    Output
    1
    1
    1
    1
    Input
    3 1
    1 0 2
    1 3
    Output
    1
    0
    1
    Input
    3 1
    2 0 1
    1 3
    Output
    0
    0
    0
    Note

    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.

    题意:好像就是从所有1走到2,的路径覆盖的点答案是1,否则答案是0

    sol:很容易发现就是减一下反图,分别从1和2开始bfs

    #include <bits/stdc++.h>
    using namespace std;
    typedef int ll;
    inline ll read()
    {
        ll s=0; bool f=0; char ch=' ';
        while(!isdigit(ch))    {f|=(ch=='-'); ch=getchar();}
        while(isdigit(ch)) {s=(s<<3)+(s<<1)+(ch^48); ch=getchar();}
        return (f)?(-s):(s);
    }
    #define R(x) x=read()
    inline void write(ll x)
    {
        if(x<0) {putchar('-'); x=-x;}
        if(x<10) {putchar(x+'0'); return;}
        write(x/10); putchar((x%10)+'0');
    }
    #define W(x) write(x),putchar(' ')
    #define Wl(x) write(x),putchar('
    ')
    const int N=100005,M=200005;
    int n,m,a[N];
    int tot=0,Next[M],to[M],head[N];
    bool arr1[N],arr2[N];
    inline void Link(int x,int y)
    {
        Next[++tot]=head[x]; to[tot]=y; head[x]=tot;
    }
    #define PB push_back
    vector<int>E[N];
    int main()
    {
        queue<int>Que;
        int i,e,x,y;
        R(n); R(m);
        for(i=1;i<=n;i++) R(a[i]);
        for(i=1;i<=m;i++)
        {
            R(x); R(y); Link(x,y); E[y].PB(x);
        }
        memset(arr1,0,sizeof arr1);
        for(i=1;i<=n;i++) if(a[i]==1) {Que.push(i); arr1[i]=1;}
        while(!Que.empty())
        {
            x=Que.front(); Que.pop();
            for(e=head[x];e;e=Next[e])
            {
                if(arr1[to[e]]) continue;
                arr1[to[e]]=1; Que.push(to[e]);
            }
        }
        while(!Que.empty()) Que.pop();
        memset(arr2,0,sizeof arr2);
        for(i=1;i<=n;i++) if(a[i]==2) {Que.push(i); arr2[i]=1;}
        while(!Que.empty())
        {
            x=Que.front(); Que.pop();
            for(i=0;i<E[x].size();i++)
            {
                if(a[E[x][i]]==1) {arr2[E[x][i]]=1; continue;}
                if(arr2[E[x][i]]) continue;
                arr2[E[x][i]]=1; Que.push(E[x][i]);
            }
        }
        for(i=1;i<=n;i++) {if(arr1[i]&&arr2[i]) puts("1"); else puts("0");}
        return 0;
    }
    View Code
  • 相关阅读:
    MySQL表之间的关系概述
    网路通信简介
    多态与鸭子类型
    组合与类继承
    类与对象的属性与方法以及封装
    对象与类的初始
    2018.12.12
    2018.12.9浮动布局,盒子显隐,定位,z-index,流式布局,小米开头
    2018.12.8浮动布局,display总结,overflow,清浮动
    2018.12.7边界圆角redius,背景图设置,平铺,精灵图,盒子伪类索引
  • 原文地址:https://www.cnblogs.com/gaojunonly1/p/11296214.html
Copyright © 2011-2022 走看看