結果
| 問題 | No.1369 交換門松列・竹 |
| ユーザー |
|
| 提出日時 | 2020-11-03 16:48:26 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
WA
(最新)
AC
(最初)
|
| 実行時間 | - |
| コード長 | 6,350 bytes |
| コンパイル時間 | 2,999 ms |
| コンパイル使用メモリ | 223,640 KB |
| 最終ジャッジ日時 | 2025-01-15 19:21:32 |
|
ジャッジサーバーID （参考情報） |
judge4 / judge1 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 1 |
| other | AC * 31 WA * 2 |
ソースコード
#pragma GCC optimize ("O3")#include "bits/stdc++.h"using namespace std;using ll = long long int;#define all(v) (v).begin(),(v).end()#define repeat(cnt,l) for(typename remove_const<typename remove_reference<decltype(l)>::type>::type cnt={};(cnt)<(l);++(cnt))#define rrepeat(cnt,l) for(auto cnt=(l)-1;0<=(cnt);--(cnt))#define iterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);++(cnt))#define diterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);--(cnt))const long long MD = 1000000007ll; const long double PI = 3.1415926535897932384626433832795L;template<typename T1, typename T2> inline ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << '(' << p.first << ':' << p.second << ')';return o; }template<typename T> inline T& chmax(T& to, const T& val) { return to = max(to, val); }template<typename T> inline T& chmin(T& to, const T& val) { return to = min(to, val); }void bye(string s, int code = 0) { cout << s << endl; exit(code); }mt19937_64 randdev(8901016);template<typename T, typename Random = decltype(randdev), typename enable_if<is_integral<T>::value>::type* = nullptr>inline T rand(T l, T h, Random& rand = randdev) { return uniform_int_distribution<T>(l, h)(rand); }template<typename T, typename Random = decltype(randdev), typename enable_if<is_floating_point<T>::value>::type* = nullptr>inline T rand(T l, T h, Random& rand = randdev) { return uniform_real_distribution<T>(l, h)(rand); }template <typename I>struct MyRangeFormat{ I b,e; MyRangeFormat(I _b, I _e):b(_b),e(_e){} };template<typename I>static ostream& operator<<(ostream& o, const MyRangeFormat<I>& f) {o << "[ "; iterate(i,f.b,f.e) o<<*i<<' ';return o << ']';}template <typename I>struct MyMatrixFormat{const I& p; long long n, m;MyMatrixFormat(const I& _p, long long _n, long long _m):p(_p),n(_n),m(_m){}};template<typename I>static ostream& operator<<(ostream& o, const MyMatrixFormat<I>& f) {o<<'\n';repeat(i,(f.n)) {repeat(j,f.m) o<<f.p[i][j]<<' ';o<<'\n';}return o;}struct LOG_t { ~LOG_t() { cout << endl; } };#define LOG (LOG_t(),cout<<'L'<<__LINE__<<": ")#define FMTA(m,w) (MyRangeFormat<decltype(m+0)>(m,m+w))#define FMTR(b,e) (MyRangeFormat<decltype(e)>(b,e))#define FMTV(v) FMTR(v.begin(),v.end())#define FMTM(m,h,w) (MyMatrixFormat<decltype(m+0)>(m,h,w))#if defined(_WIN32) || defined(_WIN64)#define getc_x _getc_nolock#define putc_x _putc_nolock#elif defined(__GNUC__)#define getc_x getc_unlocked#define putc_x putc_unlocked#else#define getc_x getc#define putc_x putc#endifclass MaiScanner {FILE* fp_;constexpr bool isvisiblechar(char c) noexcept { return (0x21<=(c)&&(c)<=0x7E); }public:inline MaiScanner(FILE* fp):fp_(fp){}template<typename T> void input_integer(T& var) noexcept {var = 0; T sign = 1;int cc = getc_x(fp_);for (; cc < '0' || '9' < cc; cc = getc_x(fp_))if (cc == '-') sign = -1;for (; '0' <= cc && cc <= '9'; cc = getc_x(fp_))var = (var << 3) + (var << 1) + cc - '0';var = var * sign;}inline int c() noexcept { return getc_x(fp_); }template<typename T, typename enable_if<is_integral<T>::value, nullptr_t>::type = nullptr>inline MaiScanner& operator>>(T& var) noexcept { input_integer<T>(var); return *this; }inline MaiScanner& operator>>(string& var) {int cc = getc_x(fp_);for (; !isvisiblechar(cc); cc = getc_x(fp_));for (; isvisiblechar(cc); cc = getc_x(fp_))var.push_back(cc);return *this;}template<typename IT> inline void in(IT begin, IT end) { for (auto it = begin; it != end; ++it) *this >> *it; }};class MaiPrinter {FILE* fp_;public:inline MaiPrinter(FILE* fp):fp_(fp){}template<typename T>void output_integer(T var) noexcept {if (var == 0) { putc_x('0', fp_); return; }if (var < 0)putc_x('-', fp_),var = -var;char stack[32]; int stack_p = 0;while (var)stack[stack_p++] = '0' + (var % 10),var /= 10;while (stack_p)putc_x(stack[--stack_p], fp_);}inline MaiPrinter& operator<<(char c) noexcept { putc_x(c, fp_); return *this; }template<typename T, typename enable_if<is_integral<T>::value, nullptr_t>::type = nullptr>inline MaiPrinter& operator<<(T var) noexcept { output_integer<T>(var); return *this; }inline MaiPrinter& operator<<(char* str_p) noexcept { while (*str_p) putc_x(*(str_p++), fp_); return *this; }inline MaiPrinter& operator<<(const string& str) {const char* p = str.c_str();const char* l = p + str.size();while (p < l) putc_x(*p++, fp_);return *this;}template<typename IT> void join(IT begin, IT end, char sep = ' ') { for (bool b = 0; begin != end; ++begin, b = 1) b ? *this << sep << *begin :*this << *begin; }};MaiScanner scanner(stdin);MaiPrinter printer(stdout);//int N;int A[100010];//bool kkk(int a, int b, int c) {assert(a != 0 && b != 0 && c != 0);return ((a<b&&b>c)||(a>b&&b<c))&&(a!=c);}bool solve() {vector<int> miss;vector<int> head;repeat(i, N-2) {if (!kkk(A[i], A[i+1], A[i+2])) {miss.push_back(i);miss.push_back(i+1);miss.push_back(i+2);iterate(j, i-2, i+4) head.push_back(j);if (miss.size() > 15)return false;}}assert(!miss.empty());sort(miss.begin(), miss.end());miss.erase(unique(miss.begin(), miss.end()), miss.end());head.erase(remove_if(head.begin(), head.end(), [](int x){ return 0 > x || x >= N-2; }), head.end());sort(head.begin(), head.end());head.erase(unique(head.begin(), head.end()), head.end());// LOG << FMTV(miss);//for (auto m : miss) {if (m < 0 || N <= m) continue;repeat(i, N) {if (i == m) continue;// tryswap(A[i], A[m]);bool ok = true;// check invalid indicesfor (auto h : head) {ok &= kkk(A[h], A[h+1], A[h+2]);}// check around ifor (int j = max(i-2, 0); j <= min(i, N-3); ++j) {ok &= kkk(A[j], A[j+1], A[j+2]);}if (ok)return true;// revertswap(A[i], A[m]);}}//return false;}int main() {int t;scanner >> t;repeat(i, t) {scanner >> N;fill(A, A+N+10, 0);scanner.in(A, A+N);printer << (solve() ? "Yes\n" : "No\n");}return 0;}