#define _USE_MATH_DEFINES #include #include using namespace std; /* #include using namespace atcoder; */ /* #include #include using bll = boost::multiprecision::cpp_int; using bdouble = boost::multiprecision::number>; using namespace boost::multiprecision; */ #if defined(LOCAL_TEST) || defined(LOCAL_DEV) #define BOOST_STACKTRACE_USE_ADDR2LINE #define BOOST_STACKTRACE_ADDR2LINE_LOCATION /usr/local/opt/binutils/bin/addr2line #define _GNU_SOURCE 1 #include #endif #ifdef LOCAL_TEST namespace std { template class dvector : public std::vector { public: using std::vector::vector; template , std::nullptr_t> = nullptr> std::vector::reference operator[](std::size_t n) { if (this->size() <= n) { std::cerr << boost::stacktrace::stacktrace() << '\n' << "vector::_M_range_check: __n (which is " << n << ") >= this->size() (which is " << this->size() << ")" << '\n'; } return this->at(n); } template , std::nullptr_t> = nullptr> const T_ operator[](std::size_t n) const { if (this->size() <= n) { std::cerr << boost::stacktrace::stacktrace() << '\n' << "vector::_M_range_check: __n (which is " << n << ") >= this->size() (which is " << this->size() << ")" << '\n'; } return this->at(n); } template , std::nullptr_t> = nullptr> T_& operator[](std::size_t n) { if (this->size() <= n) { std::cerr << boost::stacktrace::stacktrace() << '\n' << "vector::_M_range_check: __n (which is " << n << ") >= this->size() (which is " << this->size() << ")" << '\n'; } return this->at(n); } template , std::nullptr_t> = nullptr> const T_& operator[](std::size_t n) const { if (this->size() <= n) { std::cerr << boost::stacktrace::stacktrace() << '\n' << "vector::_M_range_check: __n (which is " << n << ") >= this->size() (which is " << this->size() << ")" << '\n'; } return this->at(n); } }; template , typename Allocator = std::allocator> class dmultiset : public std::multiset { public: using std::multiset::multiset; const typename std::multiset::iterator erase(const typename std::multiset::iterator it) { return std::multiset::erase(it); } std::size_t erase([[maybe_unused]] const T& x) { std::cerr << boost::stacktrace::stacktrace() << '\n'; assert(false); } std::size_t erase_all_elements(const T& x) { return std::multiset::erase(x); } }; } #define vector dvector #define multiset dmultiset class SIGFPE_exception : std::exception {}; class SIGSEGV_exception : std::exception {}; void catch_SIGFPE([[maybe_unused]] int e) { std::cerr << boost::stacktrace::stacktrace() << '\n'; throw SIGFPE_exception(); } void catch_SIGSEGV([[maybe_unused]] int e) { std::cerr << boost::stacktrace::stacktrace() << '\n'; throw SIGSEGV_exception(); } signed convertedmain(); signed main() { signal(SIGFPE, catch_SIGFPE); signal(SIGSEGV, catch_SIGSEGV); return convertedmain(); } #define main() convertedmain() #else #define erase_all_elements erase #endif #ifdef LOCAL_DEV template std::ostream& operator<<(std::ostream& s, const std::pair& p) { return s << "(" << p.first << ", " << p.second << ")"; } template std::ostream& operator<<(std::ostream& s, const std::array& a) { s << "{ "; for (std::size_t i = 0; i < N; ++i){ s << a[i] << "\t"; } s << "}"; return s; } template std::ostream& operator<<(std::ostream& s, const std::set& se) { s << "{ "; for (auto itr = se.begin(); itr != se.end(); ++itr){ s << (*itr) << "\t"; } s << "}"; return s; } template std::ostream& operator<<(std::ostream& s, const std::multiset& se) { s << "{ "; for (auto itr = se.begin(); itr != se.end(); ++itr){ s << (*itr) << "\t"; } s << "}"; return s; } template std::ostream& operator<<(std::ostream& s, const std::map& m) { s << "{\n"; for (auto itr = m.begin(); itr != m.end(); ++itr){ s << "\t" << (*itr).first << " : " << (*itr).second << "\n"; } s << "}"; return s; } template std::ostream& operator<<(std::ostream& s, const std::deque& v) { for (std::size_t i = 0; i < v.size(); ++i){ s << v[i]; if (i < v.size() - 1) s << "\t"; } return s; } template std::ostream& operator<<(std::ostream& s, const std::vector& v) { for (std::size_t i = 0; i < v.size(); ++i){ s << v[i]; if (i < v.size() - 1) s << "\t"; } return s; } template std::ostream& operator<<(std::ostream& s, const std::vector>& vv) { s << "\\\n"; for (std::size_t i = 0; i < vv.size(); ++i){ s << vv[i] << "\n"; } return s; } template , std::nullptr_t> = nullptr> std::ostream& operator<<(std::ostream& s, const T (&v)[N]) { for (std::size_t i = 0; i < N; ++i){ s << v[i]; if (i < N - 1) s << "\t"; } return s; } template , std::nullptr_t> = nullptr> std::ostream& operator<<(std::ostream& s, const T (&vv)[N][M]) { s << "\\\n"; for (std::size_t i = 0; i < N; ++i){ s << vv[i] << "\n"; } return s; } #if __has_include() template std::ostream& operator<<(std::ostream& s, const __gnu_pbds::tree& se) { s << "{ "; for (auto itr = se.begin(); itr != se.end(); ++itr){ s << (*itr) << "\t"; } s << "}"; return s; } template std::ostream& operator<<(std::ostream& s, const __gnu_pbds::gp_hash_table& m) { s << "{\n"; for (auto itr = m.begin(); itr != m.end(); ++itr){ s << "\t" << (*itr).first << " : " << (*itr).second << "\n"; } s << "}"; return s; } #endif void debug_impl() { std::cerr << '\n'; } template void debug_impl(Head& head, Tail&... tail) { std::cerr << " " << head << (sizeof...(tail) ? "," : ""); debug_impl(tail...); } template void debug_impl(const Head& head, const Tail&... tail) { std::cerr << " " << head << (sizeof...(tail) ? "," : ""); debug_impl(tail...); } #define debug(...) do { std::cerr << ":" << __LINE__ << " (" << #__VA_ARGS__ << ") ="; debug_impl(__VA_ARGS__); } while (false) constexpr inline long long prodlocal([[maybe_unused]] long long prod, [[maybe_unused]] long long local) { return local; } #else #define debug(...) do {} while (false) constexpr inline long long prodlocal([[maybe_unused]] long long prod, [[maybe_unused]] long long local) { return prod; } #endif //#define int long long using ll = long long; //INT_MAX = (1<<31)-1 = 2147483647, INT64_MAX = (1LL<<63)-1 = 9223372036854775807 constexpr ll INF = std::numeric_limits::max() == INT_MAX ? (ll)1e9 + 7 : (ll)1e18; constexpr ll MOD = (ll)1e9 + 7; //primitive root = 5 //constexpr ll MOD = 998244353; //primitive root = 3 constexpr double EPS = 1e-9; constexpr ll dx[4] = {1, 0, -1, 0}; constexpr ll dy[4] = {0, 1, 0, -1}; constexpr ll dx8[8] = {1, 0, -1, 0, 1, 1, -1, -1}; constexpr ll dy8[8] = {0, 1, 0, -1, 1, -1, 1, -1}; #define repoverload3(_1, _2, _3, name, ...) name #define rep3(i, a, b) for(ll i=(a), i##_length=(b); i=(a); --i) #define rrep2(i, n) rrep3(i, 0, n) #define rrep1(n) rrep3(i, 0, n) #define rrep(...) repoverload3(__VA_ARGS__, rrep3, rrep2, rrep1)(__VA_ARGS__) #define rrepeq3(i, a, b) rrep3(i, (a)+1, (b)+1) #define rrepeq2(i, n) rrep3(i, 1, (n)+1) #define rrepeq1(n) rrep3(i, 1, (n)+1) #define rrepeq(...) repoverload3(__VA_ARGS__, rrepeq3, rrepeq2, rrepeq1)(__VA_ARGS__) #define all(v) std::begin(v), std::end(v) #define rall(v) std::rbegin(v), std::rend(v) void p() { std::cout << '\n'; } template void p(Head& head, Tail&... tail) { std::cout << head << (sizeof...(tail) ? " " : ""); p(tail...); } template void p(const Head& head, const Tail&... tail) { std::cout << head << (sizeof...(tail) ? " " : ""); p(tail...); } template inline void pv(const std::vector& v) { for(ll i=0, N=v.size(); i inline bool chmax(T& a, T b) { return a < b && (a = b, true); } template inline bool chmin(T& a, T b) { return a > b && (a = b, true); } template inline void uniq(std::vector& v) { std::sort(v.begin(), v.end()); v.erase(std::unique(v.begin(), v.end()), v.end()); } template inline ll sz(const T& v) { return std::size(v); } template std::vector make_vector_impl(std::vector& sizes, typename std::enable_if<(N==1), const T&>::type x) { return std::vector(sizes.front(),x); } template auto make_vector_impl(std::vector& sizes, typename std::enable_if<(N>1), const T&>::type x) { ll size=sizes.back(); sizes.pop_back(); return std::vector(sizes,x))>(size,make_vector_impl(sizes,x)); } template auto make_vector(const ll (&sizes)[N], const T& x=T()) { std::vector s(N); for(std::size_t i=0; i(s,x); } #if __has_include() template , typename std::enable_if_t, std::nullptr_t> = nullptr> class fmap : public __gnu_pbds::gp_hash_table { public: using __gnu_pbds::gp_hash_table::gp_hash_table; template fmap(std::initializer_list> il) : __gnu_pbds::gp_hash_table() { for (auto&& x : il) __gnu_pbds::gp_hash_table::insert(std::pair(*x.begin(), *(x.begin() + 1))); } template ll count(const T& x) const { return __gnu_pbds::gp_hash_table::find(x) != __gnu_pbds::gp_hash_table::end(); } }; #else template using fmap = std::map; #endif template class each_hepler { public: class iterator { public: ll _pos; typename T::iterator _it; iterator(typename T::iterator it): _pos(0), _it(it) {} std::pair::reference> operator*() const { return {_pos, *_it}; } iterator& operator++() { ++_pos; ++_it; return *this; } iterator operator++(int) { iterator tmp(*this); ++*this; return tmp; } bool operator==(iterator const& it) const { return _it == it._it; } bool operator!=(iterator const& it) const { return !(*this == it); } }; T& _container; each_hepler(T& t): _container(t) {} iterator begin() const { return iterator(_container.begin()); } iterator end() const { return iterator(_container.end()); } }; template each_hepler each(T& t) { return each_hepler(t); } // for (auto&& [i, val] : each(v)) template class zip_helper { public: class iterator : std::iterator().begin())...>> { private: std::tuple().begin())...> iters_; template auto deref(std::index_sequence) const { return typename iterator::value_type{*std::get(iters_)...}; } template void increment(std::index_sequence) { [[maybe_unused]] auto l = {(++std::get(iters_), 0)...}; } public: explicit iterator(decltype(iters_) iters) : iters_{std::move(iters)} {} iterator& operator++() { increment(std::index_sequence_for{}); return *this; } iterator operator++(int) { auto saved{*this}; increment(std::index_sequence_for{}); return saved; } bool operator!=(const iterator& other) const { return iters_ != other.iters_; } auto operator*() const { return deref(std::index_sequence_for{}); } }; zip_helper(T&... seqs) : begin_{std::make_tuple(seqs.begin()...)}, end_{std::make_tuple(seqs.end()...)} {} iterator begin() const { return begin_; } iterator end() const { return end_; } private: iterator begin_, end_; }; template auto zip(T&&... seqs) { return zip_helper{seqs...}; } // for (auto&& [a, b, c] : zip(A, B, C)) /*-----8<-----template-----8<-----*/ //[lib]manachar.cpp class Manacher { public: vector r; Manacher(const vector &a) { build(a); } Manacher(const string& s) { vector a(s.size()); for (int i = 0; i < (int)s.size(); i++) a[i] = s[i]; build(a); } void build(const vector &s) { ll n = s.size(); ll m = 2*n+1; vector d(m, INF); for(ll i = 0; i < n; i++){ d[2*i+1]=s[i]; } r.assign(m,0); ll i = 0, j = 0; while (i < m) { while (j <= i && i < m-j && d[i-j] == d[i+j]) { j++; } r[i] = j; ll k = 1; while (k <= i && i < m-k && k+r[i-k] < j) { r[i+k] = r[i-k]; k++; } i += k; j -= k; } } //区間[left, right)が回文になっているかを判定 bool is_palindrome(ll left, ll right) { ll mid = left+right; return 2*right-1 < mid+r[mid]; } }; /*-----8<-----library-----8<-----*/ void solve() { ll N; cin >> N; N <<= 1; vector a(N); rep(i, N) cin >> a[i], a[i]--; if ([&] { rep(k, 2) rep(i, N >> 1) if (a[k * (N>>1) + i] != i) return false; return true; }()) { p("Yes"); return; } { map m; for (auto&& c : a) m[c]++; rep(i,N>>1){ if(m[i]!=2){ p("No"); return; } } } Manacher mana(a); for (ll i = 1; i < N; i += 2) { if(mana.is_palindrome(0,i) && mana.is_palindrome(i,N)){ bool ok=true; ll index = 0; ll len = i; rep(j, len / 2 + 1) { if (a[j] == a[len - 1 - j] && a[j]==index){ } else{ ok = false; } index++; } index = (N >> 1) - 1; len = N - i; rep(j, len / 2 + 1) { if (a[i+j] == a[i+len - 1 - j] && a[i+j] == index) { } else { ok = false; } index--; } if(ok){ p("Yes"); return; } } } p("No"); } signed main() { #ifndef LOCAL_DEV std::cin.tie(nullptr); std::ios::sync_with_stdio(false); #endif ll Q; cin >> Q; while(Q--)solve(); //solve(); return 0; }