////////////////////////////// Author:eldaee, coder_viper!!!!!!!!!!!!!!!!!!!!!!!!11
#pragma GCC optimize ("Ofast")
#include <bits/stdc++.h>
#define int long long
#define str string
#define vec vector
#define dou double
#define ld long double
#define pb push_back
#define ppb pop_back
#define eb emplace_back
#define YES cout << "YES" << '\n'
#define Yes cout << "Yes" << '\n'
#define NO cout << "NO" << '\n'
#define No cout << "No" << '\n'
#define gcd __gcd
#define all(x) x.begin(),x.end()
#define eldaee ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
void solve() {
str s;
cin >> s;
int n = (int) s.size();
str res(n, ' ');
int x[26];
for (int i = 0; i < 26; i++)
{
x[i] = -1;
}
int y = 0;
int i = 0;
for (char ch : s)
{
int pos = ch - 'a';
if (x[pos] == -1)
{
res[i] = '(';
x[pos] = i;
y++;
}
else
{
res[i] = ')';
x[pos] = -1;
y--;
if (y < 0)
{
cout << -1 << '\n';
return;
}
}
i = i + 1;
}
if (y != 0)
{
cout << -1 << '\n';
return;
}
cout << res << '\n';
}
signed main()
{
eldaee
solve();
}
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |