| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 782171 | ymm | Match (CEOI16_match) | C++17 | 1 ms | 336 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define Loop(x,l,r) for (ll x = (l); x < (ll)(r); ++x)
#define LoopR(x,l,r) for (ll x = (r)-1; x >= (ll)(l); --x)
typedef long long ll;
typedef std::pair<int, int> pii;
typedef std::pair<ll , ll > pll;
using namespace std;
const int N = 100'010;
string s;
vector<int> pos[256];
bool ans[N];
int n;
int main()
{
cin.tie(0) -> sync_with_stdio(false);
cin >> s;
n = s.size();
Loop (i,0,n)
pos[s[i]].push_back(i);
Loop (i,0,256) {
if (pos[i].size()&1) {
cout << "-1\n";
return 0;
}
Loop (j,pos[i].size()/2,pos[i].size())
ans[pos[i][j]] = 1;
}
int dep = 0;
Loop (i,0,n) {
dep += ans[i]? -1: 1;
if (dep < 0) {
cout << "-1\n";
return 0;
}
}
Loop (i,0,n)
cout << (ans[i]? ')': '(');
cout << '\n';
}Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
