Submission #198213

#	Time	Username	Problem	Language	Result	Execution time	Memory
198213		parsa_mobed	Match (CEOI16_match)	C++14	37 / 100	2100 ms	664 KiB

match

#include <bits/stdc++.h>

using namespace std;
const int N = 1e5 + 10;
int a[N], n;
string s;

bool isval()
{
    vector <char> vec;
    for (int i = 0; i < n; i++) {
        if (a[i] == -1) {
            if (vec.empty() || vec.back() != s[i]) return 0;
            vec.pop_back();
        }
        if (a[i] == 1) vec.push_back(s[i]);
        if (a[i] == 0) {
            if (vec.size() && vec.back() == s[i]) vec.pop_back();
            else vec.push_back(s[i]);
        }
    }
    return vec.empty();
}
int main()
{
    cin >> s;
    n = s.size();
    if (!isval()) return cout << -1 << "\n", 0;
    for (int i = 0; i < n; i++) {
        a[i] = 1;
        if (!isval()) a[i] = -1;
    }
    for (int i = 0; i < n; i++) cout << (a[i] == 1 ? '(' : ')');
    cout << "\n";

    return 0;
}

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