제출 #942062

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
942062		GrindMachine	Match (CEOI16_match)	C++17	10 / 100	15 ms	600 KiB

match

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

void solve(int test_case)
{
    string s; cin >> s;
    ll n = sz(s);
    if(n&1){
        cout << -1 << endl;
        return;
    }

    rep(mask,1<<n){
        if(setbits(mask) != n/2) conts;
        string ans = "";
        rev(i,n-1,0){
            if(mask&(1<<i)){
                ans.pb(')');
            }
            else{
                ans.pb('(');
            }
        }

        stack<ll> stk;
        bool ok = true;

        rep(i,n){
            if(ans[i] == '('){
                stk.push(i);
            }
            else{
                if(stk.empty()){
                    ok = false;
                    break;
                }
                if(s[stk.top()] != s[i]){
                    ok = false;
                    break;
                }

                stk.pop();
            }
        }

        if(ok){
            cout << ans << endl;
            return;
        }
    }

    cout << -1 << endl;
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 0 / 27
• Subtask 3: 0 / 63