#497855 (C++14) No.470 Inverse S+T Problem

提出ソース

結果

問題	No.470 Inverse S+T Problem
ユーザー	haruki_K
提出日時	2020-06-17 17:13:40
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	8 ms / 2,000 ms
コード長	6,890 bytes
コンパイル時間	2,012 ms
コンパイル使用メモリ	184,512 KB
実行使用メモリ	6,528 KB
最終ジャッジ日時	2024-06-01 23:02:58
合計ジャッジ時間	3,015 ms
ジャッジサーバーID （参考情報）	judge1 / judge4

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 5,248 KB
testcase_01	AC	2 ms 5,376 KB
testcase_02	AC	2 ms 5,376 KB
testcase_03	AC	2 ms 5,376 KB
testcase_04	AC	2 ms 5,376 KB
testcase_05	AC	2 ms 5,376 KB
testcase_06	AC	6 ms 6,528 KB
testcase_07	AC	8 ms 6,528 KB
testcase_08	AC	8 ms 6,528 KB
testcase_09	AC	1 ms 5,376 KB
testcase_10	AC	2 ms 5,376 KB
testcase_11	AC	2 ms 5,376 KB
testcase_12	AC	2 ms 5,376 KB
testcase_13	AC	2 ms 5,376 KB
testcase_14	AC	2 ms 5,376 KB
testcase_15	AC	2 ms 5,376 KB
testcase_16	AC	2 ms 5,376 KB
testcase_17	AC	2 ms 5,376 KB
testcase_18	AC	2 ms 5,376 KB
testcase_19	AC	2 ms 5,376 KB
testcase_20	AC	1 ms 5,376 KB
testcase_21	AC	2 ms 5,376 KB
testcase_22	AC	2 ms 5,376 KB
testcase_23	AC	2 ms 5,376 KB
testcase_24	AC	2 ms 5,376 KB
testcase_25	AC	2 ms 5,376 KB
testcase_26	AC	2 ms 5,376 KB
testcase_27	AC	2 ms 5,376 KB
testcase_28	AC	2 ms 5,376 KB
testcase_29	AC	2 ms 5,376 KB
testcase_30	AC	2 ms 5,376 KB

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

コンパイルメッセージ

main.cpp: In function 'int32_t main()':
main.cpp:160:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions]
  160 |         auto [a,b] = st(x);
      |              ^
main.cpp:161:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions]
  161 |         auto [c,d] = st(y);
      |              ^
main.cpp:172:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions]
  172 |         auto [s,t] = st(y);
      |              ^

ソースコード

raw source code

// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
#define int ll
#define double ld
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define rep1(i,n) for (int i = 1; i <= (int)(n); i++)
#define repR(i,n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i,n) for (int i = (int)(n); i >= 1; i--)
#define loop(i,a,B) for (int i = a; i B; i++)
#define loopR(i,a,B) for (int i = a; i B; i--)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
template <class Int> auto constexpr inf = numeric_limits<Int>::max()/2-1;
auto constexpr INF32 = inf<int32_t>;
auto constexpr INF64 = inf<int64_t>;
auto constexpr INF   = inf<int>;
#ifdef LOCAL
#include "debug.hpp"
#define dump(...) cerr << "[" << setw(3) << __LINE__ << ":" << __FUNCTION__ << "] ", dump_impl(#__VA_ARGS__, __VA_ARGS__)
#define say(x) cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] " << x << endl
#define debug if (1)
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T> using pque_max = priority_queue<T>;
template <class T> using pque_min = priority_queue<T, vector<T>, greater<T> >;
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
ostream& operator<<(ostream& os, T const& v) { bool f = true; for (auto const& x : v) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &v) { for (auto& x : v) is >> x; return is; }
template <class T, class S> ostream& operator<<(ostream& os, pair<T,S> const& p) { return os << "(" << p.first << ", " << p.second << ")"; }
template <class T, class S> istream& operator>>(istream& is, pair<T,S>& p) { return is >> p.first >> p.second; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class F> struct FixPoint : private F {
    constexpr FixPoint(F&& f) : F(forward<F>(f)) {}
    template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }
};
struct MakeFixPoint {
    template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); }
};
#define MFP MakeFixPoint()|
#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
    using type = vector<typename vec_impl<T,d-1>::type>;
    template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T,d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T,0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T,d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T,d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T, class U> constexpr bool chmin(T& x, U const& y) { if (x > y) { x = y; return true; } return false; }
