#869787 (C++17) No.2160 みたりのDominator

提出ソース

結果

問題	No.2160 みたりのDominator
ユーザー	👑 Nachia
提出日時	2023-05-16 20:01:47
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	107 ms / 2,000 ms
コード長	13,492 bytes
コンパイル時間	1,402 ms
コンパイル使用メモリ	96,244 KB
実行使用メモリ	36,432 KB
最終ジャッジ日時	2024-05-08 13:52:54
合計ジャッジ時間	7,685 ms
ジャッジサーバーID （参考情報）	judge1 / judge2

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	44 ms 19,120 KB
testcase_02	AC	1 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	2 ms 5,376 KB
testcase_07	AC	2 ms 5,376 KB
testcase_08	AC	2 ms 5,376 KB
testcase_09	AC	2 ms 5,376 KB
testcase_10	AC	2 ms 5,376 KB
testcase_11	AC	1 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	1 ms 5,376 KB
testcase_20	AC	2 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
testcase_31	AC	2 ms 5,376 KB
testcase_32	AC	2 ms 5,376 KB
testcase_33	AC	2 ms 5,376 KB
testcase_34	AC	44 ms 19,248 KB
testcase_35	AC	2 ms 5,376 KB
testcase_36	AC	2 ms 5,376 KB
testcase_37	AC	2 ms 5,376 KB
testcase_38	AC	2 ms 5,376 KB
testcase_39	AC	2 ms 5,376 KB
testcase_40	AC	50 ms 18,348 KB
testcase_41	AC	47 ms 18,048 KB
testcase_42	AC	30 ms 11,992 KB
testcase_43	AC	39 ms 15,176 KB
testcase_44	AC	49 ms 18,020 KB
testcase_45	AC	48 ms 17,864 KB
testcase_46	AC	43 ms 16,956 KB
testcase_47	AC	23 ms 11,336 KB
testcase_48	AC	32 ms 14,376 KB
testcase_49	AC	39 ms 17,320 KB
testcase_50	AC	37 ms 17,656 KB
testcase_51	AC	31 ms 13,060 KB
testcase_52	AC	44 ms 17,328 KB
testcase_53	AC	48 ms 17,708 KB
testcase_54	AC	28 ms 11,692 KB
testcase_55	AC	83 ms 32,588 KB
testcase_56	AC	78 ms 30,836 KB
testcase_57	AC	80 ms 31,372 KB
testcase_58	AC	95 ms 35,276 KB
testcase_59	AC	84 ms 32,492 KB
testcase_60	AC	85 ms 35,936 KB
testcase_61	AC	88 ms 32,076 KB
testcase_62	AC	107 ms 36,432 KB
testcase_63	AC	96 ms 32,988 KB
testcase_64	AC	78 ms 32,336 KB
testcase_65	AC	47 ms 18,768 KB
testcase_66	AC	49 ms 19,660 KB
testcase_67	AC	51 ms 20,172 KB
testcase_68	AC	96 ms 33,228 KB
testcase_69	AC	69 ms 25,544 KB
testcase_70	AC	97 ms 33,364 KB
testcase_71	AC	39 ms 15,992 KB
testcase_72	AC	76 ms 26,092 KB
testcase_73	AC	92 ms 32,804 KB
testcase_74	AC	88 ms 31,440 KB
testcase_75	AC	22 ms 11,472 KB
testcase_76	AC	18 ms 9,672 KB
testcase_77	AC	60 ms 22,776 KB
testcase_78	AC	70 ms 25,416 KB
testcase_79	AC	13 ms 7,552 KB
testcase_80	AC	15 ms 8,592 KB
testcase_81	AC	28 ms 13,204 KB
testcase_82	AC	30 ms 15,048 KB
testcase_83	AC	31 ms 15,192 KB
61_evil_bias_nocross_01.txt	AC	53 ms 18,336 KB
61_evil_bias_nocross_02.txt	AC	50 ms 18,116 KB
61_evil_bias_nocross_03.txt	AC	30 ms 11,992 KB
61_evil_bias_nocross_04.txt	AC	39 ms 15,236 KB
61_evil_bias_nocross_05.txt	AC	50 ms 17,896 KB
61_evil_bias_nocross_06.txt	AC	52 ms 18,416 KB
61_evil_bias_nocross_07.txt	AC	33 ms 13,068 KB
61_evil_bias_nocross_08.txt	AC	46 ms 17,324 KB
61_evil_bias_nocross_09.txt	AC	54 ms 17,836 KB
61_evil_bias_nocross_10.txt	AC	30 ms 11,696 KB
61_evil_bias_nocross_11.txt	AC	40 ms 14,944 KB
61_evil_bias_nocross_12.txt	AC	46 ms 16,604 KB

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

