Submission #3776706


Source Code Expand

#include <iostream>
#include <fstream>
#include <cmath>  
#include <cstdlib>
#include <ctime>
#include <algorithm>
#include <numeric>
#include <functional>
#include <string> 
#include <vector>
#include <bitset>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>

using namespace std;
using ll = long long;

template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;

#define REP(i,n) for(int i = 0; i < int(n); i++)
#define FOR(i, m, n) for(int i = int(m);i < int(n);i++)
#define ALL(obj) (obj).begin(),(obj).end()

const ll MOD = (ll)1e9 + 7;
const ll HINF = (ll)1e18;
const ll LINF = (ll)1e9;
const long double PI = 3.1415926535897932384626433;

template<class T> void corner(bool flg, T hoge) {
	if (flg) {
		cout << hoge << endl;
		exit(0);
	}
	else return;
}

template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {
	o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;
}

template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {
	o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;
}

template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {
	o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;
}

template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {
	o << "{" << obj.first << ", " << obj.second << "}"; return o;
}

template <template <class tmp>  class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {
	o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;
}

void print(void) {
	cout << endl;
}

template <class Head> void print(Head&& head) {
	cout << head;
	print();
}

template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {
	cout << head << " ";
	print(forward<Tail>(tail)...);
}

void YN(bool flg) {
	cout << ((flg) ? "YES" : "NO") << endl;
}

void Yn(bool flg) {
	cout << ((flg) ? "Yes" : "No") << endl;
}

void yn(bool flg) {
	cout << ((flg) ? "yes" : "no") << endl;
}

struct info {
	int to, rev, flg;
};

int main() {
	int N, M; cin >> N >> M;
	string s; cin >> s;
	
	vector<vector<info>> edge(N);
	REP(i,M){
		int a, b; cin >> a >> b;
		a--; b--;
		edge[a].push_back({ b,(int)edge[b].size(),1});
		edge[b].push_back({ a,(int)edge[a].size() - 1,1 });
	}

	V<int> node(N,1);
	REP(n, 100) {
		REP(i, N) {
			if (!node[i]) continue;
			int flgA = 0, flgB = 0;
			for (auto u : edge[i]) {
				if (u.flg && s[u.to] == 'A') flgA = 1;
				if (u.flg && s[u.to] == 'B') flgB = 1;
			}
			if (flgA && flgB) continue;
			node[i] = 0;
			for (auto u : edge[i]) {
				u.flg = 0;
				edge[u.to][u.rev].flg = 0;
			}
		}
	}
	Yn(accumulate(ALL(node), 0)>1);
	cin >> N;
	return 0;
}

Submission Info

Submission Time
Task C - ABland Yard
User ningenMe
Language C++14 (GCC 5.4.1)
Score 0
Code Size 3055 Byte
Status WA
Exec Time 568 ms
Memory 13444 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 900
Status
AC × 4
AC × 53
WA × 6
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt
All sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt, test_32.txt, test_33.txt, test_34.txt, test_35.txt, test_36.txt, test_37.txt, test_38.txt, test_39.txt, test_40.txt, test_41.txt, test_42.txt, test_43.txt, test_44.txt, test_45.txt, test_46.txt, test_47.txt, test_48.txt, test_49.txt, test_50.txt, test_51.txt, test_52.txt, test_53.txt, test_54.txt, test_55.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 256 KB
sample_02.txt AC 1 ms 256 KB
sample_03.txt AC 1 ms 256 KB
sample_04.txt AC 1 ms 256 KB
test_01.txt AC 478 ms 9092 KB
test_02.txt WA 478 ms 9092 KB
test_03.txt AC 257 ms 5504 KB
test_04.txt AC 392 ms 7680 KB
test_05.txt WA 327 ms 6656 KB
test_06.txt AC 254 ms 5376 KB
test_07.txt AC 123 ms 3072 KB
test_08.txt AC 247 ms 5248 KB
test_09.txt WA 187 ms 4224 KB
test_10.txt WA 121 ms 2944 KB
test_11.txt AC 474 ms 9092 KB
test_12.txt AC 473 ms 9092 KB
test_13.txt WA 259 ms 5504 KB
test_14.txt AC 392 ms 7680 KB
test_15.txt WA 333 ms 6656 KB
test_16.txt AC 178 ms 3328 KB
test_17.txt AC 246 ms 5632 KB
test_18.txt AC 184 ms 4224 KB
test_19.txt AC 318 ms 5760 KB
test_20.txt AC 254 ms 6784 KB
test_21.txt AC 265 ms 4992 KB
test_22.txt AC 158 ms 10116 KB
test_23.txt AC 132 ms 7424 KB
test_24.txt AC 568 ms 10240 KB
test_25.txt AC 444 ms 7808 KB
test_26.txt AC 273 ms 12932 KB
test_27.txt AC 114 ms 7808 KB
test_28.txt AC 71 ms 5760 KB
test_29.txt AC 357 ms 8192 KB
test_30.txt AC 119 ms 2560 KB
test_31.txt AC 163 ms 10756 KB
test_32.txt AC 120 ms 8836 KB
test_33.txt AC 530 ms 11008 KB
test_34.txt AC 40 ms 2944 KB
test_35.txt AC 214 ms 13444 KB
test_36.txt AC 1 ms 256 KB
test_37.txt AC 1 ms 256 KB
test_38.txt AC 1 ms 256 KB
test_39.txt AC 1 ms 256 KB
test_40.txt AC 1 ms 256 KB
test_41.txt AC 1 ms 256 KB
test_42.txt AC 1 ms 256 KB
test_43.txt AC 1 ms 256 KB
test_44.txt AC 1 ms 256 KB
test_45.txt AC 1 ms 256 KB
test_46.txt AC 1 ms 256 KB
test_47.txt AC 1 ms 256 KB
test_48.txt AC 1 ms 256 KB
test_49.txt AC 1 ms 256 KB
test_50.txt AC 1 ms 256 KB
test_51.txt AC 1 ms 256 KB
test_52.txt AC 1 ms 256 KB
test_53.txt AC 1 ms 256 KB
test_54.txt AC 1 ms 256 KB
test_55.txt AC 1 ms 256 KB