提出 #502879

---

ソースコード 拡げる

#include <iostream>
#include <vector>
#include <queue>
using namespace std;

#define ll long long

struct Node{
	ll coin;
	ll dist;
	
	vector<ll> connect;
};

int main() {
	
	int N,M;
	cin >> N >> M;

	vector<Node> nodes(N);
	for(Node &node : nodes){
		cin >> node.coin;
	}

	for(int i=0;i<M;i++){
		int v,w;
		cin >> v >> w;
		nodes[v].connect.push_back(w);
		nodes[w].connect.push_back(v);
	}

	for(Node &node : nodes){
		node.dist=-1;
	}	

	queue<int> q;
	nodes[0].dist=0;
	q.push(0);

	while(!q.empty()){
		int i=q.front();
		for(int c : nodes[i].connect){
			if( nodes[c].dist<0){
				nodes[c].dist = nodes[i].dist+1;
				q.push(c);
			}
		}
		q.pop();
	}

	ll count = 0;
	for(Node &node : nodes){
		if( node.dist>0 )
			count+= (node.dist%2) * (node.coin%2);
	}

	if( count%2==0 ){
		cout << "Second" << endl;
	}else{
		cout << "First" << endl;
	}

	// your code goes here
	return 0;
}

提出情報

ジャッジ結果