#611536 (C++17) No.1369 交換門松列・竹

• 問題: No.1369 交換門松列・竹
• ユーザー: hotman78
• 提出日時: 2021-01-29 23:14:26
• 言語: C++17 (gcc 13.2.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 220 ms / 2,000 ms
• コード長: 5,776 bytes
• コンパイル時間: 3,602 ms
• コンパイル使用メモリ: 237,604 KB
• 実行使用メモリ: 4,380 KB
• 最終ジャッジ日時: 2023-09-09 16:58:45
• 合計ジャッジ時間: 6,184 ms
• ジャッジサーバーID （参考情報）: judge11 / judge12

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 4,376 KB
testcase_01	AC	2 ms; 4,376 KB
testcase_02	AC	1 ms; 4,380 KB
testcase_03	AC	2 ms; 4,380 KB
testcase_04	AC	2 ms; 4,376 KB
testcase_05	AC	2 ms; 4,380 KB
testcase_06	AC	1 ms; 4,376 KB
testcase_07	AC	1 ms; 4,376 KB
testcase_08	AC	2 ms; 4,380 KB
testcase_09	AC	2 ms; 4,380 KB
testcase_10	AC	2 ms; 4,376 KB
testcase_11	AC	2 ms; 4,376 KB
testcase_12	AC	2 ms; 4,380 KB
testcase_13	AC	11 ms; 4,376 KB
testcase_14	AC	15 ms; 4,376 KB
testcase_15	AC	7 ms; 4,376 KB
testcase_16	AC	55 ms; 4,380 KB
testcase_17	AC	113 ms; 4,380 KB
testcase_18	AC	60 ms; 4,376 KB
testcase_19	AC	7 ms; 4,380 KB
testcase_20	AC	220 ms; 4,376 KB
testcase_21	AC	7 ms; 4,376 KB
testcase_22	AC	196 ms; 4,376 KB
testcase_23	AC	64 ms; 4,380 KB
testcase_24	AC	6 ms; 4,376 KB
testcase_25	AC	75 ms; 4,376 KB
testcase_26	AC	83 ms; 4,376 KB
testcase_27	AC	87 ms; 4,380 KB
testcase_28	AC	5 ms; 4,376 KB
testcase_29	AC	5 ms; 4,376 KB
testcase_30	AC	7 ms; 4,376 KB
testcase_31	AC	6 ms; 4,380 KB
testcase_32	AC	8 ms; 4,376 KB
testcase_33	AC	67 ms; 4,380 KB

ソースコード

#line 2 "cpplib/util/template.hpp"
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx2")
#include<bits/stdc++.h>
using namespace std;
struct __INIT__{__INIT__(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}}__INIT__;
typedef long long lint;
#define INF (1LL<<60)
#define IINF (1<<30)
#define EPS (1e-10)
#define endl ('\n')
typedef vector<lint> vec;
typedef vector<vector<lint>> mat;
typedef vector<vector<vector<lint>>> mat3;
typedef vector<string> svec;
typedef vector<vector<string>> smat;
template<typename T>using V=vector<T>;
template<typename T>using VV=V<V<T>>;
template<typename T>inline void output(T t){bool f=0;for(auto i:t){cout<<(f?" ":"")<<i;f=1;}cout<<endl;}
template<typename T>inline void output2(T t){for(auto i:t)output(i);}
template<typename T>inline void debug(T t){bool f=0;for(auto i:t){cerr<<(f?" ":"")<<i;f=1;}cerr<<endl;}
template<typename T>inline void debug2(T t){for(auto i:t)output(i);}
#define loop(n) for(long long _=0;_<(long long)(n);++_)
#define _overload4(_1,_2,_3,_4,name,...) name
#define __rep(i,a) repi(i,0,a,1)
#define _rep(i,a,b) repi(i,a,b,1)
#define repi(i,a,b,c) for(long long i=(long long)(a);i<(long long)(b);i+=c)
#define rep(...) _overload4(__VA_ARGS__,repi,_rep,__rep)(__VA_ARGS__)
#define _overload3_rev(_1,_2,_3,name,...) name
#define _rep_rev(i,a) repi_rev(i,0,a)
#define repi_rev(i,a,b) for(long long i=(long long)(b)-1;i>=(long long)(a);--i)
#define rrep(...) _overload3_rev(__VA_ARGS__,repi_rev,_rep_rev)(__VA_ARGS__)

// #define rep(i,...) for(auto i:range(__VA_ARGS__)) 
// #define rrep(i,...) for(auto i:reversed(range(__VA_ARGS__)))
// #define repi(i,a,b) for(lint i=lint(a);i<(lint)(b);++i)
// #define rrepi(i,a,b) for(lint i=lint(b)-1;i>=lint(a);--i)
// #define irep(i) for(lint i=0;;++i)
// inline vector<long long> range(long long n){if(n<=0)return vector<long long>();vector<long long>v(n);iota(v.begin(),v.end(),0LL);return v;}
// inline vector<long long> range(long long a,long long b){if(b<=a)return vector<long long>();vector<long long>v(b-a);iota(v.begin(),v.end(),a);return v;}
// inline vector<long long> range(long long a,long long b,long long c){if((b-a+c-1)/c<=0)return vector<long long>();vector<long long>v((b-a+c-1)/c);for(int i=0;i<(int)v.size();++i)v[i]=i?v[i-1]+c:a;return v;}
// template<typename T>inline T reversed(T v){reverse(v.begin(),v.end());return v;}
#define all(n) begin(n),end(n)
template<typename T,typename E>bool chmin(T& s,const E& t){bool res=s>t;s=min<T>(s,t);return res;}
template<typename T,typename E>bool chmax(T& s,const E& t){bool res=s<t;s=max<T>(s,t);return res;}
const vector<lint> dx={1,0,-1,0,1,1,-1,-1};
const vector<lint> dy={0,1,0,-1,1,-1,1,-1};
#define SUM(v) accumulate(all(v),0LL)
template<typename T,typename ...Args>auto make_vector(T x,int arg,Args ...args){if constexpr(sizeof...(args)==0)return vector<T>(arg,x);else return vector(arg,make_vector<T>(x,args...));}
#define extrep(v,...) for(auto v:__MAKE_MAT__({__VA_ARGS__}))
#define bit(n,a) ((n>>a)&1)
vector<vector<long long>> __MAKE_MAT__(vector<long long> v){if(v.empty())return vector<vector<long long>>(1,vector<long long>());long long n=v.back();v.pop_back();vector<vector<long long>> ret;vector<vector<long long>> tmp=__MAKE_MAT__(v);for(auto e:tmp)for(long long i=0;i<n;++i){ret.push_back(e);ret.back().push_back(i);}return ret;}
using graph=vector<vector<int>>;
template<typename T>using graph_w=vector<vector<pair<int,T>>>;
template<typename T,typename E>ostream& operator<<(ostream& out,pair<T,E>v){out<<"("<<v.first<<","<<v.second<<")";return out;}
constexpr inline long long powll(long long a,long long b){long long res=1;while(b--)res*=a;return res;}
#line 4 "cpplib/graph_tree/topological_sort.hpp"

/**
 * @brief トポロジカルソート
 */

std::vector<int>tsort(std::vector<std::vector<int>>G){
	std::vector<int> in(G.size(),0);
	std::vector<int> vis(G.size(),0);
	std::vector<int> res;
	for(int i=0;i<(int)G.size();i++)for(int j=0;j<(int)G[i].size();j++){
		in[G[i][j]]++;
	}
	for(int i=0;i<(int)G.size();++i){
		auto dfs=[&](auto dfs,int v)->void{
			vis[v]=1;
			res.push_back(v);
			for(auto e:G[v]){
				in[e]--;
				if(in[e]==0)dfs(dfs,e);
			}
		};
		if(vis[i]==0&&in[i]==0)dfs(dfs,i);
	}
	return res;
}
#line 3 "code.cpp"
bool f(lint a,lint b,lint c){
    return ((a<b&&b>c)||(a>b&&b<c))&&a!=c;
}

int main(){
    lint t;
    cin>>t;
    while(t--){
        lint n;
        cin>>n;
        vec a(n);
        rep(i,n)cin>>a[i];
        vec b(n-2);
        lint cnt=0;
        rep(i,n-2){
            b[i]=!f(a[i],a[i+1],a[i+2]);
            if(b[i])cnt++;
        }
        if(cnt>6){
            cout<<"No"<<endl;
        }else{
            set<lint> c;
            rep(i,n-2){
                if(b[i]){
                    c.insert(i);
                    c.insert(i+1);
                    c.insert(i+2);
                }
            }
            bool flag=0;
            rep(i,n){
                for(auto j:c){
                    if(i==j)continue;
                    lint tmp=0;
                    swap(a[i],a[j]);
                    set<lint>s;
                    rep(k,max(i-2,0LL),min(i+1,n-2)){
                        s.insert(k);
                    }
                    rep(k,max(j-2,0LL),min(j+1,n-2)){
                        s.insert(k);
                    }
                    for(auto e:s){
                        tmp+=f(a[e],a[e+1],a[e+2])-!b[e];
                    }
                    swap(a[i],a[j]);
                    if(cnt==tmp){
                        flag=1;
                        break;
                    }
                }
                if(flag)break;
            }
            if(flag)cout<<"Yes"<<endl;
            else cout<<"No"<<endl;
        }
    }
}