#907082 (C++17) No.855 ヘビの日光浴

提出ソース
結果

問題	No.855 ヘビの日光浴
コンテスト
ユーザー	FF256grhy
提出日時	2023-08-23 18:01:21
言語	C++17 (gcc 13.3.0 + boost 1.87.0)
結果	AC
実行時間	166 ms / 3,153 ms
コード長	8,367 bytes
コンパイル時間	4,166 ms
コンパイル使用メモリ	269,888 KB
最終ジャッジ日時	2025-02-16 12:35:24
ジャッジサーバーID （参考情報）	judge3 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン	結果
sample	AC * 3
other	AC * 92
権限があれば一括ダウンロードができます
ソースコード

raw source code
#include <bits/stdc++.h>
using namespace std;
#define incII(i, l, r) for(decay_t<decltype(r)> i = (l)    ; i <= (r); i++)
#define incIX(i, l, r) for(decay_t<decltype(r)> i = (l)    ; i <  (r); i++)
#define incXI(i, l, r) for(decay_t<decltype(r)> i = (l) + 1; i <= (r); i++)
#define incXX(i, l, r) for(decay_t<decltype(r)> i = (l) + 1; i <  (r); i++)
#define decII(i, l, r) for(decay_t<decltype(r)> i = (r)    ; i >= (l); i--)
#define decIX(i, l, r) for(decay_t<decltype(r)> i = (r) - 1; i >= (l); i--)
#define decXI(i, l, r) for(decay_t<decltype(r)> i = (r)    ; i >  (l); i--)
#define decXX(i, l, r) for(decay_t<decltype(r)> i = (r) - 1; i >  (l); i--)
#define inc(i, n)  incIX(i, 0, n)
#define dec(i, n)  decIX(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define dec1(i, n) decII(i, 1, n)
auto inII = [](auto a, auto l, auto r) -> bool { return (l <= a && a <= r); };
auto inIX = [](auto a, auto l, auto r) -> bool { return (l <= a && a <  r); };
auto inXI = [](auto a, auto l, auto r) -> bool { return (l <  a && a <= r); };
auto inXX = [](auto a, auto l, auto r) -> bool { return (l <  a && a <  r); };
auto setmin   = [](auto & a, auto b) -> bool { return (b <  a ? a = b, true : false); };
auto setmax   = [](auto & a, auto b) -> bool { return (b >  a ? a = b, true : false); };
auto setmineq = [](auto & a, auto b) -> bool { return (b <= a ? a = b, true : false); };
auto setmaxeq = [](auto & a, auto b) -> bool { return (b >= a ? a = b, true : false); };
using LL = long long int;
using LD = long double;
#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(a) begin(a), end(a)
#define RALL(a) rbegin(a), rend(a)
#define RV(a) reverse(ALL(a))
// #define ST(a) sort(ALL(a))
#define RST(a) sort(RALL(a))
#define SC static_cast
#define SI(a) SC<int>(a.size())
#define SL(a) SC<LL>(a.size())
#define RF(e, ...) for(auto && e: __VA_ARGS__)
#define SF(a, ...) for(auto && [__VA_ARGS__]: a)
#define until(...) while(not(__VA_ARGS__))
#define if_not(...) if(not(__VA_ARGS__))
#define ef else if
#define UR assert(false)
template<typename A>             istream & operator>>(istream & is, vector<A>          & v);
template<typename A>             ostream & operator<<(ostream & os, vector<A>    const & v);
template<typename A, size_t N>   istream & operator>>(istream & is, array<A, N>        & a);
template<typename A, size_t N>   ostream & operator<<(ostream & os, array<A, N>  const & a);
template<typename A, typename B> istream & operator>>(istream & is, pair<A, B>         & p);
template<typename A, typename B> ostream & operator<<(ostream & os, pair<A, B>   const & p);
template<typename ... A>         istream & operator>>(istream & is, tuple<A ...>       & t);
template<typename ... A>         ostream & operator<<(ostream & os, tuple<A ...> const & t);
template<int I = 0, typename T> void tin_ (istream & is, T       & t) { if constexpr(I < tuple_size<T>::value) { is >> get<I>(t); tin_<I + 1>(is, t); } }
template<int I = 0, typename T> void tout_(ostream & os, T const & t) { if constexpr(I < tuple_size<T>::value) { if(I != 0) { os << " "; } os << get<I>(t); tout_<I + 1>(os, t); } }
template<typename A>             istream & operator>>(istream & is, vector<A>          & v) { for(auto && e: v) { is >> e; } return is; }
template<typename A>             ostream & operator<<(ostream & os, vector<A>    const & v) { string ss; for(auto && e: v) { os << ss << e; ss = " "; } return os; }
template<typename A, size_t N>   istream & operator>>(istream & is, array<A, N>        & a) { for(auto && e: a) { is >> e; } return is; }
template<typename A, size_t N>   ostream & operator<<(ostream & os, array<A, N>  const & a) { string ss; for(auto && e: a) { os << ss << e; ss = " "; } return os; }
template<typename A, typename B> istream & operator>>(istream & is, pair<A, B>         & p) { return is >> p.first >> p.second; }
template<typename A, typename B> ostream & operator<<(ostream & os, pair<A, B>   const & p) { return os << p.first << " " << p.second; }
template<typename ... A>         istream & operator>>(istream & is, tuple<A ...>       & t) { tin_ (is, t); return is; }
template<typename ... A>         ostream & operator<<(ostream & os, tuple<A ...> const & t) { tout_(os, t); return os; }
auto * IS = & cin;
auto * OS = & cout;
template<typename ... A> void in(A & ... a) { (* IS >> ... >> a); }
#define IN(...) __VA_ARGS__; in(__VA_ARGS__)
template<typename A                > auto make_v(A a) { return a; }
template<typename A, typename ... M> auto make_v(A a, int n, M ... m) { return vector(n, make_v(a, m ...)); }
template<typename A, typename ... N> auto read_v(N ... n) { auto a = make_v(A { }, n ...); in(a); return a; }
void                                      out_([[maybe_unused]] string const & s) { }
template<typename A                > void out_([[maybe_unused]] string const & s, A const & a) { * OS << a; }
template<typename A, typename ... B> void out_(                 string const & s, A const & a, B const & ... b) { * OS << a << s; out_(s, b ...); }
auto outF  = [](string const & s, string const & t, auto const & ... a) { out_(s, a ...); * OS << t << flush; };
auto outN  = [](auto const & ... a) { outF(""  , ""  , a ...); };
auto outS  = [](auto const & ... a) { outF(" " , " " , a ...); };
auto outL  = [](auto const & ... a) { outF("\n", "\n", a ...); };
auto outSN = [](auto const & ... a) { outF(" " , ""  , a ...); };
auto outNL = [](auto const & ... a) { outF(""  , "\n", a ...); };
auto outSL = [](auto const & ... a) { outF(" " , "\n", a ...); };
auto out   = outSL;
template<typename A                > void disp_(A const & a) { * OS << a; }
template<typename A, typename ... T> void disp_(A const & a, string const & s, T const & ... t) { string ss; for(auto && e: a) { * OS << ss; ss = s; disp_(e, t ...); } }
auto dispI = [](auto const & a, auto const & s, auto const & ... t) { disp_(a, t ...); * OS << s << flush; };
auto dispT = [](auto const & a, auto const & s, auto const & ... t) { for(auto && e: a) { disp_(e, t ...); * OS << s; } * OS << flush; };
auto dispL = [](auto const & a,                 auto const & ... t) { dispT(a, "\n", t ...); };
struct OS_init { OS_init() { * OS << boolalpha << fixed << setprecision(20); } } os_init_;

