QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #836538 | #9925. LR String | ucup-team159# | AC ✓ | 291ms | 8344kb | C++20 | 5.3kb | 2024-12-28 23:23:11 | 2024-12-28 23:23:11 |
Judging History
answer
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rep1(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < (t); ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define em emplace
#define pob pop_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define newline puts("")
#define vc vector
using namespace std;
template<class T> using vv = vc<vc<T>>;
template<class T> using PQ = priority_queue<T,vc<T>,greater<T>>;
using uint = unsigned; using ull = unsigned long long;
using vi = vc<int>; using vvi = vv<int>; using vvvi = vv<vi>;
using ll = long long; using vl = vc<ll>; using vvl = vv<ll>; using vvvl = vv<vl>;
using P = pair<int,int>; using vp = vc<P>; using vvp = vv<P>; using LP = pair<ll,ll>;
int geti(){int x;scanf("%d",&x);return x;}
vi pm(int n, int s=0) { vi a(n); iota(rng(a),s); return a;}
template<class T1,class T2>istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.fi>>v.se;}
template<class T1,class T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.fi<<","<<v.se;}
template<class T>istream& operator>>(istream&i,vc<T>&v){rep(j,sz(v))i>>v[j];return i;}
template<class T>string join(const T&v,const string&d=""){stringstream s;rep(i,sz(v))(i?s<<d:s)<<v[i];return s.str();}
template<class T>ostream& operator<<(ostream&o,const vc<T>&v){if(sz(v))o<<join(v," ");return o;}
template<class T>void vin(vc<T>&a){int n;cin>>n;a=vc<T>(n);cin>>a;}
template<class T>void vin(vv<T>&a){int n,m;cin>>n>>m;a=vv<T>(n,vc<T>(m));cin>>a;}
template<class T1,class T2>void operator--(pair<T1,T2>&a,int){a.fi--;a.se--;}
template<class T1,class T2>void operator++(pair<T1,T2>&a,int){a.fi++;a.se++;}
template<class T>void operator--(vc<T>&a,int){for(T&x:a)x--;}
template<class T>void operator++(vc<T>&a,int){for(T&x:a)x++;}
template<class T1,class T2>void operator+=(vc<T1>&a,T2 b){for(T1&x:a)x+=b;}
template<class T1,class T2>void operator-=(vc<T1>&a,T2 b){for(T1&x:a)x-=b;}
template<class T1,class T2>void operator*=(vc<T1>&a,T2 b){for(T1&x:a)x*=b;}
template<class T1,class T2>void operator/=(vc<T1>&a,T2 b){for(T1&x:a)x/=b;}
template<class T>void operator+=(vc<T>&a,const vc<T>&b){a.insert(a.end(),rng(b));}
template<class T1,class T2>pair<T1,T2>operator+(const pair<T1,T2>&a,const pair<T1,T2>&b){return {a.fi+b.fi,a.se+b.se};}
template<class T1,class T2>pair<T1,T2>operator-(const pair<T1,T2>&a,const pair<T1,T2>&b){return {a.fi-b.fi,a.se-b.se};}
template<class T>pair<T,T>operator*(const pair<T,T>&a,T b){return {a.fi*b,a.se*b};}
template<class T1,class T2>bool mins(T1& x,const T2&y){if(y<x){x=y;return true;}else return false;}
template<class T1,class T2>bool maxs(T1& x,const T2&y){if(x<y){x=y;return true;}else return false;}
template<class T>T min(const vc<T>&a){return *min_element(rng(a));}
template<class T>T max(const vc<T>&a){return *max_element(rng(a));}
template<class Tx,class Ty>Tx dup(Tx x, Ty y){return (x+y-1)/y;}
template<class T>ll suma(const vc<T>&a){ll s=0;for(auto&&x:a)s+=x;return s;}
template<class T>ll suma(const vv<T>&a){ll s=0;for(auto&&x:a)s+=suma(x);return s;}
template<class T>void uni(T&a){sort(rng(a));a.erase(unique(rng(a)),a.end());}
template<class T>void prepend(vc<T>&a,const T&x){a.insert(a.begin(),x);}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame { puts("-1"); return;}
#define yes { puts("Yes"); return;}
#define no { puts("No"); return;}
#define rtn(x) { cout<<(x)<<'\n'; return;} // flush!
#define yn {puts("YES");}else{puts("NO");}
template<typename T> int lwb(const vector<T>& a, const T& x) { return lower_bound(rng(a), x) - a.begin();}
template<typename T> int upb(const vector<T>& a, const T& x) { return upper_bound(rng(a), x) - a.begin();}
template<typename T> bool exists(const vector<T>& a, const T& x) { return binary_search(rng(a), x);}
struct Solver {
void solve() {
string s;
cin>>s;
int q;
scanf("%d",&q);
vi ls, rs, lrs;
int n = sz(s);
rep(i,n) if (s[i] == 'L') ls.pb(i);
rep(i,n) if (s[i] == 'R') rs.pb(i);
rep(i,n-1) if (s[i] == 'L' && s[i+1] == 'R') lrs.pb(i);
rep(qi,q) {
string t;
cin>>t;
int i = 0;
bool ok = [&]() {
rep(j,sz(t)) {
if (j+1 < sz(t) && t[j] == 'L' && t[j+1] == 'R') {
i = lwb(lrs,i);
if (i == sz(lrs)) return false;
i = lrs[i]+2; j++;
} else if (t[j] == 'L') {
i = lwb(ls,i);
if (i == sz(ls)) return false;
i = ls[i]+1;
} else {
if (j) {
i = lwb(rs,i);
if (i == sz(rs)) return false;
i = rs[i]+1;
} else {
if (s[0] != 'R') return false;
i = 1;
}
}
}
if (t.back() == 'L' && s.back() != 'L') return false;
return true;
}();
if (ok) yn;
}
}
};
int main() {
// cin.tie(nullptr); ios::sync_with_stdio(false);
int ts = 1;
scanf("%d",&ts);
rep1(ti,ts) {
Solver solver;
solver.solve();
}
return 0;
}
这程序好像有点Bug，我给组数据试试？
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3892kb
input:
2 RRLLRRLL 4 LLLLL LLR LRLR R RLLLLLL 3 LLLLL RL RRL
output:
NO YES NO YES YES YES NO
result:
ok 7 lines
Test #2:
score: 0
Accepted
time: 172ms
memory: 3668kb
input:
100000 RRLLR 4 R R R R LRLLL 6 R L L L L R RLLRR 1 L LRLLL 3 R L L RLRRL 2 LRRRR RRRL LRLRR 2 L R RRLRL 4 RLRLR RLLL LR RLL RLRLL 8 R R R L L L R L RLLRR 7 R LL RL R L L L LLRLR 2 L R RRRRL 1 RLLLR RRLLL 2 L L RLLRL 1 RLLRL LRLLL 5 RLRLL RLLLR RRRRL LLRRR RLLRR LRLLL 3 RRLL R RL LLRRL 3 L R LLLRR RR...
output:
YES YES YES YES NO YES YES YES YES NO NO NO YES YES NO YES NO NO NO NO YES YES YES YES YES YES YES YES YES YES YES NO NO YES NO NO NO NO NO NO YES YES YES NO NO NO NO NO NO NO NO YES NO NO NO YES YES NO NO NO NO NO NO NO NO NO YES YES YES YES YES YES YES NO NO NO NO YES NO NO YES YES YES NO NO NO NO...
result:
ok 356450 lines
Test #3:
score: 0
Accepted
time: 276ms
memory: 7172kb
input:
2 RRLRLLLRLRLRLRLLLLRRLLLRLRRLLLLLLRRRRRLRLRLRLLLLRRRLLRLRRLLRRRRRLLRLLRLLLLRLLLLRLLRRRRLRLLRRLRRRLLRRRLLLRLLRRLRLRRRRLRRLRRRLRLRLLLRLRRLRLRRRRRRLRRRRRLLLRLLLLRLRRRLRLRLLLRLRLLLLRLRRLRRLLRLRLRRLLLRRRLLLLLLLRLRRLLLLLRLRRLRLRLRRRLLRLLRLLRRLRRLLRLRLRLRLRRLRRRLLLRLLRLRLRRLRRRLLRRRRRRRRLLRLLRRLLRRLLLLRLR...
output:
YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES ...
result:
ok 820231 lines
Test #4:
score: 0
Accepted
time: 184ms
memory: 7528kb
input:
2 LLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLL...
output:
NO YES NO NO NO NO YES NO NO YES NO YES NO NO YES NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO YES NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO YES NO NO NO...
result:
ok 531269 lines
Test #5:
score: 0
Accepted
time: 120ms
memory: 3668kb
input:
100000 LRLLLLRLRR 4 LLRRRRRR LRLLL LL RLR LLLLLRRLLR 1 RLLR RRLRLRRRRR 1 LRLLLLRRLR LRRLLRLRLL 3 RLRL LLLRR LRRLRRRL RRRRLRLRRR 2 RRL L RRLLRRRLRL 4 LLLLRRRLRR LRLLLRLRL RRLRRLRLLR RRRRRLLRLR LLLLLRLLLR 1 LLRRLRLR RLLLRLLRLL 1 RRLLRLRLLL RLLRRLLLLL 6 L L L R R L LRLRLRRRRL 1 RLLRRRRRRL RRLLLLLLRL 2 ...
output:
NO NO NO NO NO NO NO YES NO NO NO NO NO NO NO NO NO YES YES YES YES YES YES NO NO NO NO NO NO YES NO YES NO YES YES YES NO NO NO NO YES NO NO NO NO NO NO NO YES YES YES YES NO NO NO NO NO NO NO NO NO NO NO NO NO NO YES NO NO NO YES NO NO NO NO YES NO YES NO NO YES YES YES YES NO YES YES YES YES NO Y...
result:
ok 249969 lines
Test #6:
score: 0
Accepted
time: 195ms
memory: 3600kb
input:
100000 RRLLRRLLLR 1 L RLLLLRRRRR 2 L L RLRRLLLRRL 3 L L R LRLRLLRLLL 3 RRLLLLRLLL L RLRRLLLRRR LLLRRLRRRL 4 L R L L RRLRLLLLLL 1 LLLL RRLLRRLRLL 27 R LR L R R LR RLL L LR L L LL L LL R R R LR R RL LRLRL L L LL R R RRL RLLRLRRRLL 4 L LR LRLRRLRR R LLLRRRRRRR 11 R L L R R R L R L L R RLRLLLRLRL 8 LL L...
output:
NO NO NO YES YES YES NO YES NO YES NO YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES NO YES NO NO NO NO NO NO NO NO NO NO NO YES YES YES YES YES YES YES YES NO YES YES NO YES NO YES YES YES YES YES YES YES YES YES YES Y...
result:
ok 527043 lines
Test #7:
score: 0
Accepted
time: 171ms
memory: 3656kb
input:
10000 RLLLRRLRLRLLRRLLLRRRRLLLLRRLLLRLRLLLLRRLRLRRLLLRLLLLLLLRLRRLRLLRRLLRRLLRRRLRRLRLRLLLLRRLLRLRRRLLRRLR 37 R L R R R R L RL R R RLL R RRLR L LR R LR L LL R LLLL LRRR R LLL L LR LR RLR LRRL R R RRL L L L L L RRRRRRRLRLLLLLLLRRRLLLLRRLLRLLRLLRRRRLRLRRRRLRRLLLLLLRLLLLRRRRRRLLRRRLLRRRLLLRRRLRLLRLRRLL...
output:
YES NO YES YES YES YES NO NO YES YES NO YES YES NO YES YES YES NO NO YES NO YES YES NO NO YES YES YES NO YES YES NO NO NO NO NO NO NO YES YES NO YES NO NO YES YES NO NO NO YES NO NO YES YES NO YES YES NO NO YES YES YES YES NO NO NO NO YES YES NO YES NO YES YES YES YES YES YES YES YES YES YES YES YES...
result:
ok 507876 lines
Test #8:
score: 0
Accepted
time: 147ms
memory: 3652kb
input:
1000 RLRLLLRLLLRRLRLLLRRLRLLLLLLLRLLLLRLRLRLRRLLLLLRRLLRRLRLLLRLRRLRRRLRRRLRLRLLRRRLRLLLRRRLRLRRRRRRLRRLRLLLLLLRRRLRLLRRRRRRLRLRLRLRRLRRLRRLRRRRRRRLLRRLRLLLLLRRRLLRLRRLLRLLLRLLRRLLRRLRLLLRRRLLLLRLLRRRRLRLRLRLRLRLRLRRLRLRLLLRRRLRLLRLLRRLRLLLRRRRRLRRLLLLRRLRRRLRLRLRRRLLRRLRRLLRRLRLRRLRLRRRLLRLRRLLRLLR...
output:
YES YES YES NO NO NO YES YES YES NO YES NO YES NO YES NO YES NO NO NO YES NO YES NO YES YES YES YES NO NO NO NO NO NO YES YES NO NO YES NO YES NO YES YES YES YES NO YES NO YES YES YES NO YES YES YES YES YES YES YES NO YES YES NO NO NO NO NO NO NO YES NO YES NO YES YES YES NO YES NO NO YES YES NO NO ...
result:
ok 515798 lines
Test #9:
score: 0
Accepted
time: 279ms
memory: 4208kb
input:
10 LRLLRLRRLLRRRLLRRRRLRLLLLRLRLLLRLRRRLLRLRLLLLRRLLLLRRRRRRRRLLLRLRLLLLLRLLRLRRRLRRRRRLRLRRLRLRRRRRLLLLRLRRRRLRLRLRRLRLLRLLRRRRLLRLRRLLRLLRLRLLLRRRRLLLRLLRRRRRLLLRLLLRLLLLLLRLRRLRLLLRRRLLLRLRLLRRLRLRRLRRLRLLLLLLLRRRLLRLLRRRRRRLLRRRRLRLLRLLRRLLRLRLLRRRLRRRRLRRRLRLRLRRLRLLLRLRRRRLLLRRLLRLRRRLRLLRRRRR...
output:
NO YES YES NO NO YES YES NO YES YES YES YES NO NO YES NO YES NO NO NO YES NO YES YES YES NO NO YES NO NO YES YES NO YES YES NO YES YES NO YES YES NO NO NO NO NO NO YES YES YES YES YES YES YES YES NO NO YES NO YES NO NO NO NO YES NO YES NO NO YES YES NO NO YES YES NO NO NO NO NO NO YES YES YES YES NO...
result:
ok 779728 lines
Test #10:
score: 0
Accepted
time: 196ms
memory: 4180kb
input:
20 LRRRLLRLRLLLRLRLLRLLRRLLLLRRRRLLRLLLLLRLRLRLRLRLRRRLRRRLRLRLLRLRLRLRRLLRRRLLRRRRLRLLRLLRLRLRRLLRRLLRLRRLLRLLRRLLLRRLLLLLRLRRLLRRRLRRLLLLLLRLLRRRRRLLLLLLRLRLRRLLRRRRRRLRRLLLRRRRLLLLRLRRLRLLLRRLRLLRLRLLRRRRRRLRLLLLLRLLLLLRLRRLLLLLLLLRLLRRLRLLLRRRRLLLRLRLRRRLRRRLLRLRLLLRLRRLRLLLRRRLLLRLRLLRRRRLRLRLL...
output:
NO YES YES NO YES NO NO NO YES NO YES YES YES NO YES YES NO YES NO YES NO YES NO NO NO NO NO NO YES YES NO YES YES NO NO NO NO NO NO YES YES NO NO YES NO NO NO YES NO YES NO NO NO NO YES NO YES NO YES YES YES YES YES NO NO NO NO YES NO NO YES YES NO NO YES YES YES NO YES NO NO YES YES NO YES NO YES ...
result:
ok 447294 lines
Test #11:
score: 0
Accepted
time: 183ms
memory: 5048kb
input:
4 RRRRLLRRRRLLRLLLLRRLLLRLRLLLLRRRLLRRRRRRRLLLLRLRLRRLRLLLRLLLLRLRRLRRLRLRRRRLRLLLRLLLLLLLLLLLRRRLLLRRLRLRLRLRRLRLRRLLRRLRRRLLRLLRLRLRRLLRLLLLLLLRRRLLLLLRRLRRLLLRRRLRLLLLLLRLRRRRRLRLLRRLRRRRRLLRRRRLLLRRLLLRRRLLLLRLRRLRLLLLLRLLRLRLRRRLRRRRLLLLLLRRRRLRLRRRLRLLRRRLRRRRRRRRRRRLLRLRRRLRLLRLLRRRRRLRLLRRRL...
output:
YES YES NO YES NO NO NO NO NO YES YES NO NO YES YES YES YES NO YES NO YES YES NO YES YES NO NO NO YES YES NO YES NO YES YES YES YES YES YES NO NO YES NO YES NO NO YES YES YES YES YES NO YES NO NO YES YES YES NO NO YES NO NO YES NO YES NO NO YES YES YES YES NO NO YES YES NO YES NO YES NO NO NO NO NO ...
result:
ok 508901 lines
Test #12:
score: 0
Accepted
time: 291ms
memory: 6872kb
input:
3 RLLRRRLRRLLLRLLRRRLLRLLLRRLLRRRLRLLRLLRLRRRRRLRLRLLLRLRLRRLRLLLRLLRRRRLLRLLRLRRRRLLLRLLLLRLLRRRLRRRRRRRLRLRRRLRRRLLLLRRLRLRLRLLRRRLLLLRRLRLRLLLRLRRRLLLLLLLLLRLRLLLRRLLRLLLRLRRLRLLRRLLLLLRRRRRRRLLRRRLRRRLLRRRRRRLRRRLLLRRRLLRLRLRRLLRLRLRRLRRLLRRRLRLLLLLLRLLLRRLLLRLRRRRLLRRRLLRRLRRRRLLLLRLLLLLRLRLLRR...
output:
NO NO NO YES YES NO NO YES NO YES YES YES NO YES YES YES NO YES YES YES NO YES NO NO NO NO YES NO YES NO NO YES NO NO YES YES NO YES YES NO NO NO NO NO YES NO YES YES YES YES YES NO YES YES YES YES YES YES YES NO YES YES YES NO NO NO NO NO YES NO NO NO YES NO NO NO YES YES YES YES NO NO YES NO YES N...
result:
ok 941609 lines
Test #13:
score: 0
Accepted
time: 275ms
memory: 8252kb
input:
2 RRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...
output:
YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES YES ...
result:
ok 858650 lines
Test #14:
score: 0
Accepted
time: 77ms
memory: 8260kb
input:
2 RRLLLLRRRLLLLLLRRRRLRRRRLLLLRRLRLLLRLLLLLRLLRLRLRRLLLRLRLLRRLRRRRLLLLRRRRLRLLRLRRRRRLRLRRLLLLRRRRLRRRRRRLRRLRLRLRLRRRRLLLRLLRLRLRRRLRLRRLRRRLLLRRLLLRRLLLRLLLRRRRLLRRRLLLRRLLLLRRLRRLLRLRLLRLRLLLRLLRRLRLRLLRRLRRLLRRLLLRLRRLLLRLRLRRRRRLRLRRLLRRLLLRLRRLRLRLRLRLRLRRLLRRLLLRLRRRRLRLLLRLRRRLLLRRLLLLRLRRR...
output:
NO NO
result:
ok 2 lines
Test #15:
score: 0
Accepted
time: 68ms
memory: 7304kb
input:
2 RRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...
output:
YES YES YES YES NO NO YES YES YES NO
result:
ok 10 lines
Test #16:
score: 0
Accepted
time: 49ms
memory: 6640kb
input:
1 LLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLL...
output:
NO YES YES YES NO
result:
ok 5 lines
Test #17:
score: 0
Accepted
time: 71ms
memory: 7580kb
input:
2 LLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLL...
output:
YES NO NO NO YES YES YES YES YES YES
result:
ok 10 lines
Test #18:
score: 0
Accepted
time: 59ms
memory: 6764kb
input:
1 RRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...
output:
YES YES YES NO YES
result:
ok 5 lines
Test #19:
score: 0
Accepted
time: 49ms
memory: 8344kb
input:
2 LLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLL...
output:
NO YES
result:
ok 2 lines
Test #20:
score: 0
Accepted
time: 39ms
memory: 7288kb
input:
1 LLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLL...
output:
YES
result:
ok single line: 'YES'
Extra Test:
score: 0
Extra Test Passed