#566103 (C++17) No.1254 補強への架け橋

提出ソース

結果

問題	No.1254 補強への架け橋
ユーザー	nok0
提出日時	2020-10-12 14:50:10
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	204 ms / 2,000 ms
コード長	11,000 bytes
コンパイル時間	2,680 ms
コンパイル使用メモリ	232,688 KB
実行使用メモリ	31,104 KB
最終ジャッジ日時	2024-07-20 17:58:29
合計ジャッジ時間	16,829 ms
ジャッジサーバーID （参考情報）	judge4 / judge1

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	2 ms 5,248 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	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	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	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	3 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	3 ms 5,376 KB
testcase_30	AC	2 ms 5,376 KB
testcase_31	AC	3 ms 5,376 KB
testcase_32	AC	2 ms 5,376 KB
testcase_33	AC	2 ms 5,376 KB
testcase_34	AC	2 ms 5,376 KB
testcase_35	AC	3 ms 5,376 KB
testcase_36	AC	3 ms 5,376 KB
testcase_37	AC	2 ms 5,376 KB
testcase_38	AC	2 ms 5,376 KB
testcase_39	AC	3 ms 5,376 KB
testcase_40	AC	2 ms 5,376 KB
testcase_41	AC	2 ms 5,376 KB
testcase_42	AC	2 ms 5,376 KB
testcase_43	AC	3 ms 5,376 KB
testcase_44	AC	2 ms 5,376 KB
testcase_45	AC	2 ms 5,376 KB
testcase_46	AC	3 ms 5,376 KB
testcase_47	AC	2 ms 5,376 KB
testcase_48	AC	3 ms 5,376 KB
testcase_49	AC	3 ms 5,376 KB
testcase_50	AC	3 ms 5,376 KB
testcase_51	AC	2 ms 5,376 KB
testcase_52	AC	3 ms 5,376 KB
testcase_53	AC	3 ms 5,376 KB
testcase_54	AC	3 ms 5,376 KB
testcase_55	AC	3 ms 5,376 KB
testcase_56	AC	2 ms 5,376 KB
testcase_57	AC	2 ms 5,376 KB
testcase_58	AC	2 ms 5,376 KB
testcase_59	AC	2 ms 5,376 KB
testcase_60	AC	2 ms 5,376 KB
testcase_61	AC	3 ms 5,376 KB
testcase_62	AC	2 ms 5,376 KB
testcase_63	AC	11 ms 5,376 KB
testcase_64	AC	5 ms 5,376 KB
testcase_65	AC	7 ms 5,376 KB
testcase_66	AC	6 ms 5,376 KB
testcase_67	AC	4 ms 5,376 KB
testcase_68	AC	7 ms 5,376 KB
testcase_69	AC	9 ms 5,376 KB
testcase_70	AC	4 ms 5,376 KB
testcase_71	AC	4 ms 5,376 KB
testcase_72	AC	9 ms 5,376 KB
testcase_73	AC	4 ms 5,376 KB
testcase_74	AC	9 ms 5,376 KB
testcase_75	AC	7 ms 5,376 KB
testcase_76	AC	3 ms 5,376 KB
testcase_77	AC	5 ms 5,376 KB
testcase_78	AC	10 ms 5,376 KB
testcase_79	AC	12 ms 5,376 KB
testcase_80	AC	10 ms 5,376 KB
testcase_81	AC	11 ms 5,376 KB
testcase_82	AC	10 ms 5,376 KB
testcase_83	AC	204 ms 19,432 KB
testcase_84	AC	192 ms 18,896 KB
testcase_85	AC	98 ms 13,072 KB
testcase_86	AC	156 ms 17,056 KB
testcase_87	AC	176 ms 18,292 KB
testcase_88	AC	17 ms 5,760 KB
testcase_89	AC	191 ms 19,360 KB
testcase_90	AC	99 ms 13,604 KB
testcase_91	AC	69 ms 11,524 KB
testcase_92	AC	32 ms 7,680 KB
testcase_93	AC	141 ms 16,180 KB
testcase_94	AC	126 ms 15,196 KB
testcase_95	AC	131 ms 15,080 KB
testcase_96	AC	171 ms 18,616 KB
testcase_97	AC	58 ms 10,308 KB
testcase_98	AC	177 ms 18,752 KB
testcase_99	AC	86 ms 12,724 KB
testcase_100	AC	188 ms 19,836 KB
testcase_101	AC	27 ms 7,168 KB
testcase_102	AC	14 ms 5,504 KB
testcase_103	AC	31 ms 7,804 KB
testcase_104	AC	46 ms 9,344 KB
testcase_105	AC	144 ms 16,444 KB
testcase_106	AC	63 ms 11,024 KB
testcase_107	AC	185 ms 19,324 KB
testcase_108	AC	177 ms 19,008 KB
testcase_109	AC	131 ms 16,004 KB
testcase_110	AC	116 ms 14,984 KB
testcase_111	AC	126 ms 15,580 KB
testcase_112	AC	42 ms 8,960 KB
testcase_113	AC	106 ms 14,560 KB
testcase_114	AC	61 ms 10,820 KB
testcase_115	AC	18 ms 5,888 KB
testcase_116	AC	76 ms 11,908 KB
testcase_117	AC	40 ms 9,044 KB
testcase_118	AC	164 ms 18,516 KB
testcase_119	AC	82 ms 12,540 KB
testcase_120	AC	160 ms 17,952 KB
testcase_121	AC	37 ms 7,936 KB
testcase_122	AC	73 ms 11,680 KB
testcase_123	AC	2 ms 5,376 KB
testcase_124	AC	182 ms 31,104 KB
testcase_125	AC	182 ms 31,104 KB

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

ソースコード

raw source code

/**
 *	author: nok0
 *	created: 2020.10.12 10:46:08
**/
#ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
#pragma region Macros
#define FOR(i, l, r) for(int i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define REPS(i, n) FOR(i, 1, n + 1)
#define RFOR(i, l, r) for(int i = (l); i >= (r); --i)
#define RREP(i, n) RFOR(i, n - 1, 0)
#define RREPS(i, n) RFOR(i, n, 1)
#define pb push_back
#define eb emplace_back
#define SZ(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
template <class T = int>
using V = vector<T>;
template <class T = int>
using VV = V<V<T>>;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define VEC(type, name, size) \
	V<type> name(size);       \
	IN(name)
#define VVEC(type, name, h, w)    \
	VV<type> name(h, V<type>(w)); \
	IN(name)
#define INT(...)     \
	int __VA_ARGS__; \
	IN(__VA_ARGS__)
#define LL(...)     \
	ll __VA_ARGS__; \
	IN(__VA_ARGS__)
#define STR(...)        \
	string __VA_ARGS__; \
	IN(__VA_ARGS__)
#define CHAR(...)     \
	char __VA_ARGS__; \
	IN(__VA_ARGS__)
#define DOUBLE(...)     \
	DOUBLE __VA_ARGS__; \
	IN(__VA_ARGS__)
#define LD(...)     \
	LD __VA_ARGS__; \
	IN(__VA_ARGS__)
