結果

問題 No.1054 Union add query
ユーザー FF256grhyFF256grhy
提出日時 2020-05-16 11:29:40
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
CE  
(最新)
AC  
(最初)
実行時間 -
コード長 6,440 bytes
コンパイル時間 2,301 ms
コンパイル使用メモリ 205,992 KB
最終ジャッジ日時 2023-10-22 02:30:22
合計ジャッジ時間 3,277 ms
ジャッジサーバーID
（参考情報） 		judge10 / judge13
このコードへのチャレンジ
（要ログイン）
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。（リジャッジ後のコンパイルエラーは公開されます）
ただし、clay言語の場合は開発者のデバッグのため、公開されます。

コンパイルメッセージ
main.cpp: In instantiation of 'std::istream& operator>>(std::istream&, std::vector<_Tp>&) [with T = std::array<int, 3>; std::istream = std::basic_istream<char>]':
main.cpp:160:9:   required from here
main.cpp:145:86: error: no match for 'operator>>' (operand types are 'std::istream' {aka 'std::basic_istream<char>'} and 'std::array<int, 3>')
  145 | template<typename T> istream & operator>>(istream & s, vector<T> & v) { RF(e, v) { s >> e; } return s; }
      |                                                                                    ~~^~~~
In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/sstream:38,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/complex:45,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/ccomplex:39,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/x86_64-pc-linux-gnu/bits/stdc++.h:54,
                 from main.cpp:1:
/home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/istream:120:7: note: candidate: 'std::basic_istream<_CharT, _Traits>::__istream_type& std::basic_istream<_CharT, _Traits>::operator>>(__istream_type& (*)(__istream_type&)) [with _CharT = char; _Traits = std::char_traits<char>; __istream_type = std::basic_istream<char>]'
  120 |       operator>>(__istream_type& (*__pf)(__istream_type&))
      |       ^~~~~~~~
/home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/istream:120:36: note:   no known conversion for argument 1 from 'std::array<int, 3>' to 'std::basic_istream<char>::__istream_type& (*)(std::basic_istream<char>::__istream_type&)' {aka 'std::basic_istream<char>& (*)(std::basic_istream<char>&)'}
  120 |       operator>>(__istream_type& (*__pf)(__istream_type&))
      |                  ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/istream:124:7: note: candidate: 'std::basic_istream<_CharT, _Traits>::

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using LL = long long int;
#define incID(i, l, r) for(int i = (l)    ; i <  (r); ++i)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); --i)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); ++i)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); --i)
#define inc(i, n)  incID(i, 0, n)
#define dec(i, n)  decID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define dec1(i, n) decII(i, 1, n)
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))
#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define MT make_tuple
#define FI first
#define SE second
#define FR front()
#define BA back()
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
auto setmin   = [](auto & a, auto b) { return (b <  a ? a = b, true : false); };
auto setmax   = [](auto & a, auto b) { return (b >  a ? a = b, true : false); };
auto setmineq = [](auto & a, auto b) { return (b <= a ? a = b, true : false); };
auto setmaxeq = [](auto & a, auto b) { return (b >= a ? a = b, true : false); };
#define SI(v) static_cast<int>(v.size())
#define RF(e, v) for(auto & e: v)
#define until(e) while(! (e))
#define if_not(e) if(! (e))
#define ef else if
#define UR assert(false)
#define IN(T, ...) T __VA_ARGS__; IN_(__VA_ARGS__);
void IN_() { };
template<typename T, typename ... U> void IN_(T &  a, U &  ... b) { cin >> a; IN_(b ...); };
template<typename T                > void OUT(T && a            ) { cout << a << endl; }
template<typename T, typename ... U> void OUT(T && a, U && ... b) { cout << a << " "; OUT(b ...); }

// ---- ----

template<typename T> class SegmentTree {
private:
	int n, s;
	vector<T> a;
	function<T(T &, T &)> f;
	T e;
	bool ok;
public:
	SegmentTree() { n = 0; }
	SegmentTree(int nn, function<T(T &, T &)> ff, T ee) { init(nn, ff, ee); }
	void init(int nn, function<T(T &, T &)> ff, T ee) {
		n = nn;
		f = ff;
		e = ee;
		s = 1;
		while(s < n) { s *= 2; }
		a = vector<T>(2 * s, e);
		ok = true;
	}
	void shift(int & p) {
		assert(inID(p, 0, n));
		p += s;
	}
	void apply(int p, function<void(T &)> g) {
		shift(p);
		g(a[p]);
		while(p > 1) {
			p /= 2;
			a[p] = f(a[2 * p], a[2 * p + 1]);
		}
	}
	T fold_ID(int l, int r) {
		assert(ok);
		assert(inII(l, 0, n)); l += s;
		assert(inII(r, 0, n)); r += s; r--;
		T x = e, y = e;
		while(l <= r) {
			if(l % 2 == 1) { x = f(x, a[l]); l++; }
			if(r % 2 == 0) { y = f(a[r], y); r--; }
			l /= 2;
			r /= 2;
		}
		return f(x, y);
	}
	T fold_II(int l, int r) { return fold_ID(l + 0, r + 1); }
	T fold_CI(int l, int r) { return fold_ID(l + 1, r + 1); }
	T fold_CD(int l, int r) { return fold_ID(l + 1, r + 0); }
	const T & operator[](int p) {
		shift(p);
		return a[p];
	}
	T & ref(int p) {
		shift(p);
		ok = false;
		return a[p];
	}
	void update() {
		dec(i, s) { a[i] = f(a[2 * i], a[2 * i + 1]); }
		ok = true;
	}
};
#define OP(s) [&](auto & A, auto & B) { return s; }
#define AP(s) [&](auto & A) { s; }