ソースコード

raw source code

#line 2 "D:\\Programming\\VSCode\\competitive-cpp\\nachia\\graph\\graph.hpp"
#include <vector>
#include <utility>
#include <cassert>
#line 4 "D:\\Programming\\VSCode\\competitive-cpp\\nachia\\array\\csr-array.hpp"
#include <algorithm>

namespace nachia{

template<class Elem>
class CsrArray{
public:
    struct ListRange{
        using iterator = typename std::vector<Elem>::iterator;
        iterator begi, endi;
        iterator begin() const { return begi; }
        iterator end() const { return endi; }
        int size() const { return (int)std::distance(begi, endi); }
        Elem& operator[](int i) const { return begi[i]; }
    };
    struct ConstListRange{
        using iterator = typename std::vector<Elem>::const_iterator;
        iterator begi, endi;
        iterator begin() const { return begi; }
        iterator end() const { return endi; }
        int size() const { return (int)std::distance(begi, endi); }
        const Elem& operator[](int i) const { return begi[i]; }
    };
private:
    int m_n;
    std::vector<Elem> m_list;
    std::vector<int> m_pos;
public:
    CsrArray() : m_n(0), m_list(), m_pos() {}
    static CsrArray Construct(int n, std::vector<std::pair<int, Elem>> items){
        CsrArray res;
        res.m_n = n;
        std::vector<int> buf(n+1, 0);
        for(auto& [u,v] : items){ ++buf[u]; }
        for(int i=1; i<=n; i++) buf[i] += buf[i-1];
        res.m_list.resize(buf[n]);
        for(int i=(int)items.size()-1; i>=0; i--){
            res.m_list[--buf[items[i].first]] = std::move(items[i].second);
        }
        res.m_pos = std::move(buf);
        return res;
    }
    static CsrArray FromRaw(std::vector<Elem> list, std::vector<int> pos){
        CsrArray res;
        res.m_n = pos.size() - 1;
        res.m_list = std::move(list);
        res.m_pos = std::move(pos);
        return res;
    }
    ListRange operator[](int u) { return ListRange{ m_list.begin() + m_pos[u], m_list.begin() + m_pos[u+1] }; }
    ConstListRange operator[](int u) const { return ConstListRange{ m_list.begin() + m_pos[u], m_list.begin() + m_pos[u+1] }; }
    int size() const { return m_n; }
    int fullSize() const { return (int)m_list.size(); }
};

} // namespace nachia
#line 6 "D:\\Programming\\VSCode\\competitive-cpp\\nachia\\graph\\graph.hpp"

