Submission #75002397


Source Code Expand

#include <bits/stdc++.h>

using namespace std;

mt19937_64    rng(chrono::steady_clock::now().time_since_epoch().count());

#define       nline                     "\n"
#define       pb                        push_back
#define       ppb                       pop_back
#define       mp                        make_pair
#define       ff                        first
#define       ss                        second
#define       fall(x, n)                for(int x=0; x<n; x++)
#define       rall(x, n)                for(int x=n-1; x>=0; x--)
#define       frange(x, start, end)     for(int x=start; x<=end; x++)
#define       rrange(x, start, end)     for(int x=start; x>=end; x--)
#define       in(i, v)                  for(auto &i: v) cin >> i;
#define       vi                        vector<int>
#define       ii                        pair<int, int>
#define       sz(x)                     ((int)(x).size())
#define       all(x)                    (x).begin(), (x).end()
#define       mod                       1000000007
#define       INF                       0x1fffffffffffffffLL

typedef       long long                 ll;
typedef       unsigned long long        ull;
typedef       long double               lld;

#ifdef        LOCAL
#include      "debug.h"
#else
#define       debug(x)
#endif

#define       int                       long long

void solve()
{
    string s; cin >> s;
    vi b, k, r;
    fall(i, sz(s)) {
        if (s[i] == 'R') r.pb(i);
        else if (s[i] == 'B') b.pb(i);
        else if (s[i] == 'K') k.pb(i);
    }
    if ((b[0] % 2 != b[1] % 2) && (r[0] <= k[0] && k[0] <= r[1]))
        cout << "Yes\n";
    else
        cout << "No\n";
}

signed main()
{
#ifdef LOCAL
    freopen("i.txt", "r", stdin); freopen("o.txt", "w", stdout); freopen("e.txt", "w", stderr);
#endif
    auto begin = chrono::high_resolution_clock::now();
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int t = 1;
    while (t--) solve();
    auto end = chrono::high_resolution_clock::now();
    auto elapsed = chrono::duration_cast<chrono::nanoseconds>(end - begin);
    cerr << fixed << "Time measured <= *_* => " << elapsed.count() * 1e-9 << " seconds.\n";
    return 0;
}

Submission Info

Submission Time
Task C - chess960
User kumaresh_rk
Language C++23 (GCC 15.2.0)
Score 200
Code Size 2261 Byte
Status AC
Exec Time 1 ms
Memory 3980 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 3
AC × 13
Set Name Test Cases
Sample 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt
All 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 01_test_01.txt, 01_test_02.txt, 01_test_03.txt, 01_test_04.txt, 01_test_05.txt, 01_test_06.txt, 01_test_07.txt, 01_test_08.txt, 01_test_09.txt, 01_test_10.txt
Case Name Status Exec Time Memory
00_sample_01.txt AC 1 ms 3864 KiB
00_sample_02.txt AC 1 ms 3748 KiB
00_sample_03.txt AC 1 ms 3956 KiB
01_test_01.txt AC 1 ms 3908 KiB
01_test_02.txt AC 1 ms 3948 KiB
01_test_03.txt AC 1 ms 3908 KiB
01_test_04.txt AC 1 ms 3932 KiB
01_test_05.txt AC 1 ms 3948 KiB
01_test_06.txt AC 1 ms 3932 KiB
01_test_07.txt AC 1 ms 3812 KiB
01_test_08.txt AC 1 ms 3980 KiB
01_test_09.txt AC 1 ms 3788 KiB
01_test_10.txt AC 1 ms 3880 KiB