#1176685 (C++17) No.3622 Perfect Matching of Crab

• 問題: No.3622 Perfect Matching of Crab
• ユーザー: 👑 AngrySadEight
• 提出日時: 2026-08-14 21:26:44
• 言語: C++17 (gcc 15.2.0 + boost 1.90.0)
• 結果: AC
• 実行時間: 358 ms / 2,000 ms
• コード長: 3,716 bytes
• コンパイル時間: 805 ms
• コンパイル使用メモリ: 164,516 KB
• 実行使用メモリ: 19,200 KB
• 最終ジャッジ日時: 2026-08-14 21:26:51
• 合計ジャッジ時間: 5,886 ms
• ジャッジサーバーID （参考情報）: judge3_0 / judge2_0

ファイルパターン	結果
sample	AC * 2
other	AC * 16

ソースコード

#include <algorithm>
#include <atcoder/segtree>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

int main() {
    ll T;
    cin >> T;
    while (T--){
        ll N;
        cin >> N;
        vector<ll> X(2 * N);
        vector<ll> Y(2 * N);
        vector<char> C(2 * N);
        ll cnt_x = 0;
        ll cnt_y = 0;
        rep(i, 2 * N){
            cin >> X[i] >> Y[i] >> C[i];
        }
        // x 同士、y 同士で最大何ペア作れるかみる
        map<ll, ll> mpx;
        map<ll, ll> mpy;
        for (ll i = 0; i < 2 * N; i++){
            if (C[i] == 'x'){
                mpx[Y[i]]++;
                cnt_x++;
            }
            else{
                mpy[X[i]]++;
                cnt_y++;
            }
        }
        ll x_pair = 0;
        ll y_pair = 0;
        for (auto it = mpx.begin(); it != mpx.end(); it++){
            x_pair += (it->second) / 2;
        }
        for (auto it = mpy.begin(); it != mpy.end(); it++){
            y_pair += (it->second) / 2;
        }
        if (cnt_x >= cnt_y){
            ll rem = (cnt_x - cnt_y) / 2;
            if (x_pair >= rem) cout << "Yes" << endl;
            else cout << "No" << endl;
        }
        else{
            ll rem = (cnt_y - cnt_x) / 2;
            if (y_pair >= rem) cout << "Yes" << endl;
            else cout << "No" << endl;
        }
    }
}