void scan(int &a) { cin >> a; }
void scan(long long &a) { cin >> a; }
void scan(char &a) { cin >> a; }
void scan(double &a) { cin >> a; }
void scan(long double &a) { cin >> a; }
void scan(char a[]) { scanf("%s", a); }
void scan(string &a) { cin >> a; }
template <class T>
void scan(V<T> &);
template <class T, class L>
void scan(pair<T, L> &);
template <class T>
void scan(V<T> &a) {
	for(auto &i : a) scan(i);
}
template <class T, class L>
void scan(pair<T, L> &p) {
	scan(p.first);
	scan(p.second);
}
template <class T>
void scan(T &a) { cin >> a; }
void IN() {}
template <class Head, class... Tail>
void IN(Head &head, Tail &... tail) {
	scan(head);
	IN(tail...);
}
template <class T>
inline void print(T x) { cout << x << '\n'; }
template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
	is >> p.first >> p.second;
	return is;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
	os << p.first << " " << p.second;
	return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
	for(T &in : v) is >> in;
	return is;
}
template <class T>
ostream &operator<<(ostream &os, const V<T> &v) {
	REP(i, SZ(v)) {
		if(i) os << " ";
		os << v[i];
	}
	return os;
}
//debug
template <typename T>
void view(const V<T> &v) {
	cerr << "{ ";
	for(const auto &e : v) {
		cerr << e << ", ";
	}
	cerr << "\b\b }";
}
template <typename T>
void view(const VV<T> &vv) {
	cerr << "{\n";
	for(const auto &v : vv) {
		cerr << "\t";
		view(v);
		cerr << "\n";
	}
	cerr << "}";
}
template <typename T, typename U>
void view(const V<pair<T, U>> &v) {
	cerr << "{\n";
	for(const auto &c : v) cerr << "\t(" << c.first << ", " << c.second << ")\n";
	cerr << "}";
}
template <typename T, typename U>
void view(const map<T, U> &m) {
	cerr << "{\n";
	for(auto &t : m) cerr << "\t[" << t.first << "] : " << t.second << "\n";
	cerr << "}";
}
template <typename T, typename U>
void view(const pair<T, U> &p) { cerr << "(" << p.first << ", " << p.second << ")"; }
template <typename T>
void view(const set<T> &s) {
	cerr << "{ ";
	for(auto &t : s) {
		view(t);
		cerr << ", ";
	}
	cerr << "\b\b }";
}
template <typename T>
void view(T e) { cerr << e; }
#ifdef LOCAL
void debug_out() {}
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
	view(H);
	cerr << ", ";
	debug_out(T...);
}
#define debug(...)                                           \
	do {                                                     \
		cerr << __LINE__ << " [" << #__VA_ARGS__ << "] : ["; \
		debug_out(__VA_ARGS__);                              \
		cerr << "\b\b]\n";                                   \
	} while(0)
#else
#define debug(...) (void(0))
#endif
template <class T>
V<T> press(V<T> &x) {
	V<T> res = x;
	sort(all(res));
	res.erase(unique(all(res)), res.end());
	REP(i, SZ(x)) {
		x[i] = lower_bound(all(res), x[i]) - res.begin();
	}
	return res;
}
template <class T>
inline bool chmin(T &a, T b) {
	if(a > b) {
		a = b;
		return true;
	}
	return false;
}
template <class T>
inline bool chmax(T &a, T b) {
	if(a < b) {
		a = b;
		return true;
	}
	return false;
}
inline void Yes(bool b = true) { cout << (b ? "Yes" : "No") << '\n'; }
inline void YES(bool b = true) { cout << (b ? "YES" : "NO") << '\n'; }
inline void err(bool b = true) {
	if(b) {
		cout << -1 << '\n';
		exit(0);
	}
}
template <class T>
inline void fin(bool b = true, T e = 0) {
	if(b) {
		cout << e << '\n';
		exit(0);
	}
}
template <class T>
T divup(T x, T y) { return (x + (y - 1)) / y; }
template <typename T>
T pow(T a, long long n, T e = 1) {
	T ret = e;
	while(n) {
		if(n & 1) ret *= a;
		a *= a;
		n >>= 1;
	}
	return ret;
}
struct iofast {
	iofast() {
		ios::sync_with_stdio(false);
		cin.tie(nullptr);
		cout << fixed << setprecision(15);
	}
} iofast_;
const int inf = 1e9;
const ll INF = 1e18;
#pragma endregion
struct Edge {
	int to;
	long long cost;
	Edge() = default;
	Edge(int to_, long long cost_)
	  : to(to_), cost(cost_) {}
	bool operator<(const Edge &a) const {
		return cost < a.cost;
	}
	bool operator>(const Edge &a) const {
		return cost > a.cost;
	}
	friend std::ostream &operator<<(std::ostream &s, Edge &a) {
		s << "to:" << a.to << " cost:" << a.cost;
		return s;
	}
};

