結果
問題 | No.1565 Union |
ユーザー |
![]() |
提出日時 | 2023-08-10 22:04:41 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 102 ms / 2,000 ms |
コード長 | 10,680 bytes |
コンパイル時間 | 2,181 ms |
コンパイル使用メモリ | 209,476 KB |
最終ジャッジ日時 | 2025-02-16 00:37:44 |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 27 |
ソースコード
#pragma region satashun// #pragma GCC optimize("Ofast")// #pragma GCC optimize("unroll-loops")#include <bits/stdc++.h>using namespace std;using uint = unsigned int;using ll = long long;using ull = unsigned long long;using pii = pair<int, int>;template <class T>using V = vector<T>;template <class T>using VV = V<V<T>>;template <class T>V<T> make_vec(size_t a) {return V<T>(a);}template <class T, class... Ts>auto make_vec(size_t a, Ts... ts) {return V<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));}template <typename T, typename V>void fill_vec(T& v, const V& val) {v = val;}template <typename T, typename V>void fill_vec(vector<T>& vec, const V& val) {for (auto& v : vec) fill_vec(v, val);}#define pb push_back#define eb emplace_back#define mp make_pair#define fi first#define se second#define rep(i, n) rep2(i, 0, n)#define rep2(i, m, n) for (int i = m; i < (n); i++)#define per(i, b) per2(i, 0, b)#define per2(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)#define ALL(c) (c).begin(), (c).end()#define SZ(x) ((int)(x).size())constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }template <class T, class U>void chmin(T& t, const U& u) {if (t > u) t = u;}template <class T, class U>void chmax(T& t, const U& u) {if (t < u) t = u;}template <typename T>int arglb(const V<T>& v, const T& x) {return distance(v.begin(), lower_bound(ALL(v), x));}template <typename T>int argub(const V<T>& v, const T& x) {return distance(v.begin(), upper_bound(ALL(v), x));}template <class T>void mkuni(vector<T>& v) {sort(ALL(v));v.erase(unique(ALL(v)), end(v));}template <class T>vector<int> sort_by(const vector<T>& v, bool increasing = true) {vector<int> res(v.size());iota(res.begin(), res.end(), 0);if (increasing) {stable_sort(res.begin(), res.end(),[&](int i, int j) { return v[i] < v[j]; });} else {stable_sort(res.begin(), res.end(),[&](int i, int j) { return v[i] > v[j]; });}return res;}// prototypetemplate <class T, class U>ostream& operator<<(ostream& os, const pair<T, U>& p);template <class T>ostream& operator<<(ostream& os, const vector<T>& v);template <class T>istream& operator>>(istream& is, vector<T>& v);template <class T, size_t sz>ostream& operator<<(ostream& os, const array<T, sz>& arr);template <class T>ostream& operator<<(ostream& os, const set<T>& ST);template <class T>ostream& operator<<(ostream& os, const multiset<T>& ST);template <class T, class U>ostream& operator<<(ostream& os, const map<T, U>& MP);ostream& operator<<(ostream& o, __int128_t x);// io functionstemplate <class T, class U>istream& operator>>(istream& is, pair<T, U>& p) {is >> p.first >> p.second;return is;}template <class T, class U>ostream& operator<<(ostream& os, const pair<T, U>& p) {os << "(" << p.first << "," << p.second << ")";return os;}template <class T>istream& operator>>(istream& is, vector<T>& v) {for (auto& x : v) {is >> x;}return is;}template <class T>ostream& operator<<(ostream& os, const vector<T>& v) {os << "{";rep(i, v.size()) {if (i) os << ",";os << v[i];}os << "}";return os;}template <class T, size_t sz>ostream& operator<<(ostream& os, const array<T, sz>& arr) {os << '[';for (auto v : arr) os << v << ',';os << ']';return os;}template <class T>ostream& operator<<(ostream& os, const set<T>& ST) {os << "{";for (auto it = ST.begin(); it != ST.end(); ++it) {if (it != ST.begin()) os << ",";os << *it;}os << "}";return os;}template <class T>ostream& operator<<(ostream& os, const multiset<T>& ST) {os << "{";for (auto it = ST.begin(); it != ST.end(); ++it) {if (it != ST.begin()) os << ",";os << *it;}os << "}";return os;}template <class T, class U>ostream& operator<<(ostream& os, const map<T, U>& MP) {for (auto it = MP.begin(); it != MP.end(); ++it) {os << "(" << it->first << ": " << it->second << ")";}return os;}string to_string(__int128_t x) {if (x == 0) return "0";string result;if (x < 0) {result += "-";x *= -1;}string t;while (x) {t.push_back('0' + x % 10);x /= 10;}reverse(t.begin(), t.end());return result + t;}ostream& operator<<(ostream& o, __int128_t x) { return o << to_string(x); }#ifdef LOCALvoid debug_out() { cerr << endl; }template <typename Head, typename... Tail>void debug_out(Head H, Tail... T) {cerr << " " << H;debug_out(T...);}#define debug(...) \cerr << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl#else#define debug(...) (void(0))#define dump(x) (void(0))#endiftemplate <class T>V<T>& operator+=(V<T>& vec, const T& v) {for (auto& x : vec) x += v;return vec;}template <class T>V<T>& operator-=(V<T>& vec, const T& v) {for (auto& x : vec) x -= v;return vec;}// suc : 1 = newline, 2 = spacetemplate <class T>void print(T x, int suc = 1) {cout << x;if (suc == 1)cout << "\n";else if (suc == 2)cout << " ";}template <class T>void print(const vector<T>& v, int suc = 1) {for (int i = 0; i < v.size(); ++i)print(v[i], i == int(v.size()) - 1 ? suc : 2);}template <class T>void show(T x) {print(x, 1);}template <typename Head, typename... Tail>void show(Head H, Tail... T) {print(H, 2);show(T...);}int topbit(int t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }int topbit(ll t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }int botbit(int a) { return a == 0 ? 32 : __builtin_ctz(a); }int botbit(ll a) { return a == 0 ? 64 : __builtin_ctzll(a); }int popcount(int t) { return __builtin_popcount(t); }int popcount(ll t) { return __builtin_popcountll(t); }int bit_parity(int t) { return __builtin_parity(t); }int bit_parity(ll t) { return __builtin_parityll(t); }struct prepare_io {prepare_io() {cin.tie(nullptr);ios::sync_with_stdio(false);cout << fixed << setprecision(10);}} prep_io;#pragma endregion satashuntemplate <class T>class Edge {public:int from, to, idx;T cost;Edge() = default;Edge(int from, int to, T cost = T(1), int idx = -1): from(from), to(to), cost(cost), idx(idx) {}operator int() const { return to; }bool operator<(const Edge& e) const { return cost < e.cost; }};template <class T>class Graph {public:using E = Edge<T>;vector<vector<E>> g;vector<E> edges;int es;Graph() {}Graph(int n) : g(n), edges(0), es(0){};int size() const { return g.size(); }virtual void add_directed_edge(int from, int to, T cost = 1) {g[from].emplace_back(from, to, cost, es++);}virtual void add_edge(int from, int to, T cost = 1) {g[from].emplace_back(from, to, cost, es);g[to].emplace_back(to, from, cost, es++);}inline vector<E>& operator[](const int& k) { return g[k]; }inline const vector<E>& operator[](const int& k) const { return g[k]; }void read(int M, int offset = -1, bool directed = false,bool weighted = false) {for (int i = 0; i < M; i++) {int a, b;cin >> a >> b;a += offset;b += offset;T c = T(1);if (weighted) cin >> c;edges.emplace_back(a, b, c, i);if (directed)add_directed_edge(a, b, c);elseadd_edge(a, b, c);}}};// ABC264Gtemplate <class T>V<T> bellman_ford(const Graph<T>& g, int s = 0) {const auto INF = numeric_limits<T>::max();int n = g.size();V<T> ds(n, INF);ds[s] = 0;rep(i, n) {rep(v, n) {for (auto& e : g[v]) {if (ds[e.from] == INF) continue;chmin(ds[e.to], ds[e.from] + e.cost);}}}rep(v, n) {for (auto& e : g[v]) {if (ds[e.from] == INF) continue;if (ds[e.from] + e.cost < ds[e.to]) return V<T>();}}return ds;}// cost = 1 or treetemplate <class T>V<T> bfs(const Graph<T>& g, int s = 0) {const T inf = numeric_limits<T>::max() / 2;int n = g.size();V<T> ds(n, inf);queue<int> que;que.push(s);ds[s] = 0;while (!que.empty()) {auto v = que.front();que.pop();for (auto e : g[v]) {T nx = ds[v] + e.cost;if (ds[e.to] > nx) {ds[e.to] = nx;que.push(e.to);}}}for (auto& x : ds)if (x == inf) x = -1;return ds;}// must be optimizedtemplate <class T>V<T> bfs01(const Graph<T>& g, int s = 0) {const T inf = numeric_limits<T>::max() / 2;int n = g.size();V<T> ds(n, inf);using P = pair<T, int>;deque<int> que;que.push_back(s);ds[s] = 0;while (!que.empty()) {auto v = que.front();que.pop_front();for (auto e : g[v]) {T nx = ds[v] + e.cost;if (ds[e.to] > nx) {ds[e.to] = nx;if (e.cost == 0) {que.push_front(e.to);} else {que.push_back(e.to);}}}}for (auto& x : ds)if (x == inf) x = -1;return ds;}template <class T>V<T> dijkstra(const Graph<T>& g, int s = 0) {const T inf = numeric_limits<T>::max() / 2;int n = g.size();V<T> ds(n, inf);using P = pair<T, int>;priority_queue<P, V<P>, greater<P>> que;que.emplace(0, s);ds[s] = 0;while (!que.empty()) {auto p = que.top();que.pop();int v = p.se;if (ds[v] < p.fi) continue;for (auto e : g[v]) {T nx = ds[v] + e.cost;if (ds[e.to] > nx) {ds[e.to] = nx;que.emplace(nx, e.to);}}}for (auto& x : ds)if (x == inf) x = -1;return ds;}void slv() {// inputint N, M;cin >> N >> M;Graph<int> g(N);g.read(M);// solveauto ds = bfs(g, 0);show(ds[N - 1]);}int main() {int cases = 1;// cin >> cases;rep(i, cases) slv();return 0;}