#461940 (C++14) No.1021 Children in Classrooms

• 問題: No.1021 Children in Classrooms
• ユーザー: cn_449
• 提出日時: 2020-04-10 21:43:49
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 31 ms / 2,000 ms
• コード長: 1,969 bytes
• コンパイル時間: 861 ms
• コンパイル使用メモリ: 101,404 KB
• 実行使用メモリ: 6,944 KB
• 最終ジャッジ日時: 2024-09-15 19:46:55
• 合計ジャッジ時間: 2,438 ms
• ジャッジサーバーID （参考情報）: judge5 / judge6

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 6,812 KB
testcase_01	AC	2 ms; 6,940 KB
testcase_02	AC	2 ms; 6,944 KB
testcase_03	AC	2 ms; 6,944 KB
testcase_04	AC	2 ms; 6,944 KB
testcase_05	AC	2 ms; 6,940 KB
testcase_06	AC	2 ms; 6,940 KB
testcase_07	AC	2 ms; 6,944 KB
testcase_08	AC	2 ms; 6,944 KB
testcase_09	AC	31 ms; 6,944 KB
testcase_10	AC	31 ms; 6,940 KB
testcase_11	AC	31 ms; 6,940 KB
testcase_12	AC	30 ms; 6,940 KB
testcase_13	AC	30 ms; 6,940 KB
testcase_14	AC	30 ms; 6,940 KB
testcase_15	AC	23 ms; 6,944 KB
testcase_16	AC	23 ms; 6,940 KB
testcase_17	AC	24 ms; 6,940 KB
testcase_18	AC	31 ms; 6,944 KB
testcase_19	AC	3 ms; 6,944 KB

ソースコード

#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <stdio.h>
#include <time.h>
#include <numeric>
//#define int long long
#define all(a) a.begin(),a.end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef long double ld;
typedef complex<ld> com;
constexpr ll INF = 1000000000000000000;
constexpr ld EPS = 1e-12;
constexpr ld PI = 3.141592653589793238;
template<class T, class U> inline bool chmax(T &a, const U &b) { if (a < b) { a = b; return true; } return false; }
template<class T, class U> inline bool chmin(T &a, const U &b) { if (a > b) { a = b; return true; } return false; }


signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	cout << fixed << setprecision(20);

	int n, m;
	cin >> n >> m;
	vector<int> a(n);
	rep(i, n) cin >> a[i];
	string s;
	cin >> s;
	int leftcnt = 0, rightcnt = 0, leftidx = 0, rightidx = n - 1;
	rep(i, m) {
		if (s[i] == 'L') {
			if (leftcnt) {
				leftcnt--; rightcnt++;
			}
			else {
				if (rightcnt < n - 1) {
					rightcnt++; leftidx++;
				}
			}
		}
		else {
			if (rightcnt) {
				rightcnt--; leftcnt++;
			}
			else {
				if (leftcnt < n - 1) {
					leftcnt++; rightidx--;
				}
			}
		}
	}
	if (leftcnt + rightcnt == n - 1) {
		int sum = 0;
		rep(i, n) sum += a[i];
		rep(i, leftcnt) cout << 0 << ' ';
		cout << sum << ' ';
		rep(i, rightcnt) cout << 0 << ' ';
		return 0;
	}
	int left = 0, right = 0;
	rep(i, leftidx + 1) left += a[i];
	for (int i = rightidx; i < n; i++) right += a[i];
	rep(i, leftcnt) cout << 0 << ' ';
	cout << left << ' ';
	for (int i = leftidx + 1; i < rightidx; i++) cout << a[i] << ' ';
	cout << right << ' ';
	rep(i, rightcnt) cout << 0 << ' ';
}