struct Graph : private std::vector<std::vector<Edge>> {
	using std::vector<std::vector<Edge>>::vector;

private:
	const long long INF = 1e18;

	bool isweight = 0;

	template <class T>
	inline bool chmax(T &a, T b) {
		if(a < b) {
			a = b;
			return true;
		}
		return false;
	}

	template <class T>
	inline bool chmin(T &a, T b) {
		if(a > b) {
			a = b;
			return true;
		}
		return false;
	}

	std::vector<int> used, order, low, articulation;
	std::vector<pii> bridge;
	int lowlinkdfs(int idx, int k, int par) {
		used[idx] = 1;
		order[idx] = k++;
		low[idx] = order[idx];
		bool is_articulation = false, neko = false;
		int cnt = 0;
		for(auto &e : (*this)[idx]) {
			if(e.to == par and !exchange(neko, true)) {
				continue;
			}
			if(!used[e.to]) {
				++cnt;
				k = lowlinkdfs(e.to, k, idx);
				low[idx] = std::min(low[idx], low[e.to]);
				is_articulation |= par >= 0 and low[e.to] >= order[idx];
				if(order[idx] < low[e.to]) {
					auto p = std::minmax(idx, e.to);
					bridge.emplace_back(p.first, p.second);
				}
			} else {
				low[idx] = std::min(low[idx], order[e.to]);
			}
		}
		is_articulation |= par == -1 and cnt > 1;
		if(is_articulation) articulation.push_back(idx);
		return k;
	}

public:
	void read(int e = -1, bool weight = 0, bool directed = false, int idx = 1) {
		if(e == -1) e = size() - 1;
		isweight |= weight;
		while(e--) {
			int u, v;
			long long cost = 1;
			std::cin >> u >> v;
			if(weight) std::cin >> cost;
			u -= idx, v -= idx;
			(*this)[u].emplace_back(v, cost);
			if(!directed) (*this)[v].emplace_back(u, cost);
		}
	}

	void add(int u, int v, int cost = 1, bool directed = false, int idx = 1) {
		u -= idx, v -= idx;
		(*this)[u].emplace_back(v, cost);
		if(!directed) (*this)[v].emplace_back(u, cost);
	}

	std::vector<long long> Dijkstra(int s) {
		std::vector dist(size(), INF);
		if(isweight) {
			using pll = std::pair<long long, long long>;
			std::priority_queue<pll, std::vector<pll>, std::greater<pll>> que;
			dist[s] = 0;
			que.push(pll(0, s));
			while(!que.empty()) {
				pll p = que.top();
				que.pop();
				int v = p.second;
				if(dist[v] < p.first) continue;
				for(int i = 0; i < (*this)[v].size(); i++) {
					Edge e = (*this)[v][i];
					if(dist[e.to] > dist[v] + e.cost) {
						dist[e.to] = dist[v] + e.cost;
						que.push(pll(dist[e.to], e.to));
					}
				}
			}
			return dist;
		} else {
			std::vector dist(size(), INF);
			std::queue<int> que;
			dist[s] = 0;
			que.push(s);
			while(!que.empty()) {
				int v = que.front();
				que.pop();
				for(auto nv : (*this)[v]) {
					if(dist[nv.to] != INF) continue;
					dist[nv.to] = dist[v] + 1;
					que.push(nv.to);
				}
			}
			return dist;
		}
	}

