text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
using namespace std;
#pragma warning(disable : 4996)
int t, i, n, tot, cnt, now;
char c[100001];
int main() {
cin >> c;
n = strlen(c);
for (i = 0; i < n; i++) {
if (c[i] == '(')
tot++;
else
tot--;
if (c[i] == '#') cnt++;
if (tot < 0) {
printf("-1");
return 0;
}
}
for (i = n - 1; i >= 0 && c[i] != '#'; i--) {
if (c[i] == '(')
now--;
else
now++;
if (now < 0) {
printf("-1");
return 0;
}
}
for (i = 1; i < cnt; i++) printf("1\n");
printf("%d", 1 + tot);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-10;
double PI = 3.14159265359;
const int INF = 1e9;
const int N = 100001;
stack<int> o, c, h;
string s;
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '(') {
o.push(i + 1);
}
if (s[i] == ')') {
if (o.size())
o.pop();
else
c.push(i + 1);
}
if (s[i] == '#') {
h.push(i);
if (h.size() > o.size()) return cout << -1, 0;
}
}
if (c.size() || o.size() < h.size() || o.top() > h.top())
return cout << -1, 0;
for (int i = 1; i < h.size(); i++) cout << 1 << "\n";
cout << o.size() - h.size() + 1;
}
|
#include <bits/stdc++.h>
using namespace std;
string a;
int sol[100100];
int main() {
cin >> a;
int siz = a.size();
int left = 0;
int c = 0;
for (int i = 0; i < siz; i++) {
if (a[i] == '(')
left++;
else if (a[i] == ')')
left--;
else
c++;
}
if (left < c) {
cout << -1 << endl;
return 0;
} else {
int le = left;
for (int i = 0; i < c - 1; i++) {
sol[i] = 1;
le--;
}
sol[c - 1] = le;
int k = 0;
int ost = 0;
for (int i = 0; i < siz; i++) {
if (a[i] == '(')
ost++;
else if (a[i] == ')')
ost--;
else {
ost -= sol[k];
k++;
}
if (ost < 0) {
cout << -1 << endl;
return 0;
}
}
for (int i = 0; i < c; i++) {
cout << sol[i] << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string a;
vector<int> v;
bool f = 0;
int i, l, j, z = 0, found = 0, need = 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) {
if (found > 0) {
found--;
need++;
v[v.size() - 1] = 1;
} else
f = 1;
}
} else if (z > 0)
z--;
else
f = 1;
} else if (a[i] == '#') {
if (z <= 0) {
if (found > 0) {
found--;
need++;
v.push_back(1);
} else
f = 1;
continue;
}
if (z > 1) found += z - 1;
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++) {
if (need > 0 && v[i] > 1) {
if (need < v[i]) {
printf("%d\n", v[i] - need);
need = 0;
} else {
printf("1\n");
need -= (v[i] - 1);
}
} else
printf("%d\n", v[i]);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3c3c3c3c;
const long long infl = 0x3c3c3c3c3c3c3c3c;
const int MAX_N = 1e5 + 9;
int ans[MAX_N];
int main() {
cin.tie(NULL);
cin.sync_with_stdio(false);
cout.sync_with_stdio(false);
string str;
cin >> str;
int strSz = str.size();
int ansSz = 0;
int lc = 0, rc = 0;
int p = 0;
for (int i = 0; i < strSz; i++) {
if (str[i] == '(')
lc++;
else
rc++;
if (str[i] == '#') {
p = i;
ans[ansSz] = 1;
ansSz++;
}
}
if (lc < rc) return !printf("-1");
for (int i = p - 1; i >= 0; i--) {
if (str[i] != '#') continue;
str[i] = ')';
}
int c = 0;
for (int i = 0; i < strSz; i++) {
if (str[i] == '(') c++;
if (str[i] == ')') c--;
if (str[i] == '#') {
int v = min(c, lc - rc);
ans[ansSz - 1] += v;
c -= (v + 1);
}
if (c < 0) return !printf("-1");
}
if (c != 0) return !printf("-1");
for (int i = 0; i < ansSz; i++) printf("%d\n", ans[i]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int dem = 0, dem1 = 0, thang = 0;
int ns = s.size();
for (int i = 0; i < ns; i++) {
if (s[i] == '(')
dem++;
else
dem--;
if (s[i] == '#') thang++;
}
if (dem < 0) {
cout << -1;
return 0;
}
int thang1 = 0, res;
for (int i = 0; i < ns; i++) {
if (s[i] == '(')
dem1++;
else
dem1--;
if (s[i] == '#') {
thang1++;
if (thang1 == thang) {
res = dem + 1;
dem1 = dem1 - dem;
}
}
if (dem1 < 0) {
cout << -1;
return 0;
}
}
if (dem1 != 0) {
cout << -1;
return 0;
}
int t = 0;
for (int i = 0; i < ns; i++) {
if (s[i] == '#') {
t++;
if (t != thang)
cout << 1 << endl;
else {
cout << res;
break;
}
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
const double EPS = 1e-9;
const double pi = acos(-1.0);
const int MAXN = (int)5e5 + 7;
const long long INF = (long long)1e9 + 7;
const long long LINF = (long long)1e18 + 7;
const long long MOD = (long long)1e9 + 7;
;
const long long P = 31;
const long long SZ = (long long)1e5;
const int K = 8;
bool us[100001];
int main() {
string s;
cin >> s;
int bal = 0;
int x = -1;
for (int i = 0; i < s.size(); ++i)
if (s[i] == '#') x = i;
for (int i = s.size() - 1; i >= 0; --i)
if (s[i] == ')')
++bal;
else if (s[i] == '(' && bal)
us[i] = 1, --bal;
if (bal) cout << -1, exit(0);
bal = 0;
vector<int> ans;
for (int i = 0; i < s.size(); ++i) {
if (s[i] == '(' && !us[i])
++bal;
else if (s[i] == '#') {
if (bal == 0) cout << -1, exit(0);
if (i < x)
ans.push_back(1), bal--;
else
ans.push_back(bal), bal = 0;
}
if (bal < 0) cout << -1, exit(0);
}
if (bal) cout << -1, exit(0);
for (int i = 0; i < ans.size(); ++i) cout << ans[i] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
char str[100010];
int ans[100010];
int main() {
scanf("%s", str);
int cnt = 0, tail = 0, len = strlen(str);
for (int i = 0; i < len; ++i) {
if (str[i] == '(')
++cnt;
else if (str[i] == ')') {
if (cnt)
--cnt;
else {
bool ok = false;
for (int now = tail - 1; now >= 0; --now)
if (ans[now] > 1) {
--ans[now];
ok = true;
break;
}
if (!ok) {
--cnt;
break;
}
}
} else {
if (!cnt) {
bool ok = false;
for (int now = tail - 1; now >= 0; --now)
if (ans[now] > 1) {
--ans[now];
ok = true;
ans[tail++] = 1;
break;
}
if (!ok) {
--cnt;
break;
}
} else {
ans[tail++] = cnt;
cnt = 0;
}
}
}
if (!cnt)
for (int i = 0; i < tail; ++i) printf("%d\n", ans[i]);
else
puts("-1");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
stack<int> st;
string s;
ios_base::sync_with_stdio(false);
cin >> s;
int n = s.size() - 1;
int cnt = 0;
int id = -1;
for (__typeof((n)) i = (0); i <= (n); i++) {
if (s[i] == '(')
st.push(i);
else if (s[i] == ')' || s[i] == '#') {
if (st.empty()) {
cout << -1 << '\n';
return 0;
}
st.pop();
if (s[i] == '#') {
id = i;
cnt++;
}
}
}
int k = st.size();
while (!st.empty()) {
if (st.top() > id) {
cout << -1 << '\n';
return 0;
}
st.pop();
}
for (__typeof((cnt - 1)) i = (1); i <= (cnt - 1); i++) cout << 1 << " ";
cout << 1 + k << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char b[100001];
int main() {
gets(b);
int n = 0;
while (b[n] != '\0') n++;
int last = n - 1;
while (b[last] != '#') last--;
int s = 0;
int r = 0;
for (int i = 0; i < last; i++) {
if (b[i] == '(')
s++;
else
s--;
if (s < 0) {
cout << -1;
return 0;
}
if (b[i] == '#') r++;
}
int rr = s;
s = 0;
for (int i = last + 1; i < n; i++) {
if (b[i] == '(')
s++;
else
s--;
if (s < 0) {
s = 0;
rr--;
}
}
if (s != 0) {
cout << -1;
return 0;
}
if (rr <= 0) {
cout << -1;
return 0;
}
for (int i = 0; i < r; i++) printf("1\n");
printf("%d\n", rr);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int toInt(string s) {
int r = 0;
istringstream sin(s);
sin >> r;
return r;
}
long long toInt64(string s) {
long long r = 0;
istringstream sin(s);
sin >> r;
return r;
}
double toDouble(string s) {
double r = 0;
istringstream sin(s);
sin >> r;
return r;
}
string toString(long long n) {
string s, s1;
while (n / 10 > 0) {
s += (char)((n % 10) + 48);
n /= 10;
}
s += (char)((n % 10) + 48);
n /= 10;
s1 = s;
for (int i = 0; i < s.length(); i++) s1[(s.length() - 1) - i] = s[i];
return s1;
}
bool isUpperCase(char c) { return c >= 'A' && c <= 'Z'; }
bool isLowerCase(char c) { return c >= 'a' && c <= 'z'; }
bool isLetter(char c) { return c >= 'A' && c <= 'Z' || c >= 'a' && c <= 'z'; }
bool isDigit(char c) { return c >= '0' && c <= '9'; }
char toLowerCase(char c) { return (isUpperCase(c)) ? (c + 32) : c; }
char toUpperCase(char c) { return (isLowerCase(c)) ? (c - 32) : c; }
long long gcd(long long a, long long b) {
if (!a) return b;
return gcd(b % a, a);
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
string s;
cin >> s;
long long open = 0, close = 0, last = 0;
vector<long long> ans;
for (int i = 0; i < s.size(); i++) {
if (s[i] == ')')
close++;
else if (s[i] == '(')
open++;
else {
s[i] = ')';
close++;
ans.push_back(1);
last = i;
}
if (close > open) {
cout << -1 << endl;
return 0;
}
}
if (close > open) {
cout << -1 << endl;
return 0;
} else if (close < open) {
long long dif = open - close;
if (ans.size() == 0) {
cout << -1 << endl;
return 0;
}
ans[ans.size() - 1] += dif;
}
long long cnt = 0;
for (int i = last + 1; i < s.size(); i++)
if (s[i] == '(')
cnt++;
else if (cnt > 0)
cnt--;
if (cnt != 0) {
cout << -1 << endl;
return 0;
}
for (int i = 0; i < ans.size(); i++) cout << ans[i] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
string s;
cin >> s;
int n = (int)s.size();
int idx = -1;
for (int i = 0; i < n; i++) {
if (s[i] == '#') {
idx = i;
}
}
assert(idx != -1);
int bal_last = 0;
int mn_bal = 0;
for (int i = idx + 1; i < n; i++) {
assert(s[i] != '#');
if (s[i] == '(')
bal_last++;
else
bal_last--;
mn_bal = min(mn_bal, bal_last);
}
int bal = 0;
vector<int> ans;
auto ret = []() {
cout << -1 << '\n';
exit(0);
};
for (int i = 0; i < n; i++) {
if (i == idx) {
int new_add = bal + bal_last;
new_add = max(new_add, 1);
bal -= new_add;
if (bal + mn_bal < 0) {
ret();
}
ans.push_back(new_add);
bal = 0;
break;
}
if (s[i] == '(')
bal++;
else if (s[i] == ')')
bal--;
if (s[i] == '#') {
bal--;
ans.push_back(1);
}
if (bal < 0) ret();
}
for (auto& i : ans) cout << i << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const int INF = 0x7f7f7f7f;
const long double eps = 1e-9;
const int maxn = 1010;
int main() {
ios_base::sync_with_stdio(false);
string s;
cin >> s;
int o, c, sharp;
o = c = sharp = 0;
int idx;
for (int i = 0; i < (int)(s.size()); i++) {
if (s[i] == '(')
o++;
else
c++;
if (s[i] == '#') sharp++, idx = i;
if (c > o) {
puts("-1");
return 0;
}
}
int ans = o - c + 1;
o = c = 0;
for (int i = 0; i < (int)(s.size()); i++) {
if (s[i] == '(')
o++;
else if (i == idx)
c += ans;
else
c++;
if (c > o) {
puts("-1");
return 0;
}
}
for (int i = 0; i < sharp - 1; i++) cout << 1 << "\n";
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
string s;
cin >> s;
long long n = s.length();
long long x = 0, cnt = 0;
for (long long i = 0; i < n; i++) {
if (s[i] == '(')
x++;
else {
if (x == 0) {
cout << "-1\n";
return 0;
}
x--;
if (s[i] == '#') cnt++;
}
}
if (x < 0 || (x > 0 && cnt == 0)) {
cout << "-1\n";
return 0;
}
long long y = 0, cur = 0;
for (long long i = 0; i < n; i++) {
if (s[i] == '(')
y++;
else if (s[i] == ')')
y--;
else if (s[i] == '#') {
cur++;
if (cur < cnt)
y--;
else {
y -= x + 1;
}
}
if (y < 0) {
cout << "-1\n";
return 0;
}
}
for (long long i = 0; i < cnt - 1; i++) {
cout << "1\n";
}
cout << x + 1 << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
string second;
bool valid(string &t) {
stack<char> st;
for (char c : t) {
if (st.empty())
st.push(c);
else if (st.top() == '(' && c == ')')
st.pop();
else
st.push(c);
}
return st.empty();
}
int main() {
cin >> second;
int b = count(second.begin(), second.end(), '(');
int p = count(second.begin(), second.end(), ')');
int h = count(second.begin(), second.end(), '#');
int dnel = b - p;
if (dnel < h) {
puts("-1");
return 0;
}
int l = second.length();
for (; l >= 0; l--) {
if (second[l] == '#') {
second[l] = '$';
break;
}
}
ostringstream ss;
string res = "";
for (char c : second) {
if (c == '(' || c == ')')
res += c;
else if (c == '#') {
res += ')';
dnel--;
ss << 1 << endl;
} else if (c == '$') {
for (int i = 0; i < dnel; i++) res += ')';
ss << dnel << endl;
}
}
if (valid(res)) {
cout << ss.str() << endl;
} else {
puts("-1");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char a[100005];
int len, x, y, z, pd, bo;
int main() {
scanf("%s", a);
len = strlen(a);
pd = -1;
bo = 0;
for (int i = 0; i < len; i++)
if (a[i] == '(')
x++;
else if (a[i] == ')')
y++;
else
z++, pd = i;
if (y + z > x) {
printf("-1\n");
return 0;
}
for (int i = 0; i < len; i++) {
if (a[i] == '(')
bo++;
else
bo--;
if (i == pd) bo -= (x - y - z);
if (bo < 0) break;
}
if (bo < 0)
printf("-1\n");
else {
for (int i = 1; i < z; i++) puts("1");
printf("%d\n", x - y - z + 1);
}
return 0;
}
|
#include <bits/stdc++.h>
#pragma warning(disable : 4996)
using namespace std;
int noAnswer() {
cout << -1;
return 0;
}
int main() {
string rawString;
cin >> rawString;
string fullString;
for (int i = 0; i < rawString.length(); ++i) {
fullString.push_back(rawString[i]);
if (rawString[i] == '#') {
fullString.push_back(')');
}
}
const int n = fullString.size();
vector<bool> removedBrackets(n, false);
stack<int> openedBrackets;
for (int i = 0; i < n; ++i) {
if (fullString[i] == '(') {
openedBrackets.push(i);
} else if (fullString[i] == ')') {
if (openedBrackets.empty()) {
return noAnswer();
}
removedBrackets[openedBrackets.top()] = true;
removedBrackets[i] = true;
openedBrackets.pop();
}
}
string reducedString;
for (int i = 0; i < n; ++i) {
if (!removedBrackets[i]) {
reducedString.push_back(fullString[i]);
}
}
if (reducedString.empty()) {
return 0;
}
if (*reducedString.rbegin() != '#') {
return noAnswer();
}
vector<int> ans;
int bracketCount = 0;
for (int i = 0; i < reducedString.size(); ++i) {
if (reducedString[i] == '(') {
++bracketCount;
} else {
ans.push_back(1);
}
}
ans.back() += bracketCount;
for (int i = 0; i < ans.size(); ++i) {
cout << ans[i] << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool check(string& S) {
int cnt = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == '(')
cnt++;
else
cnt--;
if (cnt < 0) return false;
}
return true;
}
int main() {
string S;
cin >> S;
int cnt = 0;
int last = 0;
int num = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == '(')
cnt++;
else if (S[i] == '#') {
S[i] = ')';
last = i;
cnt--;
num++;
} else
cnt--;
}
if (cnt < 0) {
cout << -1;
return 0;
}
string T = S.substr(0, last) + string(cnt + 1, ')') + S.substr(last + 1);
if (!check(T)) {
cout << -1;
return 0;
}
for (int i = 1; i < num; i++) cout << "1\n";
cout << cnt + 1;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int n, a, b, k = 0, i, l, r, avg, now, S, vanya, fl, st, dr, ct;
long long int vova, vova1, vova2, first, second;
long long int rasp;
int v[2000005];
int main() {
ios_base::sync_with_stdio(false);
string s;
cin >> s;
for (i = 0; i < s.size(); ++i) {
if (s[i] == '(')
++st;
else if (s[i] == ')')
++dr;
else if (s[i] == '#')
++dr, ++ct;
if (dr > st) {
cout << -1;
return 0;
}
}
if (1 + st - dr <= 0) {
cout << -1;
return 0;
}
i = s.size() - 1;
int st1 = 0, dr1 = 0;
while (s[i] != '#') {
if (s[i] == ')')
++dr1;
else
++st1;
if (dr1 < st1) {
cout << -1;
return 0;
}
--i;
}
for (i = 1; i < ct; ++i) cout << "1\n";
cout << 1 + st - dr;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000000 + 7;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
string s;
cin >> s;
long long n = s.size();
queue<char> q;
queue<char> q1;
vector<long long> ans;
long long pos = n;
for (int i = n - 1; i >= 0; i--) {
if (s[i] == '#') {
pos = i;
break;
}
}
if (pos == n) {
for (int i = 0; i < n; i++) {
if (s[i] == '(')
q.push('(');
else {
if (q.empty()) {
cout << "-1";
return 0;
} else
q.pop();
}
}
if (q.empty())
cout << "0";
else
cout << "-1";
} else {
for (int i = 0; i < pos; i++) {
if (s[i] == '(')
q.push('(');
else {
if (q.empty()) {
cout << "-1";
return 0;
} else if (s[i] == '#')
ans.push_back(1);
q.pop();
}
}
for (long long j = n - 1; j > pos; j--) {
if (s[j] == ')')
q1.push(')');
else {
if (q1.empty()) {
cout << "-1";
return 0;
} else
q1.pop();
}
}
if (q.size() <= q1.size()) {
cout << "-1";
return 0;
} else
ans.push_back(q.size() - q1.size());
}
for (int i = 0; i < ans.size(); i++) cout << ans[i] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char a[100005];
int len, l, r, x, last, pd;
int main() {
scanf("%s", a);
len = strlen(a);
pd = -1;
for (int i = 0; i < len; i++)
if (a[i] == '(')
l++;
else if (a[i] == ')')
r++;
else
x++, pd = i;
int bo = 0;
if (r + x > l) {
printf("-1\n");
return 0;
}
for (int i = 0; i < len; i++) {
if (a[i] == '(')
bo++;
else
bo--;
if (i == pd) bo -= (l - r - x);
if (bo < 0) break;
}
if (bo < 0)
printf("-1\n");
else {
for (int i = 1; i < x; i++) puts("1");
printf("%d\n", l - r - x + 1);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline void smin(T &a, const U &b) {
if (a > b) a = b;
}
template <typename T, typename U>
inline void smax(T &a, const U &b) {
if (a < b) a = b;
}
template <class T>
inline void gn(T &first) {
char c, sg = 0;
while (c = getchar(), (c > '9' || c < '0') && c != '-')
;
for ((c == '-' ? sg = 1, c = getchar() : 0), first = 0; c >= '0' && c <= '9';
c = getchar())
first = (first << 1) + (first << 3) + c - '0';
if (sg) first = -first;
}
template <class T1, class T2>
inline void gn(T1 &x1, T2 &x2) {
gn(x1), gn(x2);
}
template <class T1, class T2, class T3>
inline void gn(T1 &x1, T2 &x2, T3 &x3) {
gn(x1, x2), gn(x3);
}
template <class T>
inline void print(T first) {
if (first < 0) {
putchar('-');
return print(-first);
}
if (first < 10) {
putchar('0' + first);
return;
}
print(first / 10);
putchar(first % 10 + '0');
}
template <class T>
inline void println(T first) {
print(first);
putchar('\n');
}
template <class T>
inline void printsp(T first) {
print(first);
putchar(' ');
}
template <class T1, class T2>
inline void print(T1 x1, T2 x2) {
printsp(x1), println(x2);
}
template <class T1, class T2, class T3>
inline void print(T1 x1, T2 x2, T3 x3) {
printsp(x1), printsp(x2), println(x3);
}
int power(int a, int b, int m, int ans = 1) {
for (; b; b >>= 1, a = (long long)a * a % m)
if (b & 1) ans = (long long)ans * a % m;
return ans;
}
char s[100010];
int dp[100010];
int main() {
scanf("%s", s);
int n = strlen(s), ed, num = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '(')
dp[i] = dp[i - 1] + 1;
else
dp[i] = dp[i - 1] - 1;
if (dp[i] < 0) return puts("-1");
if (s[i] == '#') ed = i, num++;
}
for (int i = ed; i < n; i++)
if (dp[i] - dp[n - 1] < 0) {
return puts("-1");
}
while (--num) printsp(1);
print(dp[n - 1] + 1);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int cnt = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '(') {
cnt++;
} else {
cnt--;
}
if (cnt < 0) {
cout << -1 << endl;
return 0;
}
}
int j = -1;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '#') {
j = i;
}
}
int tt = 0;
vector<int> ans;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '#') {
if (i == j) {
ans.push_back(cnt + 1);
tt -= cnt + 1;
} else {
ans.push_back(1);
tt--;
}
}
if (s[i] == ')') tt--;
if (s[i] == '(') tt++;
if (tt < 0) {
cout << -1 << endl;
return 0;
}
}
for (int i = 0; i < ans.size(); i++) {
cout << ans[i] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string s;
int main(int argc, char *argv[]) {
ios_base::sync_with_stdio(false);
cout.precision(10);
cout << fixed;
if (argc > 1 && fopen(argv[1], "r")) freopen(argv[1], "rt", stdin);
cin >> s;
int n = (int((s).size()));
int stack = 0;
int r = 0;
int sharp = 0;
for (int i = 0; i < (int)(n); ++i) {
if (s[i] == '(')
++r, ++stack;
else if (s[i] == ')')
--r, --stack;
else if (s[i] == '#')
++sharp, --stack;
if (stack < 0) {
cout << -1 << endl;
return 0;
}
}
if (sharp > r) {
cout << -1 << endl;
return 0;
}
vector<int> ans;
for (int i = 0; i < (int)(sharp - 1); ++i) ans.push_back(1), --r;
ans.push_back(r);
int ptr = 0;
stack = 0;
for (int i = 0; i < (int)(n); ++i) {
if (s[i] == '(')
++stack;
else if (s[i] == ')')
--stack;
else if (s[i] == '#')
stack -= ans[ptr++];
if (stack < 0) {
cout << -1 << endl;
return 0;
}
}
for (int i = 0; i < (int)((int((ans).size()))); ++i) cout << ans[i] << endl;
return 0;
}
|
#include <bits/stdc++.h>
int main() {
char huruf[100010];
int panjang, temp = 0, jawab = 0, hasil, counter = 0, temp2 = 0;
scanf("%s", huruf);
getchar();
panjang = strlen(huruf);
for (int i = 0; i < panjang; i++) {
if (temp == 0 && huruf[i] == ')' || temp == 0 && huruf[i] == '#') {
temp = 0;
break;
}
if (huruf[i] == '(') {
temp += 1;
temp2 += 1;
counter += 1;
} else if (huruf[i] == '#') {
jawab += 1;
temp2 -= 1;
counter = 0;
} else {
temp -= 1;
temp2 -= 1;
counter -= 1;
}
if (temp2 < 0) {
temp = 0;
break;
}
if (huruf[panjang - 1] == '(') {
temp = 0;
break;
}
}
if (temp == 0 || counter > 0) {
printf("-1");
} else {
for (int i = 0; i < jawab; i++) {
if (i == jawab - 1) {
printf("%d", temp);
} else {
printf("1\n");
temp--;
}
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
const int Inf = 1e9 + 1;
const int Mod = 1e9 + 7;
const double eps = 1e-15;
string s;
int cnt, r;
vector<int> v;
int main() {
cin >> s;
for (int i = 0; i < s.size(); ++i) {
if (s[i] == '(')
++cnt;
else if (s[i] == ')')
--cnt;
else {
--cnt;
r = cnt;
v.push_back(1);
}
if (cnt < 0) {
cout << "-1";
return 0;
}
}
if (s[s.size() - 1] == '(' || cnt > r) {
cout << "-1";
return 0;
}
for (int i = 0; i < v.size(); ++i)
cout << v[i] + cnt * bool(i == v.size() - 1) << "\n";
return 0;
}
|
#include <bits/stdc++.h>
char F[111111];
int main() {
int n, i, k = 0, t, q = 0, flag = 0, ans, num = 0;
scanf("%s", F);
n = strlen(F);
for (i = 0; i < n; i++)
if (F[i] == '#') {
num++;
t = i;
}
for (i = 0; i < t; i++) {
if (F[i] == '(')
k++;
else if (F[i] == ')') {
if (k < 1) {
flag++;
break;
} else
k--;
} else {
if (k < 1) {
flag++;
break;
}
k--;
}
}
ans = k;
k = 0;
for (i = t + 1; i < n; i++) {
if (F[i] == '(')
k++;
else if (F[i] == ')') {
if (k > 0)
k--;
else
ans--;
if (ans < 1) {
flag++;
break;
}
}
}
if (k > 0) flag++;
ans += k;
if (ans <= 0) flag++;
if (flag)
printf("-1");
else {
for (i = 0; i < num - 1; i++) printf("1 ");
printf("%d", ans);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char str[100005];
int main() {
while (scanf("%s", str) != EOF) {
int last = 0;
int flag = 1;
int jing = 0;
stack<char> b;
for (int i = strlen(str) - 1; i >= 0; i--) {
if (str[i] == ')') {
b.push(str[i]);
} else if (str[i] == '(') {
if (b.empty()) {
flag = 0;
break;
} else
b.pop();
} else if (str[i] == '#') {
break;
}
}
stack<char> a;
for (int i = 0; i < strlen(str); i++) {
if (str[i] == '(') {
a.push(str[i]);
} else if (str[i] == ')') {
if (a.empty()) {
flag = 0;
break;
} else
a.pop();
} else if (str[i] == '#') {
jing++;
if (a.empty()) {
flag = 0;
break;
} else
a.pop();
}
}
if (flag == 0)
printf("-1\n");
else {
for (int i = 0; i < jing; i++)
if (i != jing - 1)
printf("1\n");
else
printf("%d\n", a.size() + 1);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int inf = 2e9;
const int MOD = 1e9 + 7;
const int N = 0;
string s;
void solve() {
string p = s;
int n = s.length();
for (auto &i : p)
if (i == '#') i = ')';
int c = 0;
for (auto &i : p) {
if (i == '(')
c++;
else
c--;
if (c < 0) {
printf("-1");
return;
}
}
c = 0;
for (int i = n - 1; i >= 0; i--) {
if (s[i] == '#') break;
if (s[i] == ')')
c++;
else
c--;
if (c < 0) {
printf("-1");
return;
}
}
int c1 = 0, c2 = 0, c3 = 0;
for (auto &i : s) {
if (i == '(')
c1++;
else if (i == ')')
c2++;
else
c3++;
}
vector<int> ans;
int use = c1 - c2 - c3;
for (int i = 1; i <= c3 - 1; i++) printf("1\n");
printf("%d\n", use + 1);
}
int main() {
cin >> s;
solve();
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
vector<int> veci;
stack<int> st;
for (int i = 0; i < (int)s.size(); i++) {
if (s[i] == '(')
st.push(i);
else if (s[i] == ')' && !st.empty())
s[i] = s[st.top()] = '_', st.pop();
}
int last = (int)s.size() - 1;
for (; last >= 0 && s[last] != '#'; last--)
;
int c = 0, flg = 1;
for (int i = 0; i < (int)s.size(); i++)
if (s[i] == '(')
c++;
else if (s[i] == '#' && c > 0) {
if (i == last)
veci.push_back(c), c = 0;
else
veci.push_back(1), c--;
} else if (s[i] != '_')
flg = 0;
if (veci.empty() || !flg || c)
cout << -1;
else
for (int i = 0; i < (int)veci.size(); i++) cout << veci[i] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename T>
void dbg(T t) {
cerr << t << endl;
}
template <typename T, typename... Args>
void dbg(T t, Args... args) {
cerr << t << " ";
dbg(args...);
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
;
string s;
int o = 0, b = 0, p = 0, d = 0;
cin >> s;
for (int i = s.size() - 1; i >= 0; i--) {
if (s[i] == '(')
o++;
else if (s[i] == ')')
o--;
else
break;
if (o > 0) return cout << -1 << endl, 0;
}
o = 0;
for (char c : s) {
if (c == '#')
o--, d++, p = o;
else if (c == '(')
o++;
else
o--;
if (o < 0) return cout << -1 << endl, 0;
}
if (o > p) cout << -1 << endl;
for (int i = 0; i < d - 1; i++) cout << 1 << '\n';
cout << o + 1 << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a, b;
int main() {
string str;
cin >> str;
int ob = 0, cb = 0;
int hash = 0;
for (int i = 0; i < str.length(); i++) {
if (str[i] == '(')
ob++;
else if (str[i] == ')')
cb++;
else
hash++;
}
int req = ob - cb;
int req_save = req;
int hash_save = hash;
if (req < 0 || req + cb > ob || (!req && hash)) {
printf("%d\n", -1);
return 0;
}
int cur = 0;
for (int i = 0; i < str.length(); i++) {
if (str[i] == '(') {
cur++;
} else if (str[i] == ')') {
cur--;
} else {
hash--;
if (!hash) {
cur -= req;
req = 0;
} else {
cur--;
req--;
}
}
if (cur < 0) {
printf("%d\n", -1);
return 0;
}
}
for (int i = 0; i < hash_save - 1; i++) {
printf("%d\n", 1);
}
printf("%d\n", req_save - (hash_save) + 1);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m, k, a[1000001];
char str[111111];
int main() {
scanf("%s", str);
n = strlen(str);
m = 0;
k = 0;
for (int i = 0; i < n; i++)
if (str[i] == '(')
++m;
else if (str[i] == ')')
--m;
else
++k;
if (m < k) {
printf("-1\n");
return 0;
}
int Sx = k;
int len = 0;
for (int i = 0; i < n; i++)
if (str[i] == '(')
a[++len] = '(';
else if (str[i] == ')')
a[++len] = ')';
else if (k != 1)
--k, --m, a[++len] = ')';
else
for (int i = 1; i <= m; i++) a[++len] = ')';
int r = 0;
for (int i = 1; i <= len; i++) {
if (a[i] == '(')
++r;
else
--r;
if (r < 0) {
printf("-1\n");
return 0;
}
}
for (int i = 1; i < Sx; i++) printf("1\n");
printf("%d\n", m);
}
|
#include <bits/stdc++.h>
using namespace std;
const double Pi = acos(-1.0);
string s;
int n;
int main() {
cin >> s;
n = s.size();
int a = 0, b = 0, cntHash = 0, lastHash = -1;
for (int i = 0; i < n; i++) {
if (s[i] == '(') {
a++;
} else if (s[i] == ')') {
b++;
} else {
cntHash++;
lastHash = i;
}
if (a < b + cntHash) {
cout << "-1\n";
return 0;
}
}
if (lastHash == -1 && a > b) {
cout << "-1\n";
return 0;
}
int checkA = 0, checkB = 0;
for (int i = 0; i < n; i++) {
if (i == lastHash) {
checkB += (a - b - cntHash + 1);
} else if (s[i] == '(') {
checkA++;
} else {
checkB++;
}
if (checkA < checkB) {
cout << "-1\n";
return 0;
}
}
for (int i = 0; i < cntHash - 1; i++) {
cout << "1\n";
}
cout << a - b - cntHash + 1 << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char s[1000001];
int x, y, z, l, a, i;
int main() {
cin >> s;
l = strlen(s);
for (int i = 0; i < l; i++) {
if (s[i] == '(') x++;
if (s[i] == ')') x--;
if (s[i] == '#') x--, y++;
if (x < 0) {
cout << -1;
return 0;
}
}
int p = 0, t = 0;
for (int i = 0; i < l; i++) {
if (s[i] == '#') {
t++;
if (t == y) p -= x;
p--;
}
if (s[i] == '(') p++;
if (s[i] == ')') p--;
if (p < 0) {
cout << -1;
return 0;
}
}
for (i = 1; i < y; i++) cout << 1 << endl;
cout << x + 1;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int n = 0, m, l = 0, k, a, b, c, sum = 0, i, r = 0, j, second, h,
first = 0, sc, ans = 0;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
string str;
cin >> str;
l = str.length();
if (str[0] == ')' || str[l - 1] == '(' || str[0] == '#') {
cout << -1;
return 0;
}
long long int leftopen[l + 5];
long long int rightopen[l + 5];
long long int rightclosed[l + 5];
long long int righthash[l + 5];
leftopen[0] = 0;
for (i = 0; i < l - 1; i++) {
if (str[i] == '(')
leftopen[i + 1] = leftopen[i] + 1;
else if (str[i] == ')')
leftopen[i + 1] = leftopen[i] - 1;
else
leftopen[i + 1] = leftopen[i];
if (leftopen[i + 1] < 0) {
cout << -1;
return 0;
}
}
rightopen[l - 1] = 0;
rightclosed[l - 1] = 0;
righthash[l - 1] = 0;
for (i = l - 2; i >= 0; i--) {
if (str[i + 1] == '(')
rightclosed[i] = rightclosed[i + 1] - 1;
else if (str[i + 1] == ')')
rightclosed[i] = rightclosed[i + 1] + 1;
else
rightclosed[i] = rightclosed[i + 1];
if (str[i + 1] == '#')
righthash[i] = righthash[i + 1] + 1;
else
righthash[i + 1] = righthash[i];
}
long long int hash = 0, lasthash, closed = 0, open = 0;
for (i = 0; i < l; i++) {
if (str[i] == '#') {
hash++;
lasthash = i;
if ((leftopen[i] + hash - 1) == rightclosed[i] ||
leftopen[i] + hash - 1 <= 0) {
cout << -1;
return 0;
}
}
if (str[i] == ')') {
closed++;
if (leftopen[i] < hash + 1) {
cout << -1;
return 0;
}
} else
open++;
}
if (rightclosed[lasthash] < 0) {
cout << -1;
return 0;
}
for (i = 0; i < hash - 1; i++) cout << 1 << endl;
cout << leftopen[lasthash] - hash - rightclosed[lasthash] + 1;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
string s;
cin >> s;
int nest = 0;
const int sharps = count(s.begin(), s.end(), '#');
int used_sharps = 0;
int left_nest;
int right_nest = 0;
int right_min_nest = s.length();
for (auto c : s) {
switch (c) {
case '(':
nest += 1;
if (used_sharps == sharps) {
right_nest += 1;
}
break;
case ')':
nest -= 1;
if (nest < 0) goto failure;
if (used_sharps == sharps) {
right_nest -= 1;
right_min_nest = min(right_min_nest, nest);
}
break;
case '#':
nest -= 1;
if (nest < 0) goto failure;
used_sharps += 1;
if (used_sharps == sharps) {
left_nest = nest + 1;
}
break;
default:
assert(false);
}
}
if (right_nest <= 0 and 0 <= right_min_nest - (left_nest + right_nest - 1)) {
for (int i = 0; i < (sharps - 1); ++i) cout << 1 << endl;
cout << left_nest + right_nest << endl;
} else {
failure:
cout << -1 << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long N = 1e5 + 1;
string s;
long long i, j, n, o, c, h;
long long C[N], temp;
int main() {
std::ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> s;
n = (long long)(s.size());
vector<int> ans;
for (i = 0; i < n; ++i) {
if (s[i] == '(')
++o;
else if (s[i] == ')')
++c;
else
++h;
}
temp = o - c;
if (temp < 0) {
cout << -1;
return 0;
}
for (i = 0; i < n; ++i) {
if (s[i] == '#') {
if (temp <= 0) {
cout << -1;
return 0;
}
if (h == 1) {
C[i] = temp;
ans.push_back(temp);
temp = 0;
} else {
C[i] = 1;
ans.push_back(1);
--temp;
}
--h;
}
}
o = c = 0;
for (i = 0; i < n; ++i) {
if (s[i] == '(')
++o;
else if (s[i] == ')')
++c;
else if (s[i] == '#')
c += C[i];
if (c > o || (i == n && o != c)) {
cout << -1;
return 0;
}
}
for (auto u : ans) cout << u << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
class problem {
public:
problem() { ios_base::sync_with_stdio(false); }
void solve() {
string s;
cin >> s;
int n = s.length();
vector<int> a(n);
int lastSharpChar = -1;
for (int64_t i = (0); i <= (int64_t)((n)-1); ++i) {
if (i > 0) a[i] = a[i - 1];
if (s[i] == '(')
a[i]++;
else {
a[i]--;
if (s[i] == '#') lastSharpChar = i;
}
if (a[i] < 0) {
cout << -1;
return;
}
}
int k = a[n - 1];
if (k > 0) {
for (int64_t i = (lastSharpChar); i <= (int64_t)(n - 1); ++i) {
a[i] -= k;
if (a[i] < 0) {
cout << -1;
return;
}
}
}
for (int64_t i = (0); i <= (int64_t)((n)-1); ++i) {
if (s[i] == '#') cout << (i == lastSharpChar ? k + 1 : 1) << endl;
}
}
};
int main() {
unique_ptr<problem> p(new problem());
p->solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
vector<int> ans;
int num = 0;
cin >> s;
int last = -1;
for (int i = 0; i < s.length(); i++) {
if (s[i] == '#') {
if (num == 0) {
cout << -1;
return 0;
}
ans.push_back(1);
last = i;
num--;
} else if (s[i] == '(')
num++;
else if (s[i] == ')') {
if (num == 0) {
cout << -1;
return 0;
}
num--;
}
}
if (ans.size() != 0) ans[ans.size() - 1] += num;
num = 0;
for (int i = s.length() - 1; i > last; i--) {
if (s[i] == ')') num++;
if (s[i] == '(') {
if (num == 0) {
cout << -1;
return 0;
}
num--;
}
}
for (int i = 0; i < ans.size(); i++) cout << ans[i] << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
int sum[100005], sz;
vector<int> v, ans;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
string s;
cin >> s;
sz = s.size();
int pos = -1, add = 0;
for (int i = sz - 1; i >= 0; i--) {
if (s[i] == ')')
add--;
else if (s[i] == '(')
add++;
else {
sum[i] = -1;
pos = i;
add--;
}
if (add > 0 && pos != -1) {
sum[pos] -= add;
add = 0;
} else if (add > 0) {
cout << -1 << endl;
return 0;
}
}
if (sum[0] < 0) {
cout << -1 << endl;
return 0;
}
sum[0] = (s[0] == '(') ? 1 : -1;
for (int i = 1; i < (int)sz; i++) {
if (s[i] == '(')
sum[i] = sum[i - 1] + 1;
else if (s[i] == ')')
sum[i] = sum[i - 1] - 1;
else {
ans.push_back(-sum[i]);
sum[i] = sum[i] + sum[i - 1];
}
if (sum[i] < 0) {
cout << -1 << endl;
return 0;
}
}
for (int i = 0; i < (int)ans.size(); i++) cout << ans[i] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int last_hash = -1;
int cnt = 0;
for (int i = 0; i < s.size(); ++i)
if (s[i] == '#') last_hash = i;
for (int i = last_hash + 1; i < s.size(); ++i) cnt += (s[i] == '(' ? 1 : -1);
if (cnt > 0 || s[s.size() - 1] == '(') {
cout << -1;
return 0;
}
int open = 0;
int hash = 0;
for (int i = 0; i < s.size(); ++i) {
open += (s[i] == '(' ? 1 : -1);
hash += (s[i] == '#');
if (open < 0) {
cout << -1;
return 0;
}
}
for (int i = 0; i < hash - 1; ++i) cout << 1 << " ";
cout << open + 1;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
int pref = 0;
int kol = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '#') kol++;
if (s[i] == '(')
pref++;
else
pref--;
if (pref < 0) {
cout << "-1";
return 0;
}
}
string t;
int sz = 0;
int r = 0;
while (sz < kol) {
if (s[r] == '#') {
sz++;
t += ')';
if (sz == kol) {
for (int j = 0; j < pref; j++) t += ')';
}
} else {
t += s[r];
}
r++;
}
while (r < n) {
t += s[r];
r++;
}
n = t.size();
int preff = 0;
for (int i = 0; i < n; i++) {
if (t[i] == '(')
preff++;
else
preff--;
if (preff < 0) {
cout << "-1";
return 0;
}
}
for (int i = 0; i < kol - 1; i++) {
cout << 1 << endl;
}
cout << pref + 1;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long N = 5e5 + 5;
long long cnt[N][2];
bool hey[N];
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
;
string input;
cin >> input;
long long o = 0, c = 0;
long long n = input.size();
for (long long i = 0; i < input.size(); i++) {
if (input[i] == '(') {
o++;
} else if (input[i] == ')') {
c++;
} else {
hey[i] = true;
if (o <= c) {
cout << -1;
return 0;
} else if (o > c) {
c += 1;
}
}
cnt[i][1] = c;
cnt[i][0] = o;
}
if (c > o) {
cout << -1;
return 0;
}
for (long long i = n - 1; i >= 0; i--) {
if (hey[i] == 1) {
if (o > c) {
long long save = o - c;
if (cnt[i][1] + o - c <= cnt[i][0]) {
cnt[i][1] += save;
c += save;
}
for (long long j = i + 1; j < n; j++) {
cnt[j][1] += save;
}
}
break;
}
}
for (long long i = 0; i < input.size(); i++) {
if (cnt[i][0] < cnt[i][1]) {
cout << -1;
return 0;
}
}
if (o != c) {
cout << -1;
return 0;
} else {
for (long long i = 0; i <= n; i++) {
if (hey[i] == 1) {
cout << cnt[i][1] - cnt[i - 1][1] << '\n';
}
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
vector<int> res;
int left = 0;
int right = 0;
int last = 0;
int remaining = 0;
for (int n = 0; n < s.size(); ++n) {
if (s[n] == '#')
last = n;
else if (s[n] == '(')
++remaining;
else
--remaining;
}
for (int n = 0; n < s.size(); ++n) {
if (s[n] == '(')
++left;
else if (s[n] == ')')
++right;
else if (s[n] == '#') {
if (last == n) {
if (remaining <= 0) {
cout << -1 << endl;
return 0;
}
res.push_back(remaining);
right += remaining;
} else {
res.push_back(1);
++right;
--remaining;
}
}
if (left < right) {
cout << -1 << endl;
return 0;
}
}
if (left < right) {
cout << -1 << endl;
return 0;
}
for (int n = 0; n < res.size(); ++n) {
printf("%d\n", res[n]);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void fastStream() {
cin.tie(0);
std::ios_base::sync_with_stdio(0);
}
string s;
int main() {
fastStream();
cin >> s;
int l = 0;
std::vector<int> v;
int last_pos = -1;
for (int i = 0; i < (int)s.size(); i++) {
if (s[i] == '#') last_pos = i;
}
for (int i = 0; i < (int)s.size(); i++) {
if (s[i] == '(')
l++;
else if (s[i] == ')')
l--;
else if (s[i] == '#') {
l--;
v.push_back(1);
if (i == last_pos && l > 0) {
*(--v.end()) += l;
l = 0;
}
}
if (l < 0) {
if (i > last_pos) {
if (*(--v.end()) > 1) {
l++;
(*(--v.end()))--;
} else {
cout << -1 << endl;
return 0;
}
} else {
cout << -1 << endl;
return 0;
}
}
if (i == (int)s.size() - 1) {
if (l > 0) {
cout << -1 << endl;
return 0;
}
}
}
for (int i = 0; i < (int)v.size(); i++) {
cout << v[i] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 7;
const int MOD = 1e9 + 7;
const int maxn = 1e5 + 7;
int n, m, t, T;
string s;
int main() {
while (cin >> s) {
n = s.length();
int cnt = 0;
bool can = true;
stack<int> sta;
queue<int> que;
queue<int> ans;
while (!sta.empty()) sta.pop();
while (!que.empty()) que.pop();
while (!ans.empty()) ans.pop();
for (int i = 0; i < n; i++) {
if (s[i] == '(')
sta.push(i);
else if (s[i] == '#') {
if (sta.empty()) {
can = false;
break;
}
sta.pop();
que.push(i);
} else if (s[i] == ')') {
if (sta.empty()) {
can = false;
break;
}
sta.pop();
}
}
if (!can)
puts("-1");
else {
while (!que.empty()) {
int x = que.front();
que.pop();
int cnt = 1;
while (!sta.empty() && sta.top() < x) sta.pop(), cnt++;
ans.push(cnt);
}
if (sta.empty()) {
while (!ans.empty()) cout << ans.front() << endl, ans.pop();
} else
puts("-1");
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int sta[100007], eda[100007];
int st = 0, ed = 0;
int j, cnt = 0;
int flag = 0;
for (int i = 0; i < s.length(); i++) {
if (s[i] == '(') {
st++;
sta[i] = st;
eda[i] = ed;
} else if (s[i] == ')') {
ed++;
sta[i] = st;
eda[i] = ed;
} else {
j = i;
sta[i] = st;
eda[i] = ed;
cnt++;
if (st == 0 || st <= ed) flag = 1;
}
if (eda[i] > sta[i]) flag = 1;
}
int c1 = 0;
for (int i = j + 1; i < s.length(); i++) {
if (s[i] == '(')
c1++;
else if (c1 > 0)
c1--;
}
if (c1 > 0) flag = 1;
int v = st - ed;
int b = 0;
if (st > ed && cnt <= v && flag == 0) {
for (int i = 0; i < s.length(); i++) {
if (s[i] == '#' && sta[i] > 0) {
b++;
if (cnt == b)
cout << v << endl;
else
cout << 1 << endl;
v--;
}
}
} else
cout << -1 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
const double pi = acos(-1.0);
const double eps = 1e-12;
int maxx, minn;
int maxi, mini;
int cases = 0;
void add(int &a, int &b) { a = (a + b) % mod; }
void mul(int &a, int &b) { a = (long long)a * (long long)b % mod; }
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int main() {
string a;
int len;
int i, j, k;
int l, r;
int nowl, nowr;
int nowjing;
int jing;
while (cin >> a) {
int flag = 0;
l = r = jing = 0;
nowl = nowr = 0;
len = a.length();
for (i = 0; i < len; i++) {
if (a[i] == '#') jing++;
if (a[i] == '(') l++;
if (a[i] == ')') r++;
}
nowjing = jing;
for (i = 0; i < len; i++) {
if (a[i] == '(') nowl++;
if (a[i] == ')') nowr++;
if (a[i] == '#') {
jing--;
r++;
nowr++;
if (jing == 0) {
nowr += max(l - r, 0);
}
}
if (nowr > nowl) {
flag = 1;
}
}
if (flag)
cout << "-1" << endl;
else {
for (i = 0; i < nowjing - 1; i++) {
cout << 1 << endl;
}
cout << l - r + 1 << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int l, r, t;
r = t = l = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == ')') {
r++;
}
if (s[i] == '(') {
l++;
}
if (s[i] == '#') {
t++;
}
if (r + t > l) {
cout << "-1";
return 0;
}
}
int cntl = 0, cntr = 0;
for (int i = s.size() - 1; i >= 0; i--) {
if (s[i] == '#') {
break;
}
if (s[i] == '(') {
cntl++;
if (cntl > cntr) {
cout << "-1";
return 0;
}
} else {
cntr++;
}
}
for (int i = 1; i <= t - 1; i++) {
cout << "1\n";
}
cout << l - r - (t - 1);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int cont = 0, ultimo, f = 0, curr = 0;
int balance[s.size()];
vector<int> ans;
for (int i = (0); i < (s.size()); i++) {
curr = (s[i] == ')') ? curr - 1 : (s[i] == '(') ? curr + 1 : curr;
balance[i] = curr;
if (s[i] == '#') {
cont++;
ans.push_back(1);
}
}
ans.back() = balance[s.size() - 1] - cont + 1;
int j = 0;
curr = 0;
for (int i = (0); i < (s.size()); i++) {
if (s[i] == '(')
curr++;
else if (s[i] == ')')
curr--;
else
curr -= ans[j++];
if (curr < 0) f = 1;
}
if (curr > 0 or ans.back() <= 0) f = 1;
if (f)
puts("-1");
else
for (int i = (0); i < (ans.size()); i++) cout << ans[i] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string ss, s;
while (cin >> ss) {
long c = 0, k = 0, d = 0, a[100010] = {0}, l, cc = 0, dd = 0, mm = 0, ww;
l = ss.size();
stack<char> x;
char ch;
for (int i = 0; i < l; i++) {
if (ss[i] != ')')
x.push(ss[i]);
else {
if (!x.empty()) {
ch = x.top();
if (ch == '(')
x.pop();
else {
x.push(ss[i]);
}
} else {
x.push(ss[i]);
}
}
}
while (!x.empty()) {
ch = x.top();
s += ch;
x.pop();
}
reverse(s.begin(), s.end());
l = s.size();
for (int i = 0; i < l; i++) {
if (s[i] == '#') c++;
if (s[i] == '(') k++;
if (s[i] == ')') d++;
}
if (k < c + d || s[l - 1] == '(' || s[0] == ')' || s[0] == '#') {
cout << "-1\n";
continue;
}
k = k - d;
for (int i = 0; i < l; i++) {
if (s[i] == '#' && c > 1) {
cout << 1 << "\n";
c--;
k--;
} else if (s[i] == '#') {
cout << k << "\n";
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double PI = 2.0 * acos(0.0);
const double E = exp(1);
int x[] = {0, 0, -1, 1};
int y[] = {-1, 1, 0, 0};
template <class T1>
void deb(T1 e) {
cout << e << endl;
}
template <class T1, class T2>
void deb(T1 e1, T2 e2) {
cout << e1 << " " << e2 << endl;
}
template <class T1, class T2, class T3>
void deb(T1 e1, T2 e2, T3 e3) {
cout << e1 << " " << e2 << " " << e3 << endl;
}
template <class T1, class T2, class T3, class T4>
void deb(T1 e1, T2 e2, T3 e3, T4 e4) {
cout << e1 << " " << e2 << " " << e3 << " " << e4 << endl;
}
template <class T1, class T2, class T3, class T4, class T5>
void deb(T1 e1, T2 e2, T3 e3, T4 e4, T5 e5) {
cout << e1 << " " << e2 << " " << e3 << " " << e4 << " " << e5 << endl;
}
template <class T1, class T2, class T3, class T4, class T5, class T6>
void deb(T1 e1, T2 e2, T3 e3, T4 e4, T5 e5, T6 e6) {
cout << e1 << " " << e2 << " " << e3 << " " << e4 << " " << e5 << " " << e6
<< endl;
}
template <typename T>
inline T sqr(T n) {
return n * n;
}
inline double hypot(double x, double y) { return sqrt(sqr(x) + sqr(y)); }
template <typename T>
inline T pmod(T n, T m) {
return ((n % m) + m) % m;
}
template <typename T>
T power(T n, int p) {
return (p == 0) ? (T)(1) : (sqr(power(n, p >> 1)) * ((p & 1) * (n - 1) + 1));
}
template <typename T>
T bigmod(T n, int p, T m) {
return (p == 0)
? (T)(1)
: ((sqr(bigmod(n, p >> 1, m)) % m) * ((p & 1) * (n - 1) % m + 1)) %
m;
}
char str[1000005];
vector<int> pos;
vector<pair<int, int> > info;
vector<int> ans;
int len = 0;
int main() {
while (scanf("%s", str) == 1) {
int flag = 1;
int a = 0, b = 0;
len = strlen(str);
for (int i = 0; i < len; i++) {
if (str[i] == '(')
a++;
else if (str[i] == ')')
b++;
if (str[i] == '#') pos.push_back(i);
}
int baki = a - b;
int ta = 0, tb = 0;
int extra = 0;
for (int i = 0; i < len; i++) {
if (str[i] == '(')
ta++;
else if (str[i] == '(')
tb++;
else {
if (i == pos[(int)pos.size() - 1]) {
if (baki < (int)pos.size()) {
flag = 0;
break;
}
tb += (baki - (int)pos.size() + 1);
} else
tb++;
}
if (tb > ta) {
flag = 0;
break;
}
}
if (flag == 0) {
puts("-1");
return 0;
}
for (int i = 0; i < (int)pos.size() - 1; i++) printf("1\n");
printf("%d\n", (baki - (int)pos.size() + 1));
return 0;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
string s;
cin >> s;
long long i, j, c = 0, lst;
vector<long long> v;
for (i = 0; i < s.size(); i++) {
if (s[i] == '#') break;
if (s[i] == '(') c++;
if (s[i] == ')') c--;
if (c < 0) {
cout << "-1";
return 0;
}
}
c = 0;
for (i = 0; i < s.size(); i++) {
if (s[i] == '(')
c++;
else if (s[i] == ')')
c--;
else {
if (c > 0)
v.push_back(1), c--;
else {
cout << "-1";
return 0;
}
}
}
v[v.size() - 1] += c;
c = 0;
for (i = s.size() - 1; i >= 0; i--) {
if (s[i] == '#') break;
if (s[i] == '(') c++;
if (s[i] == ')') c--;
if (c > 0) {
cout << "-1";
return 0;
}
}
for (i = 0; i < v.size(); i++)
if (v[i] <= 0) {
cout << "-1";
return 0;
}
for (i = 0; i < v.size(); i++) cout << v[i] << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
constexpr auto MAXN = 1123456;
char STRING[MAXN];
int ans[MAXN];
int main() {
stack<char> STACK;
int num = 0;
cin >> STRING;
int len = strlen(STRING);
if (STRING[0] == ')' || STRING[0] == '#' || STRING[len - 1] == '(') {
cout << "-1" << endl;
} else {
int A = 0, B = 0;
for (int i = 0; i < len; i++) {
if (STRING[i] == '(') {
STACK.push(STRING[i]);
A++;
}
if (STRING[i] == ')') {
STACK.pop();
A--;
}
if (STRING[i] == '#') {
int j;
for (j = i + 1; j < len; j++) {
if (STRING[j] == '#') {
ans[num++] = 1;
A--;
break;
}
}
if (j == len) {
for (j = i + 1; j < len; j++) {
if (STRING[j] == '(')
A++;
else
A--;
}
ans[num++] = A;
break;
}
}
if (A < 0) {
cout << "-1" << endl;
return 0;
}
}
for (int i = len - 1; i >= 0; i--) {
if (STRING[i] != '#') {
if (STRING[i] == ')')
B++;
else
B--;
} else
break;
}
if (A <= 0 || B < 0) {
cout << "-1" << endl;
} else {
for (int i = 0; i < num; i++) {
cout << ans[i] << endl;
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int l = s.length();
int open = 0;
int closed = 0;
int hash = 0;
for (__typeof((l)) i = 0; i < (l); i++) {
if (s[i] == '(') open++;
if (s[i] == ')') closed++;
if (s[i] == '#') hash++;
if (open < (closed + hash)) {
cout << "-1";
return 0;
}
}
if (hash == 0) {
if (open != closed) {
cout << "-1";
}
return 0;
}
int count = 0;
int closed2 = 0;
int open2 = 0;
vector<int> ans;
for (__typeof((l)) i = 0; i < (l); i++) {
if (s[i] == '(') open2++;
if (s[i] == ')') closed2++;
if (s[i] == '#' && count < (hash - 1)) {
ans.push_back(1);
count++;
} else if (s[i] == '#') {
ans.push_back(open - count - closed);
count += open - count - closed;
}
if (open2 < (closed2 + count)) {
cout << "-1\n";
return 0;
}
}
for (__typeof(ans.begin()) it = ans.begin(); it != ans.end(); ++it)
cout << *it << endl;
return 0;
}
|
#include <bits/stdc++.h>
int main() {
char c;
unsigned x = 0, y = 0, min = -1;
c = getchar();
do {
if (c == '#') {
++y;
min = -1;
}
if (c == '(')
++x;
else {
if (x == 0) {
printf("-1\n");
return 0;
}
--x;
}
if (min > x) min = x;
} while ((c = getchar()) > ' ');
if (x != min) {
printf("-1\n");
return 0;
}
while (--y) printf("1\n");
printf("%u\n", x + 1);
return 0;
}
|
#include <bits/stdc++.h>
char tab[100009];
int odp[100009];
int main() {
int ile = 0;
int n = 0;
int ost = 0;
int k = 0;
scanf("%s", tab);
for (int i = 0; tab[i] != 0; i++) {
k = i;
if (tab[i] == '(') ile++;
if (tab[i] == ')') ile--;
if (tab[i] == '#') {
ile--;
n++;
odp[n] = 1;
ost = i;
}
if (ile < 0) {
printf("-1");
return 0;
}
}
odp[n] = ile + 1;
ile = 0;
for (int i = k; i > ost; i--) {
if (tab[i] == '(') ile++;
if (tab[i] == ')') ile--;
if (ile > 0) {
printf("-1");
return 0;
}
}
for (int i = 1; i <= n; i++) printf("%d\n", odp[i]);
}
|
#include <bits/stdc++.h>
int main() {
char str[100005];
int len;
int lp, rp, quata;
int lastsh, numsh;
scanf("%s", str);
len = strlen(str);
lp = rp = 0;
for (int i = len - 1; i >= 0; i--) {
if (str[i] == '#') {
lastsh = i;
break;
}
}
for (int i = 0; i < len; i++) {
if (str[i] == '(') lp++;
if (str[i] == ')') rp++;
}
if (lp <= rp) {
printf("-1\n");
return 0;
}
numsh = len - rp - lp;
quata = len - lp - rp > lp - rp ? len - lp - rp : lp - rp;
lp = rp = 0;
for (int i = 0; i < len; i++) {
if (str[i] == '(') {
lp++;
} else if (str[i] == ')') {
rp++;
} else {
if (i != lastsh) {
rp++;
quata--;
} else {
rp += quata;
}
}
if (lp < rp) {
printf("-1");
return 0;
}
}
if (lp != rp) {
printf("-1\n");
return 0;
}
for (int i = 1; i < numsh; i++) printf("1\n");
printf("%d\n", quata);
}
|
#include <bits/stdc++.h>
using namespace std;
int ans[100010];
void solve() {
string s;
cin >> s;
int n = s.length(), x = 0, y = 0, lst = -1;
for (int i = 0; i < n; i++) {
if (s[i] == '(')
x++;
else
x--;
if (x < 0) {
cout << "-1\n";
return;
}
if (s[i] == '#') lst = i;
}
for (int i = 0; i < n; i++) {
if (s[i] == '(')
y++;
else
y--;
if (i == lst) {
y -= x;
}
if (y < 0) {
cout << "-1\n";
return;
}
}
for (int i = 0; i < n; i++) {
if (s[i] == '#') {
if (i == lst) {
printf("%d\n", x + 1);
} else
cout << "1\n";
}
}
}
int main() {
int t = 1;
scanf("%d", &t);
while (t--) {
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 1000 * 1000 * 1000;
const long long INF64 = 1LL * INF * INF;
const long long mod = INF + 7;
void solve() {
string s;
cin >> s;
int q = s.find_last_of("#");
vector<int> ans;
int bal = 0;
for (int i = 0; i <= q; ++i) {
if (s[i] == '(')
bal++;
else if (s[i] == ')') {
bal--;
if (bal < 0) {
cout << -1 << endl;
return;
}
} else if (i != q) {
ans.push_back(1), bal--;
if (bal < 0) {
cout << -1 << endl;
return;
}
} else {
bal--;
if (bal < 0) {
cout << -1 << endl;
return;
}
int bbal = 0;
for (int i = s.size() - 1; i > q; --i) {
if (s[i] == '(') {
bbal++;
if (bbal > 0) {
cout << -1 << endl;
return;
}
} else if (s[i] == ')') {
bbal--;
if (-bbal > bal) {
cout << -1 << endl;
return;
}
}
}
if (bbal > 0) {
cout << -1 << endl;
return;
}
ans.push_back(bal + bbal + 1);
}
}
for (int i = 0; i < ans.size(); ++i) {
cout << ans[i] << "\n";
}
}
int main() {
ios_base::sync_with_stdio(false);
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
vector<int> hash_pos;
vector<int> lparen(s.size()), rparen(s.size());
lparen[0] = (s[0] == '(');
rparen[0] = (s[0] == ')');
if (s[0] == '#') hash_pos.push_back(0);
bool flag = (s.size() != 1);
for (int i = 1; i < s.size(); i++) {
if (s[i] == '(') {
lparen[i] = lparen[i - 1] + 1;
rparen[i] = rparen[i - 1];
} else if (s[i] == ')') {
lparen[i] = lparen[i - 1];
rparen[i] = rparen[i - 1] + 1;
} else {
lparen[i] = lparen[i - 1];
rparen[i] = rparen[i - 1];
hash_pos.push_back(i);
}
}
int last_hash = hash_pos.back();
for (int i = 1; i < s.size(); i++) {
if (s[i] == '(') {
lparen[i] = lparen[i - 1] + 1;
rparen[i] = rparen[i - 1];
} else if (s[i] == ')') {
lparen[i] = lparen[i - 1];
rparen[i] = rparen[i - 1] + 1;
} else {
lparen[i] = lparen[i - 1];
if (i != last_hash) {
rparen[i] = rparen[i - 1] + 1;
} else {
int k = lparen.back() - rparen.back() - hash_pos.size() + 1;
if (k == 0) flag = false;
rparen[i] = rparen[i - 1] + k;
}
}
}
for (int i = 0; i < s.size(); i++) {
if (lparen[i] < rparen[i]) {
flag = false;
break;
}
}
flag = flag && (lparen.back() == rparen.back());
if (flag) {
for (auto x : hash_pos) {
cout << rparen[x] - rparen[x - 1] << endl;
}
} else {
cout << -1 << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int pos, ans, L, R, l, r;
string S;
bool ok = true;
vector<int> v;
int main() {
cin >> S;
for (int i = 0; i < S.size(); i++)
if (S[i] == '(')
++L;
else if (S[i] == ')')
++R;
else
pos = i;
for (int i = 0; i < S.size(); i++) {
if (S[i] == '(')
++l;
else if (S[i] == ')')
++r;
else {
if (r > l) {
ok = false;
break;
}
v.push_back(i == pos ? L - R - v.size() : 1);
r += v[v.size() - 1];
}
if (r > l) {
ok = false;
break;
}
}
if (R - L >= 0) ok = false;
if (!ok)
cout << "-1" << endl;
else
for (int i = 0; i < v.size(); i++) cout << v[i] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int inf = 1000000009;
int rd() {
char c = getchar();
int t = 0, f = 1;
while (!isdigit(c)) f = (c == '-') ? -1 : 1, c = getchar();
while (isdigit(c)) t = t * 10 + c - 48, c = getchar();
return t * f;
}
void wt(int x) {
if (x < 0)
putchar('-'), wt(-x);
else {
if (x > 9) wt(x / 10);
putchar(x % 10 + 48);
}
}
const int N = 100005;
char s[N];
int n, now, hv, cnt, Ans[N];
int main() {
scanf("%s", s + 1);
n = strlen(s + 1);
for (int i = ((int)1); i <= ((int)n); i++) {
if (s[i] == '(')
now++;
else
now--;
if (now < 0) return puts("-1"), 0;
}
for (int i = ((int)1); i <= ((int)n); i++)
if (s[i] == '#') Ans[++cnt] = now + 1, Ans[cnt - 1] = 1;
hv = 0;
now = 0;
for (int i = ((int)1); i <= ((int)n); i++) {
if (s[i] == '(') now++;
if (s[i] == ')') now--;
if (s[i] == '#') now -= Ans[++hv];
if (now < 0) return puts("-1"), 0;
}
for (int i = ((int)1); i <= ((int)cnt); i++) printf("%d\n", Ans[i]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int res = 0;
int t = 0;
int r = 0;
for (int i = s.length() - 1; i >= 0 && s[i] != '#'; i--) {
if (s[i] == ')') r++;
if (s[i] == '(') {
r--;
if (r < 0) {
printf("-1\n");
return 0;
}
}
}
for (int i = 0; i < s.length(); i++) {
if (s[i] == '(')
res += 1;
else
res--;
t = t + (s[i] == '#');
if (res < 0) {
cout << -1 << endl;
return 0;
}
}
for (int i = 0; i < t - 1; i++) cout << 1 << endl;
cout << res + 1 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
string s;
vector<int> ans;
int a, b, c;
int main() {
cin >> s;
for (int i = s.size() - 1; i > -1; i--) {
if (s[i] == '#')
break;
else if (s[i] == '(')
a++;
else
b++;
if (a > b) {
cout << "-1";
return 0;
}
}
if (a > b) {
cout << "-1";
return 0;
}
a = 0, b = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '#')
c++;
else if (s[i] == '(')
a++;
else
b++;
if (b + c > a) {
cout << "-1";
return 0;
}
}
if (b + c > a) {
cout << "-1";
return 0;
} else {
int g = a - b;
for (int i = 1; i < c; i++) cout << "1" << endl;
cout << g - (c - 1);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string input;
cin >> input;
vector<int> bal;
int balance = 0;
for (int i = 0; i < input.size(); ++i) {
if (input[i] == '(') {
++balance;
}
if (input[i] == ')') {
--balance;
}
if (input[i] == '#') {
bal.push_back(1);
--balance;
}
if (balance < 0) {
cout << -1 << endl;
return 0;
}
}
if (balance > 0) {
bal.back() = balance + 1;
}
balance = 0;
int index = 0;
for (int i = 0; i < input.size(); ++i) {
if (input[i] == '(') {
++balance;
}
if (input[i] == ')') {
--balance;
}
if (input[i] == '#') {
balance -= bal[index++];
}
if (balance < 0) {
cout << -1 << endl;
return 0;
}
}
if (balance > 0) {
cout << -1 << endl;
return 0;
}
for (int i = 0; i < bal.size(); ++i) {
cout << bal[i] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
int num = count(s.begin(), s.end(), '#');
vector<int> A(s.size());
int cur = 0;
for (int i = 0; i < s.size(); ++i) {
char c = s[i];
if (c == '(')
++cur, A[i] = 1;
else
--cur, A[i] = -1;
if (cur < 0) cout << -1 << '\n', exit(0);
}
A[s.size() - 1 - (find(s.rbegin(), s.rend(), '#') - s.rbegin())] -= cur;
for (int now = 0, i = 0; i < s.size(); ++i) {
now += A[i];
if (now < 0) cout << -1 << '\n', exit(0);
}
while (num--) cout << (num ? 1 : 1 + cur) << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename Tp>
inline void read(Tp &x) {
x = 0;
bool neg = false;
char c = getchar();
for (; !isdigit(c); c = getchar()) {
if (c == '-') {
neg = true;
}
}
for (; isdigit(c); c = getchar()) {
x = x * 10 + c - '0';
}
if (neg) {
x = -x;
}
}
const int N = 1e5 + 5;
char str[N];
int main() {
scanf("%s", str);
int n = strlen(str), cur = 0, sharp = 0, last = -1;
for (int i = 0; i < n; ++i) {
if (str[i] == '(') {
++cur;
} else if (str[i] == ')') {
--cur;
} else if (str[i] == '#') {
--cur;
++sharp;
last = i;
}
if (cur < 0) {
puts("-1");
return 0;
}
}
int match = 0;
for (int i = last + 1; i < n; ++i) {
if (str[i] == '(') {
++match;
} else if (str[i] == ')') {
--match;
if (match < 0) {
match = 0;
}
}
}
if (match > 0) {
puts("-1");
return 0;
}
for (int i = 1; i < sharp; ++i) {
puts("1");
}
printf("%d\n", cur + 1);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char* argv[]) {
string s;
cin >> s;
int v = 0;
int sv = 0;
stack<char> remained;
bool noWay = false;
for (int i = 0; i < s.length(); i++) {
if (s[i] == '(') {
remained.push('(');
v++;
} else if (s[i] == ')') {
if (remained.empty()) {
noWay = true;
break;
}
v--;
remained.pop();
} else if (s[i] == '#') {
if (remained.empty()) {
noWay = true;
break;
}
v--;
sv++;
remained.pop();
}
}
stack<char> remained2;
if (!noWay) {
for (int i = s.length() - 1; i >= 0; i--) {
if (s[i] == ')') {
remained2.push(')');
} else if (s[i] == '(') {
if (remained2.empty()) {
noWay = true;
break;
}
remained2.pop();
} else if (s[i] == '#') {
noWay = false;
break;
}
}
}
if (noWay)
cout << "-1";
else {
for (int i = 0; i < sv - 1; i++) {
cout << "1" << endl;
}
int k = 1 + v;
cout << k;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int inf = (int)1e9;
const int mod = inf + 7;
const double eps = 1e-9;
const double pi = acos(-1.0);
const int maxn = (int)1e5 + 11;
string second;
int main() {
getline(cin, second);
if (second[0] == '#') {
cout << -1 << endl;
return 0;
}
vector<int> ans;
int last = 0;
int cur = 0;
for (int i = 0; i < (int)second.size(); i++) {
if (second[i] == '(')
cur++;
else if (second[i] == ')') {
if (cur)
cur--;
else {
while (last < (int)ans.size() && ans[last] == 1) last++;
if (last >= (int)ans.size()) {
cout << -1 << endl;
return 0;
}
ans[last]--;
}
} else {
if (cur == 0) {
while (last < (int)ans.size() && ans[last] == 1) last++;
if (last >= (int)ans.size()) {
cout << -1 << endl;
return 0;
}
ans[last]--;
ans.push_back(1);
} else {
ans.push_back(cur);
cur = 0;
}
}
}
if (cur) return cout << -1 << endl, 0;
for (__typeof(ans.begin()) it = ans.begin(); it != ans.end(); it++)
printf("%d\n", *it);
return 0;
}
|
#include <bits/stdc++.h>
bool YN = 1;
char s[100001];
int len, sharp = 0, cnt = 0, cnt_2 = 0, temp, i;
int main() {
gets(s);
len = strlen(s);
for (i = 0; i < len; i++) {
if (s[i] == '#') {
sharp++;
} else if (s[i] == '(') {
cnt++;
} else {
cnt--;
}
}
if (cnt < sharp) {
printf("-1\n");
} else {
temp = sharp;
for (i = 0; i < len; i++) {
if (s[i] == '#') {
if (sharp > 1) {
sharp--;
cnt_2--;
} else {
cnt_2 -= cnt - temp + 1;
}
} else if (s[i] == '(') {
cnt_2++;
} else {
cnt_2--;
}
if (cnt_2 < 0) {
printf("-1\n");
return 0;
}
}
for (i = 1; i < temp; i++) printf("1\n");
printf("%d\n", cnt - temp + 1);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int a = 1;
int b = 0;
for (int i = 0; i < s.length(); i++) {
if (s[i] == '(') a++;
if (s[i] == ')') a--;
if (s[i] == '#') {
b++;
a--;
};
}
int c = 0;
int d = 0;
for (int i = 0; i < s.length(); i++) {
if (s[i] == '(') c++;
if (s[i] == ')') c--;
if (s[i] == '#') {
d++;
c--;
if (d == b) {
c++;
c -= a;
}
}
if (c < 0) {
cout << -1;
return 0;
}
}
if (a <= 0)
cout << -1;
else {
for (int i = 1; i < b; i++) cout << "1\n";
cout << a;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
vector<int> a, b;
char s[100100];
vector<int> f;
void solve() {
cin >> s;
n = strlen(s);
int l = 0, r = 0, x = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '(') l++;
if (s[i] == ')') r++;
if (s[i] == '#') x++;
}
int sum = l - r;
if (sum < x) {
cout << -1;
return;
}
int k = sum;
int t = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '(') l++, f.push_back(1);
if (s[i] == ')') r++, f.push_back(-1);
if (s[i] == '#') {
t++;
if (t < x) {
f.push_back(-1);
k--;
} else {
for (int j = 1; j <= k; j++) f.push_back(-1);
}
}
}
int now = 0;
for (int i = 0; i < f.size(); i++) {
now += f[i];
if (now < 0) {
cout << -1;
return;
}
}
if (now != 0) {
cout << -1;
return;
}
for (int i = 1; i <= x; i++) {
if (i < x) {
cout << 1 << endl;
sum--;
} else
cout << sum << endl;
}
}
int main() {
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char s[100005];
int main() {
scanf("%s", s);
int n = strlen(s), cnt = 0, h = 0;
for (int i = 0; i < n; ++i) {
if (s[i] == '(')
cnt++;
else
cnt--;
if (s[i] == '#') h++;
if (cnt < 0) {
printf("-1\n");
return 0;
}
}
int th = h, tcnt = 0;
for (int i = 0; i < n; ++i) {
if (s[i] == '(')
tcnt++;
else if (s[i] == '#') {
if (th != 1)
tcnt--, th--;
else
tcnt -= cnt + 1;
} else
tcnt--;
if (tcnt < 0) {
printf("-1\n");
return 0;
}
}
for (int i = 0; i < n; ++i) {
if (s[i] == '#') {
if (h != 1) {
printf("%d\n", 1);
h--;
} else {
printf("%d\n", cnt + 1);
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const long long INFl = 4223372036854775807ll;
const int inf = 1e9 + 7;
long long power(long long x, long long y, long long z) {
long long t = 1;
while (y > 0) {
if (y % 2) {
t = (t * x) % z;
}
x = (x * x) % z;
y /= 2;
}
return t;
}
int movex[4] = {0, 1, -1, 0};
int movey[4] = {1, 0, 0, -1};
int movexx[8] = {-1, 0, 1, 1, 1, 0, -1, -1};
int moveyy[8] = {1, 1, 1, 0, -1, -1, -1, 0};
const int CS = 2005;
int n, m, sz;
char S[100005];
int main() {
int i, now = 0;
scanf("%s", S);
n = strlen(S);
for (i = 0; i < n; i++) {
if (S[i] == '(') now++;
if (S[i] == ')') now--;
if (S[i] == '#') sz++;
if (now - sz < 0) return !printf("-1");
}
int cur = 0;
for (i = n - 1; S[i] != '#'; i--) {
if (S[i] == ')')
cur++;
else
cur--;
if (cur < 0) return !printf("-1");
}
for (i = 1; i < sz; i++) printf("1\n");
printf("%d", now - sz + 1);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void) {
char input[500001];
int total = 0;
int lastseen = 0;
cin >> input;
int n = strlen(input);
if (input[0] == ')' || input[0] == '#') {
printf("-1");
return 0;
}
for (int i = 0; i < n; i++) {
total += (input[i] == '(' ? 1 : -1);
if (total < 0) {
printf("-1");
return 0;
}
if (input[i] == '#') {
lastseen = i;
}
}
int maximum = total + 1;
total = 0;
for (int i = 0; i < n; i++) {
if (i == lastseen) {
total -= maximum;
} else {
total += (input[i] == '(' ? 1 : -1);
}
if (!(total >= 0)) {
printf("-1");
return 0;
}
}
for (int i = 0; i < n; i++) {
if (i == lastseen) {
printf("%d\n", maximum);
} else if (input[i] == '#') {
printf("1\n");
}
}
return 0;
}
|
#include <bits/stdc++.h>
std::vector<int> vs;
int main() {
std::string str;
std::cin >> str;
int last = 0;
int open = 0;
for (int i = 0; i < str.length(); i++) {
if (str[i] == '#') {
last = i;
str[i] = ')';
vs.push_back(1);
}
if (str[i] == '(') {
open++;
} else {
open--;
}
if (open < 0) {
std::cout << -1 << std::endl;
return 0;
}
}
vs.back() += open;
open = 0;
for (int i = 0; i < str.length(); i++) {
if (i == last) {
open -= vs.back();
} else if (str[i] == '(') {
open++;
} else {
open--;
}
if (open < 0) {
std::cout << -1 << std::endl;
return 0;
}
}
for (int v : vs) {
std::cout << v << std::endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 9e18;
const long long alphabet = 256;
int main() {
string s, ans = "";
cin >> s;
int n = s.length();
int counto = 0, countc = 0, hash = 0, temphash, p;
for (int i = 0; i < n; i++) {
if (s[i] == '(')
counto++;
else if (s[i] == ')')
countc++;
else
hash++;
}
if (countc + hash > counto) {
cout << -1;
return 0;
}
temphash = hash;
for (int i = 0; i < n; i++) {
if (s[i] == '(')
ans += '(';
else if (s[i] == ')')
ans += ')';
else {
if (hash == 1) {
p = counto - (countc + temphash - 1);
if (p <= 0) {
cout << "hello";
cout << -1;
return 0;
}
for (int j = 0; j < p; j++) ans += ')';
} else {
ans += ')';
hash--;
}
}
}
n = ans.length();
int bal = 0;
for (int i = 0; i < n; i++) {
if (ans[i] == '(')
bal++;
else if (ans[i] == ')')
bal--;
if (bal < 0) {
cout << -1;
return 0;
}
}
for (int i = 0; i < temphash - 1; i++) cout << 1 << endl;
cout << p;
}
|
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
if (b == 0) return a;
return gcd(b, a % b);
}
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
string str;
long long i, j;
cin >> str;
long long n = str.length();
long long cnt = 0;
vector<long long> res;
long long flag = 0;
for (i = 0; i < n; i++) {
if (str[i] == '(')
cnt++;
else if (str[i] == ')')
cnt--;
else {
res.push_back(cnt);
if (cnt < 1) {
flag = 1;
break;
}
}
if (cnt < 0) {
flag = 1;
break;
}
}
if (flag || cnt < res.size())
cout << -1 << "\n";
else {
long long temp = 1;
flag = 0;
cnt -= res.size();
vector<long long> fin(res.size(), 1);
for (i = 0; i < fin.size(); i++) {
res[i] -= temp;
temp++;
if (res[i] < 0) {
flag = 1;
break;
}
}
i = fin.size() - 1;
temp = 0;
while (i >= 0) {
if (cnt > res[i]) {
cnt -= res[i];
fin[i] += res[i];
i--;
} else {
fin[i] += cnt;
cnt = 0;
break;
}
}
if (flag || (cnt != 0))
cout << -1 << "\n";
else {
j = 0;
for (i = 0; i < n; i++) {
if (str[i] == '(')
cnt++;
else if (str[i] == ')')
cnt--;
else
cnt -= fin[j++];
if (cnt < 0) {
flag = 1;
break;
}
}
if (cnt != 0 || flag) {
cout << -1 << "\n";
return 0LL;
}
for (i = 0; i < fin.size(); i++) cout << fin[i] << "\n";
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
string in;
cin >> in;
int c = 0;
vector<int> out;
int lastpos;
for (int i = 0; i < in.length(); i++) {
if (in[i] == '#') {
lastpos = i;
}
}
for (int i = 0; i <= lastpos; i++) {
if (in[i] == '(') {
c++;
} else if (in[i] == ')') {
c--;
} else {
if (i != lastpos) {
out.push_back(1);
} else {
out.push_back(c);
}
c--;
}
if (c < 0) {
printf("-1\n");
return 0;
}
if (i == lastpos) {
c = 0;
}
}
int c2 = 0;
for (int i = in.length() - 1; i > lastpos; i--) {
if (in[i] == ')') {
c2++;
} else if (in[i] == '(') {
c2--;
}
if (c2 < 0) {
printf("-1\n");
return 0;
}
}
if (c2 < 0 || (c2 > 0 && out[out.size() - 1] - c2 < 1)) {
printf("-1\n");
} else {
out[out.size() - 1] -= c2;
for (int x : out) {
printf("%d\n", x);
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long i;
string s;
cin >> s;
long long n = s.length();
long long cls_brckt_in_stock = 0, n_opn_brckt = 0, n_cls_brckt = 0,
hash_i = 0;
vector<long long> gvn_cls_brckt(1);
for (i = 0; i < n; i++) {
if (s[i] == '(') {
n_opn_brckt++;
cls_brckt_in_stock++;
} else if (s[i] == ')') {
n_cls_brckt++;
if (n_cls_brckt > n_opn_brckt) {
for (long long j = hash_i; j >= 1; j--) {
if (gvn_cls_brckt[j] > 1) {
gvn_cls_brckt[j]--;
n_cls_brckt--;
break;
}
}
if (n_cls_brckt > n_opn_brckt) {
cout << "-1" << endl;
return 0;
}
} else {
cls_brckt_in_stock--;
}
} else {
hash_i++;
gvn_cls_brckt.push_back(0);
if (cls_brckt_in_stock < 1) {
for (long long j = 1; j < hash_i; j++) {
if (gvn_cls_brckt[j] > 1) {
gvn_cls_brckt[hash_i] = 1;
gvn_cls_brckt[j]--;
break;
}
}
if (gvn_cls_brckt[hash_i] == 0) {
cout << "-1" << endl;
return 0;
}
} else {
gvn_cls_brckt[hash_i] = cls_brckt_in_stock;
n_cls_brckt += cls_brckt_in_stock;
cls_brckt_in_stock = 0;
}
}
}
if (n_opn_brckt != n_cls_brckt) {
cout << "-1" << endl;
return 0;
}
for (i = 1; i <= hash_i; i++) {
cout << gvn_cls_brckt[i] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int Nmax = 100005;
char s[Nmax];
int N, v[Nmax], ans[Nmax];
int st[Nmax], o[Nmax];
int main() {
cin.getline(s + 1, Nmax);
N = strlen(s + 1);
int c = 0, f = 1;
for (int i = 1; i <= N; i++)
if (s[i] == '#') o[++o[0]] = i;
o[++o[0]] = N + 1;
for (int i = 1; i < o[1]; i++) {
if (s[i] == '(') c++;
if (s[i] == ')') c--;
if (c < 0) {
cout << "-1\n";
return 0;
}
}
for (int i = 1; i < o[0]; i++) {
int get = 0x3f3f3f3f;
for (int j = o[i]; j < o[i + 1]; j++) {
if (s[j] == '(') c++;
if (s[j] == ')') c--;
get = ((get) < (c) ? (get) : (c));
}
v[++v[0]] = get;
c--;
}
c = 0;
for (int i = 1; i <= N; i++) {
if (s[i] == '(') c++;
if (s[i] == ')') c--;
if (s[i] == '#') c--;
}
for (int i = 1; i <= v[0]; i++) ans[i] = 1;
for (int i = 1; i <= v[0]; i++) {
v[i]--;
if (v[i] < 0) {
cout << "-1\n";
return 0;
}
}
st[++st[0]] = v[0] + 1;
v[v[0] + 1] = 0x3f3f3f3f;
for (int i = v[0]; i >= 1; i--) {
if (v[i] < v[st[st[0]]]) st[++st[0]] = i;
}
int sc = 0;
for (int j = st[0]; j >= 2; j--) {
int i = st[j];
v[i] -= sc;
if (c) {
int coef = ((c) < (v[i]) ? (c) : (v[i]));
c -= coef;
v[i] -= coef;
ans[i] += coef;
sc += coef;
}
}
if (c) {
cout << "-1\n";
return 0;
}
for (int i = 1; i <= v[0]; i++) cout << ans[i] << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
char array[100000];
int i;
int dif[100000], hash = 0, test = 0, count;
gets(array);
int len = strlen(array);
if (array[0] == '(')
dif[0] = 1;
else {
cout << -1;
return 0;
}
for (i = 1; i < len; i++) {
if (array[i] == '(')
dif[i] = dif[i - 1] + 1;
else if (array[i] == ')')
dif[i] = dif[i - 1] - 1;
else {
dif[i] = dif[i - 1] - 1;
test = 1;
count = i;
hash++;
}
if (dif[i] == -1) {
cout << -1;
return 0;
}
}
for (i = count; i < len; i++) {
if ((dif[i] - dif[len - 1]) == -1) {
cout << -1;
return 0;
}
}
for (i = 0; i < hash - 1; i++) {
cout << 1 << endl;
}
cout << dif[len - 1] + 1;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string sss = "0123456789ABCDEF";
void solve(long long CS) {
long long left = 0, right = 0, i, l, cnt = 0, np = 0, kyta = 0, baki, last;
vector<long long> v;
string s;
cin >> s;
l = s.size();
for (i = 0; i < l; i++) {
if (s[i] == '#') {
kyta++;
last = i;
} else if (s[i] == '(')
left++;
else
right++;
}
if (kyta + right > left) {
puts("-1");
return;
}
baki = left - right - kyta;
for (i = 0; i < l; i++) {
if (s[i] == '(') {
cnt++;
} else if (s[i] == ')') {
cnt--;
if (cnt < 0) np = 1;
} else if (s[i] == '#') {
cnt--;
if (i == last) cnt -= baki;
if (cnt < 0) np = 1;
}
}
if (cnt != 0) np = 1;
if (np) {
puts("-1");
return;
}
for (i = 0; i < l; i++) {
if (s[i] == '#') {
if (i == last)
cout << baki + 1 << endl;
else
cout << 1 << endl;
}
}
}
int main() {
long long t, no = 0;
t = 1;
while (t--) solve(++no);
}
|
#include <bits/stdc++.h>
using namespace std;
typedef struct _node {
struct _node* L;
struct _node* R;
long long int key;
} tree;
typedef tree* treenode;
long long int modinverse(long long int a, long long int y) {
if (y == 0) return 1;
long long int p = modinverse(a, y / 2) % 1000000007;
p = (p * p) % 1000000007;
return (y % 2 == 0) ? p : (a * p) % 1000000007;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
;
long long int n, k;
string s;
cin >> s;
vector<long long int> v;
long long int countopen = 0, countclose = 0;
for (long long int i = 0; i < s.length(); i++) {
if (s[i] == '(') countopen++;
if (s[i] == ')') countclose++;
if (s[i] == '#') {
if (countopen - countclose < 1) {
cout << "-1\n";
return 0;
}
v.push_back(1);
countclose++;
}
if (countclose > countopen) {
cout << "-1\n";
return 0;
}
}
if (countclose > countopen) {
cout << "-1\n";
return 0;
}
v[v.size() - 1] += countopen - countclose;
long long int count = 0;
countopen = countclose = 0;
for (long long int i = 0; i < s.length(); i++) {
if (s[i] == '(')
countopen++;
else if (s[i] == ')')
countclose++;
else {
countclose += v[count];
count++;
}
if (countclose > countopen) {
cout << "-1\n";
return 0;
}
}
for (long long int i = 0; i < v.size(); i++) cout << v[i] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int32_t main() {
string s;
long long cnto = 0, cntc = 0, cnth = 0, cntb = 0, cnt = 0;
cin >> s;
for (long long i = 0; i < s.size(); i++) {
if (s[i] == '(') {
cnto++;
cntb++;
} else if (s[i] == ')') {
cntc++;
if (cntc > cnto) {
cout << -1 << endl;
return 0;
}
if (cntb > 0) cntb--;
} else {
cnt++;
cntb = 0;
if (cntc + cnt > cnto) {
cout << -1 << endl;
return 0;
}
}
}
if (cntc >= cnto || cntb > 0) {
cout << -1 << endl;
return 0;
}
for (long long i = 1; i < cnt; i++) cout << 1 << endl;
cout << (cnto - cntc) - cnt + 1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long int N = 1e5 + 10, INF = 1e18;
int T, c;
const int mod = 1e9 + 7;
int n, open, close, emp, last_emp;
string s;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> s;
n = s.length();
for (int i = 0; i < n; i++) {
if (s[i] == '(')
open++;
else if (s[i] == ')')
close++;
else {
emp++;
last_emp = i;
}
}
if (open - close < emp) {
cout << -1;
return 0;
}
vector<int> ans;
int rem = open - close;
open = 0;
for (int i = 0; i < n; i++) {
if (s[i] == ')') {
if (open > 0)
open--;
else {
cout << -1;
return 0;
}
} else if (s[i] == '#') {
if (open > 0) {
if (i == last_emp) {
if (open >= rem) {
ans.push_back(rem);
open -= rem;
rem = 0;
} else {
cout << -1;
return 0;
}
} else {
open--;
rem--;
ans.push_back(1);
}
} else {
cout << -1;
return 0;
}
} else
open++;
}
ans.back() += open;
for (auto x : ans) cout << x << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
string s;
int br_left, br_right, diff, n, br_h, currentdiff, num = 0, k;
int ans[100000];
void input() {
cin >> s;
n = s.size();
for (int i = 0; i < n; i++) {
if (s[i] == '(')
br_left++;
else if (s[i] == ')')
br_right++;
else
br_h++;
}
diff = br_left - br_right;
k = br_h;
}
void solve() {
if (diff < br_h)
printf("-1\n");
else {
br_left = 0;
br_right = 0;
bool f = 1;
int count = 0, i = 0;
while (count < k) {
while (s[i] != '#' && i < n) {
if (s[i] == '(')
br_left++;
else if (s[i] == ')')
br_right++;
i++;
}
currentdiff = br_left - br_right;
if (currentdiff <= 0) {
f = 0;
break;
} else {
br_h--;
if (br_h == 0)
ans[num] = diff;
else {
ans[num] = 1;
diff--;
}
if (br_left - ans[num] - br_right < 0) {
f = 0;
break;
}
num++;
}
count++;
i++;
}
if (!f)
printf("-1\n");
else {
int p = 0;
br_left = 0;
br_right = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '(')
br_left++;
else if (s[i] == ')')
br_right++;
else {
br_right += ans[p];
p++;
}
currentdiff = br_left - br_right;
if (currentdiff < 0) {
f = 0;
break;
}
}
if (f)
for (int i = 0; i < num; i++) printf("%d\n", ans[i]);
else
printf("-1\n");
}
}
}
int main() {
input();
solve();
}
|
#include <bits/stdc++.h>
using namespace std;
struct Dbg {
template <typename T>
Dbg& operator,(const T& v) {
cerr << v << ", ";
return *this;
}
} Dbg;
template <typename T>
ostream& operator<<(ostream& _o_, const vector<T>& _v_) {
if (!_v_.empty()) {
_o_ << '[';
copy(_v_.begin(), _v_.end(), ostream_iterator<T>(_o_, ", "));
_o_ << "\b\b]";
}
return _o_;
}
template <class C>
void mini(C& _a, C _b) {
_a = min(_a, _b);
}
template <class C>
void maxi(C& _a, C _b) {
_a = max(_a, _b);
}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
string s;
cin >> s;
int n = s.size();
int opening = 0, closing = 0, cnt = 0;
for (int i = 0; i < n; i++) {
opening += (s[i] == '(');
closing += (s[i] == ')');
if (closing > opening) {
cout << -1;
return 0;
}
cnt += (s[i] == '#');
}
if (cnt > opening - closing) {
cout << -1;
return 0;
}
int k = 0;
vector<int> ans;
for (int i = 0; i < n; i++) {
k += (s[i] == '(');
k -= (s[i] == ')');
if (s[i] == '#') {
if (cnt > 1) {
cnt--;
k--;
closing++;
ans.push_back(1);
} else {
if (opening - closing - 1 < 0) {
cout << -1;
return 0;
}
k -= opening - closing;
ans.push_back(opening - closing);
}
}
if (k < 0) {
cout << -1;
return 0;
}
}
for (int x : ans) {
cout << x << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 1 << 29;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
int n = s.size();
bool first = true;
int cnt = 0, ind;
for (int i = n - 1; i >= 0; i--) {
if (s[i] == '#') {
cnt++;
s.replace(i, 1, ")");
if (first) ind = i;
first = false;
}
}
int left = 0, right = 0, btm = 0;
for (int i = 0; i < ind; i++) {
if (s[i] == '(') ++left;
if (s[i] == ')') --left;
if (left < 0) break;
}
for (int i = ind + 1; i < n; i++) {
if (s[i] == '(') ++right;
if (s[i] == ')') --right;
btm = min(btm, right);
}
int ans = left + right;
if (left <= 0 || ans <= 0 || left - ans + btm < 0) {
cout << "-1" << endl;
} else {
for (int i = 0; i < cnt - 1; i++) cout << 1 << endl;
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, cek = 0, pagar = 0, cekp = 0, cek2, cek3;
string s;
cin >> s;
for (i = 0; i < s.length(); i++) {
if (s[i] == '(') {
cek++;
} else {
cek--;
}
if (cek < 0) {
cout << -1;
return 0;
}
if (s[i] == '#') {
pagar++;
}
}
for (i = 0; i < s.length(); i++) {
if (s[i] == '#') {
cekp++;
cek2--;
if (cekp == pagar) {
cek2 = 0;
cek3 = 0;
}
} else if (s[i] == '(') {
cek2++;
cek3++;
} else {
cek2--;
cek3 = 0;
}
}
if ((cek2 > 0) || (cek3 > 0)) {
cout << -1;
return 0;
}
for (i = 0; i < pagar - 1; i++) {
cout << 1 << endl;
}
cout << 1 + cek;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-5;
long long llinf = 1e18 + 10;
int intinf = 1e9 + 7;
const int mod = 1e9 + 7;
const int N = 1e5 + 10;
char s[N];
int main() {
scanf("%s", s);
int n = strlen(s);
int run = 0;
int lstrn, lst, num = 0;
for (int i = 0; i < int(n); ++i) {
if (s[i] == '(')
run++;
else {
run--;
if (s[i] == '#') num++, lst = i, lstrn = run;
}
if (run < 0) {
cout << "-1\n";
return 0;
}
}
int run2 = 0;
for (int i = n - 1; i > lst; i--) {
if (s[i] == ')')
run2++;
else
run2--;
if (run2 < 0) {
cout << "-1\n";
return 0;
}
}
run = lstrn;
if (run2 > run) {
cout << "-1\n";
return 0;
}
int ans = run - run2 + 1;
for (int i = 0; i < int(num - 1); ++i) printf("1\n");
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<long long int> divisor(long long int n) {
vector<long long int> res;
for (long long int i = 1; i * i <= n; ++i) {
if (n % i == 0) {
res.push_back(i);
if (i * i != n) res.push_back(n / i);
}
}
sort(begin(res), end(res));
return res;
}
int main() {
string st;
cin >> st;
int lastshar;
int leftnum = 0;
int rightnum = 0;
int shnum = 0;
for (int i = 0; i < st.size(); ++i) {
if (st[i] == '#') {
lastshar = i;
shnum++;
rightnum++;
} else if (st[i] == '(') {
leftnum++;
} else {
rightnum++;
}
}
if (leftnum < rightnum) {
cout << -1 << endl;
return 0;
} else {
int lastrightnum = 1 + leftnum - rightnum;
vector<char> stack;
for (int i = 0; i < st.size(); ++i) {
if (st[i] == '(') {
stack.push_back('(');
} else if (st[i] == ')') {
if (!stack.empty() && stack.back() == '(') {
stack.pop_back();
} else {
cout << -1 << endl;
return 0;
}
} else {
if (i == lastshar) {
for (int j = 0; j < lastrightnum; ++j) {
if (!stack.empty() && stack.back() == '(') {
stack.pop_back();
} else {
cout << -1 << endl;
return 0;
}
}
} else {
if (!stack.empty() && stack.back() == '(') {
stack.pop_back();
} else {
cout << -1 << endl;
return 0;
}
}
}
}
for (int i = 0; i < shnum - 1; ++i) {
cout << 1 << endl;
}
cout << lastrightnum << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = (int)1E9;
char str[100005];
int main() {
scanf("%s", str);
int n = strlen(str);
int sharp = 0, lastsharp;
for (int i = (0); i < (n); i++) {
if (str[i] == '#') {
lastsharp = i;
sharp++;
str[i] = ')';
}
}
int open = 0, openbeyond = 0;
bool fail = 0;
for (int i = (0); i < (lastsharp + 1); i++) {
if (str[i] == '(')
open++;
else {
if (open)
open--;
else
fail = 1;
}
}
for (int i = (lastsharp + 1); i < (n); i++) {
if (str[i] == '(')
openbeyond++;
else {
if (openbeyond <= 0) {
if (open)
open--;
else
fail = 1;
} else
openbeyond--;
}
}
int need = open + openbeyond + 1;
if (fail || openbeyond > 0 || need < 1) {
puts("-1");
return 0;
}
for (int i = (0); i < (sharp - 1); i++) puts("1");
printf("%d\n", need);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double PI = 2 * asin(1.0);
const long long mod = 1e9 + 7;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
string texto;
cin >> texto;
int cont = 0;
int vetor[((int)texto.size())];
memset(vetor, 0, sizeof vetor);
bool primeiro = false;
bool possivel = true;
int pos = 0;
for (int i = 0; i < ((int)texto.size()); ++i) {
if (texto[i] == '(')
cont++;
else if (!primeiro && texto[i] == ')') {
cont--;
if (cont < 0) {
possivel = false;
break;
}
} else if (texto[i] == '#') {
primeiro = true;
vetor[i] = cont;
cont = 0;
pos = i;
}
}
if (!possivel)
cout << "-1\n";
else {
int aux = 0;
if (cont > 0) {
for (int i = ((int)texto.size()) - 1; i >= pos + 1; --i) {
if (texto[i] == ')')
aux++;
else if (texto[i] == '(')
aux--;
if (aux < 0) {
possivel = false;
break;
}
}
} else {
for (int i = pos + 1; i < ((int)texto.size()); ++i) {
if (texto[i] == ')') aux++;
}
}
if (!possivel)
cout << "-1\n";
else {
cont = 0;
int aux2 = 0;
int aux3 = 0;
for (int i = pos - 1; i >= 0; --i) {
if (texto[i] == ')')
aux3++;
else if (texto[i] == '#') {
vetor[i] -= aux3;
aux3 = 0;
}
}
vetor[pos] -= aux;
for (int i = 0; i < ((int)texto.size()); ++i) {
if (texto[i] == '#') {
cont += vetor[i];
aux2++;
}
}
if (aux2 > cont)
cout << "-1\n";
else {
bool ult = true;
int aux4 = 0;
for (int i = 0; i < ((int)texto.size()); ++i) {
if (texto[i] == '(')
aux4++;
else if (texto[i] == ')')
aux4--;
else {
if (aux4 <= 0) {
ult = false;
break;
}
aux4--;
}
}
if (!ult)
cout << "-1\n";
else {
for (int i = 0; i < ((int)texto.size()); ++i) {
if (texto[i] == '#') {
if (i == pos)
cout << cont << endl;
else {
cout << "1\n";
cont--;
}
}
}
}
}
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
string s;
vector<int> v;
int main() {
cin >> s;
int n = s.length();
int cur = 0, pos = -1;
for (int i = 0; i < n; i++)
if (s[i] == '#') pos = i;
for (int i = 0; i < n; i++) {
cur += s[i] == '(' ? 1 : -1;
if (cur < 0) return puts("-1");
}
int last = 1 + cur;
cur = 0;
for (int i = 0; i < n; i++) {
cur += i == pos ? -last : (s[i] == '(' ? 1 : -1);
if (cur < 0) return puts("-1");
}
for (int i = 0; i < n; i++) {
if (s[i] == '#') {
cout << ((i == pos) ? last : 1) << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
char s[100010];
int mark[100010];
vector<int> pos;
bool solve() {
int num = 0, last = -1;
for (int i = 0; s[i]; i++) {
if (s[i] == '(')
num++, mark[i] = 1;
else if (s[i] == ')')
num--, mark[i] = -1;
else {
mark[i] = -1;
num--;
last = i;
pos.push_back(i);
}
if (num < 0) return false;
}
if (last != -1) {
mark[last] -= num;
}
num = 0;
for (int i = 0; s[i]; i++) {
num += mark[i];
if (num < 0) return false;
}
return num == 0;
}
int main() {
scanf("%s", s);
if (!solve())
puts("-1");
else {
for (int i = 0; i < (pos.size()); i++) printf("%d\n", -mark[pos[i]]);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e9;
const long long N = 1e2 + 1;
const long long mod = 1e9 + 7;
const long double eps = 1E-7;
string s;
int z, w;
char x, y;
vector<int> D;
vector<int> ANS;
deque<pair<char, int>> V;
int main() {
ios_base::sync_with_stdio(0);
cin >> s;
for (int i = 0; i < s.size(); i++) {
x = s[i], y = '*';
if (!V.empty()) y = V.back().first;
if (x == '#')
D.push_back(i);
else if (y != x && y == '(')
V.pop_back();
else
V.push_back({x, i});
}
if (V.front().first == ')') {
cout << -1;
return 0;
}
w = 1;
for (int i = 0; i < D.size(); i++) {
if (i != D.size() - 1 && D[i + 1] - D[i] == 1) {
w++;
continue;
}
while (!V.empty() && V.front().second <= D[i]) z++, V.pop_front();
if (w > z) {
cout << -1;
return 0;
}
for (int i = 1; i <= w; i++) ANS.push_back(1), z--;
w = 1;
}
if (!V.empty()) {
cout << -1;
return 0;
}
for (int i = 0; i < ANS.size() - 1; i++) cout << ANS[i] << endl;
cout << ANS.back() + z << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
char S[N];
int Count[N];
int main() {
scanf("%s", S);
int count = 0;
int Num = 0;
for (int i = 0; S[i]; i++) {
if (S[i] == '(')
count++;
else if (S[i] == ')')
count--;
else {
Num++;
}
Count[i] = count;
}
if (count < Num) {
cout << -1 << endl;
return 0;
}
int last = count - Num + 1;
int j = 0;
for (int i = 0; S[i]; i++) {
if (S[i] == '#') {
j++;
}
if (j == Num) {
Count[i] -= count;
} else {
Count[i] -= j;
}
if (Count[i] < 0) {
cout << -1 << endl;
return 0;
}
}
for (int i = 1; i < Num; i++) cout << 1 << endl;
cout << last << endl;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.