Submission #6691009


Source Code Expand

Copy
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<unordered_set>
#include<unordered_map>
using namespace std;
typedef long long ll;
#define mod 1000000007
#define mad(a,b) a=(a+b)%mod;
ll ans[200010];
int main(){
  string s; cin>>s; s+="R";
  for(int i=0;i<s.size();i++)ans[i]=0;
  ll a=1,b=0,pl=-1;
  for(int i=1;i<s.size();i++){
      if(s[i-1]=='L'&&s[i]=='R'){
	  ans[pl]=(a+1)/2+b/2;
	  ans[pl+1]=a/2+(b+1)/2;
	  a=1,b=0,pl=-1;
	  continue;
      }
      if(s[i]=='L')b++;
      if(s[i]=='R')a++;
      if(s[i-1]=='R'&&s[i]=='L')pl=i-1;
  }
  for(int i=0;i<s.size()-1;i++)cout<<ans[i]<<endl;
  return 0;
}

Submission Info

Submission Time
Task D - Gathering Children
User ynymxiaolongbao
Language C++14 (GCC 5.4.1)
Score 400
Code Size 671 Byte
Status AC
Exec Time 162 ms
Memory 1408 KB

Judge Result

Set Name All Sample
Score / Max Score 400 / 400 0 / 0
Status
AC × 21
AC × 3
Set Name Test Cases
All sample_01, sample_02, sample_03, testcase_01, testcase_02, testcase_03, testcase_04, testcase_05, testcase_06, testcase_07, testcase_08, testcase_09, testcase_10, testcase_11, testcase_12, testcase_13, testcase_14, testcase_15, testcase_16, testcase_17, testcase_18
Sample sample_01, sample_02, sample_03
Case Name Status Exec Time Memory
sample_01 AC 1 ms 256 KB
sample_02 AC 1 ms 256 KB
sample_03 AC 1 ms 256 KB
testcase_01 AC 100 ms 1024 KB
testcase_02 AC 95 ms 896 KB
testcase_03 AC 156 ms 1408 KB
testcase_04 AC 160 ms 1408 KB
testcase_05 AC 106 ms 1024 KB
testcase_06 AC 135 ms 1280 KB
testcase_07 AC 162 ms 1408 KB
testcase_08 AC 155 ms 1408 KB
testcase_09 AC 37 ms 512 KB
testcase_10 AC 155 ms 1408 KB
testcase_11 AC 156 ms 1408 KB
testcase_12 AC 156 ms 1408 KB
testcase_13 AC 159 ms 1408 KB
testcase_14 AC 157 ms 1408 KB
testcase_15 AC 156 ms 1408 KB
testcase_16 AC 159 ms 1408 KB
testcase_17 AC 157 ms 1408 KB
testcase_18 AC 1 ms 256 KB