Submission #70613347

---

Source Code Expand

#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#ifdef jlocal
#include<jdebug/debug.hpp>
#else
#define debug(...) 0;
#endif

using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int,int> pii;
typedef vector<pii> vii;
template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#if defined(__LP64__) || defined(_WIN64)
typedef __int128 lll;
#else
typedef long long lll;
#endif

#define pcount(x) __builtin_popcount(x)
#define pcountll(x) __builtin_popcountll(x)
#define all(x) x.begin(),x.end()

const ld pi = 3.14159265358979323846L;
const ld sqrt2 = 1.41421356237309504880L;

template<class T>
istream& operator>>(istream& in, vector<T> &a){
	for (int i = 0; i < a.size(); i ++)
		in >> a[i];
	return in;
}

template<class T>
ostream& operator<<(ostream& out, vector<T> &a){
	for (int i = 0; i < a.size(); i ++){
		if (i > 0) out << ' ';
		out << a[i];
	}
	return out;
}

#if defined(__LP64__) || defined(_WIN64)

istream& operator>>(istream& in, __int128 &x){
	string S;
	in >> S;
	for (char &y : S){
		x *= 10;
		x += (y - '0');
	}
	return in;
}

ostream& operator<<(ostream& out, __int128 &x){
	string s;
	while(x > 0){
		s.push_back((x % 10) + '0');
		x /= 10;
	}
	if (s.size() == 0)
		s.push_back('0');
	reverse(all(s));
	return out << s;
}

#endif

mt19937_64 MT64;
void pre_init() {
	MT64 = mt19937_64(chrono::system_clock::now().
	time_since_epoch().count());
}

void solve(int caso){
	int n;
	cin >> n;
	string S;
	cin >> S;
	vector<int> ans(n + 1);
	vector<int> lefts1(n), rights1(n), lefts2(n), rights2(n);

	for (int i = 0; i + 1 < n; i ++){
		if (S[i] == 'R'){
			lefts1[i + 1] = 1 + lefts1[i];
		}
		else if (S[i] == 'L'){
			rights1[i + 1] = 1 + rights1[i];
		}
	}
	for (int i = n - 2; i >= 0; i --){
		if (S[i] == 'R'){
			rights2[i] = 1 + rights2[i + 1];
		}
		else{
			lefts2[i] = 1 + lefts2[i + 1];
		}
	}

	for (int i = 0; i < n; i ++){
		int l = lefts1[i] + lefts2[i];
		int r = rights1[i] + rights2[i];
		int left = l;
		int right = n - 1 - r;
		debug(i + 1, left, right);
		ans[left] ++;
		ans[right + 1] --;
	}
	for (int i = 1; i < n; i ++){
		ans[i] += ans[i - 1];
	}
	for (int i = 0; i < n; i ++){
		if (i > 0) cout << ' ';
		cout << ans[i];
	}
	cout << '\n';
}

int main(){
#ifndef jlocal
	ios::sync_with_stdio(0); cin.tie(0);
#endif
	pre_init();

	int t;
	cin >> t;
	for (int i = 1; i <= t; i ++){
		solve(i);
	}
	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function 'void solve(int)':
./Main.cpp:8:20: warning: statement has no effect [-Wunused-value]
    8 | #define debug(...) 0;
      |                    ^
./Main.cpp:112:17: note: in expansion of macro 'debug'
  112 |                 debug(i + 1, left, right);
      |                 ^~~~~
./Main.cpp:82:16: warning: unused parameter 'caso' [-Wunused-parameter]
   82 | void solve(int caso){
      |            ~~~~^~~~

Judge Result