text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
using namespace std;
char a[100010];
int main() {
scanf("%s", a);
int n = strlen(a);
int m = 0;
int count = 0;
for (int i = (n - 1); i >= (0); --i) {
if (a[i] == '#')
break;
else if (a[i] == '(')
count++;
else
count--;
if (count > 0) {
printf("-1\n");
return 0;
}
}
count = 0;
for (int i = 0; i < (n); ++i)
if (a[i] == '#') a[i] = ')', m++;
bool flag = true;
for (int i = 0; i < (n); ++i) {
if (a[i] == '(')
count++;
else
count--;
if (count < 0) {
flag = false;
break;
}
}
if (!flag) {
printf("-1\n");
return 0;
}
for (int i = (1); i <= (m - 1); ++i) printf("1\n");
printf("%d\n", 1 + count);
return 0;
}
|
#include <bits/stdc++.h>
int main() {
std::string str;
std::cin >> str;
str = '#' + str;
int pos = str.length() - 1;
while (str[pos] != '#') pos--;
int cnt = 0;
for (int i = pos + 1; i < str.length(); i++) {
if (str[i] == '(')
cnt++;
else
cnt--;
}
bool ok = (cnt <= 0);
if (ok) {
int temp = cnt, last;
cnt = 0;
for (int i = 1; i < str.length(); i++) {
if (str[i] == '(')
cnt++;
else if (str[i] == ')')
cnt--;
else {
if (i != pos)
cnt--;
else {
if (cnt <= -temp) ok = false;
last = (cnt + temp);
cnt -= last;
}
}
if (cnt < 0) ok = false;
}
ok &= (cnt == 0);
if (ok) {
for (int i = 1; i < str.length(); i++) {
if (str[i] == '#') {
if (i != pos)
puts("1");
else
printf("%d\n", last);
}
}
} else
puts("-1");
} else
puts("-1");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/STACK:102400000,102400000")
char str[100005];
int ans[100005];
int main(void) {
int i, c1, c2, srp;
while (scanf("%s", str) != EOF) {
int len = strlen(str);
memset(ans, 0, sizeof(ans));
int flag = 1;
c1 = 0;
c2 = 0;
srp = 0;
for (i = 0; i < len; i++) {
if (str[i] == '(')
c1++;
else if (str[i] == ')')
c2++;
else if (str[i] == '#')
srp++;
if (c1 < c2 + srp) {
flag = 0;
break;
}
}
if (!flag) {
printf("-1\n");
continue;
} else {
int res = c1 - c2, bal = 0, j = 1;
for (i = 0; i < len; i++) {
if (str[i] == '(')
bal++;
else if (str[i] == ')')
bal--;
else if (str[i] == '#') {
if (j != srp)
ans[j] = 1;
else
ans[j] = res - srp + 1;
bal -= ans[j];
j++;
}
if (bal < 0) {
flag = 0;
break;
}
}
if (!flag || bal > 0)
printf("-1\n");
else {
for (i = 1; i <= srp; i++) printf("%d\n", ans[i]);
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char str[100010];
int c[100010];
int k;
int main() {
scanf("%s", str);
int len = strlen(str);
int last = 0;
int cnt = 0;
int left = 0, right = 0;
bool flag = false;
for (int i = 0; i < len; i++) {
if (str[i] == '#')
last++;
else if (str[i] == '(')
left++;
else
right++;
}
if (right + last > left) {
printf("-1\n");
return 0;
}
cnt = last;
int left2 = 0, right2 = 0;
for (int i = 0; i < len; i++) {
if (str[i] == '(')
left2++;
else if (str[i] == ')')
right2++;
else {
int left3 = 0, right3 = 0;
if (--last == 0) {
for (int j = i + 1; j < len; j++) {
if (str[j] == ')')
right3++;
else
left3++;
}
int tmp = left - right2 - right3;
right2 += tmp;
c[last] = tmp;
} else {
right2++;
c[last] = 1;
}
}
if (left2 < right2) break;
}
if (left2 < right2)
printf("-1\n");
else
for (int i = cnt - 1; i >= 0; i--) printf("%d\n", c[i]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
while (cin >> s) {
int sz = s.size();
int a = 0;
int num = 0, num2 = 0;
int la = 0;
bool f = 0;
for (int i = 0; i < sz; ++i) {
if (s[i] == '(') {
a++;
num++;
} else {
a--;
if (s[i] == '#') {
num2++;
la = i + 1;
}
if (a < 0) f = 1;
}
}
if (f) {
cout << -1 << endl;
continue;
}
int num3 = sz - num - num2;
if (num != num3 && !num2) {
cout << -1 << endl;
continue;
}
a = 0;
bool fuck = 0;
int shit = 0;
for (int i = la; i < sz; ++i) {
if (s[i] == '(') {
if (!fuck) fuck = 1, shit = i;
a++;
} else {
a--;
}
}
if (a > 0) {
cout << -1 << endl;
continue;
}
a = 0;
f = 0;
if (shit > la) {
for (int i = shit; i < sz; ++i) {
if (s[i] == '(') {
a++;
} else {
a--;
}
}
}
if (a > 0) {
cout << -1 << endl;
continue;
}
for (int i = 0; i < num2 - 1; ++i) printf("1\n");
cout << num - num2 - num3 + 1 << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
bool isBeautifulTail(string inpt, int index) {
int closeParen = 0;
bool isBeauty = true;
for (int i = inpt.length() - 1; i >= index; i--) {
if (inpt[i] == ')') {
++closeParen;
} else if (inpt[i] == '(') {
if (closeParen == 0) {
isBeauty = false;
}
--closeParen;
}
}
return isBeauty;
}
vector<int> getParenthesisValue(string inp) {
int openParen = 0;
int hash = 0;
vector<int> result;
bool isValid = true;
int lastHashIndex = inp.find_last_of('#');
isValid = isBeautifulTail(inp, lastHashIndex + 1);
for (int i = 0; i < inp.length() && isValid; i++) {
if (inp[i] == '(') {
++openParen;
} else if (inp[i] == ')') {
if (openParen == 0) {
isValid = false;
}
--openParen;
} else if (inp[i] == '#') {
if (openParen == 0) {
isValid = false;
}
++hash;
}
if (hash > 0 && openParen == 0) {
isValid = false;
}
}
if (!isValid) {
result.push_back(0);
result.push_back(0);
} else {
result.push_back(openParen);
result.push_back(hash);
}
return result;
}
int main() {
string input;
cin >> input;
int noSoltn = -1;
bool solutionFound = true;
vector<int> result = getParenthesisValue(input);
int openParen = result[0];
if (openParen <= 0) {
solutionFound = false;
} else {
int hash = result[1];
for (int i = hash; i > 0; i--) {
if ((openParen - i) < 0) {
solutionFound = false;
break;
} else if (i != 1) {
cout << 1 << endl;
--openParen;
} else {
cout << openParen << endl;
}
}
}
if (!solutionFound) {
cout << noSoltn << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int p, sum1 = 0, y;
cin >> s;
for (int i = 0; i < int((s).size()); ++i) {
if (s[i] == '(')
sum1++;
else
sum1--;
if (sum1 < 0) {
cout << "-1";
return 0;
}
}
p = s.find(')');
while (p != -1) {
for (int i = p - 1; i > -1; i--) {
if (s[i] == '(') {
s.erase(i, 1);
s.erase(p - 1, 1);
break;
}
}
p = s.find(')');
}
vector<int> o;
sum1 = 0;
for (int i = 0; i < int((s).size());) {
if (s[i] == '(') {
sum1++;
++i;
y = 0;
} else {
while (i < int((s).size()) && s[i] != '(') {
if (i != int((s).size()) - 1) {
o.push_back(1);
sum1--;
++i;
} else {
o.push_back(sum1);
++i;
y = 1;
}
}
}
}
if (y == 0) {
cout << "-1";
} else {
for (typeof((o).begin()) i = (o).begin(); i != (o).end(); i++) {
cout << *i << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("avx,avx2,fma")
using namespace std;
long long power(long long a, long long b) {
long long res = 1;
a = a % 998244353;
while (b > 0) {
if (b & 1) {
res = (res * a) % 998244353;
}
a = (a * a) % 998244353;
b >>= 1;
}
return res;
}
long long fermat_inv(long long y) { return power(y, 998244353 - 2); }
long long gcd(long long a, long long b) { return (b == 0) ? a : gcd(b, a % b); }
const long long dx[] = {-1, 0, 1, 0, -1, 1, 1, -1};
const long long dy[] = {0, 1, 0, -1, 1, 1, -1, -1};
void solve() {
string s;
cin >> s;
int n = s.length();
int total = 0;
int pos = -1;
for (int i = 0; i < n; i++) {
total += (s[i] == '(' ? 1 : -1);
if (s[i] == '#') {
pos = i;
}
}
if (total < 0) {
printf("%d\n", -1);
return;
}
int last = 1 + total;
total = 0;
for (int i = 0; i < n; i++) {
total += (i == pos ? -last : (s[i] == '(' ? 1 : -1));
if (total < 0) {
printf("%d\n", -1);
return;
}
}
for (int i = 0; i < n; i++) {
if (s[i] == '#') {
if (i == pos) {
printf("%d\n", last);
} else {
printf("%d\n", 1);
}
}
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long T = 1;
while (T--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
stack<int> st;
for (int i = 0; i < s.length(); i++) {
if (s[i] == '(') {
st.push(i);
} else if (s[i] == ')') {
if (!st.empty()) {
st.pop();
} else {
cout << -1;
return 0;
}
}
}
set<int> ind;
while (!st.empty()) {
ind.insert(st.top());
st.pop();
}
int cnt = 0, hash = 0, cur_cnt = 0;
for (int i = 0; i < s.length(); i++) {
if (s[i] == '#') {
++hash;
ind.insert(i);
while (*ind.begin() != i) {
++cnt;
++cur_cnt;
ind.erase(ind.begin());
}
if (cur_cnt == 0) {
if (cnt / hash == 0) {
cout << -1;
return 0;
}
}
cur_cnt = 0;
ind.erase(ind.begin());
}
}
if (ind.empty()) {
for (int i = 0; i < hash - 1; i++) {
cout << 1 << endl;
cnt -= 1;
}
cout << cnt << endl;
} else {
cout << -1;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T>
T sqr(T x) {
return x * x;
}
char s[110000];
int n;
vector<int> ans;
int main() {
int i, sum, cnt, last, x;
scanf("%s", s);
n = strlen(s);
sum = 1;
for (i = 0; i < n; i++) {
if (s[i] == '#') last = i, sum--;
if (s[i] == '(') sum++;
if (s[i] == ')') sum--;
}
if (sum < 1) return puts("-1"), 0;
cnt = 0;
for (i = 0; i < n; i++) {
if (s[i] == '(') cnt++;
if (s[i] == ')') cnt--;
if (s[i] == '#') {
if (i != last)
x = 1;
else
x = sum;
ans.push_back(x);
cnt -= x;
}
if (cnt < 0) return puts("-1"), 0;
}
for (i = 0; i < ans.size(); i++) printf("%d\n", ans[i]);
}
|
#include <bits/stdc++.h>
using namespace std;
char s[100009];
vector<int> re;
void solve() {
scanf("%s", s);
int len = strlen(s);
int t = 0;
int cnt = 0;
int idx = -1;
for (int i = 0; i < len; i++) {
if (s[i] == '(')
t--;
else if (s[i] == ')')
t++;
else {
cnt++;
idx = i;
}
}
if (!t && cnt) {
puts("-1");
return;
}
if (t > 0) {
puts("-1");
return;
}
t = 0;
int Min, Max;
for (int i = 0; i < len; i++) {
if (s[i] == '(')
t--;
else if (s[i] == ')')
t++;
else {
if (t >= 0) {
puts("-1");
return;
}
if (idx != i) {
re.push_back(1);
t++;
} else {
Min = 1;
Max = -t;
}
}
}
if (t >= 0 || t + Max < 0) {
puts("-1");
return;
}
re.push_back(-t);
idx = t = 0;
int n = re.size();
for (int i = 0; i < len; i++) {
if (s[i] == '(')
t--;
else if (s[i] == ')')
t++;
else {
if (idx >= n) {
puts("-1");
return;
}
t += re[idx++];
}
if (t > 0) {
puts("-1");
return;
}
}
if (t) {
puts("-1");
return;
}
for (int i = 0; i < n; i++) {
printf("%d\n", re[i]);
}
}
int main(void) {
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
char str[1000100];
int ak[1000100];
int total_l;
int total_r;
int total_s;
int main() {
cin >> str;
n = strlen(str);
for (int i = 0; i < n; i++) {
if (str[i] == '(')
total_l++;
else if (str[i] == ')')
total_r++;
else
total_s++;
}
for (int i = 0; i < n; i++) {
if (str[i] == '#') {
total_s--;
ak[i] = 1;
total_r++;
if (total_s == 0) ak[i] += -total_r + total_l;
}
}
int count = 0;
for (int i = 0; i < n; i++) {
if (str[i] == '(')
count++;
else if (str[i] == ')')
count--;
else {
count -= ak[i];
if (ak[i] <= 0) {
cout << -1 << endl;
return 0;
}
}
if (count < 0) {
cout << -1 << endl;
return 0;
}
}
for (int i = 0; i < n; i++)
if (ak[i] > 0) cout << ak[i] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAGIC = 300;
string s;
int main() {
cin >> s;
int last = -1;
int a = 0;
int sharp = 0;
for (int i = 0; i < s.length(); ++i) {
switch (s[i]) {
case '(':
a++;
break;
case '#':
last = i;
++sharp;
case ')':
--a;
}
if (a < 0) {
cout << -1 << endl;
return 0;
}
}
int b = 0;
for (int i = 0; i < s.length(); ++i) {
switch (s[i]) {
case '(':
b++;
break;
case '#':
last == i ? b -= a + 1 : --b;
break;
case ')':
--b;
}
if (b < 0) {
cout << -1 << endl;
return 0;
}
}
for (int i = 0; i < sharp - 1; ++i) cout << 1 << endl;
cout << a + 1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int l, r, sh, ll, rr;
int main() {
string s;
cin >> s;
for (int i = 0; i < (int)s.size(); i++) {
l += (s[i] == '(');
sh += (s[i] == '#');
r += (s[i] == ')');
}
if (2 * l < (int)s.size()) {
cout << -1;
return 0;
}
vector<int> ans;
for (int i = 0; i < (int)s.size(); i++) {
ll += (s[i] == '(');
rr += (s[i] == ')');
if (s[i] == '#') {
ans.push_back(sh == 1 ? l - r : 1);
rr += sh == 1 ? l - r : 1;
sh--;
r++;
}
if (ll < rr) {
cout << -1;
return 0;
}
}
for (int i = 0; i < (int)ans.size(); i++) cout << ans[i] << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int ara[100000];
int main() {
string str;
long long int i, n, open = 0, close = 0, hsh = 0;
cin >> str;
long long int z = str.length();
for (i = 0; i < z; i++) {
if (str[i] == '(')
open++;
else if (str[i] == ')')
close++;
else {
n = i;
hsh++;
}
if (close + hsh > open) {
cout << -1 << endl;
return 0;
}
}
long long int op = 0, cl = 0;
for (i = n + 1; i < z; i++) {
if (str[i] == '(')
op++;
else
cl++;
}
if (op > cl) {
puts("-1");
return 0;
}
if (str[z - 1] == '(') {
puts("-1");
return 0;
}
for (i = 0; i < hsh - 1; i++) puts("1");
cout << open - (close + hsh - 1) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int logy(long long int x, long long int y) {
return ceil((long double)(log(x) / log(y)));
}
long long int powe(long long int a, long long int b) {
long long int re = 1;
while (b) {
if (b & 1) re = (re * a) % 1000000007;
a = (a * a) % 1000000007;
b = b >> 1;
}
return re;
}
bool flag = 0, flag1 = 0, flag2 = 0;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long int tt = 1;
while (tt--) {
string s;
cin >> s;
long long int n = s.length();
long long int last = -1, total = 0;
for (long long int i = 0; i < n; i++) {
if (s[i] == '(')
total++;
else
total--;
if (s[i] == '#') last = i;
}
if (total < 0) {
cout << -1;
return 0;
}
long long int add = total + 1;
total = 0;
for (long long int i = 0; i < n; i++) {
if (i == last)
total -= add;
else if (s[i] == '(')
total++;
else
total--;
if (total < 0) {
cout << -1;
return 0;
}
}
for (long long int i = 0; i < n; i++) {
if (i == last)
cout << add << "\n";
else if (s[i] == '#')
cout << 1 << "\n";
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
string s, t = "";
cin >> s;
int x1 = 0, x2 = 0, x3 = 0;
for (int i = 0; i < s.length(); i++) {
if (s[i] == '(') x1++;
if (s[i] == ')') x2++;
if (s[i] == '#') x3++;
}
if (x1 < x2 + x3) {
cout << -1 << endl;
return 0;
}
int r = x3;
for (int i = 0; i < s.length(); i++) {
if (s[i] != '#')
t += s[i];
else if (x3 > 1) {
t += ')';
x3--;
} else {
for (int j = 0; j < x1 - x2 - r + 1; j++) t += ')';
}
}
stack<int> st;
st.push(0);
for (int i = 1; i < t.length(); i++) {
if (st.empty()) {
st.push(i);
continue;
}
int q = st.top();
if (t[q] == '(' && t[i] == ')')
st.pop();
else
st.push(i);
}
if (!st.empty())
cout << -1 << endl;
else {
for (int i = 0; i < r - 1; i++) cout << 1 << endl;
cout << x1 - x2 - r + 1 << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k;
char s[100005];
int r[100005], rn;
int check() {
int i, sum, tmp, val;
sum = 0;
for (i = 0; i < k; i++) {
if (s[i] != '#') {
if (s[i] == '(')
sum++;
else
sum--;
if (sum < 0) return 0;
continue;
}
if (sum < 1) return 0;
r[rn++] = 1;
sum--;
}
tmp = 0;
for (i = n - 1; i > k; i--) {
if (s[i] == '(')
tmp++;
else if (s[i] == ')')
tmp--;
if (tmp > 0) return 0;
}
val = sum + tmp;
if (val < 1) return 0;
r[rn++] = val;
return 1;
}
int main() {
scanf("%s", s);
n = strlen(s);
for (k = n - 1; k >= 0; k--) {
if (s[k] == '#') break;
}
if (check()) {
for (int i = 0; i < rn; i++) printf("%d\n", r[i]);
} else
puts("-1");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> v;
int main() {
string s;
cin >> s;
int n = s.size();
int ptr = 0;
int c1 = 0, c2 = 0;
int te = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '(')
c1++;
else if (s[i] == ')') {
c2++;
te++;
} else
te++;
if (te > c1) {
cout << "-1" << endl;
return 0;
}
}
int f1 = 0, f2 = 0;
int last;
for (int i = n - 1; i >= 0; i--) {
if (s[i] == '#') {
last = i;
break;
} else if (s[i] == '(')
f1++;
else
f2++;
}
if (f1 > f2) {
cout << "-1" << endl;
return 0;
}
int count = 0;
for (int i = 0; i <= last; i++) {
if (s[i] == '#') {
if (i != last) {
v.push_back(1);
count++;
} else
v.push_back((c1 - c2) - count);
}
}
ptr = 0;
int a1 = 0, a2 = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '(')
a1++;
else if (s[i] == ')')
a2++;
else if (s[i] == '#') {
a2 += v[ptr];
ptr++;
}
if (a2 > a1) {
cout << -1 << endl;
return 0;
}
}
for (int i = 0; i < v.size(); i++) {
if (i != v.size() - 1)
cout << v[i] << " ";
else
cout << v[i] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, m;
int main() {
ios_base::sync_with_stdio(false);
string s;
cin >> s;
deque<long long> dq;
long long endd, enddd;
for (int i = 0; i < s.size(); ++i) {
if (s[i] == '#') endd = i;
}
long long res = 0;
for (int i = 0; i < s.size(); ++i) {
if (s[i] == '(')
++res;
else if (s[i] == ')')
--res;
if (res < 0) {
cout << -1;
return 0;
}
if (i != endd && s[i] == '#') {
--res;
if (res < 0) {
cout << -1;
return 0;
}
dq.push_back(1);
} else if (i == endd) {
bool c = false;
long long cnt = 0;
for (int j = endd + 1; j < s.size(); ++j) {
if (s[j] == '(') {
if (!c) {
enddd = j;
c = true;
}
++res;
} else if (s[j] == ')') {
--res;
}
if (res < 0) {
cout << -1;
return 0;
}
}
dq.push_back(res);
if (res <= 0) {
cout << -1;
return 0;
}
break;
}
}
long long cnt = 0;
for (int i = enddd; i < s.size(); ++i) {
if (s[i] == '(')
++cnt;
else if (s[i] == ')')
--cnt;
}
if (cnt > 0) {
cout << -1;
return 0;
}
while (dq.size()) {
cout << dq.front() << endl;
dq.pop_front();
}
}
|
#include <bits/stdc++.h>
using namespace std;
int setBit(int n, int r) { return n | (1 << r); }
int resetBit(int n, int r) { return n & ~(1 << r); }
int checkBit(int n, int r) { return n & (1 << r); }
template <typename T>
T mod(T a, T b = 1000000007) {
return (a % b) >= 0 ? (a % b) : (a % b) + b;
}
template <typename T>
T bigmod(T p, T e, T M) {
T ret = 1;
while (e > 0) {
if (e % 2) ret = (ret * p) % M;
p = (p * p) % M;
e /= 2;
}
return ret;
}
template <typename T>
T power(T x, T y) {
T ans = 1;
while (y > 0) {
if (y % 2) ans *= x;
x *= x;
y /= 2;
}
return ans;
}
template <typename T>
T gcd(T a, T b) {
a = abs(a);
b = abs(b);
while (b != 0) {
a = a % b;
swap(a, b);
}
return a;
}
template <typename T>
T lcm(T a, T b) {
return a * (b / gcd(a, b));
}
template <typename T>
void read(T &result) {
bool sgn = false;
result = 0;
char ch;
ch = getchar();
while (true) {
if (ch == '-') break;
if (ch >= '0' && ch <= '9') break;
ch = getchar();
}
if (ch == '-')
sgn = true;
else
result = ch - '0';
while (true) {
ch = getchar();
if (ch < '0' || ch > '9') break;
result = result * 10 + (ch - '0');
}
if (sgn) result = -result;
}
string s;
stack<int> st;
int main() {
cin >> s;
int h = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '#') h++;
}
int last;
for (int i = s.size() - 1; i >= 0; i--) {
if (s[i] == '#') {
last = i;
break;
}
if (s[i] == ')')
st.push(1);
else {
if (st.size())
st.pop();
else
return 0 * printf("-1\n");
}
}
int extra = st.size();
while (st.size()) {
st.pop();
}
for (int i = 0; i < last; i++) {
if (s[i] == '(')
st.push(1);
else {
if (st.size()) {
st.pop();
} else
return 0 * printf("-1\n");
}
}
int lastAns = st.size() - extra;
if (lastAns < 1) return 0 * printf("-1\n");
while (--h) {
printf("1\n");
}
printf("%d\n", lastAns);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> a;
string s;
cin >> s;
int sum1 = 0;
for (int i = s.size() - 1; s[i] != '#'; i--) {
if (s[i] == ')')
sum1++;
else
sum1--;
if (sum1 < 0) {
cout << -1;
return 0;
}
}
int sum = 0, ss = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '(')
sum++;
else if (s[i] == ')')
sum--;
else {
if (sum == 0) {
ss = -1;
break;
} else {
a.push_back(1);
sum--;
}
}
if (sum < 0) {
ss = -1;
break;
}
}
if (ss == -1)
cout << ss;
else {
a[a.size() - 1] += sum;
for (int i = 0; i < a.size(); i++) cout << a[i] << " ";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string s;
int n;
int cnt;
int pcnt;
int ans[100100], pos;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int i, t = -1;
cin >> s;
n = s.size();
for (i = 0; i < n; i++)
if (s[i] == '#') t = i;
for (i = t + 1; i < n; i++) {
if (s[i] == ')') {
cnt--;
if (cnt == -1) {
cnt = 0;
pcnt++;
}
continue;
}
if (s[i] == '(') {
cnt++;
continue;
}
}
cnt = 0;
for (i = 0; i < n; i++) {
if (s[i] == ')') {
cnt--;
if (cnt < 0) {
cout << -1 << "\n";
return 0;
}
continue;
}
if (s[i] == '(') {
cnt++;
continue;
}
if (i == t) {
ans[pos++] = cnt - pcnt;
cnt = pcnt;
} else {
cnt--;
if (cnt < 0) {
cout << -1 << "\n";
return 0;
}
ans[pos++] = 1;
}
}
if (ans[pos - 1] <= 0 || cnt != 0) {
cout << -1 << "\n";
return 0;
}
for (i = 0; i < pos; i++) cout << ans[i] << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[100010];
string s;
int cnt;
int main() {
cin >> s;
cnt = 0;
for (int i = 0; i < s.length(); i++) {
if (s[i] == '(')
cnt++;
else if (s[i] == ')')
cnt--;
}
int last = 0;
for (int i = 0; i < s.length(); i++) {
if (s[i] == '#') {
a[i] = 1;
cnt--;
last = i;
}
}
if (cnt >= 0)
a[last] += cnt;
else {
cout << "-1";
return 0;
}
bool ok = 1;
cnt = 0;
for (int i = 0; i < s.length(); ++i) {
if (s[i] == '(')
cnt++;
else if (s[i] == ')')
cnt--;
else if (s[i] == '#')
cnt -= a[i];
if (cnt < 0) ok = 0;
}
if (ok && cnt == 0) {
for (int i = 0; i < s.length(); ++i)
if (s[i] == '#') cout << a[i] << endl;
} else
cout << "-1";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char s[111111];
int len, b, last_pos, back_b;
vector<int> ans;
int main() {
gets(s);
len = strlen(s);
for (int i = len - 1; i >= 0; --i) {
if (s[i] == '#') {
last_pos = i;
break;
}
if (s[i] == '(')
++back_b;
else
--back_b;
}
for (int i = 0; i < len; ++i) {
if (s[i] == '(') {
if (b < 0) {
cout << -1;
return 0;
}
++b;
continue;
}
if (s[i] == ')') {
if (b == 0) {
cout << -1;
return 0;
}
--b;
continue;
}
if (b <= 0) {
cout << -1;
return 0;
}
if (s[i] == '#' && last_pos != i) {
--b;
ans.push_back(1);
} else {
if (b + back_b <= 0) {
cout << -1;
return 0;
}
ans.push_back(min(b + back_b, b));
b -= min(b + back_b, b);
}
}
if (b != 0) {
cout << -1;
return 0;
}
for (int i = 0; i < ans.size(); ++i) cout << ans[i] << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
char s[100005];
int n, f = 0, c = 0, cl, last;
cin >> s;
n = strlen(s);
for (int i = 0; i < n; ++i) {
if (s[i] == '#') {
s[i] = ')';
last = i;
f++;
}
}
for (int i = 0; i < n; ++i) {
if (s[i] == '(')
c++;
else
c--;
}
cl = c;
if (c < 0) {
cout << "-1\n";
return 0;
}
c = 0;
for (int i = 0; i < n; ++i) {
if (s[i] == '(')
c++;
else
c--;
if (i == last) c -= cl;
if (c < 0) {
cout << "-1\n";
return 0;
}
}
if (c != 0) {
cout << "-1\n";
return 0;
}
for (int i = 1; i < f; ++i) cout << "1\n";
cout << cl + 1 << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
const int N = (int)1e6 + 7;
const int MOD = (int)1e9 + 7;
const int INF = (int)2e9;
const long long BIG = 1e15;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
;
string s;
cin >> s;
int op = 0, cl = 0, add = 0;
for (auto x : s)
if (x == '(')
++op;
else if (x == ')')
++cl;
else
++add;
if (cl + add > op) cout << -1, exit(0);
op -= cl;
int last = -1, bal = 0;
int n = int(s.size());
for (int i = n - 1; i >= 0; i--)
if (s[i] == '#') {
last = i;
break;
}
vector<int> ans;
for (int i = 0; i < n; i++) {
if (s[i] == '(') ++bal;
if (s[i] == ')') --bal;
if (s[i] == '#') {
if (i == last)
ans.push_back(op), bal -= op;
else
ans.push_back(1), --op, --bal;
}
if (bal < 0) cout << -1, exit(0);
}
if (bal != 0) cout << -1, exit(0);
for (auto x : ans) cout << x << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int INF = 9e18;
long long int mod = 1e9 + 7;
long long int ti = 0;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
long long int te = 1;
while (te--) {
string str1;
cin >> str1;
long long int n = str1.length(), i, j, t;
long long int c1 = 0;
long long int ls;
for (i = 0; i < n; i++) {
c1 += (str1[i] == '(');
if (str1[i] != '(') {
if (c1 == 0) {
cout << "-1" << endl;
return 0;
}
if (str1[i] == '#') ls = i;
c1--;
}
}
if (str1[n - 1] == '(') {
cout << "-1" << endl;
return 0;
}
long long int c2 = 0;
vector<long long int> rm;
for (i = 0; i < n; i++) {
if (str1[i] == '#') {
if (i == ls) {
if (c2 < 1 + c1) {
cout << "-1" << endl;
return 0;
}
rm.push_back(1 + c1);
} else {
rm.push_back(1);
}
} else if (str1[i] == '(') {
c2++;
} else if (str1[i] == ')') {
c2--;
}
}
for (i = 0; i < rm.size(); i++) {
cout << rm[i] << endl;
}
}
}
|
#include <bits/stdc++.h>
int main() {
char str[100005];
int i, j, len, ind, flag, l, r, temp, num, save[100005];
while (scanf("%s", str) != EOF) {
len = strlen(str);
memset(save, 0, sizeof(save));
for (i = 0, num = 0; i < len; i++)
if (str[i] == '#') {
ind = i;
num++;
}
flag = 1;
l = r = 0;
for (i = len - 1; i > ind; i--) {
if (str[i] == ')')
r++;
else
l++;
if (r - l < 0) {
flag = 0;
break;
}
}
temp = l - r;
if (flag) {
l = r = 0;
for (i = 0, j = 0; i <= ind; i++) {
if (str[i] == '(')
l++;
else {
if (str[i] == ')')
r++;
else {
if (j + 1 != num) {
save[j++] = 1;
r++;
} else {
save[j] = l - r + temp;
if (save[j] <= 0) flag = 0;
break;
}
}
}
if (l < r) {
flag = 0;
break;
}
}
if (num == 0 && l != r) flag = 0;
}
if (flag)
for (i = 0; i < num; i++) printf("%d\n", save[i]);
else
printf("-1\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char s[300100], t[300100];
int l, lst = -1;
int ans[300100];
int main() {
scanf("%s", s);
l = strlen(s);
int bal = 0;
for (int i = 0; i < l; i++) {
if (s[i] == '(') bal++;
if (s[i] == ')') bal--;
if (s[i] == '#') {
s[i] = ')';
ans[i] = 1;
lst = i;
bal--;
}
}
for (int i = 0, j = 0; i < l; i++, j++) {
if (i != lst) {
t[j] = s[i];
} else {
ans[i] += max(bal, 0);
t[j] = ')';
j++;
while (bal > 0) t[j] = ')', j++, bal--;
j--;
}
}
bal = 0;
int l2 = strlen(t);
for (int i = 0; i < l2; i++) {
if (t[i] == '(') bal++;
if (t[i] == ')') bal--;
if (bal < 0) {
cout << "-1\n";
return 0;
}
}
if (bal != 0) {
cout << "-1\n";
return 0;
}
for (int i = 0; i < l; i++)
if (ans[i] != 0) printf("%d\n", ans[i]);
return 0;
}
|
#include <bits/stdc++.h>
const long long inf = 0x3f3f3f3f3f3f3f3LL;
const long long mod = 1e9 + 7;
using namespace std;
template <class T>
void smin(T& a, T val) {
if (a > val) a = val;
}
template <class T>
void smax(T& a, T val) {
if (a < val) a = val;
}
template <typename T>
inline std::ostream& operator<<(std::ostream& os, const std::vector<T>& v) {
bool first = true;
os << "[";
for (auto i : v) {
if (!first) os << ", ";
os << i;
first = false;
}
return os << "]";
}
const long long N = 1e5 + 10;
long long lst[N];
string s;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> s;
long long n = (long long)(s.size());
s = 't' + s;
long long prev = 0, open = 0, close = 0, has = 0;
for (long long i = 1; i <= n; ++i) {
open += (s[i] == '(');
close += (s[i] == ')');
has += (s[i] == '#');
if (s[i] == '#') {
prev = i;
}
}
if (open < close + has) {
cout << -1;
return 0;
}
std::vector<long long> v;
long long pref = 0;
for (long long i = 1; i <= n; ++i) {
if (s[i] == '#') {
if (i == prev) {
break;
} else {
pref--;
if (pref < 0) {
cout << -1;
return 0;
}
v.push_back(1);
}
} else if (s[i] == '(') {
pref++;
} else {
pref--;
if (pref < 0) {
cout << -1;
return 0;
}
}
}
long long pref2 = 0;
for (long long i = prev + 1; i <= n; ++i) {
pref2 += (s[i] == '(') ? 1 : -1;
}
long long tt = -(pref + pref2);
if (-tt < 0) {
cout << -1;
return 0;
}
pref += tt;
if (pref < 0) {
cout << -1;
return 0;
}
for (long long i = prev + 1; i <= n; ++i) {
pref += (s[i] == '(') ? 1 : -1;
if (pref < 0) {
cout << -1;
return 0;
}
}
v.push_back(-tt);
for (auto it : v) {
cout << it << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, l;
char c[100100], cc[100100];
;
bool chk[100100];
int print[100100], pl = 0;
int main() {
memset(chk, 0, sizeof(chk));
int i, j, k;
scanf("%s", c);
l = strlen(c);
j = 0;
for (i = l - 1; i >= 0; i--) {
if (c[i] == '#') continue;
if (c[i] == ')') {
j++;
chk[i] = 1;
continue;
}
if (c[i] == '(' && j > 0) {
j--;
chk[i] = 1;
}
}
if (j > 0) {
printf("-1");
return 0;
}
j = 0;
for (i = 0; i < l; i++) {
if (chk[i] == 0) {
cc[j++] = c[i];
}
}
if (cc[j - 1] == '(') {
printf("-1");
return 0;
}
k = 0;
for (i = 0; i < j; i++) {
if (cc[i] == '(') {
k++;
continue;
}
if (cc[i] == '#') {
if (k == 0) {
printf("-1");
return 0;
}
print[pl++] = 1;
k--;
}
}
print[pl - 1] += k;
for (i = 0; i < pl; i++) {
printf("%d\n", print[i]);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename T1, typename T2>
istream& operator>>(istream& in, pair<T1, T2>& a) {
in >> a.first >> a.second;
return in;
}
template <typename T1, typename T2>
ostream& operator<<(ostream& out, pair<T1, T2> a) {
out << a.first << " " << a.second;
return out;
}
template <typename T, typename U>
static inline void amin(T& x, U y) {
if (y < x) x = y;
}
template <typename T, typename U>
static inline void amax(T& x, U y) {
if (x < y) x = y;
}
vector<string> vec_splitter(string s) {
for (char& c : s) c = c == ',' ? ' ' : c;
stringstream ss;
ss << s;
vector<string> res;
for (string z; ss >> z; res.push_back(z))
;
return res;
}
void debug_out(vector<string> __attribute__((unused)) args,
__attribute__((unused)) int idx,
__attribute__((unused)) int LINE_NUM) {
cerr << endl;
}
template <typename Head, typename... Tail>
void debug_out(vector<string> args, int idx, int LINE_NUM, Head H, Tail... T) {
if (idx > 0)
cerr << ", ";
else
cerr << "Line(" << LINE_NUM << "): ";
stringstream ss;
ss << H;
cerr << args[idx] << " = " << ss.str();
debug_out(args, idx + 1, LINE_NUM, T...);
}
long long int power(long long int b, long long int e) {
assert(e >= 0);
if (e == 0) return 1;
if (e % 2 == 1)
return b * power(b * b, (e - 1) / 2);
else
return power(b * b, e / 2);
}
long long int power(long long int b, long long int e, long long int m) {
assert(e >= 0);
if (e == 0) return 1;
if (e % 2 == 1)
return b * power(((b % m) * (b % m)) % m, (e - 1) / 2, m) % m;
else
return power(((b % m) * (b % m)) % m, e / 2, m) % m;
}
const long double pi = acos(-1);
constexpr int mod = 1e9 + 7;
void swagWaalaFunction() {
long long int n, ans = 0, op = 0, cl = 0, open = 0, close = 0, hash = 0,
cnt = 0, xtra = 0;
string s;
cin >> s;
vector<long long int> v;
n = (long long int)s.size();
for (auto i : s) open += (i == '('), close += (i == ')'), hash += (i == '#');
if ((open <= close and hash) or (open < close)) {
cout << -1;
return;
}
for (long long int i = 0; i < (long long int)n; ++i) {
if (s[i] == '(')
op++;
else if (s[i] == ')')
cl++;
else {
cnt++;
if (cnt != hash) {
v.push_back(1);
cl++;
xtra++;
} else {
v.push_back(open - close - xtra);
cl += (open - close - xtra);
}
}
if (cl > op) {
cout << -1;
return;
}
}
for (auto i : v) cout << i << "\n";
return;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
;
long long int tc = 1;
for (long long int i = 0; i < (long long int)tc; ++i) {
swagWaalaFunction();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, d[100007];
char c[100007];
void solve() {
int kol = 0, i, j, l = 0, r = 0, s = 0, k = 0, m;
n = strlen(c);
for (i = 0; i < n; i++) {
if (c[i] == ')') {
r++;
}
if (c[i] == '(') {
l++;
}
if (c[i] == '#') {
d[s] = l - r - k;
k += d[s];
s++;
}
if (s == 0 && r + s > l) {
printf("-1\n");
return;
}
if (s > 0 && r == l) {
printf("-1\n");
return;
}
}
for (i = 0; i < s - 1; i++) {
d[i] = 1;
}
d[s - 1] = l - r - s + 1;
kol = 0;
m = 0;
l = 0;
r = 0;
for (i = 0; i < n; i++) {
if (c[i] == ')') {
r++;
}
if (c[i] == '(') {
l++;
}
if (c[i] == '#') {
m += d[kol];
kol++;
}
if (r + m > l) {
printf("-1\n");
return;
}
}
for (i = 0; i < s; i++) {
printf("%d\n", d[i]);
}
}
int main() {
#pragma comment(linker, "/STACK:67108864")
while (gets(c)) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, k;
string s;
cin >> s;
vector<int> v1;
int op = 0, clo = 0, h = 0;
for (i = 0; i < s.size(); i++) {
if (s[i] == '(')
op++;
else if (s[i] == ')')
clo++;
else
h++;
}
if (op < clo + h) {
printf("-1\n");
return 0;
} else {
vector<char> v;
int x = op - clo - h + 1;
for (i = 0; i < s.size(); i++) {
if (s[i] != '#')
v.push_back(s[i]);
else {
if (h == 1) {
v1.push_back(x);
while (x--) {
v.push_back(')');
}
} else {
v.push_back(')');
v1.push_back(1);
}
h--;
}
}
stack<int> s;
for (i = 0; i < v.size(); i++) {
if (v[i] == '(')
s.push(i);
else {
if (s.empty()) {
printf("-1\n");
return 0;
} else
s.pop();
}
}
if (!s.empty()) {
printf("-1\n");
return 0;
} else {
for (i = 0; i < v1.size(); i++) printf("%d\n", v1[i]);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int const MAX = 10005;
double const eps = 1e-9;
int const INF = 100000;
string s;
vector<int> ans;
int main() {
int n, i, b;
cin >> s;
b = 0;
int pos = -1;
for (i = 0; i < s.size(); ++i) {
if (s[i] == '(')
++b;
else
--b;
if (s[i] == '#') {
ans.push_back(1);
pos = i;
}
if (b < 0) {
cout << "-1" << endl;
return 0;
}
}
for (i = pos; i < s.size() && s[i] != '('; ++i)
;
int k = 0;
if (i < s.size())
for (; i < s.size(); ++i) k += (s[i] == '(' ? 1 : -1);
if (k > 0) {
cout << "-1" << endl;
return 0;
}
ans.back() += b;
for (i = 0; i < ans.size(); ++i) cout << ans[i] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T>
T gcd(T a, T b) {
T r;
while (b != 0) {
r = a % b;
a = b;
b = r;
}
return a;
}
template <class T>
T lcm(T a, T b) {
return a / gcd(a, b) * b;
}
template <class T>
int getbit(T s, int i) {
return (s >> i) & 1;
}
template <class T>
T onbit(T s, int i) {
return s | (T(1) << i);
}
template <class T>
T offbit(T s, int i) {
return s & (~(T(1) << i));
}
const double PI = 2 * acos(0.0);
const double eps = 1e-9;
const int infi = 1e9;
const long long Linfi = (long long)1e18;
const long long MOD = 1000000007;
const int c1 = 11;
const int c2 = 13;
int n;
string s, t;
vector<int> ans;
void solve() {
int dem = 0;
for (int i = 1; i <= n; i++) {
if (s[i] == '(')
dem++;
else if (s[i] == ')')
dem--;
}
int sum = dem;
dem = 0;
for (int i = 1; i <= n; i++) {
if (s[i] == '(')
dem++;
else if (s[i] == ')')
dem--;
else if (s[i] == '#') {
ans.push_back(1);
sum--;
dem--;
}
if (dem < 0) {
cout << -1 << endl;
return;
}
}
ans.back() = sum + 1;
dem = 0;
int chay = 0;
for (int i = 1; i <= n; i++) {
if (s[i] == '(')
dem++;
else if (s[i] == ')')
dem--;
else if (s[i] == '#') {
dem -= ans[chay++];
}
if (dem < 0) {
cout << -1 << endl;
return;
}
}
for (int i = 0; i < ans.size(); i++) cout << ans[i] << endl;
}
int main() {
ios::sync_with_stdio(false);
cin >> s;
n = s.size();
s = '0' + s;
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long M = 1e9 + 7;
const long long INF = LLONG_MAX;
long long power_2(long long p1, long long p2) {
if (p2 == 0) {
return 1;
}
if (p2 == 1) {
return p1 % M;
}
long long y = power_2(p1, p2 / 2);
y = ((((y * y) % M) * power_2(p1, p2 % 2)) % M);
return y;
}
void comps(long long st, vector<set<long long> > *edges, long long *visited,
long long *cats, long long *cnt, long long curr_cnt,
long long max_cnt, long long m) {
visited[st] = 1;
set<long long>::iterator it;
set<long long> x1 = (*edges)[st];
if (cats[st] == 1) {
curr_cnt = curr_cnt + 1;
} else {
curr_cnt = 0;
}
max_cnt = max(max_cnt, curr_cnt);
long long lf = 0;
for (it = x1.begin(); it != x1.end(); ++it) {
if (visited[(*it)] == -1) {
++lf;
comps((*it), edges, visited, cats, cnt, curr_cnt, max_cnt, m);
}
}
if (lf == 0) {
if ((max_cnt) <= m) {
(*cnt) = (*cnt) + 1;
}
}
}
long long popcount1(long long i) {
long long cnt = 0;
while (i > 0) {
if (i % 2 == 1) {
++cnt;
}
i = i / 2;
}
return cnt;
}
long long lf_cnt = 0;
void recurse(long long st, vector<set<pair<long long, long long> > > *edges,
long long *arr, long long n, int *dp) {
arr[st] = 1;
long long i, j;
fill(dp, dp + 2 * n + 2, 0);
set<pair<long long, long long> >::iterator it;
set<pair<long long, long long> > x1 = (*edges)[st];
long long lf = 0;
int *bp = new int[2 * n + 2];
int *cp = new int[2 * n + 2];
for (it = x1.begin(); it != x1.end(); ++it) {
if (arr[(*it).first] == -1) {
recurse((*it).first, edges, arr, n, bp);
++lf;
if (lf == 1) {
for (i = 0; i <= n; ++i) {
dp[i] = min(bp[i], bp[n + 1 + i] + 1);
}
for (i = i; i <= 2 * n + 1; ++i) {
dp[i] = min(bp[i - n - 1] + 1, bp[i]);
}
} else {
for (i = 0; i <= n; ++i) {
cp[i] = dp[0] + min(bp[i], bp[n + i + 1] + 1);
for (j = 0; j <= i; ++j) {
cp[i] = dp[j] + min(bp[i - j], bp[n + (i - j) + 1] + 1);
}
}
for (i = i; i <= 2 * n + 1; ++i) {
cp[i] = dp[i] + min(bp[0] + 1, bp[n + 1]);
for (j = 0; j <= i - n - 1; ++j) {
cp[i] = dp[j] + min(bp[i - j - n - 1] + 1, bp[i - j]);
}
}
for (i = 0; i <= 2 * n + 1; ++i) {
dp[i] = cp[i];
}
}
}
delete (cp);
delete (bp);
}
if (lf == 0) {
dp[0] = 0;
dp[1] = 0;
++lf_cnt;
}
}
void eql(long long **a, long long **b, long long n) {
long long i, j;
for (i = 1; i <= n; ++i) {
for (j = 1; j <= n; ++j) {
a[i - 1][j - 1] = b[i - 1][j - 1];
}
}
}
bool cheql(long long **a, long long **b, long long n) {
bool ans = true;
long long i, j;
for (i = 1; i <= n; ++i) {
for (j = 1; j <= n; ++j) {
ans = ans & (a[i - 1][j - 1] == b[i - 1][j - 1]);
if (!(a[i - 1][j - 1] == b[i - 1][j - 1])) {
}
}
}
return ans;
}
void init1(long long ***a, long long n) {
*a = new long long *[n];
long long i;
for (i = 1; i <= n; ++i) {
(*a)[i - 1] = new long long[n];
fill((*a)[i - 1], (*a)[i - 1] + n, 0);
}
}
long long gcd(long long a, long long b) {
if (a > b) {
return gcd(b, a);
}
if (a == b || a == 0) {
return b;
}
return gcd(b % a, a);
}
int main() {
vector<pair<long long, long long> > xx;
long long n, m, d, p, l, r, t1, q, x, y, z, a, b, c, sum = 0, mult = 1, t = 0;
long long i, j, k;
string s, s1;
t = 1;
while (t-- > 0) {
cin >> s;
long long cnt0;
long long cnt1;
cnt0 = cnt1 = 0;
vector<long long> ans;
bool pos = true;
for (i = 1; i <= s.length(); ++i) {
if (s[i - 1] == '(') {
++cnt0;
}
if (s[i - 1] == ')') {
++cnt1;
}
if (s[i - 1] == '#') {
++cnt1;
ans.push_back(1);
}
if (cnt1 > cnt0) {
pos = false;
break;
}
}
if (!pos) {
cout << -1;
continue;
}
ans[ans.size() - 1] += cnt0 - cnt1;
cnt0 = cnt1 = 0;
j = 0;
pos = true;
for (i = 1; i <= s.length(); ++i) {
if (s[i - 1] == '(') {
++cnt0;
}
if (s[i - 1] == ')') {
++cnt1;
}
if (s[i - 1] == '#') {
cnt1 = cnt1 + ans[j];
++j;
}
if (cnt1 > cnt0) {
pos = false;
break;
}
}
if (!pos) {
cout << -1;
continue;
}
for (i = 1; i <= ans.size(); ++i) {
cout << ans[i - 1] << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
const double PI = acos(-1.0);
const double e = exp(1.0);
template <class T>
T gcd(T a, T b) {
return b ? gcd(b, a % b) : a;
}
template <class T>
T lcm(T a, T b) {
return a / gcd(a, b) * b;
}
template <class T>
inline T Min(T a, T b) {
return a < b ? a : b;
}
template <class T>
inline T Max(T a, T b) {
return a > b ? a : b;
}
bool cmpbig(int a, int b) { return a > b; }
bool cmpsmall(int a, int b) { return a < b; }
using namespace std;
char s[100005];
char s2[100005];
int main() {
int siz, h = 0, x1 = 0, x2 = 0;
string s;
cin >> s;
siz = s.size();
for (int i = 0; i < siz; ++i) {
if (s[i] == '(')
++x1, ++x2;
else if (s[i] == ')')
--x1, x2 = (((x2 - 1) >= 0) ? (x2 - 1) : 0);
else
++h, --x1, x2 = 0;
if (x1 < 0) {
cout << -1;
return 0;
}
}
if (x2 > 0) {
cout << -1;
return 0;
}
--h;
for (int i = 0; i < h; ++i) cout << 1 << '\n';
cout << 1 + x1;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void) {
string s;
cin >> s;
int l = 0;
int r = 0;
int k = 0;
int a = 0;
int b = 0;
vector<int> v(s.length());
for (int i = 0; i < s.length(); i++) {
if (s[i] == '(') {
l++;
} else if (s[i] == ')') {
r++;
} else {
v[k++] = 1;
r++;
}
}
int n = l - r;
for (int i = s.length() - 1, j = k; i >= 0 && n > 0; i--) {
if (s[i] == '(') {
l--;
a++;
} else if (s[i] == ')') {
r--;
b++;
} else if (l - r > 0) {
int tmp = l - r;
if (n > tmp) {
v[--j] += tmp;
n -= tmp;
r += tmp;
} else {
v[--j] += n;
r += n;
n = 0;
break;
}
}
if (a > b) {
n = -1;
break;
}
}
l = 0;
r = 0;
for (int i = 0, j = 0; i < s.length(); i++) {
if (s[i] == '(') {
l++;
} else if (s[i] == ')') {
r++;
} else {
r += v[j++];
}
if (r > l) {
n = -1;
break;
}
}
if (n == 0) {
for (int i = 0; i < k; i++) {
printf("%d\n", v[i]);
}
} else {
printf("%d\n", -1);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string s;
int n, last, dif = 0, cl = 0, ans[100005];
void setup() {
cin >> s;
n = s.length();
for (int i = n - 1; i >= 0; i--) {
cl += (s[i] == ')');
if (s[i] == '#') {
last = i;
break;
}
}
}
void xuly() {
int r = 0;
for (int i = 0; i <= n - 1; i++) {
if (s[i] == '#') {
if (i == last) {
int op = s.length() - i - 1 - cl;
int needToAdd = dif + op - cl;
if (needToAdd <= 0) {
cout << -1;
return;
}
dif -= needToAdd;
ans[++r] = needToAdd;
} else {
s[i] = ')';
ans[++r] = 1;
}
}
dif -= (s[i] == ')');
dif += (s[i] == '(');
if (dif < 0) {
cout << -1;
return;
}
}
for (int i = 1; i <= r; i++) cout << ans[i] << '\n';
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
setup();
xuly();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
int k = 1;
vector<int> m;
int u = 0;
for (int x = 0; x < a.size(); ++x) {
if (a[x] == '(')
u++;
else if (a[x] == ')')
u--;
else {
m.push_back(1);
if (u == 0) {
cout << -1;
k = 0;
break;
}
}
if (u < 0) {
cout << -1;
k = 0;
break;
}
}
if (k) {
if (u == 0)
cout << -1;
else if (m.size() > u)
cout << -1;
else {
m[m.size() - 1] = u - m.size() + 1;
u = 0;
int k = 0;
for (int x = 0; x < a.size(); ++x) {
if (a[x] == '(')
u++;
else if (a[x] == ')')
u--;
else
u = u - m[k++];
if (u < 0) {
cout << -1;
return 0;
}
}
for (int x = 0; x < m.size(); ++x) cout << m[x] << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
size_t noOpen = 0, noClosed = 0, noHash = 0, lastPos = 0;
for (size_t i = 0; i < s.size(); ++i) {
if (s[i] == '(')
++noOpen;
else if (s[i] == ')')
++noClosed;
else {
lastPos = i;
++noHash;
}
if (noClosed + noHash > noOpen) {
cout << "-1\n";
return 0;
}
}
size_t toAddLast = noOpen - noClosed - noHash + 1;
string p;
for (size_t i = 0; i < s.size(); ++i) {
if (s[i] != '#')
p += s[i];
else {
if (i == lastPos) {
for (size_t i = 0; i < toAddLast; ++i) p += ')';
} else
p += ')';
}
}
noOpen = noClosed = 0;
for (size_t i = 0; i < p.size(); ++i) {
if (p[i] == '(')
++noOpen;
else
++noClosed;
if (noClosed > noOpen) {
cout << "-1\n";
return 0;
}
}
if (noOpen != noClosed) {
cout << "-1\n";
return 0;
}
for (size_t i = 1; i < noHash; ++i) cout << "1\n";
cout << toAddLast << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
inline int read() {
static int r, sign;
static char c;
r = 0, sign = 1;
do c = getchar();
while (c != '-' && (c < '0' || c > '9'));
if (c == '-') sign = -1, c = getchar();
while (c >= '0' && c <= '9') r = r * 10 + (int)(c - '0'), c = getchar();
return sign * r;
}
template <typename T>
inline void print(T *a, int n) {
for (int i = 1; i < n; ++i) cout << a[i] << " ";
cout << a[n] << endl;
}
int n, a[100100 + 1], ans[100100 + 1];
char s[100100 + 1];
int main(int argc, char *argv[]) {
scanf("%s", s);
n = strlen(s);
int cnt = 0;
for (int i = 0; i < n; ++i)
if (s[i] == '#') a[++cnt] = i;
int cov = 0;
bool ok = true;
for (int i = 0; i < n; ++i) {
if (s[i] == '(')
++cov;
else
--cov;
if (cov < 0) ok = false;
}
cov = 0;
for (int i = n - 1; i >= 0; --i) {
if (s[i] == ')')
++cov;
else if (s[i] == '(') {
if (cov == 0) {
if (cnt > 0 && a[cnt] > i)
++ans[a[cnt]];
else
ok = false;
} else
--cov;
} else if (s[i] == '#') {
++cov;
if (cnt > 0 && a[cnt] > i) --cnt;
}
}
if (ok) {
for (int i = 0; i < n; ++i)
if (s[i] == '#') printf("%d\n", ans[i] + 1);
} else
printf("-1\n");
fclose(stdin);
fclose(stdout);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXPOW = 20;
const int MAXA = 1048577;
const int MAXN = 100009;
const int MAXM = 100009;
bool solve(const string& s, vector<int>& counts) {
vector<int> balances(s.length());
int balance = 0;
int lastHash = -1;
for (int i = 0; i < s.length(); ++i) {
if (s[i] == '(') {
++balance;
}
if (s[i] == ')') {
--balance;
}
if (s[i] == '#') {
lastHash = i;
counts.push_back(1);
--balance;
}
balances[i] = balance;
if (balance < 0) {
return false;
}
}
if (balance == 0) {
return true;
}
if ((lastHash == -1) && (balance != 0)) {
return false;
}
int b = 0;
for (int i = s.length() - 1; i > lastHash; --i) {
if (s[i] == ')') {
++b;
} else {
--b;
}
if (b < 0) {
return false;
}
}
if (balances[s.length() - 1] - balances[lastHash] > 0) {
return false;
}
counts.back() += balance;
return true;
}
int main() {
ios::sync_with_stdio(false);
string s;
cin >> s;
vector<int> counts;
if (solve(s, counts)) {
for (int i = 0; i < counts.size(); ++i) {
cout << counts[i] << endl;
}
} else {
cout << -1 << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int const inf = 1e18;
long long int const maxn = 1e6 + 5;
long long int const mod = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
;
string s;
cin >> s;
long long int open = 0, i = 0, flag = 0;
long long int n = s.length();
long long int cnt = 0, cur = 1;
for (auto u : s) cnt += (u == '#');
vector<long long int> ans;
while (i < n) {
if (s[i] == '(') {
open++;
i++;
} else if (s[i] == ')') {
if (open)
open--;
else {
flag = 1;
break;
}
i++;
} else if (s[i] == '#') {
if (open <= 0) {
flag = 1;
break;
}
if (cur == cnt) {
long long int tmp = 0;
for (long long int j = i + 1; j < n; j++) {
if (s[j] == '(')
tmp++;
else
tmp--;
}
if (tmp > 0 || abs(tmp) >= open) {
flag = 1;
break;
}
long long int x = open - abs(tmp);
ans.push_back(x);
open -= x;
} else {
ans.push_back(1);
open--;
}
cur++;
i++;
}
}
if (open != 0) flag = 1;
if (flag) {
cout << -1 << "\n";
} else {
for (auto u : ans) cout << u << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string s;
int l, _, p, t;
int main() {
ios ::sync_with_stdio(false);
cin >> s;
for (register int i = 0; i < s.size(); i++) {
if (s[i] == '(') l++;
if (s[i] == ')') l--;
if (s[i] == '#') l--, _++;
if (l < 0) {
cout << -1;
return 0;
}
}
for (register int i = 0; i < s.size(); i++) {
if (s[i] == '#') {
t++;
if (t == _) p -= l;
p--;
}
if (s[i] == '(') p++;
if (s[i] == ')') p--;
if (p < 0) {
cout << "-1";
return 0;
}
}
for (register int i = 1; i < _; i++) cout << "1\n";
cout << 1 + l;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
while (cin >> s) {
int cont = 0, c = -1;
bool possible = true;
vector<int> pos;
for (int i = int(0); i < int(s.length()); i++) {
if (s[i] == '(') {
cont++;
} else if (s[i] == ')') {
cont--;
} else {
pos.push_back(i);
cont--;
c = cont;
}
if (cont < 0) {
possible = false;
break;
}
}
c -= cont;
if (pos.size())
for (int i = int(pos[pos.size() - 1]); i < int(s.length()); i++) {
if (s[i] == '(') {
c++;
} else if (s[i] == ')') {
c--;
}
if (c < 0) {
possible = false;
break;
}
}
if (!possible) {
cout << -1 << endl;
} else {
for (int i = int(0); i < int(pos.size() - 1); i++) {
cout << 1 << endl;
}
cout << cont + 1 << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char s[100007];
int main() {
scanf("%s", s);
int n = strlen(s);
int bal = 0, pos = -1;
for (int i = 0; i < n; i++) {
bal += (s[i] == '(' ? 1 : -1);
if (s[i] == '#') {
pos = i;
}
}
if (bal < 0) {
printf("%d\n", -1);
return 0;
}
int extra = bal + 1;
bal = 0;
for (int i = 0; i < n; i++) {
bal += (i == pos ? -extra : (s[i] == '(' ? 1 : -1));
if (bal < 0) {
printf("%d\n", -1);
return 0;
}
}
for (int i = 0; i < n; i++) {
if (s[i] == '#') {
if (i == pos) {
printf("%d\n", extra);
} else {
printf("%d\n", 1);
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100010;
char s[maxn];
int top = 0;
int a[maxn];
int main() {
scanf("%s", s);
int len = strlen(s);
int tot = 0;
int l = 0, r = 0;
int last = 0;
for (int i = 0; i < len; i++)
if (s[i] == '#')
tot++, last = i;
else if (s[i] == '(')
l++;
else
r++;
if (r + tot > l) {
puts("-1");
return 0;
}
int t = 0;
for (int i = 0; i < len; i++) {
if (s[i] == '(')
t++;
else
t--;
if (i == last) t -= (l - r - tot);
if (t < 0) {
puts("-1");
return 0;
}
}
for (int i = 1; i < tot; i++) puts("1");
printf("%d\n", l - r - tot + 1);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
long long n, a[200009], id2, c = 0, ans[200009] = {0}, sum = 0, j = 0, id;
string s;
cin >> s;
for (int i = s.size() - 1; i >= 0; i--) {
if (s[i] == '#') {
id = i;
break;
}
}
for (int i = 0; i < id; i++) {
if (s[i] == '(')
c++;
else if (s[i] == ')')
c--;
else {
c--;
ans[j] = c;
j++;
}
if (c < 0) {
cout << "-1\n";
exit(0);
}
}
long long c2 = 0;
for (int i = s.size() - 1; i >= 0; i--) {
if (s[i] == '#') {
break;
}
if (s[i] == '(')
c2++;
else if (s[i] == ')')
c2--;
if (c2 > 0) {
cout << "-1\n";
exit(0);
}
}
if (c + c2 <= 0) {
cout << "-1\n";
exit(0);
}
j++;
for (int i = 0; i < j - 1; i++) {
cout << "1\n";
sum++;
}
cout << c + c2 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
string s;
cin >> s;
int n = s.size();
int tot = 0;
int mx = 0;
int l = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '(') tot++;
if (s[i] == '#') {
mx = i;
l++;
}
}
for (int i = 0; i < n; i++) {
if (s[i] == '#') s[i] = ')';
}
int p = n - tot;
bool f = true;
if (p > tot)
f = false;
else {
string t(tot - p, ')');
s = s.substr(0, mx + 1) + t + s.substr(mx + 1);
int a = 0, b = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '(')
a++;
else
b++;
if (a < b) f = false;
}
if (f) {
for (int i = 0; i < l - 1; i++) {
cout << 1 << endl;
}
cout << tot - p + 1 << endl;
}
}
if (!f) {
cout << "-1" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 2e9;
const long long LINF = 2e18;
const double DINF = numeric_limits<double>::max();
const int ITER = 300;
const int MOD = 1e9 + 7;
const double EPS = 1e-9;
const int MAXN = 2e5 + 15;
string s;
int last;
bool LAST(int a) { return a == last; }
void TAIL(int p, int& opb, int& clb) {
for (int i = p; i < s.size(); i++) {
if (s[i] == '(')
opb++;
else
clb++;
}
}
void solve() {
cin >> s;
for (int i = s.size() - 1; i >= 0; i--) {
if (s[i] == '#') {
last = i;
break;
}
}
int ob = 0;
vector<int> v;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '(') {
ob++;
} else if (s[i] == ')') {
ob--;
if (ob < 0) {
cout << -1 << endl;
exit(0);
}
} else {
if (ob == 0) {
cout << -1 << endl;
exit(0);
}
if (LAST(i)) {
int opb = 0, clb = 0;
TAIL(i + 1, opb, clb);
if (opb > clb) {
cout << -1 << endl;
exit(0);
}
int rcb = clb - opb;
if (ob <= rcb) {
cout << -1 << endl;
exit(0);
}
v.push_back(ob - rcb);
ob = rcb;
} else {
v.push_back(1);
ob--;
}
}
}
for (int to : v) {
cout << to << endl;
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t = 1;
while (t--) {
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
char a[maxn];
int main() {
scanf("%s", a);
int l = 0;
int r = 0;
int len = strlen(a);
int cnt = 0;
int cnt1;
for (int i = 0; i < len; ++i) {
if (a[i] == '#') {
++cnt;
} else if (a[i] == '(') {
++l;
} else if (a[i] == ')') {
++r;
}
if (l < r || l == 0) {
printf("%d\n", -1);
return 0;
}
}
cnt1 = cnt;
int cnt2 = cnt;
if (l - r < cnt) {
printf("%d\n", -1);
return 0;
}
l = 0;
if (cnt == 0) {
printf("%d\n", -1);
return 0;
}
for (int i = 0; i < len; ++i) {
if (l < 0) {
printf("%d\n", -1);
return 0;
}
if (a[i] == '(') {
++l;
} else if (a[i] == ')') {
--l;
} else if (a[i] == '#') {
if (cnt != 1) {
--cnt;
--l;
} else {
for (int j = i + 1; j < len; ++j) {
if (a[j] == '(')
++l;
else if (a[j] == ')')
--l;
}
int l1 = 0;
for (int k = 0; k < len; ++k) {
if (l1 < 0) {
printf("%d\n", -1);
return 0;
}
if (a[k] == '(') {
++l1;
} else if (a[k] == ')') {
--l1;
} else if (a[k] == '#') {
if (cnt1 != 1) {
--cnt1;
--l1;
} else {
l1 = l1 - l;
}
}
}
break;
}
}
}
for (int m = 0; m < cnt2; ++m) {
if (m != cnt2 - 1)
printf("%d\n", 1);
else {
printf("%d\n", l);
}
}
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("O2")
#pragma GCC optimize("unroll-loops")
using namespace std;
const int MAX = 1e3 + 5;
const long long MAX2 = 11;
const long long MOD = 1000000007;
const long long MOD2 = 1000005329;
const long long INF = 2e18;
const int dr[] = {1, 0, -1, 0, 1, 1, -1, -1, 0};
const int dc[] = {0, 1, 0, -1, 1, -1, 1, -1, 0};
const double pi = acos(-1);
const double EPS = 1e-9;
const int block = 555;
int n, ls, cnt, hit, jl;
string s;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> s;
n = s.size(), s = 'a' + s;
for (int i = 1; i <= n; ++i) {
if (s[i] == '(')
++cnt;
else if (s[i] == ')')
--cnt;
else
--cnt, ls = i, ++jl;
}
if (cnt < 0) return cout << "-1\n", 0;
hit = cnt, cnt = 0;
for (int i = 1; i <= n; ++i) {
if (s[i] == '(')
++cnt;
else if (s[i] == ')')
--cnt;
else
--cnt;
if (i == ls) cnt -= hit;
if (cnt < 0) return cout << "-1\n", 0;
}
if (cnt != 0) return cout << "-1\n", 0;
for (int i = 2; i <= jl; ++i) cout << "1\n";
cout << hit + 1 << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
inline void use_io_optimizations() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
}
int main() {
use_io_optimizations();
string lock;
cin >> lock;
int difference{0};
int last_hole{0};
for (string::size_type i{0}; i < lock.size(); ++i) {
difference += (lock[i] == '(' ? 1 : -1);
if (lock[i] == '#') {
last_hole = i;
}
}
int last_number{max(1, difference + 1)};
difference = 0;
for (string::size_type i{0}; i < lock.size(); ++i) {
if (i == last_hole) {
difference -= last_number;
} else {
difference += (lock[i] == '(' ? 1 : -1);
}
if (difference < 0) {
cout << "-1\n";
return 0;
}
}
for (string::size_type i{0}; i < lock.size(); ++i) {
if (lock[i] == '#') {
cout << (i == last_hole ? last_number : 1) << '\n';
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long M = 1e15 + 7;
const long long oo = 1e13;
const double PI = acos(-1);
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
int n = s.size() - 1, o = 0, ls = -1, ans = 1, co = 0;
for (int i = n; i >= 0; --i) {
o += (s[i] == '(' ? 1 : -1);
if (o > 0 && ls == -1)
return cout << -1 << endl, 0;
else if (o > 0)
o = 0, ans++;
if (s[i] == '#') ls = i, co++;
}
if (o) return cout << -1 << endl, 0;
while (--co) cout << 1 << endl;
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int GCD(int a, int b) {
if (!a) return b;
return GCD(b % a, a);
}
bool valid(string &str, int start, int last) {
stack<char> S;
for (int i = start; i < last; i++) {
if (str[i] == '(') {
S.push('(');
} else if (str[i] == ')') {
if (S.empty()) return false;
S.pop();
}
}
if (S.empty()) return true;
return false;
}
int main() {
clock_t startTime = clock();
ios_base::sync_with_stdio(false);
string str;
cin >> str;
int n = str.size();
int c = 0;
int last = -1;
for (int i = 0; i < n; i++) {
if (str[i] == '#') {
str[i] = ')';
c++;
last = i;
}
}
if (valid(str, last + 1, n) || 1) {
int left = 0;
for (int i = 0; i < n; i++) {
if (str[i] == '(')
left++;
else
left--;
}
if (left >= 0) {
string nstr;
for (int i = 0; i < last; i++) nstr += str[i];
for (int i = 0; i < left + 1; i++) nstr += ')';
for (int i = last + 1; i < n; i++) nstr += str[i];
if (valid(nstr, 0, nstr.size())) {
for (int i = 1; i < c; i++) cout << "1\n";
cout << left + 1 << "\n";
} else {
cout << "-1\n";
}
} else {
cout << "-1\n";
}
} else {
cout << "-1\n";
}
clock_t endTime = clock();
cerr << "\nTime:" << double(endTime - startTime) / CLOCKS_PER_SEC
<< " seconds\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string st;
int sz, total, last, pos;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> st;
sz = st.size();
for (int i = 0; i < sz; i++) {
total += st[i] == '(' ? 1 : -1;
if (st[i] == '#') pos = i;
}
if (total < 0) {
cout << "-1\n";
return 0;
}
last = 1 + total;
total = 0;
for (int i = 0; i < sz; i++) {
total += (i == pos) ? -last : (st[i] == '(' ? 1 : -1);
if (total < 0) {
cout << "-1\n";
return 0;
}
}
for (int i = 0; i < sz; i++) {
if (st[i] == '#')
if (i == pos)
cout << last << "\n";
else
cout << "1\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char s[100001];
int main() {
scanf("%s", &s);
int c1 = 0, c2 = 0;
vector<int> v;
int n = strlen(s);
int N = n;
int lp = 0;
int k1 = 0;
for (int(i) = 0; (i) < (n); (i)++)
if (s[i] == '(') k1++;
for (int(i) = 0; (i) < (n); (i)++)
if (s[i] == ')') k1--;
for (int(i) = 0; (i) < (n); (i)++)
if (s[i] == '#') lp = i;
int tt = 0;
for (int(i) = 0; (i) < (n); (i)++) {
if (s[i] == '(')
tt++;
else if (s[i] == ')')
tt--;
else if (s[i] == '#' && lp != i)
k1--, v.push_back(1), tt--;
else {
if (k1 <= 0) return puts("-1");
v.push_back(k1);
tt -= k1;
}
if (tt < 0) return puts("-1");
}
for (int(i) = 0; (i) < (v.size()); (i)++) printf("%d\n", v[i]);
}
|
#include <bits/stdc++.h>
using namespace std;
int fang1[][2] = {-1, 0, 1, 0, 0, -1, 0, 1};
int main() {
string s;
while (getline(cin, s, '\n')) {
int n1, n2, n3;
n1 = n2 = n3 = 0;
for (int i = (0); i < (s.size()); i++) {
if (s[i] == '(') n1++;
if (s[i] == '#') n2++;
if (s[i] == ')') n3++;
}
if (n1 < n3 + n2) {
printf("-1\n");
continue;
}
int num2 = n2;
int num = n1 - n3 - (n2 - 1);
for (int i = (0); i < (s.size()); i++) {
if (s[i] == '#' && n2 > 1) {
s[i] = ')';
n2--;
continue;
}
if (s[i] == '#' && n2 == 1) {
s[i] = ')';
n2 = 0;
s.insert(s.begin() + i, num - 1, ')');
continue;
}
}
n1 = n2 = 0;
int flag = 0;
for (int i = (0); i < (s.size()); i++) {
if (s[i] == '(') n1++;
if (s[i] == ')') n2++;
if (n1 >= n2)
continue;
else {
flag = 1;
break;
}
}
if (flag)
printf("-1\n");
else {
for (int i = (0); i < (num2); i++) {
if (i != num2 - 1)
printf("1\n");
else
printf("%d\n", num);
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m, k, t, r1;
string s;
int a[100010];
int main() {
cin >> s;
int n = s.size();
int q = 0;
int cnt = 0;
int open = 0;
int close = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '(')
open++;
else
close++;
if (s[i] == '#') cnt++;
}
if (close > open) {
cout << "-1";
exit(0);
}
k = open - close;
int ncnt = 0;
int nopen = 0;
int nclose = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '(') {
nopen++;
if (nopen < nclose) {
cout << "-1";
exit(0);
}
} else if (s[i] == ')') {
nclose++;
if (nopen < nclose) {
cout << "-1";
exit(0);
}
} else {
ncnt++;
if (ncnt == cnt) {
nclose += k + 1;
a[q++] = k + 1;
} else {
nclose++;
a[q++] = 1;
}
if (nopen < nclose) {
cout << "-1";
exit(0);
}
}
}
for (int i = 0; i < q; i++) {
cout << a[i] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
mt19937 rnd(time(0));
const double eps = 1e-10;
const long long N = 3e4 + 7;
const long long MOD = 1e9 + 7;
long long pw(long long b, long long p) {
b %= MOD;
long long res = 1;
while (p > 0) {
if (p & 1) res = res * b % MOD;
b = b * b % MOD;
p >>= 1;
}
return res;
}
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
long long n = s.size();
long long o = 0, c = 0, h = 0, cnt = 0;
for (long long i = 0; i < n; i++) {
if (s[i] == '#') h++;
}
vector<long long> ans;
for (long long i = 0; i < n; i++) {
if (s[i] == '(')
o++;
else if (s[i] == ')')
c++;
else {
cnt++;
if (cnt == h) {
long long x = o - c;
for (long long j = i + 1; j < n; j++) {
if (s[j] == ')')
x--;
else if (s[j] == '(')
x++;
}
if (x <= 0) {
cout << -1;
return 0;
}
ans.emplace_back(x);
o -= x;
} else {
ans.emplace_back(1);
o--;
}
}
if (o < c) {
cout << -1;
return 0;
}
}
if (ans.size() < h) {
cout << -1;
} else {
for (auto i : ans) cout << i << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string s;
int k1, k2, k3, cnt, c1, c2;
int main() {
cin >> s;
if (s[0] == '#') {
cout << -1;
exit(false);
}
for (int i = 0; i < s.size(); i++) {
if (s[i] == '(')
k1++;
else {
if (s[i] == ')')
k2++;
else {
if (k1 < k2) {
cout << -1;
exit(false);
}
k3++;
}
}
if (k3 == 0) {
if (k2 > k1) {
cout << -1;
exit(false);
}
}
}
if (k1 < k2) {
cout << -1;
exit(false);
}
for (int i = s.size() - 1; i >= 0; i--) {
if (s[i] == '#') break;
if (s[i] == '(')
c1++;
else {
c2++;
}
if (c1 > c2) {
cout << -1;
exit(false);
}
}
cnt = k1 - k2;
if (cnt < k3) {
cout << -1;
exit(false);
}
for (int i = 1; i < k3; i++) {
cout << 1 << '\n';
}
cout << cnt - (k3 - 1);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size(), c = 0, k = 0, tag = true, z, i;
for (i = 0; i < n; i++) {
if (s[i] == '(')
k++;
else if (s[i] == ')')
k--;
else {
s[i] = ')';
z = i;
k--;
c++;
}
if (k < 0) {
tag = false;
break;
}
}
if (c == 0 && k > 0) tag = false;
if (tag == true) {
if (k > 0) {
string p = s.substr(0, z);
for (i = 0; i < k; i++) p += ')';
p += s.substr(z, n - z);
vector<int> q;
q.push_back(p[0]);
for (i = 1; i < p.size(); i++) {
if (q[q.size() - 1] == '(' && p[i] == ')')
q.pop_back();
else
q.push_back(p[i]);
}
if (q.size() > 0) tag = false;
}
}
if (tag == false) cout << "-1";
if (tag == true) {
for (i = 0; i < c - 1; i++) cout << "1" << endl;
if (c > 0) cout << k + 1 << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
string s;
int l, r, D;
int main() {
cin >> s;
for (int i = 0, sz = s.size(); i < sz; i++) {
if (s[i] == '(')
l++, r++;
else {
l--;
if (r > 0) r--;
if (l < 0) cout << -1, exit(0);
if (s[i] == '#') r = 0, D++;
}
}
if (r > 0) cout << -1, exit(0);
for (int i = 0; i < D - 1; i++) cout << 1 << endl;
cout << l + 1;
}
|
#include <bits/stdc++.h>
using namespace std;
string s;
int maxi = -1;
int temp = 0;
int temp2 = 0;
int cnt = 0;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> s;
for (int i = 0, len = s.length(); i < len; i++) {
if (s[i] == '#') maxi = i;
}
int i = 0;
int len = s.length();
while (i < len) {
if (i <= maxi) {
if (s[i] == '(') temp++;
if (s[i] == ')') temp--;
if (s[i] == '#') {
if (temp <= 0) {
cout << -1 << endl;
return 0;
} else
cnt++;
}
if (temp < 0) {
cout << -1 << endl;
return 0;
}
} else {
while (s[i] != '(' and i < len) {
temp--;
i++;
}
for (int j = i; j < len; j++) {
if (s[j] == '(') temp2++;
if (s[j] == ')') temp2--;
}
break;
}
i++;
}
if (temp2 > 0 or cnt > temp) {
cout << -1 << endl;
return 0;
} else {
temp += temp2;
if (cnt > temp) {
cout << -1 << endl;
} else {
for (int i = 0; i < cnt; i++) {
if (i == cnt - 1) {
cout << temp - cnt + 1 << endl;
} else {
cout << 1 << endl;
}
}
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
std::ios_base::sync_with_stdio(false);
cout.precision(20);
string s;
cin >> s;
int n, cnt = 0, reqc = 0, x;
n = s.length();
for (int i = 0; i < n; i++) {
if (s[i] == ')')
cnt--;
else if (s[i] == '(')
cnt++;
else if (s[i] == '#')
reqc++;
if (cnt < 0 or (cnt == 0 and s[i] == '#')) {
cout << -1;
return 0;
}
}
vector<int> has;
for (int i = 0; i < n; i++)
if (s[i] == '#') {
if (cnt <= 0) {
cout << -1;
return 0;
}
if (reqc == 1) {
has.push_back(cnt);
s.erase(s.begin() + i);
for (int j = 0; j < cnt; j++) s.insert(s.begin() + i, ')');
cnt = 0;
break;
} else {
has.push_back(1);
s.erase(s.begin() + i);
s.insert(s.begin() + i, ')');
cnt--;
}
reqc--;
}
cnt = 0;
n = s.length();
for (int i = 0; i < n; i++) {
if (s[i] == ')')
cnt--;
else if (s[i] == '(')
cnt++;
else if (s[i] == '#')
reqc++;
if (cnt < 0 or (cnt == 0 and s[i] == '#')) {
cout << -1;
return 0;
}
}
if (cnt != 0) {
cout << -1;
return 0;
}
for (int i = 0; i < has.size(); i++) cout << has[i] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
int cnt = 0;
int open = 0, close = 0, sharp = 0, lst = 0;
for (int i = 0; i < (int)str.size(); i++) {
if (str[i] == ')') close++;
if (str[i] == '(') open++;
if (str[i] == '#') {
lst = i;
sharp++;
}
}
int ans = (open - close) - (sharp - 1);
if (ans <= 0) {
cout << -1;
return 0;
}
for (int i = 0; i < (int)str.size(); i++) {
if (i != lst && str[i] == '#') str[i] = ')';
}
for (int i = 0; i < (int)str.size(); i++) {
if (str[i] == ')') cnt--;
if (str[i] == '(') cnt++;
if (str[i] == '#') cnt -= ans;
if (cnt < 0) {
cout << -1;
return 0;
}
}
for (int i = 1; i < sharp; i++) cout << 1 << endl;
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
if (!b) return a;
return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return b / gcd(a, b) * a; }
string x;
int a, b, c;
vector<int> p;
int g[1 << 20];
int main() {
cin >> x;
for (int(i) = 0; i < int(x.size()); ++i) {
if (x[i] == '(') {
++a;
g[i] = 1;
} else if (x[i] == ')') {
++b;
g[i] = -1;
} else {
if (b + 1 > a) {
puts("-1");
return 0;
}
p.push_back(i);
++b;
g[i] = -1;
}
}
int n = p.size();
g[p[n - 1]] = -(a - b + 1);
int s = 0, ss = 0;
for (int(i) = 0; i < int(x.size()); ++i) {
s += g[i];
if (s < 0 || g[i] == 0) {
puts("-1");
return 0;
}
}
for (int i = 0; i < n - 1; ++i) cout << 1 << endl;
cout << a - b + 1 << endl;
cin >> n;
}
|
#include <bits/stdc++.h>
using namespace std;
string s;
int n, strt_cnt, hash_cnt, end_cnt[100005];
vector<int> soln;
int main() {
cin >> s;
n = s.size();
hash_cnt = count(s.begin(), s.end(), '#');
for (int i = n - 1; i >= 0; i--) {
end_cnt[i] = end_cnt[i + 1] + (s[i] == ')') - (s[i] == '(') + (s[i] == '#');
}
for (int i = 0; i < n; i++) {
if (s[i] == '(') {
strt_cnt++;
} else if (s[i] == ')') {
strt_cnt--;
} else if (s[i] == '#' && hash_cnt != 1) {
strt_cnt--;
hash_cnt--;
soln.push_back(1);
} else if (s[i] == '#' && hash_cnt == 1) {
hash_cnt--;
int pushing = (strt_cnt - end_cnt[i + 1]);
if (pushing <= 0) {
cout << "-1";
return 0;
}
strt_cnt -= pushing;
soln.push_back(pushing);
}
if (strt_cnt < 0) {
cout << "-1";
return 0;
}
}
if (strt_cnt != 0) {
cout << "-1";
return 0;
}
for (int i = 0; i < soln.size(); i++) {
cout << soln[i] << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char s[100200];
int sum = 0, x = 0, d = 0;
int main() {
cin >> s;
for (int i = strlen(s) - 1; i >= 0; --i) {
if (s[i] == '(') {
x++;
} else if (s[i] == ')') {
x--;
} else
break;
if (x > 0) {
cout << -1;
return 0;
}
}
x = 0;
for (int i = 0; i < strlen(s); ++i) {
if (s[i] == '(') {
x++;
} else if (s[i] == ')') {
x--;
} else
break;
if (x < 0) {
cout << -1;
return 0;
}
}
x = 0;
for (int i = 0; i < strlen(s); ++i) {
if (s[i] == '(') {
sum++;
x++;
} else if (s[i] == ')') {
sum--;
x--;
} else {
if (sum <= 0) {
cout << -1;
return 0;
} else {
d++;
sum--;
}
}
}
if (x <= 0) {
cout << -1;
return 0;
}
for (int i = 1; i < d; ++i) {
cout << 1 << endl;
}
cout << sum + 1;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
vector<int> v;
int main() {
ios_base ::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
string s;
cin >> s;
int n = s.length();
int o = 0, c = 0, h = 0;
int d = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '(') {
d++;
o++;
} else if (s[i] == ')') {
d--;
c++;
} else {
v.push_back(1);
d--;
}
if (d < 0) return cout << -1, 0;
}
if (o <= c) return cout << -1, 0;
int x = v[v.size() - 1];
v.pop_back();
v.push_back(x + d);
int yo = 0;
o = 0, c = 0, d = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '(') {
o++, d++;
} else if (s[i] == ')') {
c++, d--;
} else {
d -= v[yo];
yo++;
}
if (d < 0) return cout << -1, 0;
}
for (auto i : v) cout << i << " ";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int inv = 1000000000;
const int minv = -inv;
const int max_n = 100010;
char s[max_n + 5];
int ns;
char r[2 * max_n];
int nr;
int last, nopen, nclose, nhash;
int res;
int main() {
scanf("%s", s);
for (ns = 0; s[ns] != 13 and s[ns] != 0; ++ns)
;
s[ns] = 0;
nopen = 0;
nclose = 0;
nhash = 0;
last = -1;
for (int i = 0; i < ns; ++i) {
if (s[i] == '#') {
last = i;
++nhash;
} else if (s[i] == '(')
++nopen;
else
++nclose;
}
if (nclose + nhash > nopen) {
printf("%d\n", -1);
return 0;
}
nr = 0;
for (int i = 0; i < ns; ++i) {
if (s[i] == '#') {
r[nr++] = ')';
if (i == last)
for (int j = 0; j < nopen - nclose - nhash; ++j) r[nr++] = ')';
} else if (s[i] == '(')
r[nr++] = '(';
else if (s[i] == ')')
r[nr++] = ')';
}
res = nopen - nclose - nhash;
nopen = 0;
nclose = 0;
for (int i = 0; i < nr; ++i) {
if (r[i] == '(')
++nopen;
else
++nclose;
if (nopen < nclose) {
printf("%d\n", -1);
return 0;
}
}
for (int i = 0; i < ns; ++i) {
if (s[i] == '#') {
if (i == last)
printf("%d\n", res + 1);
else
printf("%d\n", 1);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int open = 0;
int dif = 0;
int has = 0;
bool ok = 1;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '(') {
dif++;
open++;
} else if (s[i] == ')') {
dif--;
if (open > 0) open--;
} else if (s[i] == '#') {
has++;
dif--;
open = 0;
}
if (dif < 0) {
ok = 0;
break;
}
}
if (open > 0) ok = 0;
if (ok) {
for (int i = 0; i < has - 1; i++) {
printf("1\n");
}
printf("%d\n", dif + 1);
} else
puts("-1");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return (b == 0 ? a : gcd(b, a % b)); }
long long lcm(long long a, long long b) { return ((a * b) / gcd(a, b)); }
long long pw(long long b, long long p) {
if (!p) return 1;
long long sq = pw(b, p / 2);
sq *= sq;
if (p % 2) sq *= b;
return sq;
}
long long sd(long long x) { return x < 10 ? x : x % 10 + sd(x / 10); }
double sq(double x) {
for (long long i = 0; i < x; i++)
if ((double)i * i > x) return (i - 1);
return double(1);
}
int main() {
string s;
cin >> s;
vector<long long> out;
int cnt1 = 0, windCnt = 0, check = 0;
for (long long i = 0; i < s.size(); i++) {
if (s[i] == '(')
++cnt1, ++check;
else if (s[i] == ')')
--cnt1, --check;
else
++windCnt, --check;
if (check < 0) return puts("-1"), 0;
}
int cnt2 = 0, win = windCnt, cnt3 = cnt1;
for (long long i = 0; i < s.size(); i++) {
if (s[i] == '(')
cnt2++;
else if (s[i] == ')')
cnt2--;
else {
if (win == 1)
cnt2 -= cnt3;
else
cnt2--, win--, --cnt3;
}
if (cnt2 < 0) return puts("-1"), 0;
}
for (long long i = 0; i < windCnt - 1; i++) puts("1");
printf("%d", cnt1 - (windCnt - 1));
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
const int mod = 1e9 + 7;
string s;
vector<int> res(N, 0), h;
bool solve() {
vector<int> st;
int open = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '(')
st.push_back(i);
else if (s[i] == ')') {
if (!st.size()) return 0;
st.pop_back();
} else
h.push_back(i);
}
int i = 0;
for (int j = 0; j < h.size(); j++) {
while (i < st.size() && st[i] < h[j]) res[j]++, i++;
if (j) res[j] += res[j - 1] - 1, res[j - 1] = 1;
if (res[j] <= 0) return 0;
}
if (i != st.size()) return 0;
return 1;
}
int main() {
cin >> s;
if (!solve()) {
cout << "-1";
return 0;
}
for (int i = 0; i < h.size(); i++) cout << res[i] << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string num_to_str(int n) {
string res = "";
if (!n) return "0";
while (n) {
res += ((n % 10) + '0');
n /= 10;
}
reverse(res.begin(), res.end());
return res;
}
int str_to_num(string s) {
int res = 0, p = 1;
for (int i = s.size() - 1; i >= 0; i--) res += ((s[i] - '0') * p), p *= 10;
return res;
}
int main() {
ios::sync_with_stdio(0);
string s;
cin >> s;
long long c1 = 0, c2 = 0, l = 0, ss = 0, c3;
int idx = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == ')' || s[i] == '#')
c1++;
else
c2++;
if (s[i] == '#') idx = i, ss++;
}
if (c1 > c2) {
int out = -1;
cout << out << endl;
return 0;
}
c3 = c2 - c1;
c2 = 0;
c1 = 0;
for (int i = 0; i < s.size(); i++) {
if (i == idx) c1 += c3;
if (s[i] == ')' || s[i] == '#')
c1++;
else
c2++;
if (c2 < c1) {
int out = -1;
cout << out << endl;
return 0;
}
}
for (int i = 0; i < ss; i++) {
if (i == ss - 1)
cout << c3 + 1 << endl;
else
cout << 1 << " ";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5;
int ans[N];
int main(int argc, const char* argv[]) {
ios_base::sync_with_stdio(false);
string s;
cin >> s;
int n = (int)s.length();
int balance = 0, cnt = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '(') balance++;
if (s[i] == ')') balance--;
if (s[i] == '#') {
ans[cnt++] = 1;
balance--;
}
if (balance < 0) {
cout << "-1\n";
return 0;
}
}
ans[cnt - 1] += balance;
balance = cnt = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '(') balance++;
if (s[i] == ')') balance--;
if (s[i] == '#') balance -= ans[cnt++];
if (balance < 0) {
cout << "-1\n";
return 0;
}
}
for (int i = 0; i < cnt; i++) cout << ans[i] << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
string s;
cin >> s;
int n = s.size();
int cnt = 0;
vector<int> ques;
for (int i = 0; i < n; i++) {
if (s[i] == '(')
cnt++;
else if (s[i] == ')')
cnt--;
else
ques.push_back(i);
}
for (int i = 0; i < ques.size(); i++) cnt--, s[ques[i]] = ')';
string add;
for (int i = 0; i < cnt; i++) add.push_back(')');
s.insert(s.begin() + ques.back(), add.begin(), add.end());
int check = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '(') check++;
if (s[i] == ')') check--;
if (check < 0) break;
}
if (check != 0)
cout << -1 << endl;
else {
for (int i = 0; i < ques.size() - 1; i++) cout << 1 << endl;
cout << cnt + 1 << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char S[110000];
int L;
int main() {
scanf("%s", S + 1);
L = strlen(S + 1);
int t = 0, la;
for (int i = 1; i <= L; ++i) {
if (S[i] == '#') {
t++;
la = i;
}
}
if (t > 1) {
for (int i = 1; i <= la - 1; ++i) {
if (S[i] == '#') S[i] = ')';
}
}
int t1 = 0, flag = 0;
for (int i = 1; i <= la - 1; ++i) {
if (S[i] == '(')
t1++;
else
t1--;
if (t1 < 0) flag = 1;
}
int t2 = 0;
for (int i = L; i >= la + 1; --i) {
if (S[i] == ')')
t2++;
else
t2--;
if (t2 < 0) flag = 1;
}
if (flag || t1 <= t2)
puts("-1");
else {
for (int i = 1; i <= t - 1; ++i) puts("1");
printf("%d\n", t1 - t2);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int t = s.size();
vector<int> v(t), MAX(t);
bool end = false;
int d = 0;
int last = 0;
for (int i = 0; i < t; ++i) {
if (s[i] == '#') last = i + 1;
if (s[i] == '(')
++d;
else
--d;
v[i] = d;
if (d == -1) {
end = true;
break;
}
}
int sum = 0;
for (int i = t - 1; i >= last; --i) {
if (sum < 0) {
end = true;
break;
}
if (s[i] == ')')
++sum;
else
--sum;
}
if (end or sum < 0) {
cout << -1 << endl;
return 0;
}
MAX[t - 1] = v[t - 1];
for (int i = t - 2; i > 0; --i) {
MAX[i] = min(MAX[i + 1], v[i]);
}
int m = 0;
for (int i = 0; i < t; ++i) {
if (s[i] == '#') cout << MAX[i] + 1 - m << endl, m = MAX[i];
}
}
|
#include <bits/stdc++.h>
using namespace std;
stack<long long int> q;
int main() {
long long int open = 0, count = 0, rcount = 0, i;
string str;
cin >> str;
for (i = 0; i < str.length(); i++) {
if (str[i] == '(')
open++;
else if (str[i] == ')') {
if (open != 0)
open--;
else
count--;
}
if (str[i] == '#') {
count += open - 1;
open = 0;
rcount++;
}
if (count < 0) {
cout << -1;
return 0;
}
}
if (open > 0) {
cout << -1;
return 0;
}
for (i = 0; i < rcount - 1; i++) cout << "1 ";
cout << count + 1;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int d[100000 + 5];
int ans[100000 + 5];
int main() {
int n;
char x;
string s;
cin >> s;
n = s.size();
s = " " + s;
int b = 0;
for (int i = 1; i <= n; ++i) {
x = s[i];
if (x == '(') {
d[i] = d[i - 1] + 1;
++b;
} else if (x == ')') {
d[i] = d[i - 1] - 1;
--b;
} else if (x == '#') {
d[i] = d[i - 1] - 1;
--b;
ans[i] = 1;
}
}
for (int i = n; i >= 1; i--) {
if (b < 0 or d[i] - b < 0) {
cout << -1;
return 0;
}
if (ans[i] == 1) {
int ded = min(b, d[i]);
d[i] -= ded;
b -= ded;
ans[i] += ded;
}
}
if (b > 0) {
cout << -1;
return 0;
}
for (int i = 1; i <= n; ++i) {
if (ans[i] > 0) cout << ans[i] << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x7fffffff;
const int MINF = 0x80000000;
const long long mod = 1000000007;
const int cons = 100001;
int main() {
string str;
cin >> str;
int j = 0;
int last = -1;
int cnt = 0;
int cnt2 = 0;
for (int i = 0; i < str.length(); i++) {
if (str[i] == '(') {
last = 1;
j++;
cnt2++;
} else if (str[i] == ')') {
last = 2;
j--;
cnt2--;
} else {
last = 3;
j--;
cnt++;
cnt2 = 0;
}
if (j < 0) {
puts("-1");
return 0;
}
}
if (cnt2 > 0 || last == 1) {
puts("-1");
return 0;
}
for (int i = 0; i < cnt - 1; i++) {
puts("1");
}
printf("%d\n", j + 1);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
char buffer[100000 + 1];
scanf("%s", &buffer);
string s(buffer);
int c = 0;
for (int i = s.size() - 1; i >= 0; i--) {
if (s[i] == '#')
break;
else if (s[i] == ')')
c++;
else if (s[i] == '(') {
c--;
if (c < 0) return printf("-1"), 0;
}
}
vector<int> ans;
int cnt = 0;
int cur = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '(')
cnt++;
else if (s[i] == ')') {
cnt--;
if (cnt < 0) return printf("-1"), 0;
} else if (s[i] == '#') {
if (cur == 1) {
ans.push_back(1);
} else {
cur = 1;
}
cnt--;
if (cnt < 0) return printf("-1"), 0;
}
}
ans.push_back(cnt + 1);
for (int i = 0; i < ans.size(); i++) {
printf("%d\n", ans[i]);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i = 0, j = 0, flag = 0, hash[100002] = {0}, stack[100002] = {0},
top = -1;
string x;
char item;
getline(cin, x);
n = x.length();
for (i = 0; i < n; i++) {
if (x[i] == '(') {
stack[++top] = i;
}
if (x[i] == ')') {
if (top < 0) {
flag = 1;
break;
} else {
item = stack[top];
top--;
}
}
if (x[i] == '#') {
hash[j] = i;
j++;
if (top < 0) {
flag = 1;
break;
}
}
}
if (flag == 1 || stack[top] > hash[j - 1]) {
cout << "-1";
return 0;
} else {
for (i = 0; i < j - 1; i++) {
hash[i] = 1;
item = stack[top];
top--;
}
}
if (top < 0)
cout << "-1";
else {
hash[i] = top + 1;
for (i = 0; i < j; i++) {
cout << hash[i] << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void solve();
string str;
int main() {
cin >> str;
solve();
return 0;
}
void solve() {
for (int i = str.size() - 1, r = 0; i >= 0 && str[i] != '#'; i--)
if (str[i] == ')')
r++;
else if (str[i] == '(') {
r--;
if (r < 0) {
printf("-1\n");
return;
}
}
int l = 0, cnt = 0;
for (int i = 0; str[i]; i++)
if (str[i] == '(')
l++;
else if (str[i] == ')' || str[i] == '#') {
l--;
cnt += (str[i] == '#');
if (l < 0) {
printf("-1\n");
return;
}
}
for (int i = 0; i < cnt - 1; i++) cout << 1 << endl;
cout << l + 1 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string a;
vector<int> v;
bool f = 0;
int i, l, j, z = 0;
cin >> a;
l = a.size();
for (i = 0; i < l; i++) {
if (a[i] == '(')
z++;
else if (a[i] == ')') {
if (z == 0 && v.size() != 0) {
v[v.size() - 1]--;
if (v[v.size() - 1] <= 0) {
for (j = 0; j < v.size(); j++) {
if (v[j] > 1) {
v[j]--;
v[v.size() - 1] = 1;
break;
}
}
if (j == v.size()) f = 1;
}
} else if (z > 0)
z--;
else
f = 1;
} else if (a[i] == '#') {
if (z <= 0) {
for (j = 0; j < v.size(); j++) {
if (v[j] > 1) {
v[j]--;
v.push_back(1);
break;
}
}
if (j == v.size()) f = 1;
continue;
}
v.push_back(z);
z = 0;
}
}
if (z > 0) f = 1;
if (f == 1)
printf("-1\n");
else {
l = v.size();
for (i = 0; i < l; i++) printf("%d\n", v[i]);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
const long long mod = 1e9 + 7;
const int alphabet = 26;
const int inf = INT_MAX;
const long long lint = 1e18 + 9;
inline long long cnm(char ch) { return (ch - '0'); }
inline long long cap(char ch) { return (ch - 'a'); }
inline void instr(string& s, long long& n) {
cin >> s;
n = s.length();
}
inline void instr(string& s) { cin >> s; }
long long co, cc, ch;
vector<int> ans;
int a[maxn];
void proc() {
cout << "-1";
exit(0);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long i, j, k, m, n;
string s;
instr(s, n);
stack<char> st;
for (i = 0; i < n; i++) {
if (s[i] == '(') co++;
if (s[i] == ')') cc++;
if (s[i] == '#') ch++;
}
long long cnt = 0;
if (co < cc + ch) {
cout << "-1";
return 0;
}
if (s[0] == '(')
a[0] = 1;
else
proc();
for (i = 1; i < n; i++) {
if (s[i] == '(')
a[i] = a[i - 1] + 1;
else
a[i] = a[i - 1] - 1;
if (a[i] < 0) proc();
}
long long z;
for (i = n - 1; i >= 0; i--) {
if (s[i] == '#') {
z = i;
break;
}
}
k = 0;
i = z + 1;
while (i < n and s[i] == ')') i++;
while (i < n) {
if (s[i] == '(')
k++;
else
k--;
i++;
}
if (k > 0) proc();
for (i = 0; i < n; i++) {
if (i == z)
cout << a[n - 1] + 1 << endl;
else if (s[i] == '#')
cout << "1" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
void fil() {
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
}
int a[100005], b[100005];
int main() {
string s;
cin >> s;
int cnt1 = 0, cnt2 = 0, cnt3 = 0, ck1 = 0, ck2 = 0, ck3 = 0;
for (int i = 0; i <= s.size() - 1; i++) {
if (s[i] == '(') {
a[i] = a[i - 1] + 1;
cnt1++;
} else {
a[i] = a[i - 1] - 1;
cnt2++;
}
if (s[i] == '#') cnt3++;
}
vector<int> V;
int ckk = 0;
int fuck = 0, suck = 0;
for (int i = s.size() - 1; i >= 0; i--) {
if (s[i] == '(')
fuck++;
else if (s[i] == ')')
suck++;
else if (s[i] == '#') {
break;
}
}
int bal = 0;
for (int i = 0; i <= s.size() - 1; i++) {
if (s[i] == ')') {
ck2--;
} else if (s[i] == '(')
ck2++;
if (ck2 < 0) {
ckk++;
break;
}
if (s[i] == '#') ck3++;
if (s[i] == '#' && ck3 <= (cnt3 - 1)) {
V.push_back(1);
ck2--;
} else if (s[i] == '#' && ck3 > (cnt3 - 1)) {
bal = ck2 + fuck - suck;
V.push_back(ck2 + fuck - suck);
ck2 -= ck2 + fuck - suck;
}
if (ck2 < 0) {
ckk++;
break;
}
}
if (ckk || ck2 || bal <= 0)
cout << -1 << endl;
else {
for (int i = 0; i <= V.size() - 1; i++) cout << V[i] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char s[100005];
int main() {
scanf("%s", s);
int n = strlen(s);
int lvl = 0;
vector<int> ans;
for (int i = n - 1; i >= 0; i--) {
if (lvl > 0) {
printf("-1\n");
return 0;
}
if (s[i] == '(')
lvl++;
else if (s[i] == ')')
lvl--;
else
break;
}
lvl = 0;
int flag = 0;
for (int i = 0; i < n; i++) {
if (lvl < 0) {
printf("-1\n");
return 0;
}
if (s[i] == '(') {
if (flag > 1) {
if (!lvl || lvl < flag) {
printf("-1\n");
return 0;
}
while (flag > 1) ans.push_back(1), flag--, lvl--;
} else if (flag && lvl == 0) {
printf("-1\n");
return 0;
}
lvl++;
} else if (s[i] == ')')
lvl--;
else {
flag++;
}
}
if (flag) {
if (lvl <= 0 || lvl < flag) {
printf("-1\n");
return 0;
}
while (flag > 1) ans.push_back(1), flag--, lvl--;
ans.push_back(lvl);
}
for (int i = 0; i < (int)ans.size(); i++) printf("%d\n", ans[i]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
long long powmod(long long a, long long b) {
long long res = 1;
a %= mod;
assert(b >= 0);
for (; b; b >>= 1) {
if (b & 1) res = res * a % mod;
a = a * a % mod;
}
return res;
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
const int maxn = 1e6 + 10;
string a;
int main() {
int num = 0;
cin >> a;
int len = a.size();
int n1 = 0, n2 = 0, last = 0, x = 0;
for (int i = 0; i < len; i++) {
if (a[i] == '(') {
n1++;
} else if (a[i] == ')') {
n2++;
} else {
x++;
last = i;
}
}
int now = 0;
for (int i = 0; i < len; i++) {
if (a[i] == '(') {
now++;
} else if (a[i] == ')') {
now--;
} else {
if (i != last) {
now--;
} else {
now -= (n1 - n2 - x + 1);
}
}
if (now < 0) {
printf("-1\n");
return 0;
}
}
if (now != 0) {
printf("-1\n");
} else {
if (n1 - n2 - x + 1 <= 0) {
printf("-1\n");
return 0;
}
for (int i = 1; i < x; i++) {
printf("1\n");
}
printf("%d", n1 - n2 - x + 1);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
string s;
cin >> s;
int N = s.size(), sum = 0;
if (s[N - 1] == '(') {
cout << -1;
exit(0);
}
vector<int> v;
for (int i = 0; i < N; i++) {
if (sum < 0) {
cout << -1;
exit(0);
}
if (s[i] == '(')
sum++;
else if (s[i] == ')')
sum--;
if (s[i] == '#') v.push_back(i), sum--;
}
if (sum < 0) {
cout << -1;
exit(0);
}
int sum2 = 0, n = v.size();
vector<int> ans;
for (int i = 0; i < N; i++) {
if (s[i] == '(')
sum2++;
else if (s[i] == ')')
sum2--;
else if (i != v[n - 1])
ans.push_back(1), sum2--;
else {
sum2--;
if (sum > sum2) {
cout << -1;
exit(0);
}
ans.push_back(min(sum, sum2) + 1);
}
}
for (auto x : ans) cout << x << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
string inputString;
cin >> inputString;
int leftCounter = 0, rightCounter = 0, hashCounter = 0;
for (char symbol : inputString) {
if (symbol == '(') {
++leftCounter;
} else if (symbol == ')') {
++rightCounter;
} else {
++hashCounter;
}
}
if (leftCounter < rightCounter + hashCounter) {
cout << "-1\n";
return 0;
}
int nestingDepth = 0, replaced = 0;
vector<int> answer;
for (char symbol : inputString) {
if (symbol == '(') {
++nestingDepth;
} else if (symbol == ')') {
if (--nestingDepth < 0) {
cout << "-1\n";
return 0;
}
} else {
int replace = 1;
if (++replaced == hashCounter) {
replace += leftCounter - rightCounter - hashCounter;
}
if ((nestingDepth -= replace) < 0) {
cout << "-1\n";
return 0;
}
answer.push_back(replace);
}
}
for (int replace : answer) {
cout << replace << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long f, l, n, tl, tn, tf;
long long counter = 0;
string s;
int t = 0;
bool bf = false;
int main() {
n = l = f = tl = tn = 0;
cin >> s;
for (int i = 0; i < s.size(); ++i) {
if (s[i] == '(')
f++;
else if (s[i] == ')')
l++;
else if (s[i] == '#')
n++;
if (f < l + n) {
cout << -1;
return 0;
}
}
long long ans[n + 1];
l = f = tl = tf = 0;
for (int i = 0; i < n + 1; ++i) {
ans[i] = 1;
}
for (int i = 0; i < s.size(); ++i) {
if (s[i] == '(') {
f++;
if (tn == n) {
bf = true;
tf++;
}
} else if (s[i] == ')') {
l++;
if (tn == n && bf) {
tf--;
}
} else if (s[i] == '#') {
if (tn < n - 1) {
ans[tn] = 1;
l++;
if (l > f) {
cout << -1;
return 0;
}
}
tn++;
}
}
if (tf > 0) {
cout << -1;
return 0;
}
ans[tn - 1] = f - l;
for (int i = 0; i < n; ++i) {
cout << ans[i] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long maxn = 1e5 + 5;
const long long mod = 1000000007;
long long t;
long long i, j;
long long n, m, k;
long long x, y;
vector<long long> g;
string s;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> s;
for (i = 0; i <= s.size() - 1; i++) {
if (s[i] == '(')
x++;
else if (s[i] == ')')
y++;
else
k++;
}
if (x <= y || (x - y) < k)
cout << -1;
else {
long long tmp1 = 0;
long long tmp2 = 0;
long long tmp3 = x - y;
long long zzz = 0;
for (i = 0; i < s.size(); i++) {
if (s[i] == '(')
tmp1++;
else if (s[i] == ')')
tmp1--;
if (tmp1 < 0 || tmp1 <= 0 && s[i] == '#') {
zzz = 1;
break;
}
if (s[i] == '#') {
tmp2++;
if (tmp2 < k) {
g.push_back(1);
tmp3--;
tmp1--;
} else {
tmp1 -= tmp3;
g.push_back(tmp3);
if (tmp1 < 0) {
zzz = 1;
break;
}
}
}
}
if (zzz == 1)
cout << -1 << '\n';
else {
for (i = 0; i <= g.size() - 1; i++) cout << g[i] << '\n';
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
int top = 0, say = 0, son = 0, top2 = 0;
for (int i = 0; i < (int)a.size(); i++) {
if (a[i] == ')' | a[i] == '#') top--;
if (a[i] == '#') {
say++;
son = i;
}
if (a[i] == '(') top++;
if (top < 0) {
printf("-1");
return 0;
}
}
for (int i = 0; i < (int)a.size(); i++) {
if (a[i] == ')' || a[i] == '#') top2--;
if (a[i] == '(') top2++;
if (i == son) top2 -= top;
if (top2 < 0) {
printf("-1");
return 0;
}
}
for (int i = 0; i < say - 1; i++) printf("1\n");
printf("%d\n", top + 1);
}
|
#include <bits/stdc++.h>
using namespace std;
struct debugger {
template <typename T>
debugger& operator,(const T v) {
cerr << v << " ";
return *this;
}
} dbg;
int L[100009], R[100009], H[100009];
int main() {
ios_base::sync_with_stdio(false);
int i, j, k, n;
string str;
while (cin >> str) {
str = "1" + str;
memset(L, 0, sizeof(L));
memset(R, 0, sizeof(R));
memset(H, 0, sizeof(H));
int last, cnt = 0;
;
int val[300] = {0};
for (i = 1; i < (int)str.size(); i++) {
val[str[i]]++;
if (str[i] == '#') last = i;
}
int tot = 0;
vector<int> ans;
for (i = 1; i < (int)str.size(); i++) {
if (str[i] == '(') tot++;
if (str[i] == ')') tot--;
if (str[i] == '#') {
if (i != last) {
ans.push_back(1);
tot--;
} else {
int need = val['('] - val[')'] - (val['#'] - 1);
tot -= need;
if (need <= 0) {
tot = -1;
}
ans.push_back(need);
}
}
if (tot < 0) break;
}
if (i >= (int)str.size()) {
for (i = 0; i < ((int)ans.size()); i++) cout << ans[i] << endl;
} else
cout << -1 << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
string S;
int sum = 0;
vector<int> indices;
int res[100005];
int pref[100005];
int main() {
cin >> S;
bool nema = (S[S.size() - 1] == '(');
int cnt = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == '(') sum++;
if (S[i] == ')') sum--;
pref[i] = sum;
if (S[i] == '#') {
indices.push_back(i);
cnt++;
if (sum < cnt) {
nema = 1;
}
}
}
if (nema || sum < (int)indices.size()) {
cout << -1 << "\n";
return 0;
}
int firstSum = sum;
for (int i = 0; i < indices.size(); i++) {
S[indices[i]] = ')';
}
sum = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == '(') sum++;
if (S[i] == ')') sum--;
pref[i] = sum;
if (sum < 0) {
cout << -1 << "\n";
return 0;
}
}
string fir = S.substr(0, indices.back() + 1);
string rem = S.substr(indices.back() + 1);
for (int i = 0; i < firstSum - (int)indices.size(); i++) {
fir += ")";
}
S = fir + rem;
sum = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == '(') sum++;
if (S[i] == ')') sum--;
pref[i] = sum;
if (sum < 0) {
cout << -1 << "\n";
return 0;
}
}
if (sum != 0) {
cout << -1 << "\n";
return 0;
}
for (int i = 0; i < indices.size() - 1; i++) cout << 1 << "\n";
cout << firstSum - (int)indices.size() + 1 << "\n";
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.