Submission #1590402


Source Code Expand

#pragma region include
#include <iostream>
#include <iomanip>
#include <stdio.h>

#include <sstream>
#include <algorithm>
#include <iterator>
#include <cmath>
#include <complex>

#include <string>
#include <cstring>
#include <vector>
#include <tuple>
#include <bitset>

#include <queue>
#include <complex>
#include <set>
#include <map>
#include <stack>
#include <list>

#include <fstream>
#include <random>
//#include <time.h>
#include <ctime>
#pragma endregion //#include
/////////
#define REP(i, x, n) for(int i = x; i < n; ++i)
#define rep(i,n) REP(i,0,n)
#define ALL(X) X.begin(), X.end()
/////////
#pragma region typedef
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
typedef std::pair<LL,LL> PLL;//
typedef std::pair<int,int> PII;//
#pragma endregion //typedef
////定数
const int INF = (int)1e9;
const LL MOD = (LL)1e9+7;
const LL LINF = (LL)1e18+20;
const LD PI = acos(-1.0);
const double EPS = 1e-9;
/////////
using namespace::std;

void solve(){
	int N;
	cin >> N;
	vector<string> vstr(N);
	for(int i=0;i<N;++i){
		cin >> vstr[i];
	}
	int A = 0;
	for(int i=0;i<N;++i){
		if( vstr[i] == "A" ){
			++A;
		}else{
			if( A <= 0 ){
				cout << "NO" << endl;
				return;
			}
			--A;
		}
	}
	if( A != 0 ){
		cout << "NO" << endl;
	}else{
		cout << "YES" << endl;
	}
}

#pragma region main
signed main(void){
	std::cin.tie(0);
	std::ios::sync_with_stdio(false);
	std::cout << std::fixed;//小数を10進数表示
	cout << setprecision(16);//小数点以下の桁数を指定//coutとcerrで別	

	solve();
}
#pragma endregion //main()

Submission Info

Submission Time
Task A - 阿吽の呼吸
User akarin55
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1654 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 44
Set Name Test Cases
All 00_sample_00, 00_sample_01, 00_sample_02, 00_sample_03, 01_random_00, 01_random_01, 01_random_02, 01_random_03, 01_random_04, 01_random_05, 01_random_06, 01_random_07, 01_random_08, 01_random_09, 02_valid_00, 02_valid_01, 02_valid_02, 02_valid_03, 02_valid_04, 02_valid_05, 02_valid_06, 02_valid_07, 02_valid_08, 02_valid_09, 03_random_maximum_00, 03_random_maximum_01, 03_random_maximum_02, 03_random_maximum_03, 03_random_maximum_04, 03_random_maximum_05, 03_random_maximum_06, 03_random_maximum_07, 03_random_maximum_08, 03_random_maximum_09, 04_valid_maximum_00, 04_valid_maximum_01, 04_valid_maximum_02, 04_valid_maximum_03, 04_valid_maximum_04, 04_valid_maximum_05, 04_valid_maximum_06, 04_valid_maximum_07, 04_valid_maximum_08, 04_valid_maximum_09
Case Name Status Exec Time Memory
00_sample_00 AC 1 ms 256 KB
00_sample_01 AC 1 ms 256 KB
00_sample_02 AC 1 ms 256 KB
00_sample_03 AC 1 ms 256 KB
01_random_00 AC 1 ms 256 KB
01_random_01 AC 1 ms 256 KB
01_random_02 AC 1 ms 256 KB
01_random_03 AC 1 ms 256 KB
01_random_04 AC 1 ms 256 KB
01_random_05 AC 1 ms 256 KB
01_random_06 AC 1 ms 256 KB
01_random_07 AC 1 ms 256 KB
01_random_08 AC 1 ms 256 KB
01_random_09 AC 1 ms 256 KB
02_valid_00 AC 1 ms 256 KB
02_valid_01 AC 1 ms 256 KB
02_valid_02 AC 1 ms 256 KB
02_valid_03 AC 1 ms 256 KB
02_valid_04 AC 1 ms 256 KB
02_valid_05 AC 1 ms 256 KB
02_valid_06 AC 1 ms 256 KB
02_valid_07 AC 1 ms 256 KB
02_valid_08 AC 1 ms 256 KB
02_valid_09 AC 1 ms 256 KB
03_random_maximum_00 AC 1 ms 256 KB
03_random_maximum_01 AC 1 ms 256 KB
03_random_maximum_02 AC 1 ms 256 KB
03_random_maximum_03 AC 1 ms 256 KB
03_random_maximum_04 AC 1 ms 256 KB
03_random_maximum_05 AC 1 ms 256 KB
03_random_maximum_06 AC 1 ms 256 KB
03_random_maximum_07 AC 1 ms 256 KB
03_random_maximum_08 AC 1 ms 256 KB
03_random_maximum_09 AC 1 ms 256 KB
04_valid_maximum_00 AC 1 ms 256 KB
04_valid_maximum_01 AC 1 ms 256 KB
04_valid_maximum_02 AC 1 ms 256 KB
04_valid_maximum_03 AC 1 ms 256 KB
04_valid_maximum_04 AC 1 ms 256 KB
04_valid_maximum_05 AC 1 ms 256 KB
04_valid_maximum_06 AC 1 ms 256 KB
04_valid_maximum_07 AC 1 ms 256 KB
04_valid_maximum_08 AC 1 ms 256 KB
04_valid_maximum_09 AC 1 ms 256 KB