結果
問題 | No.1707 Simple Range Reverse Problem |
ユーザー | stoq |
提出日時 | 2021-11-01 06:17:45 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 25 ms / 2,000 ms |
コード長 | 5,081 bytes |
コンパイル時間 | 5,365 ms |
コンパイル使用メモリ | 260,464 KB |
最終ジャッジ日時 | 2025-01-25 10:14:39 |
ジャッジサーバーID (参考情報) |
judge5 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 18 |
ソースコード
#define MOD_TYPE 1#include <bits/stdc++.h>using namespace std;#include <atcoder/all>//#include <atcoder/modint>//#include <atcoder/lazysegtree>using namespace atcoder;#if 0#include <boost/multiprecision/cpp_dec_float.hpp>#include <boost/multiprecision/cpp_int.hpp>using Int = boost::multiprecision::cpp_int;using lld = boost::multiprecision::cpp_dec_float_100;#endif#if 0#include <ext/pb_ds/assoc_container.hpp>#include <ext/pb_ds/tag_and_trait.hpp>#include <ext/pb_ds/tree_policy.hpp>#include <ext/rope>using namespace __gnu_pbds;using namespace __gnu_cxx;template <typename T>using extset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;#endif#if 1#pragma GCC target("avx2")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#endif#pragma region Macrosusing ll = long long int;using ld = long double;using pii = pair<int, int>;using pll = pair<ll, ll>;using pld = pair<ld, ld>;template <typename Q_type>using smaller_queue = priority_queue<Q_type, vector<Q_type>, greater<Q_type>>;#if MOD_TYPE == 1constexpr ll MOD = ll(1e9 + 7);#else#if MOD_TYPE == 2constexpr ll MOD = 998244353;#elseconstexpr ll MOD = 1000003;#endif#endifusing mint = static_modint<MOD>;constexpr int INF = (int)1e9 + 10;constexpr ll LINF = (ll)4e18;constexpr double PI = acos(-1.0);constexpr double EPS = 1e-11;constexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0};constexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0};#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)#define rep(i, n) REP(i, 0, n)#define REPI(i, m, n) for (int i = m; i < (int)(n); ++i)#define repi(i, n) REPI(i, 0, n)#define MP make_pair#define MT make_tuple#define YES(n) cout << ((n) ? "YES" : "NO") << "\n"#define Yes(n) cout << ((n) ? "Yes" : "No") << "\n"#define possible(n) cout << ((n) ? "possible" : "impossible") << "\n"#define Possible(n) cout << ((n) ? "Possible" : "Impossible") << "\n"#define Yay(n) cout << ((n) ? "Yay!" : ":(") << "\n"#define all(v) v.begin(), v.end()#define NP(v) next_permutation(all(v))#define dbg(x) cerr << #x << ":" << x << "\n";#define UNIQUE(v) v.erase(unique(all(v)), v.end())struct io_init {io_init() {cin.tie(nullptr);ios::sync_with_stdio(false);cout << setprecision(30) << setiosflags(ios::fixed);};} io_init;template <typename T>inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}template <typename T>inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}inline ll CEIL(ll a, ll b) { return (a + b - 1) / b; }template <typename A, size_t N, typename T>inline void Fill(A (&array)[N], const T& val) {fill((T*)array, (T*)(array + N), val);}template <typename T>vector<T> compress(vector<T>& v) {vector<T> val = v;sort(all(val)), val.erase(unique(all(val)), val.end());for (auto&& vi : v) vi = lower_bound(all(val), vi) - val.begin();return val;}template <typename T, typename U>constexpr istream& operator>>(istream& is, pair<T, U>& p) noexcept {is >> p.first >> p.second;return is;}template <typename T, typename U>constexpr ostream& operator<<(ostream& os, pair<T, U> p) noexcept {os << p.first << " " << p.second;return os;}ostream& operator<<(ostream& os, mint m) {os << m.val();return os;}ostream& operator<<(ostream& os, modint m) {os << m.val();return os;}random_device seed_gen;mt19937_64 engine(seed_gen());struct BiCoef {vector<mint> fact_, inv_, finv_;BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) {fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);for (int i = 2; i < n; i++) {fact_[i] = fact_[i - 1] * i;inv_[i] = -inv_[MOD % i] * (MOD / i);finv_[i] = finv_[i - 1] * inv_[i];}}mint C(ll n, ll k) const noexcept {if (n < k || n < 0 || k < 0) return 0;return fact_[n] * finv_[k] * finv_[n - k];}mint P(ll n, ll k) const noexcept { return C(n, k) * fact_[k]; }mint H(ll n, ll k) const noexcept { return C(n + k - 1, k); }mint Ch1(ll n, ll k) const noexcept {if (n < 0 || k < 0) return 0;mint res = 0;for (int i = 0; i < n; i++)res += C(n, i) * mint(n - i).pow(k) * (i & 1 ? -1 : 1);return res;}mint fact(ll n) const noexcept {if (n < 0) return 0;return fact_[n];}mint inv(ll n) const noexcept {if (n < 0) return 0;return inv_[n];}mint finv(ll n) const noexcept {if (n < 0) return 0;return finv_[n];}};BiCoef bc(500010);// -------------------------------void solve() {int n;cin >> n;vector<int> a(n * 2);rep(i, n * 2) cin >> a[i], a[i]--;vector<int> b(n * 2);rep(i, n) b[i] = b[i + n] = i;if (a == b) {Yes(1);return;}rep(i, n) {reverse(b.begin() + i + 1, b.begin() + i + n);if (a == b) {Yes(1);return;}reverse(b.begin() + i + 1, b.begin() + i + n);}Yes(0);}int main() {int testcase;cin >> testcase;while (testcase--) solve();}