結果
問題 | No.1707 Simple Range Reverse Problem |
ユーザー |
![]() |
提出日時 | 2021-10-15 21:46:36 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,587 bytes |
コンパイル時間 | 2,746 ms |
コンパイル使用メモリ | 200,380 KB |
最終ジャッジ日時 | 2025-01-25 00:43:36 |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 7 WA * 11 |
ソースコード
#include <bits/stdc++.h>#define REP_(i, a_, b_, a, b, ...) \for (int i = (a), END_##i = (b); i < END_##i; ++i)#define REP(i, ...) REP_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)#define ALL(x) std::begin(x), std::end(x)using i64 = long long;template<typename T, typename U>inline bool chmax(T &a, U b) {return a < b and ((a = std::move(b)), true);}template<typename T, typename U>inline bool chmin(T &a, U b) {return a > b and ((a = std::move(b)), true);}template<typename T>inline int ssize(const T &a) {return (int) a.size();}template<class T>inline std::ostream &print_one(const T &x, char endc) {if constexpr (std::is_same_v<T, bool>) {return std::cout << (x ? "Yes" : "No") << endc;} else {return std::cout << x << endc;}}template<class T>inline std::ostream &print(const T &x) { return print_one(x, '\n'); }template<typename T, typename... Ts>std::ostream &print(const T &head, Ts... tail) {return print_one(head, ' '), print(tail...);}inline std::ostream &print() { return std::cout << '\n'; }template<typename Container>std::ostream &print_seq(const Container &a, std::string_view sep = " ",std::string_view ends = "\n",std::ostream &os = std::cout) {auto b = std::begin(a), e = std::end(a);for (auto it = std::begin(a); it != e; ++it) {if (it != b) os << sep;os << *it;}return os << ends;}template<typename T, typename = void>struct is_iterable : std::false_type {};template<typename T>struct is_iterable<T, std::void_t<decltype(std::begin(std::declval<T>())),decltype(std::end(std::declval<T>()))>>: std::true_type {};template<typename T, typename = std::enable_if_t<is_iterable<T>::value && !std::is_same<T, std::string>::value>>std::ostream &operator<<(std::ostream &os, const T &a) {return print_seq(a, ", ", "", (os << "{")) << "}";}struct VersatileInput {template<typename T>operator T() const {T x;std::cin >> x;return x;}struct Sized {std::size_t n;template<typename T>operator T() const {T x(n);for (auto &e: x) std::cin >> e;return x;}};Sized operator()(std::size_t n) const { return {n}; }} const in;inline void check(bool cond, const char *message = "!ERROR!") {if (not cond) throw std::runtime_error(message);}#ifdef MY_DEBUG#include "debug_dump.hpp"#else#define DUMP(...)#define cerr if(false)std::cerr#endifusing namespace std;auto solve() {const int n = in;const int n2 = n * 2;vector<int> a = in(n2);auto sa = a;sort(ALL(sa));vector<int> ini(n2);REP(i, n) ini[i] = ini[i + n] = i + 1;auto sini = ini;sort(ALL(sini));DUMP(ini);DUMP(sa);if (a == ini) return true;if (sa != sini) return false;if (a[0] != 1 or a.back() != n) return false;int mid = -1;REP(i, 1, n2 - 1) {if (a[i] == 1) {mid = i;break;}}if (mid == -1)return false;if (a[mid + 1] != n) return false;DUMP(a);DUMP(mid, a[mid], a[mid + 1]);for (int i = 1;; ++i) {int j = mid - i;if (i > j) break;if (a[i] != i + 1 or a[j] != i + 1) return false;}for (int i = 1;; ++i) {int j = mid + i;if (n - i < j) break;if (a[n - i] != (n + 1 - i) or a[j] != (n + 1 - i)) return false;}return true;}int main() {ios_base::sync_with_stdio(false), cin.tie(nullptr);cout << std::fixed << std::setprecision(18);const int T = in;REP(t, T) {auto ans = solve();print(ans);}}