fork download

copy

#include <bits/stdc++.h>
using namespace std;
 
using ll = long long;
using db = long double; // or double, if TL is tight
using str = string; // yay python!
 
using pi = pair<int,int>;
using pl = pair<ll,ll>;
using pd = pair<db,db>;
 
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<ll>;
using vd = vector<db>; 
using vs = vector<str>;
using vpi = vector<pi>;
using vpl = vector<pl>; 
using vpd = vector<pd>;
 
#define tcT template<class T
#define tcTU tcT, class U
// ^ lol this makes everything look weird but I'll try it
tcT> using V = vector<T>; 
tcT, size_t SZ> using AR = array<T,SZ>; 
tcT> using PR = pair<T,T>;
 
// pairs
#define mp make_pair
#define f first
#define s second
 
// vectors
// oops size(x), rbegin(x), rend(x) need C++17
#define sz(x) int((x).size())
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define rall(x) x.rbegin(), x.rend() 
#define sor(x) sort(all(x)) 
#define rsz resize
#define ins insert 
#define ft front()
#define bk back()
#define pb push_back
#define eb emplace_back 
#define pf push_front
#define rtn return
 
#define lb lower_bound
#define ub upper_bound 
tcT> int lwb(V<T>& a, const T& b) { return int(lb(all(a),b)-bg(a)); }
 
// loops
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define rep(a) F0R(_,a)
#define each(a,x) for (auto& a: x)
 
const int MOD = 1e9+7; // 998244353;
const int MX = 2e5+5;
const ll INF = 1e18; // not too close to LLONG_MAX
const db PI = acos((db)-1);
const int dx[4] = {1,0,-1,0}, dy[4] = {0,1,0,-1}; // for every grid problem!!
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); 
template<class T> using pqg = priority_queue<T,vector<T>,greater<T>>;
 
// bitwise ops
// also see https://g...content-available-to-author-only...u.org/onlinedocs/gcc/Other-Builtins.html
constexpr int pct(int x) { return __builtin_popcount(x); } // # of bits set
constexpr int bits(int x) { // assert(x >= 0); // make C++11 compatible until USACO updates ...
	return x == 0 ? 0 : 31-__builtin_clz(x); } // floor(log2(x)) 
constexpr int p2(int x) { return 1<<x; }
constexpr int msk2(int x) { return p2(x)-1; }
 
