Submission

Score: 0

User: Monasm

Problemset: B.Shuffle

Language: cpp

Time: 0.002 second

Submitted On: 2026-04-12 13:45:53

#include <iostream>
#include <vector>
#include <string>

using namespace std;

void solve() {
    int M;
    if (!(cin >> M)) return;
    
    string S;
    string temp;
    while (temp.length() < M) {
        string partial;
        cin >> partial;
        temp += partial;
    }
    S = temp;

    vector<int> pos;
    for (int i = 0; i < M; i++) {
        if (S[i] == 'N' || S[i] == 'K') {
            pos.push_back(i);
        }
    }

    int xor_sum = 0;
    for (int i = 0; i + 1 < pos.size(); i += 2) {
        xor_sum ^= (pos[i+1] - pos[i] - 1);
    }

    if (xor_sum != 0) cout << "YES\n";
    else cout << "NO\n";
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int T;
    if (cin >> T) {
        while (T--) solve();
    }
    return 0;
}