	std::vector<long long> BellmanFord(int s) {
		int n = size();
		std::vector res(n, INF);
		res[s] = 0;
		for(int loop = 0; loop < n - 1; loop++) {
			for(int v = 0; v < n; v++) {
				if(res[v] == INF) continue;
				for(auto &e : (*this)[v]) {
					res[e.to] = std::min(res[e.to], res[v] + e.cost);
				}
			}
		}

		std::queue<int> que;
		std::vector chk(n, 0);
		for(int v = 0; v < n; v++) {
			if(res[v] == INF) continue;
			for(auto &e : (*this)[v]) {
				if(res[e.to] > res[v] + e.cost) {
					res[e.to] = res[v] + e.cost;
					if(!chk[e.to]) {
						que.push(e.to);
						chk[e.to] = 1;
					}
				}
			}
		}
		while(!que.empty()) {
			int now = que.front();
			que.pop();
			for(auto &e : (*this)[now]) {
				if(!chk[e.to]) {
					chk[e.to] = 1;
					que.push(e.to);
				}
			}
		}
		for(int i = 0; i < n; i++)
			if(chk[i]) res[i] = -INF;
		return res;
	}

	std::vector<std::vector<long long>> WarshallFloyd() {
		int n = size();
		std::vector dist(n, std::vector(n, INF));
		for(int i = 0; i < n; i++) {
			dist[i][i] = 0;
		}
		for(int i = 0; i < n; i++) {
			for(auto e : (*this)[i]) {
				chmin(dist[i][e.to], e.cost);
			}
		}
		for(int k = 0; k < n; k++)
			for(int i = 0; i < n; i++)
				for(int j = 0; j < n; j++)
					chmin(dist[i][j], dist[i][k] + dist[k][j]);
		return dist;
	}

	//{{端点、端点},直径の大きさ}
	std::pair<std::pair<int, int>, long long> Diameter() {
		auto vec = Dijkstra(0);
		int v1 = -1, v2 = -1;
		long long dia = -1;
		for(int i = 0; i < int(size()); i++)
			if(chmax(dia, vec[i])) {
				v1 = i;
			}

		vec = Dijkstra(v1);
		dia = -1;
		for(int i = 0; i < int(size()); i++)
			if(chmax(dia, vec[i])) {
				v2 = i;
			}

		std::pair<std::pair<int, int>, long long> res = {{v1, v2}, dia};
		return res;
	}

	long long Prim() {
		long long res = 0;
		std::priority_queue<Edge, std::vector<Edge>, std::greater<Edge>> que;
		for(auto &e : (*this)[0])
			que.push(e);
		std::vector chk(size(), 0);
		chk[0] = 1;
		while(!que.empty()) {
			auto e = que.top();
			que.pop();
			if(chk[e.to]) continue;
			res += e.cost;
			chk[e.to] = 1;
			for(auto &e : (*this)[e.to]) {
				que.push(e);
			}
		}
		return res;
	}

	std::pair<std::vector<std::pair<int, int>>, std::vector<int>> lowlink() {
		int n = size(), k = 0;
		used.assign(n, 0);
		order.assign(n, 0);
		low.assign(n, 0);
		for(int i = 0; i < n; i++) {
			if(!used[i]) k = lowlinkdfs(i, k, -1);
		}
		return std::pair(bridge, articulation);
	}
};

int main() {
	INT(n);
	Graph G(n);
	map<pii, int> mp;
	V<> res(n, 1);
	REP(i, n) {
		INT(a, b);
		if(a > b) swap(a, b);
		mp[{a - 1, b - 1}] = i;
		G.add(a, b);
	}
	auto bridge = G.lowlink().first;
	for(auto p : bridge)
		res[mp[p]] = 0;
	int k = 0;
	REP(i, n)
	k += res[i];
	print(k);
	REP(i, n)
	if(res[i]) cout << i + 1 << " ";
	cout << endl;
}

yukicoder

結果

テストケース

ソースコード