Submission #3722791
Source Code Expand
#include <bits/stdc++.h> using namespace std; using lint = long long int; using pint = pair<int, int>; using plint = pair<lint, lint>; struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_; #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> istream& operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; } template<typename T> ostream& operator<<(ostream &os, vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; } template<typename T> ostream& operator<<(ostream &os, set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; } template<typename T> ostream& operator<<(ostream &os, unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; } template<typename T> ostream& operator<<(ostream &os, multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; } template<typename T> ostream& operator<<(ostream &os, unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; } template<typename T1, typename T2> ostream& operator<<(ostream &os, pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; } template<typename TK, typename TV> ostream& operator<<(ostream &os, map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; } template<typename TK, typename TV> ostream& operator<<(ostream &os, unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; } template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); } template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); } #define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl; template<typename T> class Maxflow { struct edge { int to; T cap; int rev; }; std::vector<std::vector<edge> > edges; std::vector<int> level; std::vector<int> iter; std::vector<int> used; void bfs(int s) { level = std::vector<int>(edges.size(), -1); std::queue<int> q; level[s] = 0; q.push(s); while (!q.empty()) { int v = q.front(); q.pop(); for (edge &e : edges[v]) { if (e.cap > 0 && level[e.to] < 0) { level[e.to] = level[v] + 1; q.push(e.to); } } } } T dfs_d(int v, int goal, T f) { if (v == goal) return f; for (int &i = iter[v]; i < (int)edges[v].size(); i++) { edge &e = edges[v][i]; if (e.cap > 0 && level[v] < level[e.to]) { T d = dfs_d(e.to, goal, std::min(f, e.cap)); if (d > 0) { e.cap -= d; edges[e.to][e.rev].cap += d; return d; } } } return 0; } T dfs_ff(int v, int goal, T f) { if (v == goal) return f; used[v] = true; for (int i = 0; i < (int)edges[v].size(); i++) { edge &e = edges[v][i]; if (e.cap > 0 && !used[e.to]) { T d = dfs_ff(e.to, goal, std::min(f, e.cap)); if (d > 0) { e.cap -= d; edges[e.to][e.rev].cap += d; return d; } } } return 0; } public: Maxflow(int N) { edges.resize(N); } void add_edge(int from, int to, T capacity) { edges[from].push_back(edge{to, capacity, (int)edges[to].size()}); edges[to].push_back(edge{from, (T)0, (int)edges[from].size() - 1}); } T Dinic(int s, int t) { constexpr T INF = std::numeric_limits<T>::max(); T flow = 0; while (true) { bfs(s); if (level[t] < 0) return flow; iter = std::vector<int>(edges.size(), 0); T f; while ((f = dfs_d(s, t, INF)) > 0) flow += f; } } T FF(int s, int t) { constexpr T INF = std::numeric_limits<T>::max(); T flow = 0; while (true) { used = std::vector<int>(edges.size(), 0); T f = dfs_ff(s, t, INF); if (f == 0) return flow; flow += f; } } void back_flow(int s, int t, int s_e, int t_e, T capacity_reduce) { int i; for (i=0; edges[s_e][i].to != t_e; ) i++; edge &e = edges[s_e][i]; if (capacity_reduce <= e.cap) { e.cap -= capacity_reduce; } else { T flow = capacity_reduce - e.cap; e.cap = 0; edges[e.to][e.rev].cap -= flow; T f_sum = 0; while (f_sum != flow) { used = std::vector<int>(edges.size(), 0); f_sum += dfs_ff(t, t_e, flow - f_sum); } f_sum = 0; while (f_sum != flow) { used = std::vector<int>(edges.size(), 0); f_sum += dfs_ff(s_e, s, flow - f_sum); } } } }; int N; using tpl = tuple<int, int, int>; vector<int> fundos; int find_id(int w) { return distance(fundos.begin(), lower_bound(fundos.begin(), fundos.end(), w)) + 1; } int main() { cin >> N; vector<tpl> R(N); REP(i, N) { int X, Y, Z; cin >> X >> Y >> Z; FOR(i, 1, Z) fundos.push_back(X * Y * i); FOR(i, 1, Y) fundos.push_back(X * Z * i); FOR(i, 1, X) fundos.push_back(Y * Z * i); R[i] = make_tuple(X, Y, Z); } sort(fundos.begin(), fundos.end()); fundos.erase(unique(fundos.begin(), fundos.end()), fundos.end()); int v = fundos.size(); Maxflow<long long> a(2 + 2 * v); REP(i, v) a.add_edge(0, i + 1, 1); REP(i, v) a.add_edge(v + 1 + i, 2 * v + 1, 1); set<pint> es; REP(i, N) { int X, Y, Z; tie(X, Y, Z) = R[i]; FOR(i, 1, Z) es.insert(pint(find_id(X * Y * i), v + find_id(X * Y * (Z - i)))); FOR(i, 1, Y) es.insert(pint(find_id(X * Z * i), v + find_id(X * Z * (Y - i)))); FOR(i, 1, X) es.insert(pint(find_id(Z * Y * i), v + find_id(Z * Y * (X - i)))); } for (auto e : es) a.add_edge(e.first, e.second, 1); std::cout << 2 * v - a.Dinic(0, 2 * v + 1) << std::endl; }
Submission Info
Submission Time | |
---|---|
Task | D - 切り分けできるかな? |
User | hitonanode |
Language | C (GCC 5.4.1) |
Score | 0 |
Code Size | 7100 Byte |
Status | CE |
Compile Error
./Main.c:1:25: fatal error: bits/stdc++.h: No such file or directory #include <bits/stdc++.h> ^ compilation terminated.