oj.uz

Submission #132227

# Submission time Handle Problem Language Result Execution time Memory
132227 2019-07-18T14:26:06 Z johutha Match (CEOI16_match) C++14
0 / 100
 2 ms 504 KB 
#include <vector>
#include <iostream>
#include <string>
#include <algorithm>

#define int int64_t

using namespace std;

struct brackseq
{
    string s;
    
    int n;


    string calc()
    {
        vector<int> stack;
        string seq;

        vector<vector<vector<int>>> chlist(n, vector<vector<int>>(255));
        
        for (int i = 0; i < n; i++)
        {
            if (stack.size() == 0 || s[i] != s[stack.back()])
            {
                chlist[stack.size()][s[i]].push_back(i);
                stack.push_back(i);
                seq.push_back('(');
            }
            else
            {
                stack.pop_back();
                seq.push_back(')');
                chlist[stack.size()][s[i]].push_back(i);
            }
        }
        if (stack.size() != 0) return "-1";

        for (int i = 0; i < n; i++)
        {
            for (int j = 0; j < 255; j++)
            {
                int ls = chlist[i][j].size();
                for (int k = 0; k < ls/2; k++)
                {
                    seq[chlist[i][j][k]] = '(';
                    seq[chlist[i][j][ls - k - 1]] = ')';
                }
            }
        }
        return seq;
    }
};

signed main()
{
    brackseq bs;
    cin >> bs.s;
    bs.n = bs.s.size();
    cout << bs.calc() << "\n";
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 2 ms 504 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 376 KB Output is correct
2 Incorrect 2 ms 504 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 376 KB Output is correct
2 Incorrect 2 ms 504 KB Output isn't correct
3 Halted 0 ms 0 KB -