結果

問題 No.2143 Only One Bracket
コンテスト
ユーザー cpbm_p
提出日時 2022-11-05 12:18:40
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 5,018 bytes
コンパイル時間 13,950 ms
コンパイル使用メモリ 305,180 KB
最終ジャッジ日時 2025-02-08 18:43:15
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 2 WA * 1 TLE * 4
権限があれば一括ダウンロードができます

ソースコード

diff # 

// #ifndef LOCAL
    #pragma GCC optimize("Ofast")
    #pragma GCC target("avx2")
    #pragma GCC optimize("unroll-loops")
    // #pragma GCC target("sse,sse2,sse3,ssse3,sse4,fma,abm,mmx,avx,avx2,avx512f")
    #include <bits/stdc++.h>
// #else
    // #include <stdc++.h>
// #endif
using namespace std;
using ll = long long;
using ld = long double;
template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T,U>;
template<class T> using max_heap = priority_queue<T>;
template<class T> using min_heap = priority_queue<T,vector<T>,greater<T>>;
#define OVERLOADER(_1,_2,_3,NAME,...) NAME
#define REP2(i,a,b) for (ll i = (a); i < (ll)(b); ++i)
#define REP(i,n) REP2(i,0,n)
#define rep(...) OVERLOADER(__VA_ARGS__,REP2,REP)(__VA_ARGS__)
#define pb push_back
#define eb emplace_back
#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()
template<class T, class U> inline bool chmin(T &a, U b) { if(a>b) {a=b; return 1;} return 0;}
template<class T, class U> inline bool chmax(T &a, U b) { if(a<b) {a=b; return 1;} return 0;}
ll max (ll lhs, ll rhs) {return std::max<ll>(lhs, rhs);}
ll min (ll lhs, ll rhs) {return std::min<ll>(lhs, rhs);}
template<class T>void uniqify(V<T>& v){v.erase(unique(ALL(v)),v.end());}
template<class T>V<T> compress(V<T>& v){V<T>vals=v;sort(ALL(vals));uniqify(vals);rep(i,v.size())v[i]=lower_bound(ALL(vals),v[i])-vals.begin();return vals;}
template<class T>V<T> sum_array(V<T>& v) {int n=v.size(); V<T> sum(n+1); rep(i,n) sum[i+1]=sum[i]+v[i]; return sum;}
// inputs
template<class T,class U> istream& operator>>(istream& is,P<T,U>&p){return is>>p.first>>p.second;}
template<class T> istream& operator>>(istream& is,V<T>&v){for(T& e:v) is>>e; return is;}
// outputs
template<class T,class U> ostream& operator<<(ostream& os,P<T,U>& p){return os<<p.first<<' '<<p.second;}
template<class T> ostream& operator<<(ostream& os,set<T>& v) {os<<'{';for(auto&l:v){os<<l<<", ";}os<<'}';return os;}
template<class T,class U> ostream& operator<<(ostream& os,map<T,U>& m){os<<'{';for(auto&p:m) {os<<p.first<<':'<<p.second<<'\n';}os<<'}';return os;}
template<class T> ostream& operator<<(ostream& os,V<T>& v) {int ss=v.size(); rep(ii,ss) {os<<v[ii]<<(ii+1==ss?"":" ");} return os;}
template<class T>inline void drop(T&& x) { cout << x << endl; exit(0); }
constexpr char ENDL = '\n';
inline void yesno(bool f) { cout << (f ? "Yes" : "No") << ENDL; }
constexpr ll INF = (1LL<<30)-1; // 問題毎にfit
constexpr ll INFLL = (1LL<<62)-1; // 問題毎にfit
const ld PI = acos(static_cast<long double>(-1));
constexpr int dy[]={0, 1, 0, -1};
constexpr int dx[]={1, 0, -1, 0};
// constexpr int dy[]={0, 1, 1, 1, 0, -1, -1, -1};
// constexpr int dx[]={1, 1, 0, -1, -1, -1, 0, 1};
struct IO_Setting{IO_Setting(){cin.tie(nullptr);ios_base::sync_with_stdio(false);cout<<fixed<<setprecision(15);cerr<<fixed<<setprecision(3);}}io_setting;

//  ---------- ac-library ---------- insert '/' into the head of the line below to enable
/*
#include <atcoder/all>   // ac-library
using namespace atcoder; // ac-library
std::ostream &operator<<(std::ostream &os, const modint998244353 &a) {return os<<a.val();}
std::ostream &operator<<(std::ostream &os, const modint1000000007 &a) {return os<<a.val();}
//*/
#ifdef LOCAL
    void debug_out() { cerr << endl; }
    template <class Head, class... Tail> void debug_out(Head H, Tail... T) { cerr << ", " << H; debug_out(T...); }
    #define debug(...) cerr << "Line " << __LINE__ << " : " << #__VA_ARGS__ << " ,,", debug_out(__VA_ARGS__)
#else
    #define debug(...) (void(0))
#endif
// using mint = modint1000000007;
// using mint = modint998244353;

int main() {
    int n; cin>>n;
    V<int> s;
    rep(i, n) s.push_back(-1);
    rep(i, n) s.push_back(1);

    // 括弧列を全探索 16C8 ~ 12000
    do {
        // 区切り方を全探索
        V<int> div;
        rep(i, n) div.push_back(0);
        rep(i, n-1) div.push_back(1);
        do {
            V<V<int>> ss(n);
            int ind = 0;
            rep(i, 2*n) {
                ss[ind].push_back(s[i]);
                if(i == 2*n-1) break;
                if(div[i]==1) ind++;
            }

            bool isunique = 1;
            rep(i, n) rep(j, i+1, n) if(ss[i]==ss[j]) isunique = 0;
            if(!isunique) continue;

            sort(ALL(ss));

            // unique な順列かを判定
            int oks = 0;
            do {
                V<int> tmp;
                rep(i, n) for(auto ii : ss[i]) tmp.push_back(ii);

                int sum = 0;
                bool isok = 1;
                rep(i, 2*n) if((sum += tmp[i]) < 0) isok = 0;

                if(isok) oks++;
            } while(next_permutation(ALL(ss)));

            if(oks == 1) {
                // 出力して終了
                rep(i, n) {
                    for(auto ii:ss[i]) cout << (ii==1?'(':')');
                    cout << endl;
                }
                return 0;
            }
        } while(next_permutation(ALL(div)));
    } while(next_permutation(ALL(s)));
}
0