結果

問題 No.1021 Children in Classrooms
ユーザー shimarutshimarut
提出日時 2021-03-27 17:41:28
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 108 ms / 2,000 ms
コード長 3,909 bytes
コンパイル時間 3,157 ms
コンパイル使用メモリ 183,096 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-05-06 22:01:46
合計ジャッジ時間 5,859 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 AC 2 ms
6,940 KB
testcase_02 AC 2 ms
6,940 KB
testcase_03 AC 2 ms
6,944 KB
testcase_04 AC 3 ms
6,940 KB
testcase_05 AC 2 ms
6,944 KB
testcase_06 AC 2 ms
6,940 KB
testcase_07 AC 3 ms
6,944 KB
testcase_08 AC 3 ms
6,944 KB
testcase_09 AC 102 ms
6,944 KB
testcase_10 AC 101 ms
6,944 KB
testcase_11 AC 108 ms
6,940 KB
testcase_12 AC 89 ms
6,940 KB
testcase_13 AC 91 ms
6,940 KB
testcase_14 AC 90 ms
6,940 KB
testcase_15 AC 62 ms
6,944 KB
testcase_16 AC 64 ms
6,940 KB
testcase_17 AC 67 ms
6,944 KB
testcase_18 AC 80 ms
6,940 KB
testcase_19 AC 8 ms
6,944 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma region
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <list>
#include <iomanip>
#include <cstdint>
#include <bitset>
#include <sstream>
#include <regex>
#include <fstream>
#include <array>
#include <atcoder/all>

using namespace atcoder;
using mint = modint1000000007;
//using mint = modint998244353;
//using mint = modint;

using namespace std;
typedef long long ll;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vmint = vector<mint>;
using vvmint = vector<vmint>;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
//#define rep(i, s, e) for (int(i) = (s); (i) < (e); ++(i))
#define rep(i, e) for (int(i) = 0; (i) < (e); ++(i))
#define rrep(i, s) for (int(i) = (s) - 1; (i) >= 0; --(i))
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()

#pragma region UnionFind
struct UnionFind
{
	vector<int> par;

	UnionFind(int n) : par(n, -1) {}
	void init(int n) { par.assign(n, -1); }

	int root(int x)
	{
		if (par[x] < 0) return x;
		else return par[x] = root(par[x]);
	}

	bool issame(int x, int y)
	{
		return root(x) == root(y);
	}

	bool merge(int x, int y)
	{
		x = root(x); y = root(y);
		if (x == y) return false;
		if (par[x] > par[y]) swap(x, y);
		par[x] += par[y];
		par[y] = x;
		return true;
	}

	int size(int x)
	{
		return -par[root(x)];
	}
};
#pragma endregion
#pragma region GCD
ll gcd(ll a, ll b)
{
	if (b == 0)return a;
	return gcd(b, a%b);
}
#pragma endregion
#pragma region LCM
ll lcm(ll a, ll b)
{
	return a / gcd(a, b) * b;
}
#pragma endregion
#pragma region chmin
template<class T> inline bool chmin(T& a, T b)
{
	if (a > b)
	{
		a = b;
		return true;
	}
	return false;
}
#pragma endregion
#pragma region chmax
template<class T> inline bool chmax(T& a, T b)
{
	if (a < b)
	{
		a = b;
		return true;
	}
	return false;
}
#pragma endregion
#pragma region グリッド内チェック
bool out(int x, int y, int h, int w)
{
	if (x < 0 || h <= x || y < 0 || w <= y)return true;
	else return false;
}
#pragma endregion
#pragma region Dijkstra
vl dijkstra(vector<vector<pair<int, ll>>> v, int s)
{
	ll INF = 1e18;
	int MAX = 1e6;
	vl res(MAX, INF);
	priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>> q;
	q.push({ 0,s });
	while (!q.empty())
	{
		int now;
		ll d;
		tie(d, now) = q.top();
		q.pop();
		if (!chmin(res[now], d))continue;
		for (auto p : v[now])
		{
			int next;
			ll c;
			tie(next, c) = p;
			if (res[next] <= res[now] + c)continue;
			q.push({ res[now] + c,next });
		}
	}
	return res;
}
#pragma endregion
#pragma endregion


int main()
{
	int n, m; cin >> n >> m;
	vi a(n); rep(i, n)cin >> a[i];
	string s; cin >> s;
	int cnt = 0;
	for (char c : s)
	{
		if (c == 'R')++cnt;
		else --cnt;
	}
	int l = 1, ng = n - 1;
	while (abs(l - ng) > 1)
	{
		int mid = (l + ng) / 2;
		bool migihaji = false;
		int pos = mid;
		for (char c : s)
		{
			if (c == 'L')--pos;
			else if (pos + 1 < n)++pos;
			if (pos == 0)
			{
				migihaji = true;
				break;
			}
		}
		if (migihaji)l = mid;
		else ng = mid;
	}
	int r = n - 2;
	ng = 0;
	while (abs(r - ng) > 1)
	{
		int mid = (r + ng) / 2;
		bool hidarihaji = false;
		int pos = mid;
		for (char c : s)
		{
			if (c == 'R')++pos;
			else if (pos - 1 >= 0)--pos;
			if (pos == n - 1)
			{
				hidarihaji = true;
				break;
			}
		}
		if (hidarihaji)r = mid;
		else ng = mid;
	}
	int ldes = 0, rdes = n - 1;
	for (char c : s)
	{
		if (c == 'L')
		{
			ldes = max(0, ldes - 1);
			rdes = max(0, rdes - 1);
		}
		else
		{
			ldes = min(n - 1, ldes + 1);
			rdes = min(n - 1, rdes + 1);
		}
	}
	vi res(n);
	rep(i, n)
	{
		if (i <= l)res[ldes] += a[i];
		else if (r <= i)res[rdes] += a[i];
		else res[i + cnt] += a[i];
	}
	for (int x : res)cout << x << " ";
	cout << endl;
}
0