oj.uz

Submission #51711

# Submission time Handle Problem Language Result Execution time Memory
51711 2018-06-20T07:49:16 Z someone_aa Match (CEOI16_match) C++17
0 / 100
 2 ms 360 KB 
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
using namespace std;
set<int>indexes[26];
string code;
int n;

bool check_valid() {
    if(n%2==1) return false;
    stack<char>st;

    for(int i=0;i<n;i++) {
        if(st.empty()) st.push(code[i]);
        else if(!st.empty() && st.top() == code[i]) st.pop();
        else if(!st.empty() && st.top() != code[i]) st.push(code[i]);
    }

    if(st.size() == 0) return true;
    else return false;
}

int main() {
    cin>>code;
    n = code.length();

    for(int i=0;i<n;i++) {
        indexes[int(code[i]-'a')].insert(i);
    }

    string seq = code;
    if(!check_valid()) {
        cout<<"-1\n";
    }
    else {
        for(int i=0;i<n;i++) {
            if(seq[i] != '(' && seq[i] != ')') {
                int ind = int(code[i]-'a');
                int st = i;
                int last = *(indexes[ind].rbegin());

                seq[st] = '(';
                seq[last] = ')';

                indexes[ind].erase(i);
                indexes[ind].erase(last);
            }
        }
        cout<<seq<<"\n";
    }
    return 0;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Incorrect 2 ms 360 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Incorrect 2 ms 360 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Incorrect 2 ms 360 KB Output isn't correct
3 Halted 0 ms 0 KB -