#461964 (C++17) No.1021 Children in Classrooms

• 問題: No.1021 Children in Classrooms
• ユーザー: chocopuu
• 提出日時: 2020-04-10 21:46:25
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 74 ms / 2,000 ms
• コード長: 1,479 bytes
• コンパイル時間: 2,193 ms
• コンパイル使用メモリ: 203,024 KB
• 実行使用メモリ: 7,196 KB
• 最終ジャッジ日時: 2023-10-13 23:59:13
• 合計ジャッジ時間: 4,316 ms
• ジャッジサーバーID （参考情報）: judge12 / judge15

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 4,348 KB
testcase_01	AC	2 ms; 4,348 KB
testcase_02	AC	2 ms; 4,348 KB
testcase_03	AC	2 ms; 4,352 KB
testcase_04	AC	2 ms; 4,356 KB
testcase_05	AC	2 ms; 4,352 KB
testcase_06	AC	3 ms; 4,352 KB
testcase_07	AC	2 ms; 4,352 KB
testcase_08	AC	2 ms; 4,348 KB
testcase_09	AC	70 ms; 6,884 KB
testcase_10	AC	70 ms; 7,192 KB
testcase_11	AC	70 ms; 7,196 KB
testcase_12	AC	69 ms; 6,992 KB
testcase_13	AC	69 ms; 6,976 KB
testcase_14	AC	69 ms; 6,972 KB
testcase_15	AC	53 ms; 6,616 KB
testcase_16	AC	53 ms; 6,620 KB
testcase_17	AC	56 ms; 6,848 KB
testcase_18	AC	74 ms; 6,968 KB
testcase_19	AC	7 ms; 4,352 KB

ソースコード

#include "bits/stdc++.h"
using namespace std;
#define int long long
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define RREP(i, n) for (int i = (int)n - 1; i >= 0; --i)
#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)
#define RFOR(i, s, n) for (int i = (int)n - 1; i >= s; --i)
#define ALL(a) a.begin(), a.end()
#define IN(a, x, b) (a <= x && x < b)
template<class T>inline void out(T t){cout << t << "\n";}
template<class T,class... Ts>inline void out(T t,Ts... ts){cout << t << " ";out(ts...);}
template<class T>inline bool CHMIN(T&a,T b){if(a > b){a = b;return true;}return false;}
template<class T>inline bool CHMAX(T&a,T b){if(a < b){a = b;return true;}return false;}
constexpr int INF = 1e18;


signed main(){
	int N,M;
	cin >> N >> M;
	vector<int>a(N);
	REP(i,N){
		cin >> a[i];
	}
	string s;
	cin >> s;
	int leftRoom = 0,rightRoom = N - 1;
	int l = 0,r = 0;
	REP(i,s.size()){
		if(s[i] == 'L'){
			if(leftRoom){
				--leftRoom;
			}else if(l + r + 1 < N){
				++l;
			}
			if(rightRoom)--rightRoom;
		}else{
			if(rightRoom + 1 != N){
				++rightRoom;
			}else if(l + r + 1 < N){
				++r;
			}
			if(leftRoom + 1 != N)++leftRoom;
		}
	}
	vector<int>ans;
	REP(i,l)a[i + 1] += a[i],a[i] = 0;
	REP(i,r)a[N - i - 2] += a[N - i - 1],a[N - i - 1] = 0;
	REP(i,leftRoom)ans.emplace_back(0);
	FOR(i,leftRoom,rightRoom + 1)ans.emplace_back(a[l + i - leftRoom]);
	FOR(i,rightRoom + 1,N)ans.emplace_back(0);
	REP(i,ans.size())cout << ans[i] << " \n"[i+1 == ans.size()];
}