ll cdiv(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up
ll fdiv(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down
 
tcT> bool ckmin(T& a, const T& b) {
	return b < a ? a = b, 1 : 0; } // set a = min(a,b)
tcT> bool ckmax(T& a, const T& b) {
	return a < b ? a = b, 1 : 0; }
 
tcTU> T fstTrue(T lo, T hi, U f) {
	hi ++; assert(lo <= hi); // assuming f is increasing
	while (lo < hi) { // find first index such that f is true 
		T mid = lo+(hi-lo)/2;
		f(mid) ? hi = mid : lo = mid+1; 
	} 
	return lo;
}
tcTU> T lstTrue(T lo, T hi, U f) {
	lo --; assert(lo <= hi); // assuming f is decreasing
	while (lo < hi) { // find first index such that f is true 
		T mid = lo+(hi-lo+1)/2;
		f(mid) ? lo = mid : hi = mid-1;
	} 
	return lo;
}
tcT> void remDup(vector<T>& v) { // sort and remove duplicates
	sort(all(v)); v.erase(unique(all(v)),end(v)); }
tcTU> void erase(T& t, const U& u) { // don't erase
	auto it = t.find(u); assert(it != end(t));
	t.erase(it); } // element that doesn't exist from (multi)set
 
#define tcTUU tcT, class ...U
 
inline namespace Helpers {
	//////////// is_iterable
	// https://stackoverflow.com/questions/13830158/check-if-a-variable-type-is-iterable
	// this gets used only when we can call begin() and end() on that type
	tcT, class = void> struct is_iterable : false_type {};
	tcT> struct is_iterable<T, void_t<decltype(begin(declval<T>())),
	                                  decltype(end(declval<T>()))
	                                 >
	                       > : true_type {};
	tcT> constexpr bool is_iterable_v = is_iterable<T>::value;
 
	//////////// is_readable
	tcT, class = void> struct is_readable : false_type {};
	tcT> struct is_readable<T,
	        typename std::enable_if_t<
	            is_same_v<decltype(cin >> declval<T&>()), istream&>
	        >
	    > : true_type {};
	tcT> constexpr bool is_readable_v = is_readable<T>::value;
 
	//////////// is_printable
	// // https://n...content-available-to-author-only...e.es/posts/2020-02-29-is-printable/
	tcT, class = void> struct is_printable : false_type {};
	tcT> struct is_printable<T,
	        typename std::enable_if_t<
	            is_same_v<decltype(cout << declval<T>()), ostream&>
	        >
	    > : true_type {};
	tcT> constexpr bool is_printable_v = is_printable<T>::value;
}
 
inline namespace Input {
	tcT> constexpr bool needs_input_v = !is_readable_v<T> && is_iterable_v<T>;
	tcTUU> void re(T& t, U&... u);
	tcTU> void re(pair<T,U>& p); // pairs
 
	// re: read
	tcT> typename enable_if<is_readable_v<T>,void>::type re(T& x) { cin >> x; } // default
	tcT> void re(complex<T>& c) { T a,b; re(a,b); c = {a,b}; } // complex
	tcT> typename enable_if<needs_input_v<T>,void>::type re(T& i); // ex. vectors, arrays
	tcTU> void re(pair<T,U>& p) { re(p.f,p.s); }
	tcT> typename enable_if<needs_input_v<T>,void>::type re(T& i) {
		each(x,i) re(x); }
	tcTUU> void re(T& t, U&... u) { re(t); re(u...); } // read multiple
 
	// rv: resize and read vectors
	void rv(size_t) {}
	tcTUU> void rv(size_t N, V<T>& t, U&... u);
	template<class...U> void rv(size_t, size_t N2, U&... u);
	tcTUU> void rv(size_t N, V<T>& t, U&... u) {
		t.rsz(N); re(t);
		rv(N,u...); }
	template<class...U> void rv(size_t, size_t N2, U&... u) {
		rv(N2,u...); }
 
	// dumb shortcuts to read in ints
	void decrement() {} // subtract one from each
	tcTUU> void decrement(T& t, U&... u) { --t; decrement(u...); }
	#define ints(...) int __VA_ARGS__; re(__VA_ARGS__);
	#define int1(...) ints(__VA_ARGS__); decrement(__VA_ARGS__);
}
 
inline namespace ToString {
	tcT> constexpr bool needs_output_v = !is_printable_v<T> && is_iterable_v<T>;
 
	// ts: string representation to print
	tcT> typename enable_if<is_printable_v<T>,str>::type ts(T v) {
		stringstream ss; ss << fixed << setprecision(15) << v;
		return ss.str(); } // default
	tcT> str bit_vec(T t) { // bit vector to string
		str res = "{"; F0R(i,sz(t)) res += ts(t[i]);
		res += "}"; return res; }
	str ts(V<bool> v) { return bit_vec(v); }
	template<size_t SZ> str ts(bitset<SZ> b) { return bit_vec(b); } // bit vector
	tcTU> str ts(pair<T,U> p); // pairs
	tcT> typename enable_if<needs_output_v<T>,str>::type ts(T v); // vectors, arrays
	tcTU> str ts(pair<T,U> p) { return "("+ts(p.f)+", "+ts(p.s)+")"; }
	tcT> typename enable_if<is_iterable_v<T>,str>::type ts_sep(T v, str sep) {
		// convert container to string w/ separator sep
		bool fst = 1; str res = "";
		for (const auto& x: v) {
			if (!fst) res += sep;
			fst = 0; res += ts(x);
		}
		return res;
	}
	tcT> typename enable_if<needs_output_v<T>,str>::type ts(T v) {
		return "{"+ts_sep(v,", ")+"}"; }
 
	// for nested DS
	template<int, class T> typename enable_if<!needs_output_v<T>,vs>::type 
	  ts_lev(const T& v) { return {ts(v)}; }
	template<int lev, class T> typename enable_if<needs_output_v<T>,vs>::type 
	  ts_lev(const T& v) {
		if (lev == 0 || !sz(v)) return {ts(v)};
		vs res;
		for (const auto& t: v) {
			if (sz(res)) res.bk += ",";
			vs tmp = ts_lev<lev-1>(t);
			res.ins(end(res),all(tmp));
		}
		F0R(i,sz(res)) {
			str bef = " "; if (i == 0) bef = "{";
			res[i] = bef+res[i];
		}
		res.bk += "}";
		return res;
	}
}
 
inline namespace Output {
	template<class T> void pr_sep(ostream& os, str, const T& t) { os << ts(t); }
	template<class T, class... U> void pr_sep(ostream& os, str sep, const T& t, const U&... u) {
		pr_sep(os,sep,t); os << sep; pr_sep(os,sep,u...); }
	// print w/ no spaces
	template<class ...T> void pr(const T&... t) { pr_sep(cout,"",t...); } 
	// print w/ spaces, end with newline
	void ps() { cout << "\n"; }
	template<class ...T> void ps(const T&... t) { pr_sep(cout," ",t...); ps(); } 
	// debug to cerr
	template<class ...T> void dbg_out(const T&... t) {
		pr_sep(cerr," | ",t...); cerr << endl; }
	void loc_info(int line, str names) {
		cerr << "Line(" << line << ") -> [" << names << "]: "; }
	template<int lev, class T> void dbgl_out(const T& t) {
		cerr << "\n\n" << ts_sep(ts_lev<lev>(t),"\n") << "\n" << endl; }
	#ifdef LOCAL
		#define dbg(...) loc_info(__LINE__,#__VA_ARGS__), dbg_out(__VA_ARGS__)
		#define dbgl(lev,x) loc_info(__LINE__,#x), dbgl_out<lev>(x)
	#else // don't actually submit with this
		#define dbg(...) 0
		#define dbgl(lev,x) 0
	#endif
}
 
inline namespace FileIO {
	void setIn(str s)  { freopen(s.c_str(),"r",stdin); }
	void setOut(str s) { freopen(s.c_str(),"w",stdout); }
	void setIO(str s = "") {
		cin.tie(0)->sync_with_stdio(0); // unsync C / C++ I/O streams
		// cin.exceptions(cin.failbit);
		// throws exception when do smth illegal
		// ex. try to read letter into int
		if (sz(s)) setIn(s+".in"), setOut(s+".out"); // for old USACO
	}
}
 
pl& operator+=(pl& a, pl b) { return a = {a.f+b.f,a.s+b.s}; }
pl operator-(pl a, pl b) { return {a.f-b.f,a.s-b.s}; }
 
/**
 * Description: range sum queries and point updates for $D$ dimensions
 * Source: https://c...content-available-to-author-only...s.com/blog/entry/64914
 * Verification: SPOJ matsum
 * Usage: \texttt{BIT<int,10,10>} gives 2D BIT
 * Time: O((\log N)^D)
 */
 
template <class T, int ...Ns> struct BIT {
	T val{}; void upd(T v) { val += v; }
	T query() { return val; }
};
template <class T, int N, int... Ns> struct BIT<T, N, Ns...> {
	BIT<T,Ns...> bit[N+1];
	template<typename... Args> void upd(int pos, Args... args) { assert(pos > 0);
		for (; pos<=N; pos+=pos&-pos) bit[pos].upd(args...); }
	template<typename... Args> T sum(int r, Args... args) {
		T res{}; for (;r;r-=r&-r) res += bit[r].query(args...); 
		return res; }
	template<typename... Args> T query(int l, int r, Args... 
		args) { return sum(r,args...)-sum(l-1,args...); }
}; 
 
BIT<pl,MX> BB;
 
/**
 * Description: 1D range minimum query. Can also do queries 
 	* for any associative operation in $O(1)$ with D\&C
 * Source: KACTL
 * Verification: 
	* https://c...content-available-to-author-only...s.fi/problemset/stats/1647/
	* http://w...content-available-to-author-only...g.com/problem/ioi1223
	* https://p...content-available-to-author-only...n.com/ChpniVZL
 * Memory: O(N\log N)
 * Time: O(1)
 */
 
template<class T> struct RMQ { // floor(log_2(x))
	int level(int x) { return 31-__builtin_clz(x); } 
	vector<T> v; vector<vi> jmp;
	int comb(int a, int b) { // index of min
		return v[a]==v[b]?min(a,b):(v[a]>v[b]?a:b); } 
	void init(const vector<T>& _v) {
		v = _v; jmp = {vi(sz(v))}; iota(all(jmp[0]),0);
		for (int j = 1; 1<<j <= sz(v); ++j) {
			jmp.pb(vi(sz(v)-(1<<j)+1));
			F0R(i,sz(jmp[j])) jmp[j][i] = comb(jmp[j-1][i],
									jmp[j-1][i+(1<<(j-1))]);
		}
	}
	int index(int l, int r) { // get index of min element
		assert(l <= r); int d = level(r-l+1);
		return comb(jmp[d][l],jmp[d][r-(1<<d)+1]); }
	T query(int l, int r) { return v[index(l,r)]; }
};
 
RMQ<int> R;
struct interval {
	int lef, rig, mul;
	ll len, contrib;
};
 
V<interval> intervals;
 
int N,M;
int start[MX];
vi A,B;
V<tuple<int,int,int>> queries;
vl ans, cum{0,0};
 
vpi v;
 
int get_x_0(pi p) {
	if (p.s == 1) return intervals[p.f].lef;
	return get<0>(queries[p.f]);
}
 
pi get_x(pi p) { return mp(get_x_0(p),p.s); }
 
 
int get_y_0(pi p) {
	if (p.s == 1) return intervals[p.f].rig;
	return get<1>(queries[p.f]);
}
 
pi get_y(pi p) { return mp(get_y_0(p),p.s); }
 
 
ll get_z_0(pi p) {
	if (p.s == 1) return intervals[p.f].len;
	return get<2>(queries[p.f]);
}
 
pair<ll,int> get_z(pi p) { return mp(get_z_0(p),p.s); }
 
vpl aa;
 
void divi(int l, int r) {
	if (l == r) return;
	int m = (l+r)/2;
	divi(l,m); divi(m+1,r);
	vpi tmp;
	FOR(i,l,m+1) {
		pi a = v[i];
		if (a.s == 0) tmp.pb(a);
	}
	FOR(j,m+1,r+1) {
		pi b = v[j];
		if (b.s == 1) tmp.pb(b);
	}
	sort(all(tmp),[](pi a, pi b) {
		return get_y(a) < get_y(b);
	});
	R0F(i,sz(tmp)) {
		pi a = tmp[i];
		if (a.s == 1) {
			int x = get_x_0(a);
			if (x > 0) BB.upd(x,pl{intervals[a.f].contrib,intervals[a.f].mul});
		} else {
			pl p = BB.query(get_x_0(a),N+2);
			aa[a.f].f += p.f;
			aa[a.f].s += p.s;
		}
	}
	R0F(i,sz(tmp)) {
		pi a = tmp[i];
		if (a.s == 1) {
			int x = get_x_0(a);
			if (x > 0) BB.upd(x,pl{-intervals[a.f].contrib,-intervals[a.f].mul});
		}
	}
 // 	F0R(i,sz(tmp)) FOR(j,i+1,sz(tmp)) {
	// 	pi a = tmp[i], b = tmp[j];
	// 	if (a.s == 0 && b.s == 1 && get_x(a) < get_x(b)) {
	// 		aa[a.f].f += intervals[b.f].contrib;
	// 		aa[a.f].s += intervals[b.f].mul;
	// 	}
	// }
	// for (pi a: a_tmp) for (pi b: b_tmp) {
	// 	if (get_x(a) < get_x(b))
	// 	if (get_y(a) < get_y(b)) {
	// 		aa[a.f].f += intervals[b.f].contrib;
	// 		aa[a.f].s += intervals[b.f].mul;
	// 	}
	// }
}
 
void deal1() {
	BB = BIT<pl,MX>();
	aa.rsz(M);
	each(p,intervals) {
		p.contrib = p.mul*p.len;
		p.rig *= -1;
		-- p.len;
	}
	each(t,queries) get<1>(t) *= -1;
	F0R(i,M) if (ans[i] != -1) {
		int S,T,U; tie(S,T,U) = queries[i];
		// each(p,intervals) if (S <= p.lef && T <= p.rig && U <= p.len) {
		// 	aa[i].f += p.contrib;
		// 	aa[i].s += p.mul;
		// }
	}
	vpi ii,qq;
	F0R(i,sz(intervals)) {
		v.pb({i,1});
		ii.pb({i,1});
	}
	F0R(i,sz(queries)) {
		v.pb({i,0});
		qq.pb({i,0});
	}
	// for (pi a: qq) for (pi b: ii)
	// 	if (get_x(a) < get_x(b))
	// 	if (get_y(a) < get_y(b))
	// 	if (get_z(a) < get_z(b)) {
	// 		aa[a.f].f += intervals[b.f].contrib;
	// 		aa[a.f].s += intervals[b.f].mul;
	// 	}
	// F0R(i,sz(queries)) F0R(j,sz(intervals))
	sort(all(v),[&](pi a, pi b) {
		return get_z(a) < get_z(b);
	});
	divi(0,sz(v)-1);
 
 
	F0R(i,M) if (ans[i] != -1) {
		int S,T,U; tie(S,T,U) = queries[i];
		ans[i] += aa[i].f-aa[i].s*U;
	}
}
 
void deal2() {
	V<AR<ll,5>> contrib;
	// dbg("START",ans[0]);
	F0R(i,M) if (ans[i] != -1) {
		int S,T,U; tie(S,T,U) = queries[i];
		int maxLef = lstTrue(0,N+2,[&](int x) {
			return cum[x] <= cum[T]-U;
		});
		int lo = S, hi = min(T-1,maxLef);
		if (lo <= hi) {
			contrib.pb({hi,  T,cum[T]-U,i,1});
			contrib.pb({lo-1,T,cum[T]-U,i,-1});
			// each(p,intervals) if (p.lef <= hi) {
			// 	if (p.rig > T) ans[i] += p.mul*(-cum[p.lef]+cum[T]-U);
			// }
			// each(p,intervals) if (p.lef <= lo-1) {
			// 	if (p.rig > T) ans[i] -= p.mul*(-cum[p.lef]+cum[T]-U);
			// }
		}
	}
	sor(contrib);
	BB = BIT<pl,MX>();
	int ind = 0;
	each(t,contrib) {
		for(;ind < sz(intervals) && intervals[ind].lef <= t[0];++ind) {
			const auto& p = intervals[ind];
			BB.upd(p.rig,pl{-p.mul*cum[p.lef],p.mul});
		}
		pl p = BB.query((int)t[1]+1,N+2);
		// dbg("AH",p.f+p.s*t[2],t[3],t[4]);
		assert(t[3] < sz(ans));
		ans[t[3]] += t[4]*(p.f+p.s*t[2]);
	}
	// dbg("END",ans[0]);
}
 
int main() {
	setIO(); re(N,M);
	A.rsz(N+1), B.rsz(N+1);
	FOR(i,1,N+1) re(A[i]);
	FOR(i,1,N+1) re(B[i]);
	R.init(A);
	FOR(i,1,N+1) cum.pb(cum.bk+A[i]);
	cum.pb(cum.bk);
	assert(sz(cum)-1 == N+2);
	set<int> cur{0,N+2};
	vi inds; FOR(i,1,N+2) inds.pb(i);
	// F0R(i,N+2) {
	// 	rig[i] = i+1;
	// 	lef[i+1] = i;
	// }
	sort(all(inds),[&](int x, int y) {
		return B[x] < B[y]; });
	for (int x: inds) {
		cur.ins(x);
		auto it = cur.find(x);
		int l = *prev(it), r = *next(it);
		intervals.pb({l,r,B[x]-start[l],cum[r]-cum[l]});
		start[l] = start[x] = B[x];
	}
	// cout << cum[3]-cum[2] << "\n";
	// for (auto a: intervals) cout << "HA " << a.lef << " " << a.rig << " " << a.mul << " " << a.len << "\n";
	queries.rsz(M); 
	ans.rsz(M);
	F0R(i,M) {
		ints(S,T,U);
		queries[i] = {S,T,U};
		if (R.query(S,T-1) > U) {
			ans[i] = -1;
		}
	}
	sort(all(intervals),[](const interval& a, const interval& b) {
		return a.lef < b.lef;
	});
	deal2();
	vi qinds(M); iota(all(qinds),0);
	sort(all(qinds),[&](int x, int y) {
		return get<0>(queries[x]) < get<0>(queries[y]);
	});
	int pos = 0;
	BB = BIT<pl,MX>();
	for (int i: qinds) if (ans[i] != -1) {
		int S,T,U; tie(S,T,U) = queries[i];
		// each(p,intervals) if (p.lef < S) {
		// 	if (p.rig <= S) {
 
		// 	} else if (p.rig <= T) {
		// 		ans[i] += p.mul*(cum[p.rig]-cum[S]);
		// 	} else {
		// 		ans[i] += p.mul*(cum[T]-cum[S]);
		// 	}
 
		// }
		for(;pos < sz(intervals) && intervals[pos].lef < S;++pos) {
			const auto& p = intervals[pos];
			BB.upd(intervals[pos].rig,pl{p.mul*cum[p.rig],p.mul});
		}
		pl qq = BB.query(S,T);
		ans[i] += qq.f-qq.s*cum[S];
		qq = BB.query(T+1,N+2);
		ans[i] += qq.s*(cum[T]-cum[S]);
	}
	deal1();
	each(t,ans) ps(t);
	// you should actually read the stuff at the bottom
}
 
/* stuff you should look for
	* int overflow, array bounds
	* special cases (n=1?)
	* do smth instead of nothing and stay organized
	* WRITE STUFF DOWN
	* DON'T GET STUCK ON ONE APPROACH
*/
 

prog.cpp:124:14: error: ‘is_same_v’ was not declared in this scope
              is_same_v<decltype(cin >> declval<T&>()), istream&>
              ^~~~~~~~~
prog.cpp:124:14: note: suggested alternative: ‘iswspace_l’
              is_same_v<decltype(cin >> declval<T&>()), istream&>
              ^~~~~~~~~
              iswspace_l
prog.cpp:124:64: error: template argument 1 is invalid
              is_same_v<decltype(cin >> declval<T&>()), istream&>
                                                                ^
prog.cpp:125:10: error: template argument 2 is invalid
          >
          ^
prog.cpp:126:6: error: expected unqualified-id before ‘>’ token
      > : true_type {};
      ^
prog.cpp:134:14: error: ‘is_same_v’ was not declared in this scope
              is_same_v<decltype(cout << declval<T>()), ostream&>
              ^~~~~~~~~
prog.cpp:134:14: note: suggested alternative: ‘iswspace_l’
              is_same_v<decltype(cout << declval<T>()), ostream&>
              ^~~~~~~~~
              iswspace_l
prog.cpp:134:64: error: template argument 1 is invalid
              is_same_v<decltype(cout << declval<T>()), ostream&>
                                                                ^
prog.cpp:135:10: error: template argument 2 is invalid
          >
          ^
prog.cpp:136:6: error: expected unqualified-id before ‘>’ token
      > : true_type {};
      ^
prog.cpp: In instantiation of ‘str ToString::bit_vec(T) [with T = std::vector<bool>; str = std::__cxx11::basic_string<char>]’:
prog.cpp:181:38:   required from here
prog.cpp:179:40: error: no matching function for call to ‘ts(std::vector<bool>::reference)’
   str res = "{"; F0R(i,sz(t)) res += ts(t[i]);
                                      ~~^~~~~~
prog.cpp:175:55: note: candidate: ‘template<class T> typename std::enable_if<is_printable_v<T>, std::__cxx11::basic_string<char> >::type ToString::ts(T)’
  tcT> typename enable_if<is_printable_v<T>,str>::type ts(T v) {
                                                       ^~
prog.cpp:175:55: note:   template argument deduction/substitution failed:
prog.cpp: In substitution of ‘template<class T> typename std::enable_if<is_printable_v<T>, std::__cxx11::basic_string<char> >::type ToString::ts(T) [with T = std::_Bit_reference]’:
prog.cpp:179:40:   required from ‘str ToString::bit_vec(T) [with T = std::vector<bool>; str = std::__cxx11::basic_string<char>]’
prog.cpp:181:38:   required from here
prog.cpp:175:55: error: no type named ‘type’ in ‘struct std::enable_if<false, std::__cxx11::basic_string<char> >’
prog.cpp: In instantiation of ‘void Input::re(T&, U& ...) [with T = int; U = {}]’:
prog.cpp:490:22:   required from here
prog.cpp:152:43: error: no matching function for call to ‘re()’
  tcTUU> void re(T& t, U&... u) { re(t); re(u...); } // read multiple
                                         ~~^~~~~~
prog.cpp:152:14: note: candidate: ‘template<class T, class ... U> void Input::re(T&, U& ...)’
  tcTUU> void re(T& t, U&... u) { re(t); re(u...); } // read multiple
              ^~
prog.cpp:152:14: note:   template argument deduction/substitution failed:
prog.cpp:152:43: note:   candidate expects at least 1 argument, 0 provided
  tcTUU> void re(T& t, U&... u) { re(t); re(u...); } // read multiple
                                         ~~^~~~~~
prog.cpp:149:13: note: candidate: ‘template<class T, class U> void Input::re(std::pair<_T1, _T2>&)’
  tcTU> void re(pair<T,U>& p) { re(p.f,p.s); }
             ^~
prog.cpp:149:13: note:   template argument deduction/substitution failed:
prog.cpp:152:43: note:   candidate expects 1 argument, 0 provided
  tcTUU> void re(T& t, U&... u) { re(t); re(u...); } // read multiple
                                         ~~^~~~~~
prog.cpp:146:55: note: candidate: ‘template<class T> typename std::enable_if<is_readable_v<T>, void>::type Input::re(T&)’
  tcT> typename enable_if<is_readable_v<T>,void>::type re(T& x) { cin >> x; } // default
                                                       ^~
prog.cpp:146:55: note:   template argument deduction/substitution failed:
prog.cpp:152:43: note:   candidate expects 1 argument, 0 provided
  tcTUU> void re(T& t, U&... u) { re(t); re(u...); } // read multiple
                                         ~~^~~~~~
prog.cpp:147:12: note: candidate: ‘template<class T> void Input::re(std::complex<_Tp>&)’
  tcT> void re(complex<T>& c) { T a,b; re(a,b); c = {a,b}; } // complex
            ^~
prog.cpp:147:12: note:   template argument deduction/substitution failed:
prog.cpp:152:43: note:   candidate expects 1 argument, 0 provided
  tcTUU> void re(T& t, U&... u) { re(t); re(u...); } // read multiple
                                         ~~^~~~~~
prog.cpp:150:55: note: candidate: ‘template<class T> typename std::enable_if<needs_input_v<T>, void>::type Input::re(T&)’
  tcT> typename enable_if<needs_input_v<T>,void>::type re(T& i) {
                                                       ^~
prog.cpp:150:55: note:   template argument deduction/substitution failed:
prog.cpp:152:43: note:   candidate expects 1 argument, 0 provided
  tcTUU> void re(T& t, U&... u) { re(t); re(u...); } // read multiple
                                         ~~^~~~~~
prog.cpp: In instantiation of ‘void Output::pr_sep(std::ostream&, str, const T&) [with T = long long int; std::ostream = std::basic_ostream<char>; str = std::__cxx11::basic_string<char>]’:
prog.cpp:227:54:   required from ‘void Output::ps(const T& ...) [with T = {long long int}]’
prog.cpp:554:18:   required from here
prog.cpp:220:72: error: no matching function for call to ‘ts(const long long int&)’
  template<class T> void pr_sep(ostream& os, str, const T& t) { os << ts(t); }
                                                                      ~~^~~
prog.cpp:175:55: note: candidate: ‘template<class T> typename std::enable_if<is_printable_v<T>, std::__cxx11::basic_string<char> >::type ToString::ts(T)’
  tcT> typename enable_if<is_printable_v<T>,str>::type ts(T v) {
                                                       ^~
prog.cpp:175:55: note:   template argument deduction/substitution failed:
prog.cpp: In substitution of ‘template<class T> typename std::enable_if<is_printable_v<T>, std::__cxx11::basic_string<char> >::type ToString::ts(T) [with T = long long int]’:
prog.cpp:220:72:   required from ‘void Output::pr_sep(std::ostream&, str, const T&) [with T = long long int; std::ostream = std::basic_ostream<char>; str = std::__cxx11::basic_string<char>]’
prog.cpp:227:54:   required from ‘void Output::ps(const T& ...) [with T = {long long int}]’
prog.cpp:554:18:   required from here
prog.cpp:175:55: error: no type named ‘type’ in ‘struct std::enable_if<false, std::__cxx11::basic_string<char> >’
prog.cpp: In instantiation of ‘void Output::pr_sep(std::ostream&, str, const T&) [with T = long long int; std::ostream = std::basic_ostream<char>; str = std::__cxx11::basic_string<char>]’:
prog.cpp:227:54:   required from ‘void Output::ps(const T& ...) [with T = {long long int}]’
prog.cpp:554:18:   required from here
prog.cpp:181:6: note: candidate: ‘str ToString::ts(V<bool>)’
  str ts(V<bool> v) { return bit_vec(v); }
      ^~
prog.cpp:181:6: note:   no known conversion for argument 1 from ‘const long long int’ to ‘V<bool>’ {aka ‘std::vector<bool>’}
prog.cpp:182:26: note: candidate: ‘template<long unsigned int SZ> str ToString::ts(std::bitset<_Nb>)’
  template<size_t SZ> str ts(bitset<SZ> b) { return bit_vec(b); } // bit vector
                          ^~
prog.cpp:182:26: note:   template argument deduction/substitution failed:
prog.cpp:220:72: note:   mismatched types ‘std::bitset<_Nb>’ and ‘long long int’
  template<class T> void pr_sep(ostream& os, str, const T& t) { os << ts(t); }
                                                                      ~~^~~
prog.cpp:185:12: note: candidate: ‘template<class T, class U> str ToString::ts(std::pair<_T1, _T2>)’
  tcTU> str ts(pair<T,U> p) { return "("+ts(p.f)+", "+ts(p.s)+")"; }
            ^~
prog.cpp:185:12: note:   template argument deduction/substitution failed:
prog.cpp:220:72: note:   mismatched types ‘std::pair<_T1, _T2>’ and ‘long long int’
  template<class T> void pr_sep(ostream& os, str, const T& t) { os << ts(t); }
                                                                      ~~^~~
prog.cpp:195:55: note: candidate: ‘template<class T> typename std::enable_if<needs_output_v<T>, std::__cxx11::basic_string<char> >::type ToString::ts(T)’
  tcT> typename enable_if<needs_output_v<T>,str>::type ts(T v) {
                                                       ^~
prog.cpp:195:55: note:   template argument deduction/substitution failed:
prog.cpp: In substitution of ‘template<class T> typename std::enable_if<needs_output_v<T>, std::__cxx11::basic_string<char> >::type ToString::ts(T) [with T = long long int]’:
prog.cpp:220:72:   required from ‘void Output::pr_sep(std::ostream&, str, const T&) [with T = long long int; std::ostream = std::basic_ostream<char>; str = std::__cxx11::basic_string<char>]’
prog.cpp:227:54:   required from ‘void Output::ps(const T& ...) [with T = {long long int}]’
prog.cpp:554:18:   required from here
prog.cpp:195:55: error: no type named ‘type’ in ‘struct std::enable_if<false, std::__cxx11::basic_string<char> >’
prog.cpp: In function ‘void FileIO::setIn(str)’:
prog.cpp:245:30: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
  void setIn(str s)  { freopen(s.c_str(),"r",stdin); }
                       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
prog.cpp: In function ‘void FileIO::setOut(str)’:
prog.cpp:246:30: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
  void setOut(str s) { freopen(s.c_str(),"w",stdout); }
                       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Standard output is empty