結果

問題 No.1328 alligachi-problem
ユーザー FF256grhyFF256grhy
提出日時 2020-12-25 04:02:03
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
CE  
(最新)
AC  
(最初)
実行時間 -
コード長 5,878 bytes
コンパイル時間 2,806 ms
コンパイル使用メモリ 198,020 KB
最終ジャッジ日時 2025-01-17 07:02:57
ジャッジサーバーID
（参考情報） 		judge1 / judge1
このコードへのチャレンジ
（要ログイン）
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。（リジャッジ後のコンパイルエラーは公開されます）
ただし、clay言語の場合は開発者のデバッグのため、公開されます。

コンパイルメッセージ
main.cpp: In instantiation of ‘void out_(std::string, A&&) [with A = std::vector<int>&; std::string = std::__cxx11::basic_string<char>]’:
main.cpp:74:102:   required from ‘void out_(std::string, A&&, B&& ...) [with A = const char*&; B = {std::vector<int, std::allocator<int> >&}; std::string = std::__cxx11::basic_string<char>]’
main.cpp:75:71:   required from ‘<lambda(auto:48, auto:49, auto:50, auto:51 ...)> [with auto:48 = const char*; auto:49 = const char*; auto:50 = const char*; auto:51 = {const char*, std::vector<int, std::allocator<int> >}]’
main.cpp:78:34:   required from ‘<lambda(auto:54 ...)> [with auto:54 = {const char*, std::vector<int, std::allocator<int> >}]’
main.cpp:160:6:   required from here
main.cpp:73:76: error: no match for ‘operator<<’ (operand types are ‘std::basic_ostream<char>’ and ‘std::vector<int>’)
   73 | template<typename A> void out_([[maybe_unused]] string s, A && a) { (* OS) << a; }
      |                                                                     ~~~~~~~^~~~
In file included from /usr/include/c++/13/istream:41,
                 from /usr/include/c++/13/sstream:40,
                 from /usr/include/c++/13/complex:45,
                 from /usr/include/c++/13/ccomplex:39,
                 from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:127,
                 from main.cpp:1:
/usr/include/c++/13/ostream:110:7: note: candidate: ‘std::basic_ostream<_CharT, _Traits>::__ostream_type& std::basic_ostream<_CharT, _Traits>::operator<<(__ostream_type& (*)(__ostream_type&)) [with _CharT = char; _Traits = std::char_traits<char>; __ostream_type = std::basic_ostream<char>]’
  110 |       operator<<(__ostream_type& (*__pf)(__ostream_type&))
      |       ^~~~~~~~
