제출 #890511

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
890511		Iwantbemaster	Parking Problem (innopolis2021_final_A)	C++17	54 / 100	18 ms	1112 KiB

Main

#include <bits/stdc++.h>
using namespace std;
//#define int long long
#define ff first
#define ss second
const int ForSpeed = [](){
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr); cout.tie(nullptr);
	return 0;
}();
void solve(){
	string str; cin >> str;
	int m = (int)str.size();
	string strw; cin >> strw;
	int n = (int)strw.size();
	vector<int> e, o;
	int cur = 0;
	for(int i = 0; i < m;){
		if(str[i] == 'X'){
			i++; continue;
		} int j = i;
		while(j < m && str[j] == '.') j++;
		int l = j - i;
		if(l >= 2){
			if(l == 2) l++;
			if(l & 1){
				if(l > 5){ o.push_back(l); }
				cur += (l - 1) / 2;
			} else {
				e.push_back(l); cur += l / 2;
			}
		} i = j;
	} int cnt = 0;
	if(cnt >= cur) cout << "N";
	else cout << "Y";
	for(int i = 0; i < n; i++){ cnt++;
		if(strw[i] == 'C'){
			if(!e.empty()){
				int x = e.back() - 1;
				cur--; e.pop_back();
				if(x > 5){ o.push_back(x); }
			} else if(!o.empty()){
				int x = o.back() - 1;
				o.pop_back(); e.push_back(x);
			}
		} if(cnt >= cur) cout << "N";
		else cout << "Y";
	} cout << "\n";
}
int main(){
	int test; cin >> test;
	while(test--){
		solve();
	}
}

• Subtask 1: 31 / 31
• Subtask 2: 0 / 22
• Subtask 3: 23 / 23
• Subtask 4: 0 / 24