結果

問題 No.1369 交換門松列・竹
ユーザー hitonanodehitonanode
提出日時 2021-01-29 21:42:07
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 5,394 bytes
コンパイル時間 2,123 ms
コンパイル使用メモリ 207,008 KB
実行使用メモリ 6,948 KB
最終ジャッジ日時 2024-06-27 07:53:46
合計ジャッジ時間 3,638 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 WA -
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 2 ms
5,376 KB
testcase_04 AC 2 ms
5,376 KB
testcase_05 AC 2 ms
5,376 KB
testcase_06 AC 2 ms
5,376 KB
testcase_07 AC 2 ms
5,376 KB
testcase_08 AC 2 ms
5,376 KB
testcase_09 AC 2 ms
5,376 KB
testcase_10 AC 2 ms
5,376 KB
testcase_11 AC 2 ms
5,376 KB
testcase_12 AC 2 ms
5,376 KB
testcase_13 AC 7 ms
5,376 KB
testcase_14 WA -
testcase_15 AC 7 ms
5,376 KB
testcase_16 AC 25 ms
5,376 KB
testcase_17 AC 26 ms
5,376 KB
testcase_18 WA -
testcase_19 AC 14 ms
5,376 KB
testcase_20 AC 41 ms
5,376 KB
testcase_21 AC 15 ms
5,376 KB
testcase_22 AC 42 ms
5,376 KB
testcase_23 WA -
testcase_24 AC 60 ms
5,376 KB
testcase_25 AC 35 ms
5,376 KB
testcase_26 WA -
testcase_27 WA -
testcase_28 AC 56 ms
5,376 KB
testcase_29 AC 5 ms
5,376 KB
testcase_30 AC 7 ms
5,376 KB
testcase_31 AC 7 ms
5,376 KB
testcase_32 WA -
testcase_33 AC 19 ms
5,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T, typename V>
void ndarray(vector<T>& vec, const V& val, int len) { vec.assign(len, val); }
template <typename T, typename V, typename... Args> void ndarray(vector<T>& vec, const V& val, int len, Args... args) { vec.resize(len), for_each(begin(vec), end(vec), [&](T& v) { ndarray(v, val, args...); }); }
template <typename T> bool chmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template <typename T> bool chmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }
template <typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template <typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template <typename T> vector<T> sort_unique(vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto &v : vec) is >> v; return is; }
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <typename T, size_t sz> ostream &operator<<(ostream &os, const array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }
#if __cplusplus >= 201703L
template <typename... T> istream &operator>>(istream &is, tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <typename... T> ostream &operator<<(ostream &os, const tuple<T...> &tpl) { std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os; }
#endif
template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T, typename TH> ostream &operator<<(ostream &os, const unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa) { os << '(' << pa.first << ',' << pa.second << ')'; return os; }
template <typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <typename TK, typename TV, typename TH> ostream &operator<<(ostream &os, const unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#ifdef HITONANODE_LOCAL
const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m";
#define dbg(x) cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << endl
#else
#define dbg(x) (x)
#endif

template <typename T> bool kado(T a, T b, T c) {
    if (a == b or b == c or a == c) return false;
    if (a < b and b > c) return true;
    if (a > b and b < c) return true;
    return false;
}

bool solve()
{
    int N;
    cin >> N;
    vector<int> A(N);
    cin >> A;
    vector<int> bads{0, N - 1};
    FOR(i, 1, N - 1) {
        if (!kado(A[i - 1], A[i], A[i + 1])) bads.push_back(i);
    }
    if (int(bads.size()) > 10) return false;

    auto swp_chk = [&](int i, int j) -> bool {
        swap(A[i], A[j]);
        bool ret = true;
        for (auto b : bads) {
            FOR(k, max(1, b - 1), min(N - 1, b + 2)) {
                if (!kado(A[k - 1], A[k], A[k + 1])) ret = false;
            }
        }

        FOR(k, max(1, i - 1), min(N - 1, i + 2)) {
            if (!kado(A[k - 1], A[k], A[k + 1])) ret = false;
        }
        FOR(k, max(1, j - 1), min(N - 1, j + 2)) {
            if (!kado(A[k - 1], A[k], A[k + 1])) ret = false;
        }
        swap(A[i], A[j]);
        return ret;
    };

    for (auto i : bads) {
        REP(j, N) if (swp_chk(i, j)) return true;
    }
    return false;
}

int main() {
    int T;
    cin >> T;
    while (T--) cout << (solve() ? "Yes" : "No") << '\n';
}
0