oj.uz

답안 #942069

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
942069 2024-03-10T07:49:59 Z GrindMachine 괄호 문자열 (CEOI16_match) C++17
37 / 100
 2000 ms 944 KB 
#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;
    }

    stack<ll> stk;
    rep(i,n){
        if(!stk.empty() and s[i] == s[stk.top()]){
            stk.pop();
        }
        else{
            stk.push(i);
        }
    }

    if(!stk.empty()){
        cout << -1 << endl;
        return;
    }

    string ans = "";

    rep(i,n){
        // ans[i] = '(' possible?
        auto new_stk = stk;
        new_stk.push(i);

        for(int j = i+1; j < n; ++j){
            if(!new_stk.empty() and s[j] == s[new_stk.top()]){
                new_stk.pop();
            }
            else{
                new_stk.push(j);
            }
        }

        if(new_stk.empty()){
            ans.pb('(');
            stk.push(i);
        }
        else{
            ans.pb(')');
            assert(!stk.empty());
            assert(s[i] == s[stk.top()]);
            stk.pop();
        }
    }

    cout << ans << endl;
}

int main()
{
    fastio;

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

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

    return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct

Subtask #2
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 4 ms 348 KB Output is correct
7 Correct 6 ms 348 KB Output is correct

Subtask #3
0 / 63.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 4 ms 348 KB Output is correct
7 Correct 6 ms 348 KB Output is correct
8 Correct 67 ms 344 KB Output is correct
9 Correct 88 ms 744 KB Output is correct
10 Correct 102 ms 500 KB Output is correct
11 Correct 87 ms 552 KB Output is correct
12 Execution timed out 2044 ms 944 KB Time limit exceeded
13 Halted 0 ms 0 KB -