結果
| 問題 |
No.2160 みたりのDominator
|
| コンテスト | |
| ユーザー |
 Nachia
|
| 提出日時 | 2022-11-29 23:53:10 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 128 ms / 2,000 ms |
| コード長 | 9,368 bytes |
| コンパイル時間 | 1,275 ms |
| コンパイル使用メモリ | 94,960 KB |
| 最終ジャッジ日時 | 2025-02-09 02:31:01 |
|
ジャッジサーバーID （参考情報） |
judge3 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 93 |
ソースコード
#line 1 "Main.cpp"
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#line 4 "nachia\\graph\\graph.hpp"
#include <cassert>
#line 5 "nachia\\array\\csr-array.hpp"
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, const 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]] = 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 "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) : m_n(n), m_e(), 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 };
}
Graph(int n, const std::vector<Edge>& edges, bool undirected = false) : m_n(n), m_e(edges), m_isUndir(undirected) {}
Graph(int n, std::vector<Edge>&& edges, bool undirected = false) : m_n(n), m_e(edges), m_isUndir(undirected) {}
int numVertices() const noexcept { return m_n; }
int numEdges() const noexcept { return int(m_e.size()); }
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]; }
}
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 "nachia\\graph\\strongly-connected-components.hpp"
namespace nachia{
struct SCC{
int m_n;
CsrArray<int> induce;
int componentNum;
SCC() : m_n(0), induce(), componentNum(0) {}
SCC(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 numComponent() const { return componentNum; }
const CsrArray<int>& getCsr() const { return induce; }
};
} // namespace nachia
#line 7 "Main.cpp"
using namespace std;
using i64 = long long;
#define rep(i,n) for(int i=0; i<(int)(n); i++)
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
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);
}
rep(i,M){
int u, v; cin >> u >> v; u--; v--;
graph.addEdge(u, v);
graph.addEdge(v, u);
}
auto scc = nachia::SCC(graph).getCsr();
vector<int> sccid(N);
rep(i,scc.size()) 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]);
vector<int> SkipV(N, 0);
auto adj_graph2u = graph2.getAdjacencyArray(true);
rep(i,N) if(adj_graph2u[i].size() == 2) SkipV[i] = -1;
int N4 = 0;
for(int& i : SkipV) if(i != -1) i = N4++;
nachia::Graph graph3(N4, false);
std::vector<i64> W;
auto adj_graph2d = graph2.getAdjacencyArray(false);
rep(v, N) if(SkipV[v] != -1) for(int w : adj_graph2d[v]){
int weight = 1;
while(SkipV[w] == -1){ w = adj_graph2d[w][0]; weight++; }
graph3.addEdge(SkipV[v], SkipV[w]);
W.push_back(weight);
}
std::vector<i64> partAns(N4-1, 1);
rep(e,graph3.numEdges()) for(int i=graph3[e].from; i<graph3[e].to; i++) partAns[i] *= W[e];
i64 ans = 0;
for(auto w : partAns) ans += w;
cout << ans << '\n';
return 0;
}