namespace nachia{


struct Graph {
public:
    struct Edge{
        int from, to;
        void reverse(){ std::swap(from, to); }
    };
    using Base = std::vector<std::pair<int, int>>;
    Graph(int n = 0, bool undirected = false, int m = 0) : m_n(n), m_e(m), m_isUndir(undirected) {}
    Graph(int n, const std::vector<std::pair<int, int>>& edges, bool undirected = false) : m_n(n), m_isUndir(undirected){
        m_e.resize(edges.size());
        for(std::size_t i=0; i<edges.size(); i++) m_e[i] = { edges[i].first, edges[i].second };
    }
    template<class Cin>
    static Graph Input(Cin& cin, int n, bool undirected, int m, bool offset = 0){
        Graph res(n, undirected, m);
        for(int i=0; i<m; i++){
            int u, v; cin >> u >> v;
            res[i].from = u - offset;
            res[i].to = v - offset;
        }
        return res;
    }
    int numVertices() const noexcept { return m_n; }
    int numEdges() const noexcept { return int(m_e.size()); }
    int addNode() noexcept { return m_n++; }
    int addEdge(int from, int to){ m_e.push_back({ from, to }); return numEdges() - 1; }
    Edge& operator[](int ei) noexcept { return m_e[ei]; }
    const Edge& operator[](int ei) const noexcept { return m_e[ei]; }
    Edge& at(int ei) { return m_e.at(ei); }
    const Edge& at(int ei) const { return m_e.at(ei); }
    auto begin(){ return m_e.begin(); }
    auto end(){ return m_e.end(); }
    auto begin() const { return m_e.begin(); }
    auto end() const { return m_e.end(); }
    bool isUndirected() const noexcept { return m_isUndir; }
    void reverseEdges() noexcept { for(auto& e : m_e) e.reverse(); }
    void contract(int newV, const std::vector<int>& mapping){
        assert(numVertices() == int(mapping.size()));
        for(int i=0; i<numVertices(); i++) assert(0 <= mapping[i] && mapping[i] < newV);
        for(auto& e : m_e){ e.from = mapping[e.from]; e.to = mapping[e.to]; }
        m_n = newV;
    }
    std::vector<Graph> induce(int num, const std::vector<int>& mapping) const {
        int n = numVertices();
        assert(n == int(mapping.size()));
        for(int i=0; i<n; i++) assert(-1 <= mapping[i] && mapping[i] < num);
        std::vector<int> indexV(n), newV(num);
        for(int i=0; i<n; i++) if(mapping[i] >= 0) indexV[i] = newV[mapping[i]]++;
        std::vector<Graph> res; res.reserve(num);
        for(int i=0; i<num; i++) res.emplace_back(newV[i], isUndirected());
        for(auto e : m_e) if(mapping[e.from] == mapping[e.to] && mapping[e.to] >= 0) res[mapping[e.to]].addEdge(indexV[e.from], indexV[e.to]);
        return res;
    }
    CsrArray<int> getEdgeIndexArray(bool undirected) const {
        std::vector<std::pair<int, int>> src;
        src.reserve(numEdges() * (undirected ? 2 : 1));
        for(int i=0; i<numEdges(); i++){
            auto e = operator[](i);
            src.emplace_back(e.from, i);
            if(undirected) src.emplace_back(e.to, i);
        }
        return CsrArray<int>::Construct(numVertices(), src);
    }
    CsrArray<int> getEdgeIndexArray() const { return getEdgeIndexArray(isUndirected()); }
    CsrArray<int> getAdjacencyArray(bool undirected) const {
        std::vector<std::pair<int, int>> src;
        src.reserve(numEdges() * (undirected ? 2 : 1));
        for(auto e : m_e){
            src.emplace_back(e.from, e.to);
            if(undirected) src.emplace_back(e.to, e.from);
        }
        return CsrArray<int>::Construct(numVertices(), src);
    }
    CsrArray<int> getAdjacencyArray() const { return getAdjacencyArray(isUndirected()); }
private:
    int m_n;
    std::vector<Edge> m_e;
    bool m_isUndir;
};

} // namespace nachia
#line 4 "D:\\Programming\\VSCode\\competitive-cpp\\nachia\\graph\\strongly-connected-components.hpp"

namespace nachia{

struct StronglyConnectedComponents{
private:
    int m_n;
    CsrArray<int> induce;
    int componentNum;
public:

    StronglyConnectedComponents() : m_n(0), induce(), componentNum(0) {}
    StronglyConnectedComponents(Graph E) {
        int n = E.numVertices();
        m_n = n;
        std::vector<int> O(n);
        {
            auto adj = E.getAdjacencyArray();
            int Oi = n;
            std::vector<int> P(n, -1), EI(n, 0);
            for(int s=0; s<n; s++) if(P[s] == -1){
                P[s] = -2;
                int p = s;
                while(p >= 0){
                    if(EI[p] == adj[p].size()){ O[--Oi] = p; p = P[p]; continue; }
                    int q = adj[p][EI[p]++];
                    if(P[q] == -1){ P[q] = p; p = q; }
                }
            }
        }
        E.reverseEdges();
        auto adj = E.getAdjacencyArray();
        std::vector<int> sep = {0}, csr(n), vis(n,0);
        int p1 = 0, p2 = 0;
        for(int s : O) if(!vis[s]){
            csr[p2++] = s; vis[s] = 1;
            for(; p1<p2; p1++){
                int v = csr[p1];
                for(auto e : adj[v]) if(!vis[e]){ vis[e] = 1; csr[p2++] = e; }
            }
            sep.push_back(p2);
        }
        induce = CsrArray<int>::FromRaw(std::move(csr), std::move(sep));
        componentNum = induce.size();
    }

