結果

問題 No.1328 alligachi-problem
ユーザー hitonanode
提出日時 2020-12-25 00:58:42
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 71 ms / 2,000 ms
コード長 6,945 bytes
コンパイル時間 2,733 ms
コンパイル使用メモリ 206,096 KB
最終ジャッジ日時 2025-01-17 06:53:18
ジャッジサーバーID
(参考情報)
judge5 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 25
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T, typename V>
void ndarray(vector<T>& vec, const V& val, int len) { vec.assign(len, val); }
template <typename T, typename V, typename... Args> void ndarray(vector<T>& vec, const V& val, int len, Args... args) { vec.resize(len), for_each
    (begin(vec), end(vec), [&](T& v) { ndarray(v, val, args...); }); }
template <typename T> bool chmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template <typename T> bool chmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }
template <typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l
    .second + r.second); }
template <typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l
    .second - r.second); }
template <typename T> vector<T> sort_unique(vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end());
    return vec; }
template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto &v : vec) is >> v; return is; }
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <typename T, size_t sz> ostream &operator<<(ostream &os, const array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']';
    return os; }
#if __cplusplus >= 201703L
template <typename... T> istream &operator>>(istream &is, tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return
    is; }
template <typename... T> ostream &operator<<(ostream &os, const tuple<T...> &tpl) { std::apply([&os](auto &&... args) { ((os << args << ','), ...);},
    tpl); return os; }
#endif
template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os;
    }
template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T, typename TH> ostream &operator<<(ostream &os, const unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ',';
    os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os;
    }
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}';
    return os; }
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa) { os << '(' << pa.first << ',' << pa.second << ')';
    return os; }
template <typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v
    .second << ','; os << '}'; return os; }
template <typename TK, typename TV, typename TH> ostream &operator<<(ostream &os, const unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp)
    os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#ifdef HITONANODE_LOCAL
const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9
    ;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m";
#define dbg(x) cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET <<
    endl
#else
#define dbg(x) {}
#endif
void bad()
{
puts("No");
exit(0);
}
int main()
{
int N;
cin >> N;
vector<int> C(N), X(N), Y(N);
REP(i, N) {
char c, x;
cin >> c >> x >> Y[i];
C[i] = (c == 'B');
X[i] = (x == 'B');
}
const int nb = accumulate(ALL(C), 0);
vector<int> blue(nb, -1);
vector<int> red(N - nb, -1);
vector<pint> pending_reds;
vector<pint> pending_blues;
REP(i, N) {
if (C[i] == 0) {
if (X[i]) pending_reds.emplace_back(Y[i], i);
else {
if (Y[i] >= int(red.size()) or red[Y[i]] != -1) bad();
red[Y[i]] = i;
}
} else {
if (X[i]) {
if (Y[i] >= int(blue.size()) or blue[Y[i]] != -1) bad();
blue[Y[i]] = i;
}
else pending_blues.emplace_back(Y[i], i);
}
}
dbg(blue);
dbg(red);
sort(pending_reds.begin(), pending_reds.end());
sort(pending_blues.begin(), pending_blues.end());
{
int cur = 0;
for (auto [sz, i] : pending_blues) {
while (blue[cur] >= 0) cur++;
blue[cur] = i;
cur++;
}
}
{
int cur = 0;
for (auto [sz, i] : pending_reds) {
while (red[cur] >= 0) cur++;
red[cur] = i;
cur++;
}
}
dbg(blue);
dbg(red);
vector<int> lo(red.size(), -1), hi(red.size(), blue.size());
REP(t, blue.size()) {
int i = blue[t];
if (X[i] == 0) {
if (Y[i] > red.size()) bad();
if (Y[i]) chmin(hi[Y[i] - 1], t - 1);
if (Y[i] < lo.size()) chmax(lo[Y[i]], t);
}
}
REP(t, red.size()) {
int i = red[t];
if (X[i] == 1) {
lo[t] = hi[t] = Y[i] - 1;
}
}
REP(i, red.size() - 1) chmax(lo[i + 1], lo[i]);
IREP(i, red.size() - 1) chmin(hi[i], hi[i + 1]);
dbg(lo);
dbg(hi);
REP(i, red.size()) if (lo[i] > hi[i]) bad();
vector<int> ret;
int ib = 0, ir = 0;
auto check = [&](int i) -> bool {
dbg(ret);
if (i < 0) return false;
if (X[i] == 1) return ib == Y[i];
else return ir == Y[i];
};
auto add = [&](int i) {
if (!check(i)) bad();
(C[i] ? ib : ir)++;
ret.emplace_back(i);
};
int cur = 0;
int now = -1;
while (now < int(blue.size())) {
while (cur < red.size() and lo[cur] == now) add(red[cur]), cur++;
now++;
if (now >= int(blue.size())) break;
add(blue[now]);
}
while (cur < red.size()) {
add(red[cur]);
cur++;
}
if (ret.size() != N) bad();
cout << "Yes\n";
REP(i, N) cout << ret[i] + 1 << (i + 1 == N ? '\n' : ' ');
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0