牛客练习赛101 罪业之都

link

#include <bits/stdc++.h>
using namespace  std;
#define  int long long
//typedef long long ll;
typedef pair<int,int> pii;
#define x first 
#define y second
#define pb  push_back
#define inf 1e18
#define IOS   std::ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define  fer(i,a,b)  for(int i=a;i<=b;i++)
#define  der(i,a,b)  for(int i=a;i>=b;i--) 
template<typename _T>
void read(_T &x){
	_T f=1;x=0;char s=getchar();
	while(s>'9'||s<'0'){if(s=='-')f=-1;s=getchar();}
	while('0'<=s&&s<='9'){x=(x<<3)+(x<<1)+(s^48);s=getchar();}
	x*=f;
}
template<typename _T>
void print(_T x){if(x<0)putchar('-'),print(-x);if(x>9)print(x/10);putchar(x%10+'0');}
const int maxn=1e5+10;
const int mod=1e9+7;
int qmi(int a,int b)
{int res=1;  while(b){  if(b&1) res=res*a%mod;  a=a*a%mod;  b>>=1; } return res;}
const int N=2e5+10;
const int M=N*4;
int dr[4][2]={{-1,0},{1,0},{0,-1},{0,1}};
int n,k;
int h[N];
int e[M];
int ne[M];
int cnt;
int vis[N];
char ans[N];
int a[N];
bool flag;
int m;
void add(int a,int b)
{
	e[cnt]=b,ne[cnt]=h[a],h[a]=cnt++;
}
bool dfs1(int u,int fa)
{
	if(vis[u])
	{
		flag=1;
		return true;
	}
	vis[u]=1;
	bool re=false;
	for(int i=h[u];~i;i=ne[i])
	{
		int v=e[i];
		if(v==fa)continue;
		if(vis[v]&&flag)ans[i/2]='0';
		else if(dfs1(v,u))re=true,ans[i/2]=(i&1?'1':'0');
		else ans[i/2]=(i&1?'0':'1'); 
	}
	return re;
}
int dfs(int u,int fa)
{
	int ma=0;
	int need=a[u];
	for(int i=h[u];~i;i=ne[i])
	{
		int v=e[i];
		if(v==fa)continue;
		int t=dfs(v,u);
		if(t>=0)
		{
			ans[i/2]=(i&1?'1':'0');
			ma=max(ma,t+1);
		}
		else
		{
			ans[i/2]=(i&1?'0':'1');
			need=max(need,-t-1);
		}
	}
	if(ma>=need)return  ma;
	else return -need;
}
void solve()
{
	memset(h,-1,sizeof(h));
	cin>>n>>m;
	fer(i,1,n)cin>>a[i];
	fer(i,1,m)
	{
		int a,b;
		cin>>a>>b;
		add(a,b);
		add(b,a);
	}
	if(m==n-1)	{
	if(dfs(1,-1)<0){ cout<<-1<<endl;return;}
	}
	else dfs1(1,-1);
	cout<<ans<<endl;
}
signed main()
{
	IOS;
	int _=1;
	//cin>>_;
	while(_--) solve();
	return 0;
}