#597193 (C++17) No.1328 alligachi-problem

提出ソース

結果

問題	No.1328 alligachi-problem
ユーザー	hitonanode
提出日時	2020-12-25 00:33:50
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	6,475 bytes
コンパイル時間	2,238 ms
コンパイル使用メモリ	215,500 KB
実行使用メモリ	14,220 KB
最終ジャッジ日時	2024-09-21 17:14:30
合計ジャッジ時間	6,760 ms
ジャッジサーバーID （参考情報）	judge3 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	WA	-
testcase_01	AC	2 ms 6,940 KB
testcase_02	WA	-
testcase_03	WA	-
testcase_04	WA	-
testcase_05	WA	-
testcase_06	AC	2 ms 6,940 KB
testcase_07	WA	-
testcase_08	AC	2 ms 6,944 KB
testcase_09	WA	-
testcase_10	AC	26 ms 8,576 KB
testcase_11	WA	-
testcase_12	WA	-
testcase_13	WA	-
testcase_14	WA	-
testcase_15	AC	25 ms 8,448 KB
testcase_16	WA	-
testcase_17	WA	-
testcase_18	WA	-
testcase_19	WA	-
testcase_20	WA	-
testcase_21	WA	-
testcase_22	WA	-
testcase_23	AC	28 ms 8,576 KB
testcase_24	AC	41 ms 11,464 KB
testcase_25	AC	29 ms 9,456 KB
testcase_26	WA	-
testcase_27	WA	-

権限があれば一括ダウンロードができます

ソースコード

raw source code

#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');
    }
    int nb = count(ALL(C), 1);
    vector<int> blue(nb, -1);
    vector<vector<int>> reds(nb + 1);
    vector<pint> pending_reds;
    vector<pint> pending_blues;

    dbg(nb);
    dbg(C);
    dbg(X);
    dbg(Y);
    REP(i, N) {
        if (C[i] == 0) {
            if (X[i]) {
                if (Y[i] >= int(reds.size())) bad();
                else reds[Y[i]].emplace_back(i);
            }
            else pending_reds.emplace_back(Y[i], i);
        } else {
            if (X[i]) {
                if (Y[i] >= int(blue.size()) or blue[Y[i]] != -1) bad();
                else blue[Y[i]] = i;
            }
            else pending_blues.emplace_back(Y[i], i);
        }
    }
    dbg(blue);
    dbg(reds);
    sort(ALL(pending_reds));
    sort(ALL(pending_blues));

    {
        int cur = 0;
        for (auto [sz, i] : pending_blues) {
            while (blue[cur] >= 0) cur++;
            blue[cur] = i;
            cur++;
        }
    }
    dbg(pending_blues);
    dbg(blue);
    vector<int> rettmp;
    REP(i, reds.size()) {
        for (auto x : reds[i]) rettmp.emplace_back(x);
        if (i < int(blue.size())) rettmp.emplace_back(blue[i]);
    }
    dbg(rettmp);
    dbg(pending_reds);

    vector<int> ret;
    int ib = 0, ir = 0;

    auto check = [&](int i) -> bool {
        dbg(ret);
        dbg(ib);
        dbg(ir);
        dbg(i);
        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;
    for (auto i : rettmp) {
        while (cur < int(pending_reds.size()) and ((!X[i] and Y[i] > ir) or (C[i] == 0 and ir + 1 > pending_reds[cur].first))) {
            int j = pending_reds[cur].second;
            cur++;
            add(j);
        }
        add(i);
    }
    while (cur < pending_reds.size()) {
        int i = pending_reds[cur].second;
        add(i);
        cur++;
    }

    cout << "Yes\n";
    for (auto i : ret) cout << i + 1 << ' ';
    cout << '\n';
}

yukicoder

結果

テストケース

ソースコード