結果
| 問題 |
No.1369 交換門松列・竹
|
| コンテスト | |
| ユーザー |
 rniya
|
| 提出日時 | 2021-02-05 17:06:13 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 6,267 bytes |
| コンパイル時間 | 3,091 ms |
| コンパイル使用メモリ | 201,368 KB |
| 最終ジャッジ日時 | 2025-01-18 11:49:13 |
|
ジャッジサーバーID （参考情報） |
judge5 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 1 |
| other | AC * 30 WA * 3 |
ソースコード
#define LOCAL
#include <bits/stdc++.h>
using namespace std;
#pragma region Macros
typedef long long ll;
typedef __int128_t i128;
typedef unsigned int uint;
typedef unsigned long long ull;
#define ALL(x) (x).begin(), (x).end()
template <typename T> istream& operator>>(istream& is, vector<T>& v) {
for (T& x : v) is >> x;
return is;
}
template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) {
for (int i = 0; i < (int)v.size(); i++) {
os << v[i] << (i + 1 == (int)v.size() ? "" : " ");
}
return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) {
os << '(' << p.first << ',' << p.second << ')';
return os;
}
template <typename T, typename U, typename V> ostream& operator<<(ostream& os, const tuple<T, U, V>& t) {
os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ')';
return os;
}
template <typename T, typename U, typename V, typename W> ostream& operator<<(ostream& os, const tuple<T, U, V, W>& t) {
os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ',' << get<3>(t) << ')';
return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& m) {
os << '{';
for (auto itr = m.begin(); itr != m.end();) {
os << '(' << itr->first << ',' << itr->second << ')';
if (++itr != m.end()) os << ',';
}
os << '}';
return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const unordered_map<T, U>& m) {
os << '{';
for (auto itr = m.begin(); itr != m.end();) {
os << '(' << itr->first << ',' << itr->second << ')';
if (++itr != m.end()) os << ',';
}
os << '}';
return os;
}
template <typename T> ostream& operator<<(ostream& os, const set<T>& s) {
os << '{';
for (auto itr = s.begin(); itr != s.end();) {
os << *itr;
if (++itr != s.end()) os << ',';
}
os << '}';
return os;
}
template <typename T> ostream& operator<<(ostream& os, const multiset<T>& s) {
os << '{';
for (auto itr = s.begin(); itr != s.end();) {
os << *itr;
if (++itr != s.end()) os << ',';
}
os << '}';
return os;
}
template <typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s) {
os << '{';
for (auto itr = s.begin(); itr != s.end();) {
os << *itr;
if (++itr != s.end()) os << ',';
}
os << '}';
return os;
}
template <typename T> ostream& operator<<(ostream& os, const deque<T>& v) {
for (int i = 0; i < (int)v.size(); i++) {
os << v[i] << (i + 1 == (int)v.size() ? "" : " ");
}
return os;
}
void debug_out() { cerr << '\n'; }
template <class Head, class... Tail> void debug_out(Head&& head, Tail&&... tail) {
cerr << head;
if (sizeof...(Tail) > 0) cerr << ", ";
debug_out(move(tail)...);
}
#ifdef LOCAL
#define debug(...) \
cerr << " "; \
cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n'; \
cerr << " "; \
debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
template <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; }
template <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; }
template <class T1, class T2> inline bool chmin(T1& a, T2 b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T1, class T2> inline bool chmax(T1& a, T2 b) {
if (a < b) {
a = b;
return true;
}
return false;
}
#pragma endregion
const int INF = 1e9;
const long long IINF = 1e18;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const char dir[4] = {'D', 'R', 'U', 'L'};
const long long MOD = 1000000007;
// const long long MOD = 998244353;
bool kadomatsu(const vector<int>& v) {
if (v[0] == v[1]) return false;
if (v[1] == v[2]) return false;
if (v[2] == v[0]) return false;
return min({v[0], v[1], v[2]}) == v[1] || max({v[0], v[1], v[2]}) == v[1];
}
void solve() {
int N;
cin >> N;
vector<int> A(N);
cin >> A;
auto check = [&](int i) {
if (i < 0 || i + 2 >= N) return true;
if (A[i] == A[i + 1]) return false;
if (A[i + 1] == A[i + 2]) return false;
if (A[i + 2] == A[i]) return false;
return min({A[i], A[i + 1], A[i + 2]}) == A[i + 1] || max({A[i], A[i + 1], A[i + 2]}) == A[i + 1];
};
auto whole = [&]() {
for (int i = 0; i + 2 < N; i++) {
if (!check(i)) {
return false;
}
}
return true;
};
vector<bool> ng(N, false);
for (int i = 0; i + 2 < N; i++) {
if (!check(i)) {
for (int j = 0; j < 3; j++) {
ng[i + j] = true;
}
}
}
vector<int> cand;
for (int i = 0; i < N; i++) {
if (ng[i]) {
cand.emplace_back(i);
}
}
if (cand.size() > 20) {
cout << "No" << '\n';
return;
}
for (int i = 0; i < cand.size(); i++) {
for (int j = i + 1; j < cand.size(); j++) {
if (A[cand[i]] == A[cand[j]]) continue;
swap(A[cand[i]], A[cand[j]]);
if (whole()) {
cout << "Yes" << '\n';
return;
}
swap(A[cand[i]], A[cand[j]]);
}
}
if (cand.size() > 5) {
cout << "No" << '\n';
return;
}
auto SWAP = [&](int x, int y) {
for (int i : {-2, -1, 0}) {
if (!check(x + i)) return false;
if (!check(y + i)) return false;
}
return true;
};
for (int x : cand) {
for (int i = 0; i < N; i++) {
if (ng[i]) continue;
swap(A[x], A[i]);
if (SWAP(x, i)) {
cout << "Yes" << '\n';
return;
}
swap(A[x], A[i]);
}
}
cout << "No" << '\n';
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int T;
cin >> T;
for (; T--;) solve();
return 0;
}