/usr/include/c++/13/ostream:110:36: note:   no known conversion for argument 1 from ‘std::vector<int>’ to ‘std::basic_ostream<char>::__ostream_type& (*)(std::basic_ostream<char>::__ostream_type&)’ {aka ‘std::basic_ostream<char>& (*)(s

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using LL = long long int;
#define incII(i, l, r) for(LL i = (l)    ; i <= (r); i++)
#define incIX(i, l, r) for(LL i = (l)    ; i <  (r); i++)
#define incXI(i, l, r) for(LL i = (l) + 1; i <= (r); i++)
#define incXX(i, l, r) for(LL i = (l) + 1; i <  (r); i++)
#define decII(i, l, r) for(LL i = (r)    ; i >= (l); i--)
#define decIX(i, l, r) for(LL i = (r) - 1; i >= (l); i--)
#define decXI(i, l, r) for(LL i = (r)    ; i >  (l); i--)
#define decXX(i, l, r) for(LL 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 x, auto l, auto r) { return (l <= x && x <= r); };
auto inIX = [](auto x, auto l, auto r) { return (l <= x && x <  r); };
auto inXI = [](auto x, auto l, auto r) { return (l <  x && x <= r); };
auto inXX = [](auto x, auto l, auto r) { return (l <  x && x <  r); };
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 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(c) c.begin(), c.end()
#define RALL(c) c.rbegin(), c.rend()
#define RV(c) reverse(ALL(c))
#define SC static_cast
#define SI(c) SC<int>(c.size())
#define SL(c) SC<LL >(c.size())
#define RF(e, c) for(auto & e: c)
#define SF(c, ...) for(auto & [__VA_ARGS__]: c)
#define until(e) while(! (e))
#define if_not(e) if(! (e))
#define ef else if
#define UR assert(false)
auto * IS = & cin;
auto * OS = & cout;
array<string, 3> SEQ = { "", " ", "" };
// input
template<typename T> T in() { T a; (* IS) >> a; return a; }
// input: tuple
template<int I, typename U> void tin_(istream & is, U & t) {
	if constexpr(I < tuple_size<U>::value) { is >> get<I>(t); tin_<I + 1>(is, t); }
}
template<typename ... T> istream & operator>>(istream & is, tuple<T ...> & t) { tin_<0>(is, t); return is; }
template<typename ... T> auto tin() { return in<tuple<T ...>>(); }
// input: array
template<typename T, size_t N> istream & operator>>(istream & is, array<T, N> & a) { RF(e, a) { is >> e; } return is; }
template<typename T, size_t N> auto ain() { return in<array<T, N>>(); }
// input: multi-dimensional vector
template<typename T> T vin() { T v; (* IS) >> v; return v; }
template<typename T, typename N, typename ... M> auto vin(N n, M ... m) {
	vector<decltype(vin<T, M ...>(m ...))> v(n); inc(i, n) { v[i] = vin<T, M ...>(m ...); } return v;
}
// input: multi-column (tuple<vector>)
template<typename U, int I> void colin_([[maybe_unused]] U & t) { }
template<typename U, int I, typename A, typename ... B> void colin_(U & t) {
	get<I>(t).PB(in<A>()); colin_<U, I + 1, B ...>(t);
}
template<typename ... T> auto colin(int n) {
	tuple<vector<T> ...> t; inc(i, n) { colin_<tuple<vector<T> ...>, 0, T ...>(t); } return t;
}
// output
void out_([[maybe_unused]] string s) { }
template<typename A> void out_([[maybe_unused]] string s, A && a) { (* OS) << a; }
template<typename A, typename ... B> void out_(string s, A && a, B && ... b) { (* OS) << a << s; out_(s, b ...); }
auto outF = [](auto x, auto y, auto z, auto ... a) { (* OS) << x; out_(y, a ...); (* OS) << z << flush; };
auto out  = [](auto ... a) { outF("", " " , "\n", a ...); };
auto outS = [](auto ... a) { outF("", " " , " " , a ...); };
auto outL = [](auto ... a) { outF("", "\n", "\n", a ...); };
auto outN = [](auto ... a) { outF("", ""  , ""  , a ...); };
// output: multi-dimensional vector
template<typename T> ostream & operator<<(ostream & os, vector<T> const & v) {
	os << SEQ[0]; inc(i, SI(v)) { os << (i == 0 ? "" : SEQ[1]) << v[i]; } return (os << SEQ[2]);
}
template<typename T> void vout_(T && v) { (* OS) << v; }
template<typename T, typename A, typename ... B> void vout_(T && v, A a, B ... b) {
	inc(i, SI(v)) { (* OS) << (i == 0 ? "" : a); vout_(v[i], b ...); }
}
template<typename T, typename A, typename ... B> void vout (T && v, A a, B ... b) { vout_(v, a, b ...); (* OS) << a << flush; }
template<typename T, typename A, typename ... B> void voutN(T && v, A a, B ... b) { vout_(v, a, b ...); (* OS)      << flush; }

// ---- ----

// make vector
template<typename T> T MV(T v) { return v; }
template<typename T, typename ... U> auto MV(T v, int a, U ... b) { return vector<decltype(MV(v, b ...))>(a, MV(v, b ...)); }

int main() {
	using S = array<int, 3>;
	
	auto n = in<int>();
	auto v = MV<vector<S>>({}, 2, 2);
	inc1(id, n) {
		int c = (in<string>() == "R" ? 0 : 1);
		int x = (in<string>() == "R" ? 0 : 1);
		auto y = in<int>();
		v[c][x].PB({ x, y, SC<int>(id) });
	}
	inc(i, 2) {
	inc(j, 2) {
		sort(ALL(v[i][j]));
	}
	}
	
	auto no = [] { out("No"); exit(0); };
	auto zip = [&](int c) -> vector<S> {
		int d = 1 - c;
		auto & A = v[c][c];
		auto & B = v[c][d];
		vector<S> z;
		int j = 0;
		inc(i, SI(A)) {
			until(SI(z) == A[i][1]) {
				if_not(j < SI(B)) { no(); }
				z.PB(B[j++]);
			}
			z.PB(A[i]);
		}
		while(j < SI(B)) { z.PB(B[j++]); }
		return z;
	};
	auto A = zip(0);
	auto B = zip(1);
	
	using E = array<int, 2>;
	vector<E> e;
	inc(i, SI(A)) {
		auto [x, y, id] = A[i];
		if(x == 1) {
			e.PB({ SC<int>(i + 0), y });
			e.PB({ SC<int>(i + 1), y });
		}
	}
	inc(i, SI(B)) {
		auto [x, y, id] = B[i];
		if(x == 0) {
			e.PB({ y, SC<int>(i + 0) });
			e.PB({ y, SC<int>(i + 1) });
		}
	}
	e.PB({ SI(A), SI(B) });
	sort(ALL(e));
	inc(i, SI(e) - 1) { if_not(e[i][1] <= e[i + 1][1]) { no(); } }
	
	vector<int> ans;
	int i = 0, j = 0;
	SF(e, a, b) {
		while(i < a) { ans.PB(A[i++][2]); }
		while(j < b) { ans.PB(B[j++][2]); }
	}
	outL("Yes", ans);
}
0