    int numComponents() const noexcept { return componentNum; }
    const CsrArray<int>& getCsr() const noexcept { return induce; }
    std::vector<int> getMapping() const {
        std::vector<int> res(m_n);
        for(int i=0; i<numComponents(); i++) for(int v : induce[i]) res[v] = i;
        return res;
    }
};

} // namespace nachia
#line 2 "D:\\Programming\\VSCode\\competitive-cpp\\nachia\\misc\\nyaanio.hpp"
#include <cstring>
#include <type_traits>
#line 5 "D:\\Programming\\VSCode\\competitive-cpp\\nachia\\misc\\nyaanio.hpp"
#include <cstdio>
#include <string>
#include <cstdint>

namespace fastio {
static constexpr int SZ = 1 << 17;
char inbuf[SZ], outbuf[SZ];
int in_left = 0, in_right = 0, out_right = 0;

struct Pre {
    char num[40000];
    constexpr Pre() : num() {
        for (int i = 0; i < 10000; i++) {
        int n = i;
            for (int j = 3; j >= 0; j--) {
                num[i * 4 + j] = n % 10 + '0';
                n /= 10;
            }
        }
    }
} constexpr pre;

inline void load() {
    int len = in_right - in_left;
    memmove(inbuf, inbuf + in_left, len);
    in_right = len + fread(inbuf + len, 1, SZ - len, stdin);
    in_left = 0;
    if(in_right != SZ) inbuf[in_right] = '\000';
}

inline void flush() {
    fwrite(outbuf, 1, out_right, stdout);
    out_right = 0;
}

inline void skip_space() {
    if (in_left + 32 > in_right) load();
    while (inbuf[in_left] <= ' ') in_left++;
}

inline void rd(char& c) {
    if (in_left + 32 > in_right) load();
    c = inbuf[in_left++];
}
template <typename T>
inline void rd(T& x) {
    if (in_left + (int)sizeof(T) * 8 > in_right) load();
    char c;
    do c = inbuf[in_left++];
    while (c < '-');
    [[maybe_unused]] bool minus = false;
    if constexpr (std::is_signed<T>::value == true) {
        if (c == '-') minus = true, c = inbuf[in_left++];
    }
    x = 0;
    while (c >= '0') {
        x = x * 10 + (c & 15);
        c = inbuf[in_left++];
    }
    if constexpr (std::is_signed<T>::value == true) {
        if (minus) x = -x;
    }
}

inline void wt(char c) {
    if (out_right > SZ - 32) flush();
    outbuf[out_right++] = c;
}
inline void wt(bool b) {
    if (out_right > SZ - 32) flush();
    outbuf[out_right++] = b ? '1' : '0';
}
inline void wt(const std::string &s) {
    if (out_right + s.size() > SZ - 32) flush();
    if (s.size() > SZ - 32){ fwrite(s.c_str(), 1, s.size(), stdout); return; }
    memcpy(outbuf + out_right, s.data(), sizeof(char) * s.size());
    out_right += s.size();
}
inline void wt(const char* s) {
    wt(std::string(s));
}
template <typename T>
inline void wt(T x) {
    if (out_right > SZ - (int)sizeof(T) * 8) flush();
    if (!x) {
        outbuf[out_right++] = '0';
        return;
    }
    if constexpr (std::is_signed<T>::value == true) {
        if (x < 0) outbuf[out_right++] = '-', x = -x;
    }
    constexpr int SZT = sizeof(T) * 8;
    int i = SZT - 4;
    char buf[SZT];
    while (x >= 10000) {
        memcpy(buf + i, pre.num + (x % 10000) * 4, 4);
        x /= 10000;
        i -= 4;
    }
    if (x < 100) {
        if (x < 10) {
            outbuf[out_right] = '0' + x;
            ++out_right;
        } else {
            uint32_t q = (uint32_t(x) * 205) >> 11;
            uint32_t r = uint32_t(x) - q * 10;
            outbuf[out_right] = '0' + q;
            outbuf[out_right + 1] = '0' + r;
            out_right += 2;
        }
    } else {
        if (x < 1000) {
            memcpy(outbuf + out_right, pre.num + (x << 2) + 1, 3);
            out_right += 3;
        } else {
            memcpy(outbuf + out_right, pre.num + (x << 2), 4);
            out_right += 4;
        }
    }
    memcpy(outbuf + out_right, buf + i + 4, SZT - 4 - i);
    out_right += SZT - 4 - i;
}

} // namespace fastio