// ----

class UnionFind {
private:
	int n, s;
	vector<int> t;
	vector<vector<int>> v;
public:
	UnionFind(int arg_n = 0) { init(arg_n); }
	void init(int arg_n) {
		n = s = arg_n;
		t.clear();
		v.clear();
		inc(i, n) { t.PB(i); v.EB(1, i); }
	}
	int get_n() { return n; }
	int size() { return s; }
	int id(int x) { return t.at(x); }
	const vector<vector<int>> & get_v() { return v; }
	bool unite(int x, int y) {
		x = id(x);
		y = id(y);
		if(x == y) { return false; }
		if(v[x].size() < v[y].size()) { swap(x, y); }
		for(auto & e: v[y]) { v[x].PB(e); t[e] = x; }
		v[y].clear();
		s--;
		return true;
	}
	bool same(int x, int y) { return (id(x) == id(y)); }
	const vector<int> & operator[](int x) { return v[id(x)]; }
	friend ostream & operator<<(ostream & os, const UnionFind & uf) {
		inc(i, uf.n) { os << i << ": "; for(auto & e: uf.v[i]) { os << e << " "; } os << "\n"; }
		return os;
	}
};

// ---- ----

template<typename T> istream & operator>>(istream & s, vector<T> & v) { RF(e, v) { s >> e; } return s; }
template<typename T> ostream & operator<<(ostream & s, vector<T> const & v) {
	inc(i, SI(v)) { s << (i == 0 ? "" : " ") << v[i]; }
	return s;
}

template<typename T, size_t N> istream & operator>>(istream & s, array<T, N> & a) { RF(e, a) { s >> e; } return s; }
template<typename T, size_t N> ostream & operator<<(ostream & s, array<T, N> const & a) {
	inc(i, SI(a)) { s << (i == 0 ? "" : " ") << a[i]; }
	return s;
}

int main() {
	IN(int, n, Q);
	vector<array<int, 3>> q(Q);
	cin >> q;
	inc1(i, n) { q.PB({ 1, 0, i }); }
	
	auto solve1 = [&]() -> vector<int> {
		vector<int> ans;
		
		UnionFind uf(n + 1);
		vector<vector<int>> g(n + 1);
		for(auto [t, a, b]: q) {
			if(t == 1) {
				if(uf.unite(a, b)) {
					g[a].PB(b);
					g[b].PB(a);
				}
			}
		}
		
		vector<int> p(n + 1), et_f(n + 1), et_l(n + 1);
		int c = 0;
		function<void(int, int)> dfs = [&](int v, int pp) {
			p[v] = pp;
			et_f[v] = c;
			RF(e, g[v]) {
				if(e == pp) { continue; }
				c++;
				dfs(e, v);
			}
			c++;
			et_l[v] = c;
		};
		dfs(0, 0);
		
		uf.init(n + 1);
		vector<int> r_(n + 1);
		inc(i, n + 1) { r_[i] = uf.id(i); }
		auto root = [&](int v) -> int & {
			return r_[uf.id(v)];
		};
		SegmentTree<LL> st(2 * n + 1, OP(A + B), 0);
		for(auto [t, a, b]: q) {
			if(a == 0) { break; }
			
			if(t == 1) {
				int x, y;
				if(a == p[b]) { x = a; y = b; }
				else          { x = b; y = a; }
				int r = root(x);
				if(uf.unite(a, b)) {
					assert(x == p[y]);
					LL v = st.fold_ID(et_f[r], et_f[y]);
					assert(v == -st.fold_CI(et_l[y], et_l[r]));
					st.apply(et_f[y], AP(A -= v));
					st.apply(et_l[y], AP(A += v));
					root(x) = r;
					assert(root(y) = r);
				}
			}
			if(t == 2) {
				st.apply(et_f[root(a)], AP(A += b));
				st.apply(et_l[root(a)], AP(A -= b));
			}
			if(t == 3) {
				OUT(st.fold_II(et_f[root(a)], et_f[a]));
				ans.PB(st.fold_II(et_f[root(a)], et_f[a]));
			}
		}
		
		return ans;
	};
	
	auto solve2 = [&]() -> vector<int> {
		UnionFind uf(n + 1);
		vector<int> v(n + 1), ans;
		for(auto [t, a, b]: q) {
			if(t == 1) {
				uf.unite(a, b);
			}
			if(t == 2) {
				RF(e, uf[a]) { v[e] += b; }
			}
			if(t == 3) {
				OUT(v[a]);
				ans.PB(v[a]);
			}
		}
		return ans;
	};
	
	/*
	OUT("solve1:");
	auto ans1 = solve1();
	OUT("");
	
	OUT("solve2:");
	auto ans2 = solve2();
	OUT("");
	
	assert(SI(ans1) == SI(ans2));
	inc(i, SI(ans1)) {
		OUT(ans1[i] == ans2[i] ? "ok" : "!!!!!", ans1[i], ans2[i]);
	}
	*/
	solve1();
}
0