// ---- ----

#include <atcoder/all>
using namespace atcoder;

using S = int;
S op(S a, S b) { return max(a, b); }
S e() { return 0; }

#define UQnoS(v) v.erase(unique(ALL(v)), v.end())
#define UQ(v) sort(ALL(v)); UQnoS(v)
#define LB(v, x) (lower_bound(ALL(v), x) - v.begin())
#define UB(v, x) (upper_bound(ALL(v), x) - v.begin())

int main() {
	int IN(h_, w_, q);
	auto Q = read_v<array<int, 3>>(q);
	
	auto info = [&](int x, int y) -> array<int, 5> {
		if(x ==      0) { return { 0,          y,          x, h_, w_ }; }
		if(y == h_ + 1) { return { 1,          x, h_ + 1 - y, w_, h_ }; }
		if(x == w_ + 1) { return { 2, h_ + 1 - y, w_ + 1 - x, h_, w_ }; }
		if(y ==      0) { return { 3, w_ + 1 - x,          y, w_, h_ }; }
		UR;
	};
	
	vector<vector<int>> v(4, { 0 });
	v[0].PB(h_ + 1);
	v[1].PB(w_ + 1);
	v[2].PB(h_ + 1);
	v[3].PB(w_ + 1);
	SF(Q, x, y, l) {
		auto [t, i, j, h, w] = info(x, y);
		v[t].PB(i);
	}
	RF(e, v) { UQ(e); }
	
	using ST = segtree<S, op, e>;
	vector<ST> st(4);
	inc(k, 4) { st[k] = ST(SI(v[k])); }
	SF(Q, x, y, len) {
		auto [t0, i, j, h, w] = info(x, y);
		assert(inII(i, 0, h) && j == 0);
		int t1 = (t0 + 1) % 4;
		int t2 = (t0 + 2) % 4;
		int t3 = (t0 + 3) % 4;
		int ii = h + 1 - i;
		int  I = LB(v[t0],  i);
		int II = LB(v[t2], ii);
		j = st[t0].get(I);
		
		vector<array<int, 3>> pos;
		pos.PB({ w + 1, -1, -1 });
		if(h + 1 - v[t2][II] == i) { pos.PB({ w + 1 - st[t2].get(II), t2, II }); }
		int R = st[t1].max_right(       0, [&](S a) -> bool { return (a < ii); });
		int L = st[t3].min_left(SI(v[t3]), [&](S a) -> bool { return (a <  i); }) - 1;
		if(R < SI(v[t1])) { assert(st[t1].get(R) >= ii); pos.PB({         v[t1][R], t1, R }); }
		if(L >= 0)        { assert(st[t3].get(L) >=  i); pos.PB({ w + 1 - v[t3][L], t3, L }); }
		sort(ALL(pos));
		
		auto [p, t, P] = pos.FR;
		if(p <= j + len) {
			if(t != -1) { st[t ].set(P, 0); }
			if(true)    { st[t0].set(I, 0); }
		} else {
			st[t0].set(I, j + len);
		}
	}
	LL ans = 0;
	inc(k, 4) {
	inc(i, SI(v[k])) {
		ans += st[k].get(i);
	}
	}
	out(ans);
}
yukicoder

結果

ソースコード
