oj.uz

답안 #612268

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
612268 2022-07-29T12:22:36 Z drdilyor 괄호 문자열 (CEOI16_match) C++17
10 / 100
 15 ms 300 KB 
#include <bits/stdc++.h>
#ifdef ONPC
    #include "t_debug.cpp"
#else
    #define debug(...) 42
#endif
#define sz(a) ((int)(a).size())
using namespace std;
using ll = long long;
const int INF = 1e9;
const ll INFL = 1e18;
const int RANDOM = chrono::high_resolution_clock::now().time_since_epoch().count();
mt19937 rng(RANDOM);
template<typename T, typename U> istream& operator>>(istream& is, pair<T, U>& p) { return is >> p.first >> p.second; }
const int N = 2e5, LOGN = 17, MOD = 1e9+7;

string solve(const string& s) {
    int n = s.size();
    string res(n, '?');

    auto valid = [&](int i, int j) {
        map<char,int> count;
        for (int k = i; k <= j; k++) {
            count[s[i]]++;
        }
        for (auto[k, v] : count) {
            if (v%2) return false;
        }
        int depth = 0;
        for (; i <= j; i++) {
            if (res[i] =='(') depth++;
            if (res[i] == ')') depth--;
            if (depth < 0) return false;
        }
        return depth == 0;
    };

    for (int i = 0; i < n; i++) {
        if (res[i] != '?') continue;
        for (int j = n-1; j > i; j--) {
            if (s[i] != s[j]) continue;
            if (res[j] != '?') continue;

            if (valid(i+1, j-1)) {
                res[i] = '(';
                res[j] = ')';
                break;
            }
        }
        if (res[i] == '?') {
            return "-1";
        }
    }
    return res;
}

string solve_2(const string& s) {
    int n = s.size();
    string res(n, '?');
    function<bool(int)> brute = [&](int i) {
        if (i < n) {
            res[i] = '(';
            if (brute(i+1)) return true;
            res[i] = ')';
            return brute(i+1);
        } else {
            vector<int> matching(n, -1);
            vector<int> cur;
            for (int i = 0; i < n; i++) {
                if (res[i] == '(') {
                    cur.push_back(i);
                } else {
                    if (cur.empty()) return false;
                    matching[i] = cur.back();
                    matching[cur.back()] = i;
                    cur.pop_back();
                }
            }
            if (!cur.empty()) return false;
            for (int i = 0; i < n; i++) {
                if (s[i] != s[matching[i]]) return false;
                int depth = 0;
                for (int j = i+1; j < matching[i]; j++) {
                    if (res[j] == '(') depth++;
                    else depth--;
                    if (depth < 0) return false;
                }
                if (depth != 0) return false;
            }
            return true;
        }
    };
    if (!brute(0)) return "-1";
    else return res;
}

signed main() {
    int t = 1;
    #ifdef ONPC
    t = 10000;
    #endif
    while (t-- && cin) {
        string s; cin >> s;
        if (!cin) break;
        #ifdef ONPC
        string res1 = solve(s), res2 = solve_2(s);
        cout << res1 << endl;
        if (res1 != res2) {
            cout << res2 << endl;
            assert(false);
        }
        #else
        cout << solve(s);
#endif
    }
    return 0;
}

/*
     █████               █████  ███  ████                               
    ▒▒███               ▒▒███  ▒▒▒  ▒▒███                               
  ███████  ████████   ███████  ████  ▒███  █████ ████  ██████  ████████ 
 ███▒▒███ ▒▒███▒▒███ ███▒▒███ ▒▒███  ▒███ ▒▒███ ▒███  ███▒▒███▒▒███▒▒███
▒███ ▒███  ▒███ ▒▒▒ ▒███ ▒███  ▒███  ▒███  ▒███ ▒███ ▒███ ▒███ ▒███ ▒▒▒ 
▒███ ▒███  ▒███     ▒███ ▒███  ▒███  ▒███  ▒███ ▒███ ▒███ ▒███ ▒███     
▒▒████████ █████    ▒▒████████ █████ █████ ▒▒███████ ▒▒██████  █████    
 ▒▒▒▒▒▒▒▒ ▒▒▒▒▒      ▒▒▒▒▒▒▒▒ ▒▒▒▒▒ ▒▒▒▒▒   ▒▒▒▒▒███  ▒▒▒▒▒▒  ▒▒▒▒▒     
                                            ███ ▒███                    
                                           ▒▒██████                     
                                            ▒▒▒▒▒▒
*/

Subtask #1
10.0 / 10.0

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

Subtask #2
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Incorrect 15 ms 300 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 63.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Incorrect 15 ms 300 KB Output isn't correct
5 Halted 0 ms 0 KB -