namespace nachia{

struct CInStream{} cin;
template <typename T>
inline CInStream& operator>>(CInStream& c, T& dest){ fastio::rd(dest); return c; }
struct COutStream{
	~COutStream(){ atexit(fastio::flush); }
} cout;
template <typename T>
inline COutStream& operator<<(COutStream& c, const T& src){ fastio::wt(src); return c; }

} // namespace nachia
#line 3 "..\\Main.cpp"

int main(){
    using nachia::cin;
    using nachia::cout;

    int N1, N2, N3, M; cin >> N1 >> N2 >> N3 >> M;
    int s = N1+N2+N3, t = N1+N2+N3+1, N = N1+N2+N3+2;
    nachia::Graph graph(N, false);

    if(N1 != 0){
        graph.addEdge(s, 0);
        for(int i=0; i<N1-1; i++) graph.addEdge(i,i+1);
        graph.addEdge(N1-1, t);
    } else {
        graph.addEdge(s, t);
    }
    
    if(N2 != 0){
        graph.addEdge(s, N1);
        for(int i=N1; i<N1+N2-1; i++) graph.addEdge(i,i+1);
        graph.addEdge(N1+N2-1, t);
    } else {
        graph.addEdge(s, t);
    }
    
    if(N3 != 0){
        graph.addEdge(s, N1+N2);
        for(int i=N1+N2; i<N1+N2+N3-1; i++) graph.addEdge(i,i+1);
        graph.addEdge(N1+N2+N3-1, t);
    } else {
        graph.addEdge(s, t);
    }

    for(int i=0; i<M; i++){
        int u, v; cin >> u >> v; u--; v--;
        graph.addEdge(u, v);
        graph.addEdge(v, u);
    }

    auto scc = nachia::StronglyConnectedComponents(graph).getCsr();
    std::vector<int> sccid(N);
    for(int i=0; i<scc.size(); i++) for(int j : scc[i]) sccid[j] = i;

    N = scc.size();
    s = sccid[s];
    t = sccid[t];
    if(s == t){ cout << "0\n"; return 0; }
    nachia::Graph graph2(N, false);
    for(auto e : graph) if(sccid[e.from] != sccid[e.to]) graph2.addEdge(sccid[e.from], sccid[e.to]);

    std::vector<int> SkipV(N, -1);
    auto adj_graph2d = graph2.getAdjacencyArray(false);
    int N4 = 0;
    for(int i=0; i<N; i++) if(adj_graph2d[i].size() != 1) SkipV[i] = N4++;

    std::vector<long long> partAns(N4-1, 1);
    for(int v=0; v<N; v++) if(SkipV[v] != -1) for(int w : adj_graph2d[v]){
        int weight = 1;
        while(SkipV[w] == -1){ w = adj_graph2d[w][0]; weight++; }
        int vp = SkipV[v], wp = SkipV[w];
        for(int i=vp; i<wp; i++) partAns[i] *= weight;
    }

    long long ans = 0;
    for(auto w : partAns) ans += w;
    cout << ans << '\n';

    return 0;
}

yukicoder

結果

テストケース

ソースコード