結果
| 問題 | No.1707 Simple Range Reverse Problem |
| ユーザー |
 gazelle
|
| 提出日時 | 2021-10-15 21:31:33 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 29 ms / 2,000 ms |
| コード長 | 5,857 bytes |
| コンパイル時間 | 2,416 ms |
| コンパイル使用メモリ | 206,796 KB |
| 最終ジャッジ日時 | 2025-01-25 00:35:46 |
|
ジャッジサーバーID （参考情報） |
judge2 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 1 |
| other | AC * 18 |
ソースコード
#include <bits/stdc++.h>#define FOR(i, n, m) for(ll i = (n); i < (ll)(m); i++)#define REP(i, n) FOR(i, 0, n)#define ALL(v) v.begin(), v.end()#define pb push_backusing namespace std;using ll = long long;using ld = long double;using P = pair<ll, ll>;constexpr ll inf = 1000000000;constexpr ll mod = 998244353;constexpr long double eps = 1e-6;template<typename T1, typename T2>ostream& operator<<(ostream& os, pair<T1, T2> p) {os << to_string(p.first) << " " << to_string(p.second);return os;}template<typename T>ostream& operator<<(ostream& os, vector<T>& v) {REP(i, v.size()) {if(i) os << " ";os << v[i];}return os;}struct modint {ll n;public:modint(const ll n = 0) : n((n % mod + mod) % mod) {}static modint pow(modint a, int m) {modint r = 1;while(m > 0) {if(m & 1) { r *= a; }a = (a * a); m /= 2;}return r;}modint &operator++() { *this += 1; return *this; }modint &operator--() { *this -= 1; return *this; }modint operator++(int) { modint ret = *this; *this += 1; return ret; }modint operator--(int) { modint ret = *this; *this -= 1; return ret; }modint operator~() const { return (this -> pow(n, mod - 2)); } // inversefriend bool operator==(const modint& lhs, const modint& rhs) {return lhs.n == rhs.n;}friend bool operator<(const modint& lhs, const modint& rhs) {return lhs.n < rhs.n;}friend bool operator>(const modint& lhs, const modint& rhs) {return lhs.n > rhs.n;}friend modint &operator+=(modint& lhs, const modint& rhs) {lhs.n += rhs.n;if (lhs.n >= mod) lhs.n -= mod;return lhs;}friend modint &operator-=(modint& lhs, const modint& rhs) {lhs.n -= rhs.n;if (lhs.n < 0) lhs.n += mod;return lhs;}friend modint &operator*=(modint& lhs, const modint& rhs) {lhs.n = (lhs.n * rhs.n) % mod;return lhs;}friend modint &operator/=(modint& lhs, const modint& rhs) {lhs.n = (lhs.n * (~rhs).n) % mod;return lhs;}friend modint operator+(const modint& lhs, const modint& rhs) {return modint(lhs.n + rhs.n);}friend modint operator-(const modint& lhs, const modint& rhs) {return modint(lhs.n - rhs.n);}friend modint operator*(const modint& lhs, const modint& rhs) {return modint(lhs.n * rhs.n);}friend modint operator/(const modint& lhs, const modint& rhs) {return modint(lhs.n * (~rhs).n);}};istream& operator>>(istream& is, modint m) { is >> m.n; return is; }ostream& operator<<(ostream& os, modint m) { os << m.n; return os; }using mi = modint;ll mod_pow(__int128 a, __int128 n, __int128 m = mod) {using ll = __int128;ll ret = 1;ll tmp = a;while(n > 0) {if(n % 2) ret *= tmp;ret %= m;tmp = tmp * tmp;tmp %= m;n /= 2;}return ret % m;}constexpr int MAX_N = 2020202;mi mod_fact [MAX_N + 1];mi mod_fact_i[MAX_N + 1];mi mod_comb(long long n, long long k) {static bool initialized = false;if(n < 0 || k < 0 || n < k) return 0;if(not initialized) {mod_fact[0] = 1;for(int i = 1; i <= MAX_N; ++i) {mod_fact[i] = i * mod_fact[i - 1];}mod_fact_i[MAX_N] = mod_pow(mod_fact[MAX_N].n, mod - 2);for(int i = MAX_N - 1; i >= 0; --i) {mod_fact_i[i] = mod_fact_i[i + 1] * (i + 1);}initialized = true;}return mod_fact[n] * mod_fact_i[n - k] * mod_fact_i[k];}struct union_find {union_find(int n) : par_(n, -1) {}void init(int n) { par_.assign(n, -1); }int root(int x) { return par_[x] < 0 ? x : par_[x] = root(par_[x]); }bool unite(int x, int y) {x = root(x); y = root(y);if(x == y) return false;if(par_[x] < par_[y]) {par_[x] += par_[y];par_[y] = x;} else {par_[y] += par_[x];par_[x] = y;}return true;}bool same(int x, int y) { return root(x) == root(y); }int size(int x) { return -par_[root(x)]; }vector<int> par_;};ll gcd(ll a, ll b) {if (b == 0) return a;return gcd(b, a % b);}ll lcm(ll a, ll b) {ll g = gcd(a, b);return a / g * b;}ll N = 202020;ll bit[202020];void add(ll a, ll w) {a++;for (ll x = a; x <= N; x += x & -x) bit[x] += w;}ll sum(ll a) {a++;ll ret = 0;for (ll x = a; x > 0; x -= x & -x) ret += bit[x];return ret;}// return the sum of [a, b)ll sum(ll a, ll b) {ll ret = 0;if(b == 0) return 0;ret += sum(b - 1);if(a) ret -= sum(a - 1);return ret;}int main() {cin.tie(0);ios::sync_with_stdio(false);int T;cin >> T;REP(testcase, T) {int N;cin >> N;vector<int> X(2 * N);REP(i, N) X[i] = i + 1;REP(i, N) X[N + i] = i + 1;vector<int> A(2 * N);REP(i, 2 * N) cin >> A[i];if(A[0] != 1 || A[2 * N - 1] != N) {cout << "No" << endl;continue;}map<pair<int, int>, int> adjs;REP(i, 2 * N - 1) {adjs[make_pair(X[i], X[i + 1])] += 1;}bool ok = true;REP(i, 2 * N - 1) {auto p = make_pair(A[i], A[i + 1]);if(adjs[p] > 0) {adjs[p] -= 1;} else {swap(p.first, p.second);if(adjs[p] > 0) {adjs[p] -= 1;} else {ok = false;break;}}}if(ok) cout << "Yes" << endl;else cout << "No" << endl;}return 0;}