結果
問題 | No.1369 交換門松列・竹 |
ユーザー |
![]() |
提出日時 | 2021-01-29 22:53:01 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 4,241 bytes |
コンパイル時間 | 1,943 ms |
コンパイル使用メモリ | 204,680 KB |
最終ジャッジ日時 | 2025-01-18 09:39:50 |
ジャッジサーバーID (参考情報) |
judge5 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | WA * 1 |
other | AC * 19 WA * 14 |
ソースコード
#include <bits/stdc++.h>#include <random>using namespace std; typedef unsigned long long _ulong; typedef long long int lint; typedef pair<lint, lint> plint; typedef pair<double long, doublelong> pld;#define ALL(x) (x).begin(), (x).end()#define SZ(x) ((lint)(x).size())#define FOR(i, begin, end) for(lint i=(begin),i##_end_=(end);i<i##_end_;++i)#define IFOR(i, begin, end) for(lint 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)#define endk '\n'#define fi first#define se secondstruct fast_ios { fast_ios() { cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;template<class T> auto add = [](T a, T b) -> T { return a + b; };template<class T> auto f_max = [](T a, T b) -> T { return max(a, b); };template<class T> auto f_min = [](T a, T b) -> T { return min(a, b); };template<class T> using V = vector<T>;using Vl = V<lint>; using VVl = V<Vl>;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 != v.size() ? " " : "");return os;}template< typename T >istream& operator>>(istream& is, vector< T >& v) {for (T& in : v) is >> in;return is;}template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }lint gcd(lint a, lint b) { if (b == 0) return a; else return gcd(b, a % b); }lint ceil(lint a, lint b) { return (a + b - 1) / b; }lint digit(lint a) { return (lint)log10(a); }lint e_dist(plint a, plint b) { return abs(a.fi - b.fi) * abs(a.fi - b.fi) + abs(a.se - b.se) * abs(a.se - b.se); }lint m_dist(plint a, plint b) { return abs(a.fi - b.fi) + abs(a.se - b.se); }void Worshall_Floyd(VVl& g) { REP(k, SZ(g)) REP(i, SZ(g)) REP(j, SZ(g)) chmin(g[i][j], g[i][k] + g[k][j]); }const lint MOD1000000007 = 1000000007, MOD998244353 = 998244353, INF = 1e15;lint dx[8] = { 1, 0, -1, 0, 1, -1, 1, -1 }, dy[8] = { 0, 1, 0, -1, -1, -1, 1, 1 };bool YN(bool flag) { cout << (flag ? "YES" : "NO") << endk; return flag; } bool yn(bool flag) { cout << (flag ? "Yes" : "No") << endk; return flag; }struct Edge {lint from, to;lint cost;Edge(lint u, lint v, lint c) {cost = c;from = u;to = v;}bool operator<(const Edge& e) const {return cost < e.cost;}};struct WeightedEdge {lint to;lint cost;WeightedEdge(lint v, lint c = 1) {to = v;cost = c;}bool operator<(const WeightedEdge& e) const {return cost < e.cost;}};using WeightedGraph = V<V<WeightedEdge>>;typedef pair<plint, lint> tlint;typedef pair<plint, plint> qlint;typedef pair<string, lint> valstring;lint T, N;int main() {cin >> T;while (T--) {cin >> N;Vl arr(N);cin >> arr;set<lint> pos;bool flag = true;REP(i, N - 2) {if (arr[i] == arr[i + 1] && arr[i + 1] == arr[i + 2]) {flag = false;break;}if (arr[i] <= arr[i + 1] && arr[i + 1] <= arr[i + 2]) {if (i != 0) pos.insert(i - 1);pos.insert(i);pos.insert(i + 1);pos.insert(i + 2);if (i + 3 != N) pos.insert(i + 3);}if (arr[i] >= arr[i + 1] && arr[i + 1] >= arr[i + 2]) {if (i != 0) pos.insert(i - 1);pos.insert(i);pos.insert(i + 1);pos.insert(i + 2);if (i + 3 != N) pos.insert(i + 3);}}if (SZ(pos) > 20 || !flag) {cout << "No" << endk;}else {bool flag = false;auto check = [&](int pos) {int _pos = pos - 2;REP(i, 7) {if (i + _pos < 0) continue;if (i + _pos + 2 >= N) break;if (arr[i + _pos] == arr[i + _pos + 1]) return false;if (arr[i + _pos + 1] == arr[i + _pos + 2]) return false;if (arr[i + _pos] == arr[i + _pos + 2]) return false;if (arr[i + _pos] <= arr[i + _pos + 1] && arr[i + _pos + 1] <= arr[i + _pos + 2]) return false;if (arr[i + _pos] >= arr[i + _pos + 1] && arr[i + _pos + 1] >= arr[i + _pos + 2]) return false;}return true;};for (lint v : pos) {REP(i, N) {if (v == i) continue;swap(arr[v], i);if (check(i) && check(v)) {flag = true;}swap(arr[v], i);}}yn(flag);}}}