Contest Duration: - (local time) (100 minutes) Back to Home

Submission #6688127

Source Code Expand

Copy
```#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using vi = vector<int>;
using vl = vector<ll>;

using _loop_int = int;
#define REP(i,n) for(_loop_int i=0; i<(_loop_int)(n); i++)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a); i<(_loop_int)(b); i++)
#define FORR(i,a,b) for(_loop_int i=(_loop_int)(b)-1; i>=(_loop_int)(a); i--)

#define CHMIN(a,b) (a)=min((a),(b))
#define CHMAX(a,b) (a)=max((a),(b))
#define ALL(v) (v).begin(),(v).end()

#define DEBUG(x) cerr<<#x<<": "<<(x)<<endl
#define DEBUG_VEC(v) cerr<<#v<<": ";REP(__i,(v).size())cerr<<((v)[__i])<<", ";cerr<<endl

const ll MOD = 1000000007ll;

int n;
char s[125252];

int ans[125252];

int main(){
scanf("%s",s);
n = strlen(s);
{
int x=0,y=0;
REP(i,n){
if(s[i]=='R'){
x++;
swap(x,y);
}else{
ans[i] += x;
ans[i-1] += y;
x = y = 0;
}
}
}
{
int x=0,y=0;
FORR(i,0,n){
if(s[i]=='L'){
x++;
swap(x,y);
}else{
ans[i] += x;
ans[i+1] += y;
x = y = 0;
}
}
}
REP(i,n)printf("%d%c",ans[i]," \n"[i==n-1]);
return 0;
}
```

#### Submission Info

Submission Time 2019-08-04 21:07:49+0900 D - Gathering Children rickytheta C++14 (GCC 5.4.1) 400 1411 Byte AC 11 ms 896 KB

#### Compile Error

```./Main.cpp: In function ‘int main()’:
./Main.cpp:31:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%s",s);
^
```

#### 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 7 ms 640 KB
testcase_02 AC 7 ms 640 KB
testcase_03 AC 11 ms 896 KB
testcase_04 AC 11 ms 896 KB
testcase_05 AC 7 ms 640 KB
testcase_06 AC 9 ms 768 KB
testcase_07 AC 10 ms 896 KB
testcase_08 AC 10 ms 896 KB
testcase_09 AC 3 ms 384 KB
testcase_10 AC 10 ms 896 KB
testcase_11 AC 11 ms 896 KB
testcase_12 AC 10 ms 896 KB
testcase_13 AC 10 ms 896 KB
testcase_14 AC 10 ms 896 KB
testcase_15 AC 10 ms 896 KB
testcase_16 AC 10 ms 896 KB
testcase_17 AC 10 ms 896 KB
testcase_18 AC 1 ms 256 KB