제출 #1114734

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1114734		koukirocks	괄호 문자열 (CEOI16_match)	C++17	0 / 100	1 ms	336 KiB

match

#include <bits/stdc++.h>
#define speed ios_base::sync_with_stdio(0); cin.tie(0)
#define all(x) (x).begin(),(x).end()
#define F first
#define S second
//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx,avx2")
//#pragma GCC target("popcnt")
 
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
 
const ll MAX=2e5+10,P=1e9+7;
const ll INF=0x3f3f3f3f,oo=0x3f3f3f3f3f3f3f3f;
const ldb eps=1e-6;
const ldb PI=acos(-1.0);
const int dir[4][2]={{0,1},{0,-1},{1,0},{-1,0}};
template<typename T>
using vvector = vector<vector<T>>;

int main() {
    speed;
    string s;
    cin>>s;
    stack<char> pr;
    vector<int> cnt(30);
    for (char c:s) {
        if (!pr.empty() and pr.top()==c) pr.pop();
        else pr.push(c);
        cnt[c-'a']++;
    }
    if (!pr.empty()) {
        cout<<"-1\n";
        return 0;
    }
    vector<int> now(30);
    for (char c:s) {
        if (now[c-'a']<cnt[c-'a']/2) cout<<"(";
        else cout<<")";
        now[c-'a']++;
    }
    return 0;
}

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