template <class T, class U> constexpr bool chmax(T& x, U const& y) { if (x < y) { x = y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) { return accumulate(b,e,typename iterator_traits<It>::value_type{}); }
template <class T> int sz(T const& x) { return x.size(); }
template <class C, class T> int lbd(C const& v, T const& x) {
    return lower_bound(v.begin(), v.end(), x)-v.begin();
}
template <class C, class T> int ubd(C const& v, T const& x) {
    return upper_bound(v.begin(), v.end(), x)-v.begin();
}
template <class C, class F> int ppt(C const& v, F f) {
    return partition_point(v.begin(), v.end(), f)-v.begin();
}
// <<<
// >>> scc

constexpr int dst(int v) { return v; }
template <class E, class = decltype(E().to)>
constexpr int dst(E const& e) { return e.to; }

template <class E> struct SCC {
    vector<vector<E> > const& g;
    vector<int32_t> ord, low, st;
    int32_t time = 0, pos = 0, sz = 0;
    SCC(vector<vector<E> > const& g) : g(g), ord(g.size()), low(g.size()), st(g.size()) {
        rep (v,g.size()) if (ord[v] == 0) dfs(v);
        for (auto &x : ord) x += sz;
    }
    void dfs(int v) {
        low[v] = ord[v] = ++time; st[pos++] = v;
        for (auto const& e : g[v]) {
            if (ord[dst(e)] == 0) {
                dfs(dst(e));
                chmin(low[v], low[dst(e)]);
            } else if (ord[dst(e)] > 0) {
                chmin(low[v], ord[dst(e)]);
            }
        }
        if (low[v] == ord[v]) {
            sz++; do ord[st[--pos]] = -sz; while (st[pos] != v);
        }
    }

    // t-sorted id
    int id(int v) const { return ord[v]; }
    int size() const { return sz; }
    vector<vector<int>> groups() const {
        vector<vector<int> > grp(sz);
        rep (v,g.size()) grp[ord[v]].push_back(v);
        return grp;
    }

    // no multiple edges, no self-loops
    // no edge information
    vector<vector<int>> graph() const {
        vector<vector<int>> ret(size());
        rep (v,g.size()) {
            for (auto const& e : g[v]) {
                int x = id(v), y = id(dst(e));
                if (x != y) ret[x].push_back(y);
            }
        }
        for (auto &ls : ret) {
            sort(ls.begin(), ls.end());
            ls.erase(unique(ls.begin(), ls.end()), ls.end());
        }
        return ret;
    }
};
template <class E> auto get_scc(vector<vector<E> > const& g) { return SCC<E>(g); }

// <<<

int32_t main() {
    int n; cin >> n;
    vector<string> u(n); cin >> u;

    if (n > 52) quit("Impossible");

    vector<vector<int>> g(2*n);
    auto nt = [&](int x) {
        return x < n ? x+n : x-n;
    };
    auto add = [&](int x, int y) {
        g[nt(x)].eb(y);
        g[nt(y)].eb(x);
    };
    auto st = [&](int x) -> pair<string,string> {
        if (x < n) {
            return {u[x].substr(0,1), u[x].substr(1,2)};
        } else {
            return {u[x-n].substr(0,2), u[x-n].substr(2,1)};
        }
    };
    rep (x,2*n) rep (y,2*n) if (x < y) {
        auto [a,b] = st(x);
        auto [c,d] = st(y);
        if (a == c || a == d || b == c || b == d) {
            add(nt(x),nt(y));
        }
    }

    auto scc = get_scc(g);
    rep (x,n) if (scc.id(x) == scc.id(nt(x))) quit("Impossible");
    set<string> check;
    rep (x,n) {
        int y = (scc.id(x) > scc.id(nt(x)) ? x : nt(x));
        auto [s,t] = st(y);
        cout << s << " " << t << "\n";
        check.insert(s);
        check.insert(t);
    }
    assert(sz(check) == 2*n);


}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード