結果

問題 No.1328 alligachi-problem
ユーザー minato
提出日時 2020-12-25 00:41:21
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
AC  
実行時間 99 ms / 2,000 ms
コード長 5,234 bytes
コンパイル時間 15,794 ms
コンパイル使用メモリ 293,284 KB
最終ジャッジ日時 2025-01-17 06:49:37
ジャッジサーバーID
（参考情報） 		judge2 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 25
権限があれば一括ダウンロードができます

ソースコード

diff # 

#ifdef ONLINE_JUDGE
#pragma GCC target("avx2,avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using i128 = __int128_t;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
template<class T> using vec = vector<T>;
template<class T> using vvec = vector<vector<T>>;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define all(x) (x).begin(), (x).end()
constexpr char ln = '\n';
istream& operator>>(istream& is, __int128_t& x) {
    x = 0;
    string s;
    is >> s;
    int n = int(s.size()), it = 0;
    if (s[0] == '-') it++;
    for (; it < n; it++) x = (x * 10 + s[it] - '0');
    if (s[0] == '-') x = -x;
    return is;
}
ostream& operator<<(ostream& os, __int128_t x) {
    if (x == 0) return os << 0;
    if (x < 0) os << '-', x = -x;
    deque<int> deq;
    while (x) deq.emplace_front(x % 10), x /= 10;
    for (int e : deq) os << e;
    return os;
}
template<class T1, class T2>
ostream& operator<<(ostream& os, const pair<T1, T2>& p) {
    return os << "(" << p.first << ", " << p.second << ")";
}
template<class T> 
ostream& operator<<(ostream& os, const vector<T>& v) {
    os << "{";
    for (int i = 0; i < int(v.size()); i++) {
        if (i) os << ", ";
        os << v[i];
    }
    return os << "}";
}
template<class Container> inline int SZ(Container& v) { return int(v.size()); }
template<class T> inline void UNIQUE(vector<T>& v) { v.erase(unique(v.begin(), v.end()), v.end()); }
template<class T1, class T2> inline bool chmax(T1& a, T2 b) { if (a < b) {a = b; return true ;} return false ;}
template<class T1, class T2> inline bool chmin(T1& a, T2 b) { if (a > b) {a = b; return true ;} return false ;}
inline int topbit(ull x) { return x == 0 ? -1 : 63 - __builtin_clzll(x); }
inline int botbit(ull x) { return x == 0 ? 64 : __builtin_ctzll(x); }
inline int popcount(ull x) { return __builtin_popcountll(x); }
inline int kthbit(ull x, int k) { return (x>>k) & 1; }
inline constexpr long long TEN(int x) { return x == 0 ? 1 : TEN(x-1) * 10; }
inline void print() { cout << "\n"; }
template<class T>
inline void print(const vector<T>& v) {
    for (int i = 0; i < int(v.size()); i++) {
        if (i) cout << " ";
        cout << v[i];
    }
    print();
}
template<class T, class... Args>
inline void print(const T& x, const Args& ... args) {
    cout << x << " ";
    print(args...);
}
#ifdef MINATO_LOCAL
inline void debug_out() { cerr << endl; }
template <class T, class... Args>
inline void debug_out(const T& x, const Args& ... args) {
    cerr << " " << x;
    debug_out(args...);
}
#define debug(...) cerr << __LINE__ << " : [" << #__VA_ARGS__ << "] =", debug_out(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif
struct fast_ios { fast_ios() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

using Tu = tuple<int, int, int>;
int main() {
    int N; cin >> N;
    vec<int> C(N),X(N),Y(N);
    rep(i,N) {
        char c,x; cin >> c >> x;
        C[i] = c=='B';
        X[i] = x=='B';
        cin >> Y[i];
    }

    vec<Tu> R,B;
    rep(i,N) {
        if (X[i]==0) R.emplace_back(Y[i],C[i]==X[i],i);
        else B.emplace_back(Y[i],C[i]==X[i],i);
    }

    sort(all(R)); sort(all(B));
    reverse(all(R)); reverse(all(B));
    int r = 0, b = 0;
    vec<int> ans;
    while (!R.empty() or !B.empty()) {
        if (R.empty()) {
            auto[cnt,same,id] = B.back();
            if (b == cnt) {
                B.pop_back();
                ans.emplace_back(id+1);
                if (same) b++;
                else r++;
                continue;
            }
        } else if (B.empty()) {
            auto[cnt,same,id] = R.back();
            if (r == cnt) {
                R.pop_back();
                ans.emplace_back(id+1);
                if (same) r++;
                else b++;
                continue;
            }
        } else {
            auto[cnt1,same1,id1] = R.back();
            auto[cnt2,same2,id2] = B.back();
            if (same1) {
                if (r == cnt1) {
                    R.pop_back();
                    ans.emplace_back(id1+1);
                    r++;
                    continue;
                }
            }
            if (same2) {
                if (b == cnt2) {
                    B.pop_back();
                    ans.emplace_back(id2+1);
                    b++;
                    continue;
                }
            }
            if (r == cnt1) {
                R.pop_back();
                ans.emplace_back(id1+1);
                b++;
                continue;
            }
            if (b == cnt2) {
                B.pop_back();
                ans.emplace_back(id2+1);
                r++;
                continue;
            }
        }
        cout << "No" << ln;
        return 0;
    }

    cout << "Yes" << ln;
    print(ans);
}
0