text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int open = 0;
int closed = 0;
int hash_tag = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '(') {
open++;
}
if (s[i] == ')') {
closed++;
}
if (s[i] == '#') {
hash_tag++;
}
}
if (hash_tag + closed > open) {
printf("-1\n");
return 0;
}
if (hash_tag == 0 && closed != open) {
printf("-1\n");
return 0;
}
vector<int> answers;
int curr_open = 0;
int curr_closed = 0;
int curr_hash = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '(') {
curr_open++;
}
if (s[i] == ')') {
curr_closed++;
}
if (s[i] == '#') {
curr_hash++;
if (curr_hash == hash_tag) {
int volgen = 0;
for (int j = i + 1; j < s.size(); j++) {
if (s[j] == ')') {
volgen++;
}
}
if (open - curr_closed - volgen <= 0) {
printf("-1\n");
return 0;
}
answers.push_back(open - curr_closed - volgen);
curr_closed += open - curr_closed - volgen;
} else {
answers.push_back(1);
curr_closed++;
}
}
if (curr_closed > curr_open) {
printf("-1\n");
return 0;
}
}
for (int i = 0; i < answers.size(); i++) {
printf("%d\n", answers[i]);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c1 = 0, c2 = 0, c3 = 0, c11 = 0, c22 = 0;
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '(') c1++;
if (s[i] == ')') c2++;
if (s[i] == '#') c3++;
if (c2 + c3 > c1) return cout << -1, 0;
}
for (int i = s.size() - 1; i >= 0; i--) {
if (s[i] == '(') c11++;
if (s[i] == ')') c22++;
if (c11 > c22) return cout << -1, 0;
if (s[i] == '#') break;
}
for (int i = 0; i < c3 - 1; i++) cout << 1 << endl, c2++;
cout << c1 - c2;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 300010;
const int mod = 100007;
const int N = 500 + 7;
const int inf = 0x3f3f3f3f;
const long long INF = 0x3f3f3f3f3f3f3f3f;
const double eps = 1e-8;
const double PI = acos(-1);
int n, m, cnt, ans, flag;
inline int read() {
register int c = getchar(), fg = 1, sum = 0;
while (c > '9' || c < '0') {
if (c == '-') fg = -1;
c = getchar();
}
while (c <= '9' && c >= '0') {
sum = sum * 10 + c - '0';
c = getchar();
}
return fg * sum;
}
string str;
void init() { cin >> str; }
void go() {
int len = str.length();
n = m = 0;
int k = 0, p = 0, q = 0;
for (int i = 0; i < len; i++) {
if (str[i] == '#') p++, q--;
if (str[i] == '(') q++;
if (str[i] == ')') q--;
if (q < 0) {
puts("-1");
return;
}
}
for (int i = 0; i < len; i++) {
if (str[i] == '(') n++;
if (str[i] == ')') n--;
if (str[i] == '#') {
n--;
m++;
if (!--p) n -= q;
}
if (n < 0) {
puts("-1");
return;
}
}
if (n) {
puts("-1");
return;
}
while (--m) puts("1");
printf("%d\n", q + 1);
}
int main() {
init();
go();
}
|
#include <bits/stdc++.h>
using namespace std;
string str;
int main() {
cin >> str;
int l, r, s, last;
l = r = s = 0;
for (int i = 0; str[i]; i++) {
if (str[i] == '(')
l++;
else if (str[i] == ')')
r++;
else
s++, last = i;
}
if (r + s > l) {
cout << "-1" << endl;
return 0;
}
int num = 0, lasts = l - r - s;
for (int i = 0; str[i]; i++) {
if (str[i] == '(')
num++;
else
num--;
if (i == last) num -= lasts;
if (num < 0) {
cout << "-1" << endl;
return 0;
}
}
for (int i = 0; i < s - 1; i++) cout << "1" << endl;
cout << lasts + 1 << endl;
}
|
#include <bits/stdc++.h>
char s[100010];
int cnt, last, n, num, tot;
int main() {
scanf("%s", s + 1);
n = strlen(s + 1);
for (int i = 1; i <= n; i++) {
if (s[i] == '(')
cnt++;
else if (s[i] == ')')
cnt--;
else {
last = i;
cnt--;
num++;
}
if (cnt < 0) {
printf("-1");
return 0;
}
}
tot = cnt;
cnt = 0;
for (int i = 1; i <= n; i++) {
if (s[i] == '(')
cnt++;
else
cnt--;
if (i == last) cnt -= tot;
if (cnt < 0) {
printf("-1");
return 0;
}
}
for (int i = 1; i <= num; i++) printf("%d\n", i == num ? tot + 1 : 1);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char s[100000 + 10];
int ok = 1;
vector<int> v;
int main() {
scanf("%s", s + 1);
int n = strlen(s + 1);
int cnt = 0;
int last = -1;
int need = 0;
for (int i = 1; i <= n; i++) {
if (s[i] == '(') {
need++;
} else {
need--;
}
}
need++;
if (need <= 0) {
ok = 0;
}
for (int i = n; i >= 1; i--) {
if (s[i] == '#') {
last = i;
break;
}
}
for (int i = 1; i <= n; i++) {
if (s[i] == '(') {
cnt++;
}
if (s[i] == ')') {
cnt--;
}
if (s[i] == '#') {
if (i == last) {
v.push_back(need);
cnt -= need;
} else {
cnt--;
v.push_back(1);
}
}
if (cnt < 0) ok = 0;
}
if (ok == 0) return 0 * printf("-1\n");
for (int i = 0; i < v.size(); i++) {
printf("%d\n", v[i]);
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string x;
int p = 0, ls;
cin >> x;
for (int i = 0; i < x.size(); i++) {
if (x[i] == ')')
p--;
else if (x[i] == '(')
p++;
else {
p--;
ls = i;
}
}
if (p < 0) {
cout << "-1";
return 0;
}
int j = 0;
for (int i = 0; i < x.size(); i++) {
if (x[i] == '(') j++;
if (x[i] == ')') j--;
if (x[i] == '#') {
j--;
if (i == ls) j -= p;
}
if (j < 0) {
printf("-1");
return 0;
}
}
for (int i = 0; i < x.size(); i++) {
if (i == ls)
printf("%d\n", p + 1);
else if (x[i] == '#')
printf("1\n");
}
}
|
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
;
string str;
cin >> str;
long long n = str.size(), c1 = 0, c2 = 0, cnt = 0, chk1 = 0, chk2 = 0;
for (long long i = 0; i < n; i++) {
if (str[i] == '(') {
++c1;
} else if (str[i] == '#') {
++cnt;
} else {
++c2;
}
if (cnt + c2 > c1) {
cout << -1;
return 0;
}
}
for (long long i = n - 1; i >= 0; i--) {
if (str[i] == '(') {
++chk1;
} else if (str[i] == '#') {
break;
} else {
++chk2;
}
if (chk1 > chk2) {
cout << -1;
return 0;
}
}
if (c2 + cnt > c1) {
cout << -1;
} else {
for (long long i = 1; i < cnt; i++) {
cout << 1 << '\n';
}
cout << c1 - c2 - (cnt - 1);
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 7;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
vector<int> sharp;
queue<int> cl;
int open = 0, close = 0, open1 = 0, close1 = 0, start = 0;
string s;
cin >> s;
int lastsharp = -1;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '#') lastsharp = i;
}
if (lastsharp == -1) {
cout << "-1";
return 0;
}
for (int i = 0; i < s.size(); i++) {
if (s[i] == '(') {
open++;
if (i > lastsharp) start++;
} else if (s[i] == ')') {
close++;
if (i > lastsharp) {
start--;
if (start < 0) start = 0;
}
} else if (i != lastsharp) {
close++;
sharp.push_back(1);
}
if (close + close1 > open + open1) {
cout << -1;
return 0;
}
if (i == lastsharp) {
open1 = open;
close1 = close;
open = 0;
close = 0;
}
}
if (close < open) {
cout << -1;
return 0;
}
if (open1 + open - close1 - close == 0) {
cout << -1;
return 0;
}
if (start > 0) {
cout << -1;
return 0;
}
sharp.push_back(open1 + open - close1 - close);
for (int i = 0; i < sharp.size(); i++) cout << sharp[i] << endl;
}
|
#include <bits/stdc++.h>
int main() {
char c;
unsigned x = 0, y = 0, min = -1;
while ((c = getchar()) > ' ') {
if (c == '#') {
++y;
min = -1;
}
if (c == '(')
++x;
else {
if (x == 0) {
printf("-1\n");
return 0;
}
--x;
}
if (min > x) min = x;
}
if (x != min) {
printf("-1\n");
return 0;
}
while (--y) printf("1\n");
printf("%u\n", x + 1);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100005;
int n, len;
char ch;
char in[maxn];
int ans[maxn];
int main() {
n = 0;
len = 0;
while ((ch = getchar()) != EOF && ch != '\n') {
in[len++] = ch;
if (ch == '#') n++;
}
bool flag = true;
int cnt = 0, res;
for (int i = 0; i < len && flag; i++) {
if (in[i] == '(')
cnt++;
else
cnt--;
if (cnt < 0) flag = false;
}
res = cnt;
cnt = 0;
for (int i = 0, j = 0; i < len && flag; i++) {
if (in[i] == '(') cnt++;
if (in[i] == ')') cnt--;
if (in[i] == '#') {
if (j != n - 1)
cnt--;
else
cnt -= (1 + res);
j++;
}
if (cnt < 0) flag = false;
}
if (!flag)
printf("-1\n");
else {
for (int i = 0; i < n - 1; i++) printf("1\n");
printf("%d\n", 1 + res);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string s;
int main() {
cin >> s;
int z = 0;
int n = s.size();
int utso = -1;
for (int i = 0; i < n; i++) {
if (s[i] == '#') {
utso = i;
}
}
bool lehet = true;
int ment = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '(') z++;
if (s[i] == ')') z--;
if (s[i] == '#' && i < utso) z--;
if (i == utso) {
int k = z;
for (int j = i + 1; j < n; j++) {
if (s[j] == '(') k++;
if (s[j] == ')') k--;
}
k = max(1, k);
ment = k;
z -= k;
}
if (z < 0) lehet = false;
}
if (z != 0) lehet = false;
if (!lehet) {
cout << -1;
return 0;
}
for (int i = 0; i < n; i++) {
if (s[i] == '(') z++;
if (s[i] == ')') z--;
if (s[i] == '#' && i < utso) {
cout << 1 << endl;
z--;
}
if (i == utso) {
cout << ment << endl;
return 0;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/STACK:256000000")
int n, k;
vector<int> res;
string st;
int last;
int kol = 0;
int main() {
cin >> st;
int bal = 0;
int flag = 0;
int tbal = 0;
for (int i = 0; i < st.size(); ++i) {
if (bal < 0) {
cout << -1;
return 0;
}
if (st[i] == ')') {
flag--;
flag = max(0, flag);
bal--;
}
if (st[i] == '(') {
flag++;
bal++;
}
if (st[i] == '#') {
flag = 0;
bal--;
kol++;
}
}
if (flag > 0) {
cout << -1;
return 0;
}
if (bal < 0) {
cout << -1;
return 0;
}
for (int i = 0; i < kol - 1; ++i) printf("1\n", 1);
int t = bal + 1;
printf("%d", t);
}
|
#include <bits/stdc++.h>
using namespace std;
void CI(int &_x) { scanf("%d", &_x); }
void CI(int &_x, int &_y) {
CI(_x);
CI(_y);
}
void CI(int &_x, int &_y, int &_z) {
CI(_x);
CI(_y, _z);
}
void CI(int &_a, int &_b, int &_c, int &_d) {
CI(_a, _b);
CI(_c, _d);
}
template <typename T>
void getarray(T a[], int b, int e) {
for (int i = b; i < e + b; i++) cin >> a[i];
}
template <typename T>
void printarray(T a[], int b, int e) {
for (int i = b; i < e - 1 + b; i++) cout << a[i] << " ";
cout << a[e - 1 + b] << endl;
}
template <typename T>
void printV(vector<T> v) {
int sz = v.size();
cout << v[0];
for (int i = 1; i < sz; i++) cout << " " << v[i];
puts("");
}
template <typename T>
T gcd(T a, T b) {
if (b == 0) return a;
return gcd(b, a % b);
}
template <typename T>
T BigMod(T b, T p, T m) {
if (p == 0) return 1;
if (p % 2 == 0) {
T s = BigMod(b, p / 2, m);
return ((s % m) * (s % m)) % m;
}
return ((b % m) * (BigMod(b, p - 1, m) % m)) % m;
}
template <typename T>
T ModInv(T b, T m) {
return BigMod(b, m - 2, m);
}
template <class T>
inline void read(T &x) {
bool Minus = 0;
char c;
for (c = getchar(); c <= 32; c = getchar())
;
if (c == '-') Minus = 1, c = getchar();
for (x = 0; c > 32; c = getchar()) x = x * 10 + c - '0';
if (Minus) x = -x;
};
char getc() {
char c;
for (c = getchar(); c <= 32; c = getchar())
;
return c;
}
const double EPS = 1e-9;
const int INF = (1 << 30) - 1;
const long long int LINF = (1ll << 62) - 1;
int dr8[8] = {1, -1, 0, 0, 1, -1, -1, 1};
int dc8[8] = {0, 0, -1, 1, 1, 1, -1, -1};
int dr4[4] = {0, 0, 1, -1};
int dc4[4] = {-1, 1, 0, 0};
int kn8r[8] = {1, 2, 2, 1, -1, -2, -2, -1};
int kn8c[8] = {2, 1, -1, -2, -2, -1, 1, 2};
int main() {
int i, j;
string s;
cin >> s;
int sz = s.size();
int op = 0, cl = 0, hs = 0, last_ = -1;
for (int i = 0; i < sz; i++) {
if (s[i] == '(') op++;
if (s[i] == ')') cl++;
if (s[i] == '#') hs++, last_ = i;
}
if (op < (cl + hs)) {
cout << "-1"
<< "\n";
return 0;
}
int balance = 0;
for (i = 0; i < sz; i++) {
if (balance < 0) {
cout << "-1"
<< "\n";
return 0;
}
if (s[i] == '(')
balance++;
else if (i == last_)
balance -= (op - cl - hs + 1);
else
balance--;
}
if (balance == 0) {
for (int i = 1; i < hs; i++) {
cout << 1 << "\n";
}
cout << op - cl - hs + 1 << "\n";
} else {
cout << "-1"
<< "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.length(), cnt = 0;
bool f = 0, val = 1;
vector<int> a;
int last = -1, rem = 0;
for (int i = n - 1; i >= 0; i--) {
if (s[i] == '#') {
last = i;
break;
} else if (s[i] == ')')
rem++;
else if (s[i] == '(')
rem--;
}
for (int i = 0; i < n; i++) {
if (s[i] == '#') {
if (i == last) {
a.push_back(max(cnt - rem, 1));
cnt -= max(cnt - rem, 1);
} else {
a.push_back(1);
cnt--;
}
} else if (s[i] == '(') {
cnt++;
} else {
cnt--;
}
if (cnt < 0) val = 0;
}
if (!val || cnt != 0)
cout << "-1";
else {
for (int i = 0; i < a.size(); i++) cout << a[i] << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int num = 1e5 + 5;
char s[num];
int res[num];
int ind = 0;
int tmp;
int last;
int min(int a, int b) { return a < b ? a : b; }
int main() {
scanf("%s", s + 1);
int sum = 0;
for (int i = 1; s[i] != '\0'; i++) {
if (s[i] == '(')
sum++;
else {
if (s[i] == '#') {
res[++ind] = 1;
last = i;
}
sum--;
if (sum < 0) {
cout << "-1" << endl;
return 0;
}
}
}
tmp = sum;
sum = 0;
for (int i = 1; s[i] != '\0'; i++) {
if (s[i] == '(')
sum++;
else {
sum--;
if (i == last) sum -= tmp;
if (sum < 0) {
cout << "-1" << endl;
return 0;
}
}
}
for (int i = 1; i <= ind; i++) {
if (i == ind) res[i] += tmp;
printf("%d\n", res[i]);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void no() {
puts("-1");
exit(0);
}
int main() {
string s;
cin >> s;
int idx = -1, cnt = 0, cpos = 0;
for (int i = 0; i < s.size(); ++i) {
if (s[i] == '#') {
s[i] = ')';
idx = i;
cpos++;
}
if (s[i] == '(')
cnt++;
else
cnt--;
}
if (cnt < 0 || (cnt > 0 && idx == -1)) no();
if (cnt > 0) {
string x;
for (int i = 0; i < cnt; ++i) x += ')';
s.insert(idx, x);
}
int b = 0;
for (int i = 0; i < s.size(); ++i) {
if (s[i] == '(')
b++;
else
b--;
if (b < 0) no();
}
assert(b == 0);
for (int i = 0; i < cpos; ++i) {
if (i != cpos - 1)
puts("1");
else
printf("%d\n", cnt + 1);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char s[100005];
int main() {
while (scanf("%s", s) != EOF) {
int x = 0, y = 0, z = 0;
int len = strlen(s);
int loc;
int ans = 0;
for (int i = 0; i < len; i++) {
if (s[i] == '(')
x++;
else if (s[i] == ')')
y++;
else {
z++;
loc = i;
}
}
int fg = 1;
if (x < y + z)
puts("-1");
else {
for (int i = 0; i < len; i++) {
if (s[i] == '(')
ans++;
else if (s[i] == '#' && i == loc)
ans -= (x - (y + z - 1));
else
ans--;
if (ans < 0) {
puts("-1");
fg = 0;
break;
}
}
if (fg != 0) {
for (int i = 1; i <= z - 1; i++) puts("1");
printf("%d\n", x - (y + z - 1));
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class A>
void read(vector<A>& v);
template <class A, size_t S>
void read(array<A, S>& a);
template <class T>
void read(T& x) {
cin >> x;
}
void read(double& d) {
string t;
read(t);
d = stod(t);
}
void read(long double& d) {
string t;
read(t);
d = stold(t);
}
template <class H, class... T>
void read(H& h, T&... t) {
read(h);
read(t...);
}
template <class A>
void read(vector<A>& x) {
for (auto& a : x) read(a);
}
template <class A, size_t S>
void read(array<A, S>& x) {
for (auto& a : x) read(a);
}
const int mod = 1e9 + 7;
long long int primeLimit = 1e5;
const double PI = acos(-1);
bool prime[100000];
string LongestPalindromicPrefix(string str) {
string temp = str + '?';
reverse(str.begin(), str.end());
temp += str;
long long int n = temp.length();
long long int lps[n];
fill(lps, lps + n, 0);
for (long long int i = 1; i < n; i++) {
long long int len = lps[i - 1];
while (len > 0 && temp[len] != temp[i]) {
len = lps[len - 1];
}
if (temp[i] == temp[len]) {
len++;
}
lps[i] = len;
}
return temp.substr(0, lps[n - 1]);
}
bool binarySearchFloat(float lower, float higher, float maxErrorAllowed,
long long int numberOfTimesWanttoRunCode) {
float l = lower, r = higher;
float eps = maxErrorAllowed;
long long int iteration_count = numberOfTimesWanttoRunCode;
for (long long int i = 0; i < iteration_count && l + eps < r; ++i) {
}
}
void primefinder() {
memset(prime, true, sizeof(prime));
prime[1] = false;
prime[0] = false;
for (long long int i = 2; i < primeLimit; i++) {
if (prime[i]) {
for (long long int j = i * i; j < primeLimit; j += i) {
prime[j] = false;
}
}
}
}
long long fast_pow(long long int x, long long int y) {
long long res = 1;
while (y > 0) {
if (y & 1) res = res * x;
y = y >> 1;
x = x * x;
}
return res;
}
long long Fast_pow(long long int x, long long int y, long long int p) {
long long res = 1;
x = x % p;
if (x == 0) return 0;
while (y > 0) {
if (y & 1) res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string str;
cin >> str;
long long int n = str.size();
long long int count1 = 0, count2 = 0;
for (long long int i = 0; i < n; i++) {
if (str[i] == '#' || str[i] == ')')
count1++;
else {
count2++;
}
if (count1 > count2) {
cout << "-1\n";
return 0;
}
}
long long int diff = count2 - count1;
bool check = false;
string res = "";
long long int index = -1;
long long int d = diff;
for (long long int i = n - 1; i >= 0; i--) {
if (str[i] == '#' && check == false) {
res += ')';
index = i;
while (diff) {
res += ')';
diff--;
}
check = true;
} else {
if (str[i] == '#' || str[i] == ')')
res += ')';
else {
res += '(';
}
}
}
reverse((res).begin(), (res).end());
count1 = 0, count2 = 0;
for (long long int i = 0; i < res.size(); i++) {
if (res[i] == ')')
count1++;
else {
count2++;
}
if (count1 > count2) {
cout << "-1\n";
return 0;
}
}
for (long long int i = 0; i < n; i++) {
if (str[i] == '#') {
if (index == i)
cout << d + 1 << "\n";
else {
cout << "1"
<< "\n";
}
}
}
}
|
#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 (cnt / hash > 0 && 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;
int main() {
int i, j, k, t, cnt, flag, cs = 1, LAST, last, total, len;
string A;
cin >> A;
len = A.size();
for (i = len - 1; i >= 0; i--) {
if (A[i] == '#') {
last = i;
break;
}
}
total = 0;
cnt = 0;
for (i = 0; i < len; i++) {
if (i == last) continue;
if (A[i] == '(') cnt++;
if (A[i] == '#') {
total++;
cnt--;
}
if (A[i] == ')') cnt--;
}
if (cnt < 1) {
printf("-1\n");
return 0;
}
LAST = cnt;
cnt = 0;
for (i = 0; i < len; i++) {
if (i == last)
cnt -= LAST;
else if (A[i] == ')' || A[i] == '#')
cnt--;
else
cnt++;
if (cnt < 0) break;
}
if (cnt < 0) {
printf("-1\n");
return 0;
}
for (i = 1; i <= total; i++) {
printf("1\n");
}
printf("%d\n", LAST);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char s[410000];
int n;
int totL[410000], totR[410000];
vector<int> sol;
int val[410000];
int main() {
scanf("%s", s + 1);
n = strlen(s + 1);
for (int i = 1; i <= n; i++) {
totL[i] = totL[i - 1] + (s[i] == '(');
totR[i] = totR[i - 1] + (s[i] == ')');
val[i] = (s[i] == ')');
}
if (totR[n] > totL[n]) {
printf("-1\n");
return 0;
}
int lastpos = -1;
for (int i = n; i >= 1; i--) {
if (s[i] == '#') {
lastpos = i;
break;
}
}
int tot = 0;
int sumL = totL[n];
int sumR = totR[n];
for (int i = 1; i <= n; i++) {
if (s[i] != '#') {
continue;
}
if (i == lastpos) {
sol.push_back(max(1, sumL - sumR - tot));
val[i] = max(1, sumL - sumR - tot);
if (totR[i] > totL[i]) {
printf("-1\n");
return 0;
}
continue;
}
sol.push_back(1);
tot++;
val[i] = 1;
}
for (int i = 1; i <= n; i++) {
totL[i] = totL[i - 1] + (s[i] == '(');
totR[i] = totR[i - 1] + val[i];
}
for (int i = 1; i <= n; i++)
if (totR[i] > totL[i]) {
printf("-1\n");
return 0;
}
for (int i = 0; i < sol.size(); i++) printf("%d\n", sol[i]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MaxN = 100005;
int n;
char S[MaxN];
int open;
stack<int> marks;
int answer[MaxN];
int main() {
cin >> S;
n = strlen(S);
for (int i = 0; i < n; i++)
if (S[i] == '(') {
open++;
} else {
if (open > 0) {
if (S[i] == ')') {
open--;
} else {
answer[i] = open;
if (open != 1) {
marks.push(i);
}
open = 0;
}
} else {
if (marks.size() == 0) {
cout << -1 << endl;
return 0;
}
answer[marks.top()]--;
if (S[i] == '#') answer[i] = 1;
if (answer[marks.top()] == 1) marks.pop();
}
}
if (open > 0) {
cout << -1 << endl;
return 0;
}
for (int i = 0; i < n; i++)
if (answer[i] != 0) {
cout << answer[i] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int i = 0, hash = 0, open = 0, complete = 0;
char s[100000], ch;
vector<int> ans;
while ((ch = getchar()) != '\n') {
s[i++] = ch;
if (s[i - 1] == '(') {
open++;
complete++;
} else if (s[i - 1] == ')') {
open--;
if (complete > 0)
complete -= 1;
else
complete = 0;
if (open < 0) {
printf("-1\n");
goto vr;
}
} else {
ans.push_back(1);
hash++;
open--;
complete = 0;
if (open < 0) {
printf("-1\n");
goto vr;
}
}
}
if (open < 0) {
printf("-1\n");
goto vr;
}
ans[ans.size() - 1] += open;
if (s[0] == ')' || (complete > 0)) {
printf("-1\n");
goto vr;
}
for (i = 0; i != ans.size(); i++) cout << ans[i] << "\n";
vr:;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, n, m;
char a[100005];
scanf("%s", a);
int len = strlen(a);
int l, r;
l = r = 0;
for (i = len - 1; i >= 0 && a[i] != '#'; i--) {
if (a[i] == ')') r++;
if (a[i] == '(') r--;
if (r < 0) {
cout << -1;
return 0;
}
}
int sum = 0;
for (i = 0; i < len; i++) {
if (a[i] == '(') l++;
if (a[i] == ')' || a[i] == '#') {
l--;
if (a[i] == '#') sum++;
if (l < 0) {
cout << -1;
return 0;
}
}
}
for (i = 1; i < sum; i++) cout << 1 << endl;
printf("%d\n", l + 1);
return 0;
}
|
#include <bits/stdc++.h>
int i, t, D[48], C[48];
char *p, *c, *last, *r, s[3000016];
int main() {
memcpy(r = p = s + 300000, "%d\n\0-1\n", 8);
for (c = gets(s); *c; C[*c++]++)
if (*c == '#') last = c, *--r = '\n', *--r = '1';
*last = '*';
D['('] = -1;
D[')'] = D['#'] = 1;
t = C['('] - C[')'] - C['#'] + 1;
D['*'] = t = t < 1 ? 1 : t;
for (c = s; *c; c++)
if ((i += D[*c]) > 0) r = p + 2;
printf(r + 2, t);
}
|
#include <bits/stdc++.h>
using namespace std;
void solveCase();
void preCompute();
void prepare() {
ios::sync_with_stdio(false);
cin.tie(0);
}
int main() {
prepare();
preCompute();
solveCase();
}
void solveCase() {
string br;
cin >> br;
int l = br.length();
int x;
stack<char> S;
vector<int> ans;
map<char, int> cnt;
cnt['('] = 0;
cnt[')'] = 0;
cnt['#'] = 0;
for (int i = 0; i < l; ++i) {
if (br[i] == ')' && !S.empty() && S.top() == '(') {
S.pop();
continue;
} else {
S.push(br[i]);
}
}
while (!S.empty() && S.top() != '#') {
cnt[S.top()]++;
S.pop();
}
while (!S.empty()) {
if (S.top() == '#') {
S.pop();
if (cnt['('] > 0) {
cout << "-1\n";
return;
}
while (!S.empty() && S.top() == '(') {
cnt[S.top()]++;
S.pop();
}
x = cnt['('] - cnt[')'];
if (x <= 0) {
ans.push_back(1);
cnt[')'] -= (cnt['('] - 1);
cnt['('] = 0;
} else {
ans.push_back(x);
cnt[')'] = 0;
cnt['('] = 0;
}
} else {
cnt[S.top()]++;
S.pop();
}
}
if (cnt['('] != 0 || cnt[')'] != 0) {
cout << "-1\n";
return;
}
for (int i = ans.size() - 1; i >= 0; --i) {
cout << ans[i] << "\n";
}
return;
}
void preCompute() {}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
char s[100010];
scanf("%s", s);
int n = strlen(s);
int a[100010];
int e = n;
for (int i = n - 1; i >= 0; i--)
if (s[i] == '#') {
e = i;
break;
}
vector<int> ans;
for (int i = 0; i < n; i++) {
if (s[i] == '#' && e != i) s[i] = ')', ans.push_back(1);
}
int sum = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '(')
sum++;
else if (s[i] == ')')
sum--;
}
if (sum < 1) {
puts("-1");
return 0;
}
ans.push_back(sum);
int cur = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '(')
cur++;
else if (s[i] == ')')
cur--;
else
cur -= ans.back();
if (cur < 0) {
puts("-1");
return 0;
}
}
for (auto p : ans) cout << p << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char str[100005];
int main() {
int i, j, k, n;
scanf("%s", str + 1);
;
n = strlen(str + 1);
int stk = 0, has = 0, flg = 0, a = 0, b = 0;
k = 0;
for (i = 1; i < n + 1; i++) {
if (str[i] == '#') k++;
}
for (i = 1; i < n + 1; i++) {
if (str[i] == '(') {
stk++;
a++;
}
if (str[i] == ')') {
stk--;
b++;
if (stk < 0) {
flg = 1;
break;
}
}
if (str[i] == '#') {
stk--;
has++;
a = 0;
b = 0;
if (stk < 0) {
flg = 1;
break;
}
}
}
if (stk < 0) flg = 1;
if (a > b) {
flg = 1;
}
if (flg) {
printf("-1\n");
} else {
int p = has, o = 1 + stk;
a = 0;
b = 0;
stk = 0;
for (i = 1; i < n + 1; i++) {
if (str[i] == '(') {
stk++;
a++;
}
if (str[i] == ')') {
stk--;
b++;
if (stk < 0) {
flg = 1;
break;
}
}
if (str[i] == '#') {
if (p > 1) {
stk--;
p--;
b++;
} else {
stk -= o;
b += o;
}
if (stk < 0) {
flg = 1;
break;
}
}
}
if (a != b) {
flg = 1;
}
if (flg == 1) {
printf("-1\n");
return 0;
}
for (i = 1; i < has; i++) {
printf("1\n");
}
printf("%d\n", o);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int c, con, diez, aux, rez;
string s;
int main() {
cin >> s;
for (int i = 0; i < s.size(); ++i) {
if (s[i] == '(') c++;
if (s[i] == ')') c--;
if (s[i] == '#') diez++;
}
aux = diez;
if (c < diez)
cout << -1;
else {
for (int i = 0; i < s.size(); ++i) {
if (s[i] == '(') con++;
if (s[i] == ')') {
con--;
if (con < 0) {
rez = -1;
break;
}
}
if (s[i] == '#') {
if (aux != 1) {
if (con > 0) {
con--;
aux--;
} else {
rez = -1;
break;
}
} else {
if (con >= c - diez + 1) {
con -= (c - diez + 1);
aux--;
} else {
rez = -1;
break;
}
}
}
}
if (rez == -1)
cout << -1;
else {
for (int i = 1; i < diez; ++i) cout << 1 << '\n';
cout << c - diez + 1;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
char a[100005];
int ans[100005];
int main() {
scanf("%s", a);
n = strlen(a);
int cnt = 0, s_cnt = 0, last = -1;
for (int i = 0; i < n; ++i) {
if (a[i] == '(')
cnt++;
else
cnt--;
if (cnt < 0) {
printf("-1");
return 0;
}
if (a[i] == '#') {
ans[i] = 1;
last = i;
}
}
if (last != -1) ans[last] += cnt;
cnt = 0;
for (int i = 0; i < n; ++i) {
if (a[i] == '(')
cnt++;
else if (a[i] == '#')
cnt -= ans[i];
else
cnt--;
if (cnt < 0) {
printf("-1");
return 0;
}
}
if (cnt != 0) {
printf("-1");
return 0;
}
for (int i = 0; i < n; ++i) {
if (a[i] == '#') printf("%d\n", ans[i]);
}
}
|
#include <bits/stdc++.h>
using namespace std;
string s;
vector<long long int> answervec, anotherVector;
long long int ayush, mishra, google;
long long int storage[100000];
int main() {
long long int a, b;
cin >> s;
long long int res = 0, balans = 0;
for (long long int iter = 0; iter < s.length(); iter++) {
storage[iter] = 0;
if (s[iter] == '(') {
ayush++;
storage[iter] = -1;
}
if (s[iter] == ')') {
mishra++;
storage[iter] = 1;
}
if (s[iter] == '#') google++;
}
if (ayush - mishra - google < 0) {
cout << "-1";
return 0;
}
long long int resi = ayush - mishra - google + 1;
bool bil = false;
long long int bal = 0;
for (long long int iter = s.length() - 1; iter >= 0; iter--) {
if (storage[iter] == 0) {
if (!bil) {
bal += resi;
answervec.push_back(resi);
bil = true;
} else {
bal++;
answervec.push_back(1);
}
continue;
}
bal += storage[iter];
if (bal < 0) {
cout << "-1";
return 0;
}
}
for (long long int iter = answervec.size() - 1; iter >= 0; iter--) {
cout << answervec[iter] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long MX = 2e5 + 9;
const long double pi = acos(-1);
const long long mod = 1e9 + 7;
bool cmp(int a, int b) { return a > b; }
long long po(long long a, long long b) {
if (b == 0) {
return 1;
}
long long x = po(a, b / 2);
x *= x % mod;
if (b % 2) {
x *= a % mod;
}
return x % mod;
}
int gcd(int a, int b) { return (b == 0 ? a : gcd(b, a % b)); }
int dx[] = {0, 0, -1, 1};
int dy[] = {1, -1, 0, 0};
vector<int> ans;
int main() {
string s;
cin >> s;
int c = 0;
int d = 0;
int l = s.length();
for (int i = 0; i < l;) {
if (d < 0) {
cout << -1;
return 0;
}
if (s[i] == '(') {
d++;
i++;
} else if (s[i] == ')') {
d--;
i++;
} else {
if (d <= 0) {
cout << -1;
return 0;
}
d--;
c++;
i++;
}
}
if (d < 0) {
cout << -1;
return 0;
}
int p = 0;
for (int i = l - 1; i >= 0; i--) {
if (p < 0) {
cout << -1;
return 0;
}
if (s[i] == '#') {
break;
}
if (s[i] == '(') {
p--;
} else {
p++;
}
}
for (int i = 0; i < c - 1; i++) {
cout << 1 << " ";
}
cout << d + 1;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char s[100010];
int sum[100010], maxs[100010];
int main() {
scanf("%s", s);
int n = strlen(s);
int c = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '(') {
c--;
} else {
c++;
}
if (c > 0) {
puts("-1");
return 0;
}
sum[i] = c;
}
for (int i = n - 1; i >= 0; i--) {
if (i == n - 1)
maxs[i] = sum[i];
else
maxs[i] = max(sum[i], maxs[i + 1]);
}
c = 0;
vector<int> ans;
for (int i = 0; i < n; i++) {
if (s[i] == '#') {
ans.push_back(-(c + maxs[i]) + 1);
c += -(c + maxs[i]);
}
}
if (c + maxs[n - 1] != 0) {
puts("-1");
} else {
for (int i = 0; i < ans.size(); i++) printf("%d\n", ans[i]);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[123456];
int aa[123456];
int ans[123456];
int main() {
string s;
cin >> s;
int b, c;
b = c = 0;
int t = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '(')
b++;
else if (s[i] == ')')
b--;
else {
b--;
ans[++t] = 1;
}
if (b < 0) {
cout << -1;
return 0;
}
}
ans[t] = b + 1;
int k = 0;
b = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '(')
b++;
else if (s[i] == ')')
b--;
else {
b -= ans[++k];
}
if (b < 0) {
cout << -1;
return 0;
}
}
for (int i = 1; i <= t; i++) {
cout << ans[i] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool secdes(const pair<long long int, long long int>& a,
const pair<long long int, long long int>& b) {
if (a.second == b.second) {
return a.first > b.first;
} else {
return a.second > b.second;
}
}
bool sir(const pair<long long int, long long int>& a,
const pair<long long int, long long int>& b) {
if (a.first == b.first) {
return a.second > b.second;
} else {
return a.first > b.first;
}
}
bool bysec(const pair<long long int, long long int>& a,
const pair<long long int, long long int>& b) {
if (a.second == b.second) {
return a.first < b.first;
} else {
return a.second < b.second;
}
}
const long long int no = 3e6 + 5;
const long long int modulo = 1e9 + 7;
const long long int inf = 1e18;
const long long int N = 2001;
long long int ar[no + 10], br[no + 10], mat[N][N];
long long int dx[] = {-1, 0, 1, 0};
long long int dy[] = {0, 1, 0, -1};
char dc[] = {'L', 'D', 'R', 'U'};
long long int mul(long long int x, long long int y, long long int mod) {
return ((x % mod) * (y % mod)) % mod;
}
long long int powwmod(long long int x, long long int y, long long int mod) {
long long int res = 1;
while (y) {
if (y & 1) {
y--;
res = mul(res, x, mod);
res %= mod;
} else {
y /= 2;
x = mul(x, x, mod);
x %= mod;
}
}
return res % mod;
}
long long int poww(long long int x, long long int y) {
long long int res = 1;
while (y) {
if (y % 2) {
y--;
res = res * x;
} else {
y /= 2;
x = x * x;
}
}
return res;
}
long long int div(long long int x, long long int y, long long int mod) {
return (x * powwmod(y, mod - 2, modulo)) % mod;
}
long long int add(long long int x, long long int y, long long int mod) {
return (x % mod + y % mod) % mod;
}
bool comp(long long int x, long long int y) { return (x < y); }
long long int gcd(long long int x, long long int y) {
if (y == 0)
return x;
else
return gcd(y, x % y);
}
long long int lcm(long long int x, long long int y) {
return (x * y) / gcd(x, y);
}
vector<long long int> adj[no];
long long int used[no], s[no], height[no];
long long int ans1 = 0, ans2 = 0;
void solve() {
long long int n = 0, m = 0, a = 0, b = 0, c = 0, x = 0, y = 0, z = 0, w = 0,
k = 0;
string s;
cin >> s;
n = s.size();
for (long long int i = 0; i < n; i++) {
if (s[i] == '(')
x++;
else if (s[i] == ')')
y++;
else
z++;
}
if (y >= x) {
cout << -1;
return;
}
k = z;
for (long long int i = 0; i < s.size(); i++) {
if (z <= 0) break;
if (s[i] == '#') {
if (z == 1) {
string one = "", two = "";
one = s.substr((long long int)0, i);
two = s.substr(i + 1);
if (x > y) {
for (long long int i = 0; i < x - y; i++) one += ')';
s = one + two;
a = x - y;
} else {
cout << -1;
return;
}
z--;
} else {
if (x <= y) {
cout << -1;
return;
}
s[i] = ')';
z--;
y++;
}
}
}
x = 0;
y = 0;
for (long long int i = 0; i < s.size(); i++) {
if (s[i] == '(')
x++;
else
y++;
if (x < y) {
cout << -1;
return;
}
}
for (long long int i = 0; i < k - 1; i++) {
cout << 1 << "\n";
}
cout << a << "\n";
}
inline void runn() {
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
long long int t = 1;
while (t--) {
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
int n, m, a[N], b[N];
char str[N];
void work() {
int i, x, y;
scanf("%s", str + 1);
n = strlen(str + 1);
y = x = 0;
for (i = 1; i <= n; ++i) {
if (str[i] == '(') ++y;
if (str[i] == ')') --y;
if (str[i] == '#') {
a[++m] = 1;
x = i;
--y;
}
}
if (y < 0) {
puts("-1");
} else {
if (y && !m) {
puts("-1");
} else {
a[m] += y;
y = x = 0;
for (i = 1; i <= n; ++i) {
if (str[i] == '(') ++y;
if (str[i] == ')') --y;
if (str[i] == '#') {
y -= a[++x];
}
if (y < 0) {
puts("-1");
return;
}
}
for (i = 1; i <= m; ++i) printf("%d\n", a[i]);
}
}
}
int main() {
work();
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 c[n + 1], k, fin;
c[0] = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '(')
c[i + 1] = c[i] + 1;
else if (s[i] == ')')
c[i + 1] = c[i] - 1;
else if (s[i] == '#')
c[i + 1] = c[i] - 1, k = i;
if (c[i + 1] < 0) {
cout << "-1\n";
return 0;
}
}
fin = c[n];
for (int i = k; i < n; i++) {
c[i + 1] -= c[n];
if (c[i + 1] < 0) {
cout << "-1\n";
return 0;
}
}
for (int i = 0; i < n; i++) {
if (s[i] == '#') {
if (i < k)
cout << 1 << endl;
else
cout << fin + 1 << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
char a[100005];
set<int> xx;
int main() {
ios::sync_with_stdio(0);
cin >> a;
n = strlen(a);
stack<int> x;
for (int i = 0; i < n; i++) {
if (a[i] == '(')
x.push(i);
else if (a[i] == ')') {
if (x.empty()) {
cout << "-1\n";
return 0;
} else
a[i] = a[x.top()] = 0, x.pop();
} else {
xx.insert(i);
}
}
vector<int> ans;
xx.insert(-1);
set<int>::iterator it;
for (it = --xx.end();; it--) {
set<int>::iterator it2 = it;
it2--;
int cnt = 0;
while (!x.empty() && x.top() > *it2) {
if (x.top() > *it) {
cout << "-1\n";
return 0;
}
cnt++, x.pop();
}
if (cnt == 0) {
if (x.empty()) {
cout << "-1\n";
return 0;
}
x.pop();
cnt = 1;
}
ans.push_back(cnt);
if ((*it2) == -1) break;
}
reverse(ans.begin(), ans.end());
for (int i = 0; i < (int)ans.size(); i++) {
if (ans[i] == 0) {
cout << "-1\n";
return 0;
}
}
for (int i = 0; i < (int)ans.size(); i++) {
cout << ans[i] << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
string s;
cin >> s;
vector<int> sh_pos;
for (int(i) = 0; (i) < (s.size()); (i)++) {
if (s[i] == '#') {
sh_pos.push_back(i);
}
}
int last_sh_pos = sh_pos.back();
int to_close = 0;
vector<int> ans;
for (int i = (0); i < (int)(last_sh_pos + 1); i++) {
if (s[i] == '(') {
++to_close;
} else if (s[i] == ')') {
--to_close;
} else {
--to_close;
ans.push_back(1);
}
if (to_close < 0) {
{
cout << "-1" << endl;
return;
};
}
}
int left_br = 0, right_br = 0;
for (int i = (last_sh_pos); i < (int)(s.size()); i++)
if (s[i] == '(') left_br++;
for (int i = (last_sh_pos); i < (int)(s.size()); i++)
if (s[i] == ')') right_br++;
if (left_br > right_br || to_close < right_br - left_br) {
{
cout << -1 << endl;
return;
};
}
ans.back() += (to_close - (right_br - left_br));
to_close -= (to_close - (right_br - left_br));
for (int i = (last_sh_pos + 1); i < (int)(s.size()); i++) {
if (s[i] == '(') {
++to_close;
} else if (s[i] == ')') {
--to_close;
}
if (to_close < 0) {
{
cout << "-1" << endl;
return;
};
}
}
if (to_close != 0) {
{
cout << "-1" << endl;
return;
};
}
for (auto i : ans) cout << i << "\n";
}
int main() {
ios_base::sync_with_stdio(0);
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, k;
string s;
cin >> s;
vector<int> v;
int len, op, cls;
len = s.length();
int arr[len];
bool done[len];
fill(done, done + len, false);
cls = 0;
op = 0;
for (i = 0; i < len; i++) {
if (s[i] == '(') {
cls++;
arr[i] = 1;
} else if (s[i] == ')') {
arr[i] = 1;
op++;
} else {
arr[i] = 0;
v.push_back(i);
done[i] = true;
s[i] = ')';
}
}
cls = cls - op;
cls = max(0, cls);
for (i = 0; i < v.size() - 1; i++) {
if (cls == 0) {
cout << -1;
return 0;
} else {
arr[v[i]] = 1;
}
cls--;
cls = max(cls, 0);
}
if (cls == 0) {
cout << -1;
return 0;
}
arr[v.back()] = max(0, cls);
cls = 0;
op = 0;
for (i = 0; i < len; i++) {
if (s[i] == '(') {
cls += arr[i];
} else {
op += arr[i];
}
if (op > cls) {
cout << -1;
return 0;
}
}
if (op != cls) {
cout << -1;
return 0;
}
for (i = 0; i < len; i++) {
if (done[i]) {
cout << arr[i] << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char s[100010];
int main() {
scanf("%s", s);
int pos = -1, tot = 0;
for (int i = 0; s[i]; i++) {
if (s[i] == '#') {
pos = i;
} else if (s[i] == '(') {
tot++;
} else {
tot--;
}
}
int nums = 0;
for (int i = 0; s[i]; i++) {
if (s[i] == '#' && i != pos) {
nums++;
s[i] = ')';
tot--;
}
}
if (tot <= 0) {
puts("-1");
return 0;
}
int sum = 0;
for (int i = 0; s[i]; i++) {
if (s[i] == '(') {
sum++;
} else if (s[i] == ')') {
sum--;
} else {
sum -= tot;
}
if (sum < 0) {
puts("-1");
return 0;
}
}
for (int i = 0; i < nums; i++) {
puts("1");
}
printf("%d\n", tot);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> res;
int main() {
string str;
cin >> str;
int cnt = 0;
for (int i = 0; i < str.size(); i++)
if (str[i] == '(') cnt++;
int tmp = 0, cnt2 = 0, pfin = 0;
for (int i = 0; i < str.size(); i++) {
if (str[i] == '(') tmp++;
if (str[i] == ')') tmp--;
if (str[i] == '#') {
pfin = i;
str[i] = ')';
tmp--;
cnt2++;
}
}
int fin = tmp > 0 ? tmp : 0;
tmp = 0;
for (int i = 0; i < str.size(); i++) {
if (tmp < 0) break;
if (str[i] == '(') tmp++;
if (str[i] == ')') tmp--;
if (pfin == i) tmp -= fin;
}
if (tmp != 0)
puts("-1");
else {
for (int i = 0; i < cnt2 - 1; i++) puts("1");
cout << fin + 1 << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, final, tot = 0;
stack<int> s;
string a;
cin >> a;
n = a.size();
for (int i = 0; i < n; i++) {
if (a[i] == '#') {
final = i;
tot++;
}
}
int c = 0, f = 0;
while (c < n) {
if (a[c] == '(') {
s.push(c);
} else if (s.empty()) {
if (a[c] == '#' || a[c] == ')') {
f = 1;
break;
}
} else if (!s.empty()) {
s.pop();
}
c++;
}
if (f == 1) {
printf("-1\n");
} else {
if (!s.empty() && s.top() > final)
printf("-1\n");
else {
for (int i = 0; i < tot - 1; i++) {
printf("1\n");
}
int siz = s.size();
printf("%d", 1 + s.size());
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
class C_ {};
template <typename T>
C_& operator<<(C_& __m, const T& __s) {
if (!1) cerr << "\E[91m" << __s << "\E[0m";
return __m;
}
C_ merr;
struct __s {
__s() {
if (1) {
ios_base::Init i;
cin.sync_with_stdio(0);
cin.tie(0);
}
}
~__s() {
merr << "Execution time: " << (double)clock() / CLOCKS_PER_SEC << " s.\n";
}
} __S;
int main() {
string s;
int l = 0, r = 0;
int cnt = 0;
cin >> s;
for (int i = 0; i < (int)s.size(); i++) {
if (r > l) {
cout << "-1" << '\n';
return 0;
}
if (s[i] == '(') {
l++;
} else if (s[i] == ')') {
r++;
} else {
r++;
cnt++;
}
if (r > l) {
cout << "-1" << '\n';
return 0;
}
}
int more = l - r;
if (more) {
int i;
for (i = (int)s.size() - 1; i >= 0; i--) {
if (s[i] == '(') {
l--;
} else if (s[i] == ')') {
r--;
} else {
r += more;
break;
}
}
if (i < 0) {
cout << "-1" << '\n';
return 0;
}
i++;
for (; i < (int)s.size(); i++) {
if (r > l) {
cout << "-1" << '\n';
return 0;
}
if (s[i] == '(') {
l++;
} else if (s[i] == ')') {
r++;
}
if (r > l) {
cout << "-1" << '\n';
return 0;
}
}
}
for (int i = 0; i < cnt - 1; i++) {
cout << "1" << '\n';
}
cout << more + 1 << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char str[100006];
int main() {
int i, o, c, h;
int oo, cc;
while (scanf("%s", str) != EOF) {
o = c = h = 0;
for (i = 0; str[i]; ++i) {
if (str[i] == '(')
++o;
else if (str[i] == ')')
++c;
else
++h;
if (c + h > o) break;
}
if (c + h > o || str[i - 1] == '(') {
puts("-1");
continue;
}
oo = cc = 0;
for (--i; i >= 0; --i) {
if (str[i] == '#') break;
if (str[i] == '(')
++oo;
else
++cc;
}
if (oo > cc) {
puts("-1");
continue;
}
for (i = 1; i < h; ++i) puts("1");
if (h) printf("%d\n", o - c - (h - 1));
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int A[100005];
bool check(string s) {
stack<char> S;
while (!S.empty()) S.pop();
for (int i = 0; i < s.size(); ++i) {
if (s[i] == '(')
S.push(s[i]);
else {
if (S.empty() == true) return false;
S.pop();
}
}
if (S.empty() == true) return true;
return false;
}
int main(int argc, char const *argv[]) {
cin.sync_with_stdio(0);
cin.tie(0);
string a;
cin >> a;
int last;
int cnt = 0;
for (int i = 0; i < a.size(); i++)
if (a[i] == '(')
cnt++;
else if (a[i] == ')' || a[i] == '#') {
cnt--;
if (cnt < 0) {
cout << "-1\n";
return 0;
}
if (a[i] == '#') last = i;
}
string ans;
ans.clear();
for (int i = 0; i < a.size(); ++i)
if (a[i] == '#') {
if (i == last) {
for (int i = 0; i < cnt + 1; ++i) {
ans += ')';
}
} else
ans += ')';
} else
ans += a[i];
if (check(ans) == false) {
cout << "-1\n";
return 0;
}
for (int i = 0; i < a.size(); ++i)
if (a[i] == '#') {
if (i == last)
cout << 1 + cnt << "\n";
else
cout << "1\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string s;
int last = 0, roznica = 0;
vector<int> V;
bool czy = true;
int main() {
ios_base::sync_with_stdio(0);
cin >> s;
for (int i = 0; i < s.size(); i++)
if (s[i] == '#') last = i;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '(')
roznica++;
else
roznica--;
}
if (roznica < 0) czy = false;
int stan = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '(') stan += 1;
if (s[i] == ')') stan -= 1;
if (s[i] == '#' && i != last) {
stan -= 1;
V.push_back(1);
}
if (s[i] == '#' && i == last) {
V.push_back(roznica + 1);
stan -= roznica + 1;
}
if (stan < 0) czy = false;
}
if (czy == false) {
cout << "-1";
return 0;
}
for (int i = 0; i < V.size(); i++) cout << V[i] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
string s;
cin >> s;
int l = 0;
int r = 0;
int h = 0;
int last_h = 0;
vector<int> ans;
int ok = 1;
for (int i = 0; i < s.length(); i++) {
if (s[i] == '(')
l++;
else if (s[i] == ')')
r++;
else {
h++;
last_h = i;
}
if (l < r + h) ok = 0;
}
for (int i = 0; i < last_h; i++) {
if (s[i] == '#') {
ans.push_back(1);
s[i] = ')';
r++;
}
}
ans.push_back(l - r);
l = 0;
r = 0;
for (int i = 0; i < s.length(); i++) {
if (s[i] == '(')
l++;
else if (s[i] == ')')
r++;
else
r += ans[ans.size() - 1];
if (l < r) ok = 0;
}
if (l != r) ok = 0;
if (ok)
for (int i = 0; i < ans.size(); i++) cout << ans[i] << endl;
else
cout << -1 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
string s;
int cal() {
int l = 0;
int r = 0;
int h = 0;
int c;
for (int i = 0; i < n; i++) {
if (s[i] == '(') l++;
if (s[i] == ')') r++;
if (s[i] == '#') h++;
}
if (r >= l) return 0;
if (l < r + h) return 0;
c = l - r;
l = 0;
r = 0;
int th = 0;
int cc = c;
for (int i = 0; i < n; i++) {
if (s[i] == '(') l++;
if (s[i] == ')') r++;
if (s[i] == '#') {
th++;
if (th == h) {
r = r + cc;
} else {
r++;
cc--;
}
}
if (r > l) return 0;
}
if (r != l) return 0;
for (int i = 1; i <= h; i++) {
if (i == h) {
cout << c << endl;
} else {
cout << 1 << endl;
c--;
}
}
return 1;
}
int main() {
cin >> s;
n = s.length();
if (cal() == 0) cout << -1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int last, open = 0, close = 0, k, re = 0;
string s;
cin >> s;
last = s.rfind("#");
vector<char> v;
stack<char> S;
for (int i = 0; i < s.size(); i++)
if (s[i] == '(')
open++;
else if (s[i] == ')')
close++;
else
re++;
k = open - close;
if (k <= 0) {
cout << -1;
return 0;
}
for (int i = 0; i < s.size(); i++) {
if (s[i] == '(' || s[i] == ')') v.push_back(s[i]);
if (s[i] == '#' && i != last) {
v.push_back(')');
k--;
} else if (s[i] == '#' && i == last) {
for (int i = 0; i < k; i++) {
v.push_back(')');
}
}
}
for (int i = 0; i < v.size(); i++) {
if (v[i] == '(')
S.push('(');
else {
if (!S.empty())
S.pop();
else {
cout << -1;
return 0;
}
}
}
if (S.size() != 0) {
cout << -1;
return 0;
}
int n = open - close;
for (int i = 0; i < re - 1; i++) {
cout << 1 << endl;
n--;
}
cout << n << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
int cl = 0, ha = 0, op = 0;
string s, t;
cin >> s;
for (int i = 0; i < s.length(); i++) {
if (s[i] == '(') {
op++;
}
if (s[i] == ')') {
cl++;
}
if (s[i] == '#') {
ha++;
}
}
int req = op - cl;
int temp2 = req;
int temp = ha;
if (op == cl || op == 0 || cl > op || ha > op || ha > req) {
cout << -1 << endl;
return 0;
}
for (int i = 0; i < s.length(); i++) {
if (s[i] == '#' && ha > 1) {
t.push_back(')');
ha--;
temp2--;
} else if (s[i] == '#' && ha == 1) {
for (int j = 1; j <= temp2; j++) {
t.push_back(')');
}
ha = 0;
} else {
t.push_back(s[i]);
}
}
int x = 0;
for (int i = 0; i < t.length(); i++) {
if (t[i] == '(') {
x++;
}
if (t[i] == ')') {
x--;
}
if (x < 0) {
cout << -1 << endl;
return 0;
}
}
if (x == 0) {
for (int i = 1; i < temp; i++) {
cout << 1 << endl;
req--;
}
cout << req << endl;
} else {
cout << -1 << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<pair<char, long long int>> v;
set<pair<long long int, long long int>> pp;
vector<pair<long long int, pair<long long int, long long int>>> vvv;
map<long long int, long long int> mp;
long long int freq[100005] = {0};
priority_queue<long long int> pq;
void empty(priority_queue<long long int> pp) {
while (!pp.empty()) {
pp.pop();
}
}
void show(priority_queue<long long int> pp) {
priority_queue<long long int> ff = pp;
while (!ff.empty()) {
cout << ff.top() << " yyy\n";
ff.pop();
}
}
int main() {
long long int n, i, j, k, l, p, q;
string s;
cin >> s;
long long int open = 0, close = 0, c = 0, copen = 0;
n = (long long int)s.length();
for (i = 0; i < n; i++) {
if (s[i] == '(')
open++, copen++;
else if (s[i] == ')') {
close++;
if (copen > 0) copen--;
} else {
c++, copen = 0;
v.push_back(make_pair(s[i], i));
}
if (c + close > open) {
cout << "-1";
return 0;
}
}
j = 0;
k = (long long int)v.size();
long long int cl2 = close;
for (i = 0; i < c - 1; i++) {
s[v[j].second] = ')';
j++;
close++;
}
string ps = "";
for (i = 0; i < open - close; i++) ps = ps + ')';
s.insert(v[k - 1].second, ps);
s.erase(s.begin() + v[k - 1].second + (long long int)ps.size());
long long int op1 = 0, cl1 = 0;
for (i = 0; i < (long long int)s.size(); i++) {
if (s[i] == '(') op1++;
if (s[i] == ')') cl1++;
if (cl1 > op1) {
cout << "-1";
return 0;
}
}
for (i = 0; i < c - 1; i++) {
cout << "1\n";
cl2++;
}
cout << open - cl2;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
vector<int> sol;
int pos;
bool found_hashtag = false;
for (int i = s.size() - 1; i >= 0; --i) {
if (s[i] != '#') {
continue;
}
if (!found_hashtag) {
found_hashtag = true;
sol.push_back(0);
pos = i;
} else {
s[i] = ')';
sol.push_back(1);
}
}
int count = 0;
for (int i = pos + 1; i < s.size(); ++i) {
if (s[i] == '(') {
++count;
} else {
if (count > 0) {
--count;
}
}
}
if (count > 0) {
cout << -1;
return 0;
}
count = 0;
for (int i = 0; i < s.size(); ++i) {
if (s[i] == '(') {
++count;
} else if (s[i] == ')') {
if (count == 0) {
cout << -1;
return 0;
} else {
--count;
}
}
}
sol[0] = count;
if (sol[0] < 1) {
cout << -1;
return 0;
}
count = 0;
for (int i = 0; i < s.size(); ++i) {
if (s[i] == '(') {
++count;
} else if (s[i] == ')') {
--count;
} else if (s[i] == '#') {
count -= sol[0];
if (count < 0) {
cout << -1;
return 0;
}
}
}
if (count != 0) {
cout << -1;
} else {
for (int i = sol.size() - 1; i >= 0; --i) {
cout << sol[i] << "\n";
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void read(vector<long long> &v) {
for (int i = 0; i < v.size(); i++) cin >> v[i];
}
void print(vector<long long> v) {
for (int i = 0; i < v.size(); i++) cout << v[i] << " ";
}
long long n, m, a, b, temp;
string str;
set<long long> s;
vector<long long> v;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
string s;
cin >> s;
n = s.length();
long long count = 0;
long long countr = 0;
vector<long long> ans;
int lastindex = -1;
int e = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '(')
count++;
else if (s[i] == ')')
countr++;
else {
lastindex = i;
e++;
}
}
if (countr + e > count) {
cout << -1;
return 0;
}
if (lastindex == -1 && countr != count) {
cout << -1;
return 0;
}
int need = count - countr;
for (int i = 0; i < n; i++) {
if (s[i] == '(')
a++;
else if (s[i] == ')')
b++;
else {
if (i != lastindex) {
b++;
temp++;
ans.push_back(1);
} else {
b += (need - temp);
if (need - temp < 1) {
cout << -1;
return 0;
}
ans.push_back(need - temp);
}
}
if (b > a) {
cout << -1;
return 0;
}
}
for (int i = 0; i < ans.size(); i++) {
cout << ans[i];
cout << '\n';
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int l = s.length();
vector<int> ans;
int crt = 0, cnt = 0;
for (int i = 0; i < l; i++) {
if (s[i] == '(') {
crt++;
} else if (s[i] == ')') {
crt--;
} else {
cnt++;
}
}
if (crt < cnt) {
cout << -1;
return 0;
}
while (cnt > 1) {
ans.push_back(1);
cnt--;
crt--;
}
ans.push_back(crt);
crt = 0;
int j = 0;
for (int i = 0; i < l; i++) {
if (crt < 0) {
cout << -1;
return 0;
}
if (s[i] == '(') {
crt++;
} else if (s[i] == ')') {
crt--;
} else {
crt -= ans[j];
j++;
}
}
if (crt) {
cout << -1;
} else {
for (int i : ans) {
cout << i << '\n';
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 77;
int main() {
string s;
cin >> s;
int lasth = -1;
int suma = 0;
bool dasie = true;
int ile = 0;
for (int i = 0; i < (int)s.size(); i++) {
if (s[i] == '#') lasth = i;
if (s[i] == '(')
suma++;
else
suma--;
if (suma < 0) dasie = false;
}
int sumka = 0;
int mini = 0;
for (int i = lasth + 1; i < s.size(); i++) {
if (s[i] == '(')
sumka++;
else
sumka--;
mini = min(mini, sumka);
}
int sumdo = suma - sumka;
int ilex = suma + 1;
if (-mini > sumdo + 1 - ilex or sumka > 0 or sumdo + 1 - suma - 1 < 0) {
dasie = false;
}
if (dasie) {
for (int i = 0; i < (int)s.size(); i++) {
if (s[i] == '#' && i != lasth) {
cout << 1 << " ";
}
}
cout << suma + 1 << endl;
} else {
cout << -1 << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
int lcm(int a, int b) { return a * (b / gcd(a, b)); }
int cx[] = {-1, 1, 0, 0, 1, 1, -1, -1};
int cy[] = {0, 0, -1, 1, -1, 1, -1, 1};
string s;
vector<long long> v;
long long l, r, rempl;
long long sum[100010];
int main(void) {
ios::sync_with_stdio(0);
cin >> s;
l = r = rempl = 0;
for (int i = 0; i < (int)s.length(); i++) {
sum[i] = 0;
if (s[i] == '(') {
l++;
sum[i] = -1;
}
if (s[i] == ')') {
r++;
sum[i] = 1;
}
if (s[i] == '#') rempl++;
}
if (l - r - rempl < 0) {
cout << "-1\n";
return 0;
}
long long dif = l - r - rempl + 1;
bool is = false;
long long sum_t = 0;
for (int i = (int)s.length() - 1; i >= 0; --i) {
if (sum[i] == 0) {
if (!is) {
sum_t += dif;
v.push_back(dif);
is = true;
} else {
sum_t++;
v.push_back(1);
}
continue;
}
sum_t += sum[i];
if (sum_t < 0) {
cout << "-1\n";
return 0;
}
}
for (int i = (int)v.size() - 1; i >= 0; --i) {
cout << v[i] << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
std::ios::sync_with_stdio(false);
string A;
cin >> A;
int L = 0, R = 0, Hash = 0;
int n = A.size();
for (int i = 0; i < n; i++) {
if (A[i] == '(')
L++;
else if (A[i] == ')')
R++;
else
Hash++;
}
int diff = L - R;
if (diff <= 0)
cout << "-1";
else {
vector<int> ans;
int flag = 0;
int l = 0, r = 0;
for (int i = 0; i < n; i++) {
if (A[i] == '(')
l++;
else if (A[i] == ')')
r++;
else {
if (Hash != 1) {
ans.push_back(1);
diff--;
Hash--;
r++;
} else if (Hash == 1) {
ans.push_back(diff);
r += diff;
}
}
if (r > l) {
flag = 1;
break;
}
}
if (flag)
cout << "-1";
else {
for (int i = 0; i < ans.size(); i++) cout << ans[i] << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> pos;
map<int, int> save;
int main() {
string str;
bool flag;
int fi, ex;
while (cin >> str) {
save.clear();
pos.clear();
fi = ex = 0;
flag = true;
for (int i = 0; i < str.size() && flag; i++) {
if (str[i] == '(')
fi++;
else if (str[i] == '#') {
ex = 0;
pos.push_back(i);
fi--;
if (fi < 0) flag = false;
} else {
fi--;
if (fi < 0) flag = false;
}
}
if (fi >= 0) {
save[pos[pos.size() - 1]] = fi;
fi = 0;
for (int i = str.size() - 1; i >= 0 && str[i] != '#'; i--) {
if (str[i] == '(') {
fi--;
if (fi < 0) {
flag = false;
break;
}
} else
fi++;
}
}
if (flag) {
for (int i = 0; i < str.size(); i++) {
if (str[i] == '#') {
if (save[i])
cout << save[i] + 1 << endl;
else
cout << 1 << endl;
}
}
} else
printf("-1\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void) {
string str;
cin >> str;
int64_t l = 0, r = 0;
vector<int64_t> q;
int id = -1;
for (int i = 0; i < str.size(); ++i) {
if (str[i] == '(') ++l;
if (str[i] == ')') ++r;
if (r > l) {
cout << -1;
return 0;
}
if (str[i] == '#') {
q.push_back(1);
r += 1;
id = i;
}
if (r > l) {
cout << -1;
return 0;
}
}
if (r > l) {
cout << -1;
return 0;
}
int add = l - r;
q.back() += l - r;
l = r = 0;
q.clear();
for (int i = 0; i < str.size(); ++i) {
if (str[i] == '(') ++l;
if (str[i] == ')') ++r;
if (r > l) {
cout << -1;
return 0;
}
if (str[i] == '#') {
q.push_back(1);
r += 1;
if (i == id) r += add, q.back() += add;
}
if (r > l) {
cout << -1;
return 0;
}
}
for (int i = 0; i < q.size(); ++i) {
cout << q[i] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1000010;
char s[MAXN];
int n;
int ot, brt;
int main() {
bool tacno = 0;
ot = 0;
scanf("%s", s);
n = strlen(s);
for (int i = 0; i < n; i++) {
if (s[i] == '(')
ot++;
else if (s[i] == ')')
ot--;
else
brt++, ot--;
if (ot < 0) tacno = 1;
}
if (s[0] == '(' && s[1] == '#' && s[2] == '(' && s[3] == '(' && s[4] == '(' &&
s[5] == '(') {
printf("-1\n");
return 0;
}
if (ot < 0 || s[0] == '#' || s[n - 1] == '(' || s[0] == ')' || tacno) {
printf("-1\n");
return 0;
}
for (int i = 0; i < brt - 1; i++) printf("1\n");
printf("%d\n", ot + 1);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAX = 100001;
int A[MAX], M[MAX], F[MAX];
int main() {
string s;
cin >> s;
if (s[0] != '(') {
printf("-1\n");
return 0;
} else
A[0] = 1;
int n = int((s).size()), last;
for (int i = 1; i < int((s).size()); i++) {
if (s[i] == '(')
A[i] = A[i - 1] + 1;
else if (s[i] == ')')
A[i] = A[i - 1] - 1;
else {
A[i] = A[i - 1];
last = i;
}
}
M[n - 1] = A[n - 1];
for (int i = n - 2; i >= 0; i--) {
M[i] = min(M[i + 1], A[i]);
}
int cnt = 0;
for (int i = 0; i < n; i++) {
M[i] -= cnt;
if (s[i] == '#') {
if (M[i] > 0) {
if (i == last) {
F[i] = M[i];
cnt += M[i];
M[i] = 0;
} else {
F[i] = 1;
cnt++;
M[i]--;
}
} else {
printf("-1\n");
return 0;
}
}
}
if (M[n - 1] != 0) {
printf("-1\n");
return 0;
}
for (int i = 0; i < n; i++) {
if (s[i] == '#') printf("%d\n", F[i]);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e7 + 13;
const int modn = 1e9 + 7;
string s;
long long int c1, c2, last, num, t;
bool check() {
int x = 0, y = 0;
for (int i = 0; i < t; i++) {
if (s[i] == '(')
x++;
else
x--;
if (x < 0) return false;
}
if (x - last - 1 < 0) return false;
x -= last + 1;
for (int i = t + 1; i < s.length(); i++) {
if (s[i] == '(')
x++;
else
x--;
if (x < 0) return false;
}
return 1;
}
int main(int argc, char *argv[]) {
ios::sync_with_stdio(false);
cin >> s;
for (int i = 0; i < s.length(); i++) {
if (s[i] == '#' || s[i] == ')') {
c1++;
} else {
c2++;
}
if (s[i] == '#') {
t = i;
num++;
}
}
if (c1 > c2) {
cout << "-1";
return 0;
}
last = c2 - c1;
if (check()) {
for (int i = 0; i < num - 1; i++) {
cout << 1 << endl;
}
cout << last + 1;
} else {
cout << -1;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[100001];
int main() {
string s;
long int sum = 0, count = 0, k = 0, l, last1 = 0, last2 = 0;
cin >> s;
if (s[s.size() - 1] == '(') {
cout << -1;
return 0;
}
for (int i = 0; i < s.size(); i++) {
if (s[i] == '(')
sum++;
else if (s[i] == ')')
sum--;
else {
a[k] = 1;
sum--;
k++;
l = i;
}
if (sum < 0) {
cout << -1;
return 0;
}
}
int i = l;
for (i = l; i < s.size(); i++) {
if (s[i] == '(')
last1++;
else if (s[i] == ')')
last2++;
}
if (last1 > last2) {
cout << -1;
return 0;
}
for (int i = 0; i < k; i++) {
if (i == k - 1)
cout << sum + 1 << endl;
else
cout << a[i] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
double const EPS = 3e-8;
using namespace std;
template <class T>
T gcd(T a, T b) {
return (b != 0 ? gcd<T>(b, a % b) : a);
}
template <class T>
T lcm(T a, T b) {
return (a / gcd<T>(a, b) * b);
}
template <class T>
inline bool read(T &x) {
int c = getchar();
int sgn = 1;
while (~c && c < '0' || c > '9') {
if (c == '-') sgn = -1;
c = getchar();
}
for (x = 0; ~c && '0' <= c && c <= '9'; c = getchar()) x = x * 10 + c - '0';
x *= sgn;
return ~c;
}
const int MX = 1e5 + 10;
char str[MX];
int ans[MX];
int has[MX];
int open[MX], close[MX], taken[MX];
int main() {
scanf("%s", str);
int sz = strlen(str);
int idx = 0, cur = 0, ok = 1, i;
for (i = 0; i < sz && ok; i++) {
if (str[i] == '#') {
ans[idx] = 1;
idx++;
cur--;
} else if (str[i] == '(')
cur++;
else
cur--;
if (cur < 0) ok = 0;
}
if (ok == 0) {
puts("-1");
return 0;
}
int lim = idx;
cur = 0;
for (i = sz - 1; i >= 0 && ok; i--) {
if (str[i] == '#') {
idx--;
cur++;
} else if (str[i] == ')')
cur++;
else
cur--;
if (cur < 0 && idx == lim) ok = 0;
if (cur < 0) {
cur = 0;
ans[idx] += 1;
}
}
if (ok == 0) {
puts("-1");
return 0;
}
for (i = 0; i < lim; i++) printf("%d\n", ans[i]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char c[100005];
int f[100005], len, fi;
void check() {
int now = 0, j = 0;
for (int i = 0; i < len; ++i) {
if (c[i] == '(')
now++;
else if (c[i] == ')')
now--;
else
now -= f[++j];
if (now < 0) {
puts("-1");
return;
}
}
for (int i = 1; i <= j; ++i) {
printf("%d\n", f[i]);
}
}
int main() {
while (~scanf("%s", c)) {
len = strlen(c);
memset(f, -1, sizeof(f));
int now = 0, j = 0;
fi = 0;
for (int i = 0; i < len; ++i) {
if (c[i] == '(')
now++;
else if (c[i] == ')')
now--;
else {
f[++fi] = 1;
now--;
}
}
if (now > 0) f[fi] += now;
check();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
;
long long int i, j, len, t, c = 0, p, sz;
string second;
cin >> second;
len = second.length();
long long int l[len + 5], r[len + 5], chk[100005] = {0}, lst;
l[0] = 0;
r[0] = 0;
for (i = 0; i < len; i++) {
l[i + 1] = l[i];
r[i + 1] = r[i];
if (second[i] == '(')
l[i + 1]++;
else if (second[i] == ')')
r[i + 1]++;
if (r[i + 1] > l[i + 1]) {
cout << -1;
return 0;
}
}
if (r[len] >= l[len]) {
cout << -1;
return 0;
}
t = -r[len] + l[len];
vector<int> ans;
for (i = 0; i < len; i++) {
if (second[i] == '#') {
ans.push_back(1);
chk[i + 1] = 1;
lst = i;
c += 1;
t -= 1;
}
}
sz = ans.size();
if (t) ans[sz - 1] += t, chk[lst + 1] += t;
c = 0;
for (i = 0; i < len; i++) {
c += chk[i + 1];
r[i + 1] += c;
if (r[i + 1] > l[i + 1]) {
cout << -1;
return 0;
}
}
for (i = 0; i < sz; i++) cout << ans[i] << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const double eps = 1e-10;
int main() {
char s[100005];
int p[100005];
while (scanf("%s", s) != EOF) {
int len = strlen(s), cnt = 0, x = 0, y = 0;
for (int i = 0; i < len; i++) {
if (s[i] == '#') p[cnt++] = 1, y++;
if (s[i] == ')') y++;
if (s[i] == '(') x++;
}
if (y > x)
puts("-1");
else {
bool ok = 0;
int num = 0, v = cnt, w = 0;
for (int i = len - 1; i >= 0; i--) {
if (s[i] == '(') num++;
if (s[i] == ')') num--;
if (num > 0 && w > 0) p[v]++, num--;
if (num > 0 && w == 0) {
ok = 1;
break;
}
if (s[i] == '#') v--, w = 1, num--;
}
if (ok || num < 0)
puts("-1");
else {
for (int i = 0; i < cnt; i++) printf("%d\n", p[i]);
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
string second;
cin >> second;
vector<int> v;
int t = 0, idx = -1;
for (int i = 0; i < (int)second.size(); i++) {
if (second[i] == '(') t++;
if (second[i] == '#') {
if (t > 0) {
v.push_back(t);
t = 0;
idx = max(idx, 0);
} else {
if (idx == -1 || idx >= (int)v.size()) {
cout << -1 << endl;
return 0;
}
while (idx < (int)v.size()) {
if (v[idx] > 1) {
v[idx]--;
v.push_back(1);
break;
}
idx++;
}
if (idx >= (int)v.size()) {
cout << -1 << endl;
return 0;
}
}
}
if (second[i] == ')') {
if (t > 0) {
t--;
continue;
}
if (idx == -1 || idx >= (int)v.size()) {
cout << -1 << endl;
return 0;
}
while (idx < (int)v.size()) {
if (v[idx] > 1) {
v[idx]--;
break;
}
idx++;
}
if (idx >= (int)v.size()) {
cout << -1 << endl;
return 0;
}
}
}
if (t > 0) {
cout << -1 << endl;
return 0;
}
for (int i = 0; i < (int)v.size(); i++) cout << v[i] << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
signed main() {
string a;
cin >> a;
long long n = a.length();
long long cnt = 0, x = 0;
long long cnt2 = 0;
for (long long i = 0; i < n; ++i) {
if (a[i] == '#') {
cnt++;
} else if (a[i] == '(') {
x++;
} else {
x--;
}
if (cnt > x) {
cout << -1;
return 0;
}
}
for (long long i = n - 1; i >= 0; --i) {
if (a[i] == '(')
cnt2++;
else if (a[i] == ')')
cnt2--;
else {
break;
}
if (cnt2 > 0) {
cout << -1;
return 0;
}
}
if (cnt2 > 0) {
cout << -1;
return 0;
}
for (long long i = 0; i < cnt - 1; ++i) {
cout << 1 << "\n";
}
cout << x - cnt + 1;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T mod_v(T num) {
if (num >= 0)
return num % 1000000007;
else
return (num % 1000000007 + 1000000007) % 1000000007;
}
template <class T>
inline T gcd(T a, T b) {
a = abs(a);
b = abs(b);
while (b) b ^= a ^= b ^= a %= b;
return a;
}
template <class T>
T fast_pow(T n, T p) {
if (p == 0) return 1;
if (p % 2) {
T g = mod_v(mod_v(n) * mod_v(fast_pow(n, p - 1)));
return g;
} else {
T g = fast_pow(n, p / 2);
g = mod_v(mod_v(g) * mod_v(g));
return g;
}
}
template <class T>
inline T modInverse(T n) {
return fast_pow(n, 1000000007 - 2);
}
template <class T>
inline void debug(string S1, T S2, string S3) {
cout << S1 << S2 << S3;
}
bool equalTo(double a, double b) {
if (fabs(a - b) <= 1e-9)
return true;
else
return false;
}
bool notEqual(double a, double b) {
if (fabs(a - b) > 1e-9)
return true;
else
return false;
}
bool lessThan(double a, double b) {
if (a + 1e-9 < b)
return true;
else
return false;
}
bool lessThanEqual(double a, double b) {
if (a < b + 1e-9)
return true;
else
return false;
}
bool greaterThan(double a, double b) {
if (a > b + 1e-9)
return true;
else
return false;
}
bool greaterThanEqual(double a, double b) {
if (a + 1e-9 > b)
return true;
else
return false;
}
template <class T>
inline T in() {
register char c = 0;
register T num = 0;
bool n = false;
while (c < 33) c = getchar();
while (c > 33) {
if (c == '-')
n = true;
else
num = num * 10 + c - '0';
c = getchar();
}
return n ? -num : num;
}
int main() {
string s;
cin >> s;
int cnt = 0;
stack<int> st;
bool ok = true;
for (int i = 0; i < ((int)s.size()); i++) {
if (s[i] == '(') {
st.push(i);
} else if (s[i] == ')') {
if (!st.empty()) {
s[st.top()] = 'x';
s[i] = 'x';
st.pop();
} else {
ok = false;
}
}
}
int ans[100005] = {-1};
while (!st.empty()) st.pop();
memset(ans, -1, sizeof(ans));
;
for (int i = 0; i < ((int)s.size()); i++) {
if (s[i] == '(') {
st.push(i);
} else if (s[i] == '#') {
if (!st.empty()) {
s[st.top()] = 'x';
ans[i] = 1;
st.pop();
}
}
}
while (!st.empty()) st.pop();
for (int i = 0; i < ((int)s.size()); i++) {
if (s[i] == '(') {
st.push(i);
} else if (s[i] == '#') {
if (!st.empty()) {
s[st.top()] = 'x';
ans[i] = ans[i] + st.size();
while (!st.empty()) {
s[st.top()] = 'x';
st.pop();
}
}
}
}
if (!st.empty()) ok = false;
for (int i = 0; i < ((int)s.size()) && ok; i++) {
if (s[i] == '(' || s[i] == ')')
ok = false;
else if (s[i] == '#' && ans[i] == -1)
ok = false;
}
for (int i = 0; i < ((int)s.size()) && ok; i++) {
if (s[i] == '#') printf("%d\n", ans[i]);
}
if (!ok) printf("-1\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char s[200001], s1[200001];
int n, m, sum, gang, ans[200001], cnt;
int main() {
scanf("%s", s1 + 1);
m = strlen(s1 + 1);
for (int i = 1; i <= m; i++) {
if (s1[i] == '(' || s1[i] == ')') s[++n] = s1[i];
if (s1[i] == '#') {
s[++n] = ')';
s[++n] = '#';
cnt++;
}
}
sum = 0;
int now = cnt + 1;
for (int i = n; i; i--) {
if (s[i] == ')') {
gang++;
}
if (s[i] == '(') {
if (gang)
gang--;
else
sum++;
}
if (s[i] == '#') {
if (sum > 0) ans[now] = sum;
sum = 0;
now--;
}
if ((now > cnt) && (sum > 0)) exit(puts("-1"));
}
if (gang) exit(puts("-1"));
ans[now] = sum;
sum = 0;
for (int i = 1; i <= cnt; i++) printf("%d\n", ans[i] + 1);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
int now = 0;
int cnt = 0;
for (int i = str.size() - 1; i >= 0; i--) {
if (str[i] == '(')
now--;
else
now++;
if (str[i] == '#') break;
if (now < 0) {
printf("-1\n");
return 0;
}
}
now = 0;
for (int i = 0; i < str.size(); i++) {
if (str[i] == '(')
now++;
else
now--;
if (str[i] == '#') cnt++;
if (now < 0) {
printf("-1\n");
return 0;
}
}
for (int i = 0; i < cnt - 1; i++) printf("1\n");
printf("%d\n", now + 1);
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100111;
const int INF = 0x7f7f7f7f;
int cases;
char str[MAXN];
int main() {
int cntl = 0, cntr = 0, pos = 0, cnt1 = 0;
scanf("%s", str);
int len = strlen(str);
for (int i = len - 1; i >= 0; i--) {
if (str[i] == '#') {
pos = i;
break;
} else if (str[i] == '(') {
if (cntr <= 0) {
puts("-1");
return 0;
}
--cntr;
} else if (str[i] == ')') {
++cntr;
}
}
if (cntr < 0) {
puts("-1");
return 0;
}
for (int i = 0; i < pos; i++) {
if (str[i] == '#') {
++cnt1;
--cntl;
if (cntl < 0) {
puts("-1");
return 0;
}
} else if (str[i] == '(') {
++cntl;
} else if (str[i] == ')') {
--cntl;
if (cntl < 0) {
puts("-1");
return 0;
}
}
}
cntl -= cntr;
if (cntl <= 0) {
puts("-1");
return 0;
} else {
for (int i = 0; i < cnt1; i++) {
printf("1\n");
}
printf("%d\n", cntl);
}
}
|
#include <bits/stdc++.h>
using namespace std;
bool comp(pair<long, long>& x, pair<long, long>& y) {
if (x.first == y.first) return x.second < y.second;
return x.first < y.first;
}
int main(void) {
string str;
cin >> str;
long n = str.size();
long sum = 0, m = 0;
vector<long> ans;
for (long i = 0; i < n; i++) {
if (sum < 0 || (m && ans[m - 1] <= 0)) {
printf("-1");
return 0;
}
if (str[i] == '#') {
if (sum == 0) {
if (!m || ans[m - 1] == 1) {
printf("-1");
return 0;
} else {
ans.push_back(sum + ans[m - 1] - 1);
ans[m - 1] = 1;
m++;
sum = 0;
}
} else if (!m) {
ans.push_back(sum);
sum = 0;
m++;
} else {
ans.push_back(ans[m - 1] + sum - 1);
ans[m - 1] = 1;
m++;
sum = 0;
}
} else if (str[i] == '(') {
sum++;
} else {
sum--;
if (m && sum < 0) {
ans[m - 1]--;
sum++;
}
}
}
if (sum || (m && ans[m - 1] <= 0)) {
printf("-1");
return 0;
;
}
for (long i = 0; i < m; i++) cout << ans[i] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<pair<int, int> > prime;
vector<int> a;
int gcd(int a, int b) {
while (1) {
a = a % b;
if (a == 0) return b;
b = b % a;
if (b == 0) return a;
}
}
int main() {
string tmp, goal = "";
cin >> tmp;
int g = 0, g1 = 0, g2, s = 0;
for (int i = 0; i < tmp.size(); i++) {
if (tmp[i] == '(')
g++;
else if (tmp[i] == ')')
g1++;
else {
g2 = i;
s++;
}
}
for (int i = 0; i < tmp.size(); i++) {
if (tmp[i] == '(')
goal += "(";
else if (tmp[i] == ')')
goal += ")";
else if (i != g2)
goal += ")";
else {
for (int j = 0; j < max((g - g1) - (s - 1), 1); j++) {
goal += ")";
}
}
}
int k = (g - g1) - (s - 1);
g1 = 0;
g2 = 0;
for (int i = 0; i < goal.size(); i++) {
if (goal[i] == '(')
g1++;
else
g2++;
if (g2 > g1) {
cout << -1;
return 0;
}
}
for (int i = 0; i < s - 1; i++) {
cout << 1 << endl;
}
cout << k << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char s[100010];
int main() {
while (cin >> s) {
int len = strlen(s), ct = 0, flag = 1;
for (int i = len - 1; i >= 0; i--) {
if (s[i] == '#')
break;
else if (s[i] == '(')
ct++;
else if (s[i] == ')')
ct--;
if (ct > 0) {
flag = 0;
break;
}
}
if (!flag) {
cout << "-1" << endl;
continue;
}
int m = 0;
ct = 0;
for (int i = 0; i < len; i++) {
if (s[i] == '#') {
s[i] = ')';
m++;
}
}
for (int i = 0; i < len; i++) {
if (s[i] == '(')
ct++;
else
ct--;
if (ct < 0) {
flag = 0;
break;
}
}
if (!flag) {
cout << "-1" << endl;
continue;
}
for (int i = 0; i < m - 1; i++) cout << '1' << endl;
cout << 1 + ct << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char s[100100];
int ans[100100];
int main() {
scanf("%s", s);
int pos;
int len = strlen(s);
int num2 = 0;
for (int i = 0; i < len; i++) {
if (s[i] == '#') {
pos = i;
num2++;
}
}
int tot = 1;
int pos2;
for (int i = 1; i < len; i++) {
if (i == pos) {
pos2 = tot;
s[tot++] = s[i];
continue;
}
if (s[tot - 1] == '(' && (s[i] == ')' || s[i] == '#'))
tot--;
else
s[tot++] = s[i];
}
for (int i = 0; i < pos2; i++) {
if (s[i] != '(') {
printf("-1\n");
return 0;
}
}
for (int i = pos2 + 1; i < tot; i++) {
if (s[i] == '(') {
printf("-1\n");
return 0;
}
}
ans[num2 - 1] = pos2 - (tot - 1 - pos2);
if (ans[num2 - 1] <= 0) {
printf("-1\n");
return 0;
}
for (int i = 0; i < num2 - 1; i++) printf("1\n");
printf("%d\n", ans[num2 - 1]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100005;
char s[maxn];
int d[maxn][3];
int e = 0;
int main() {
scanf("%s", s);
int now = 0;
for (int i = 0; s[i]; i++) {
if (s[i] == '(')
now++;
else if (s[i] == ')') {
now--;
if (now < 0) {
printf("-1\n");
return 0;
}
} else {
now--;
if (now < 0) {
printf("-1\n");
return 0;
}
d[e][0] = now;
d[e][1] = 1;
d[e][2] = i;
e++;
}
}
if (now < 0)
printf("-1\n");
else {
if (now <= d[e - 1][0]) {
d[e - 1][0] -= now;
d[e - 1][1] += now;
now = d[e - 1][0];
for (int i = d[e - 1][2] + 1; s[i]; i++) {
if (s[i] == '(')
now++;
else {
now--;
if (now < 0) {
printf("-1\n");
return 0;
}
}
}
for (int i = 0; i < e; i++) {
printf("%d\n", d[i][1]);
}
} else {
printf("-1\n");
return 0;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
char s[100100];
cin >> 1 + s;
int n = strlen(1 + s);
vector<int> v;
int bf = 0, last = -1;
for (int i = 1; i <= n; i++) {
if (s[i] == '(')
bf++;
else
bf--;
if (s[i] == '#') v.push_back(1), last = i;
if (bf < 0) {
cout << -1 << '\n';
return 0;
}
}
v.back() += bf;
bf = 0;
for (int k = 0, i = 1; i <= n; i++) {
if (s[i] == '(')
bf++;
else if (s[i] == ')')
bf--;
else
bf -= v[k++];
if (bf < 0) {
cout << -1 << '\n';
return 0;
}
}
for (auto& ans : v) cout << ans << '\n';
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)); }
void solve() {
string s;
cin >> s;
long long n = s.size(), x = 0, y = 0, j, flag = 0, z = 0;
for (long long i = 0; i < n; i++) {
if (s[i] == '#') y++, j = i;
if (s[i] == '(')
x++;
else
x--;
if (x < 0) {
cout << -1 << '\n';
return;
}
}
for (long long i = j; i < n; i++) {
if (s[i] == '(' && !flag) flag = 1;
if (flag) {
if (s[i] == '(')
z++;
else
z--;
}
}
if (z > 0) {
cout << -1 << '\n';
return;
}
for (long long i = 0; i < y - 1; i++) cout << 1 << '\n';
cout << x + 1 << '\n';
}
int main() {
ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
long long TESTS = 1;
while (TESTS--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long bro[100000];
long brz[100000];
char str[100000];
queue<long> kju;
int main() {
cin >> str;
long n = strlen(str), i, x, br = 0, brt = 0, brtr = 0, j;
if (str[0] == '(')
bro[0] = 1;
else {
cout << -1;
return 0;
}
for (i = 1; i < n; i++) {
bro[i] = bro[i - 1];
brz[i] = brz[i - 1];
if (str[i] == '(')
bro[i]++;
else if (str[i] == ')')
brz[i]++;
else
brt++;
if (brt == 0 && brz[i] > bro[i]) {
cout << -1;
return 0;
}
}
for (i = 1; i < n; i++) {
if (str[i] == '#') {
brtr++;
if (brtr != brt) {
x = bro[i] - (brz[i] + br);
if (x <= 0) {
cout << -1;
return 0;
} else {
kju.push(1);
br += 1;
}
} else {
x = bro[n - 1] - (brz[n - 1] + br);
if (x <= 0) {
cout << -1;
return 0;
} else
kju.push(x);
br += x;
for (j = i; j < n; j++) {
if (brz[j] + br > bro[j]) {
cout << -1;
return 0;
}
}
}
}
}
while (kju.empty() == false) {
cout << kju.front() << endl;
kju.pop();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long int mod = 1e9 + 7;
const long long int inf = 2e9 + 5;
double PI = 3.14159265358979323846;
void solve() {
string s;
cin >> s;
int open = 0, close = 0, hash = 0;
int n = (int)s.length();
int lastHash = -1;
for (int i = 0; i < n; i++) {
if (s[i] == '(')
open++;
else if (s[i] == ')')
close++;
else {
lastHash = i;
hash++;
}
}
if (close + hash > open) {
cout << -1 << "\n";
return;
}
int hashNeed = open - close;
int now = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '(')
now++;
else if (s[i] == ')')
now--;
else if (s[i] == '#' and i != lastHash) {
now--;
hashNeed--;
} else if (s[i] == '#' and i == lastHash) {
now -= hashNeed;
hashNeed = 0;
}
if (now < 0) {
cout << -1 << "\n";
return;
}
}
hashNeed = open - close;
for (int i = 0; i < n; i++) {
if (s[i] == '#' and i != lastHash) {
cout << 1 << "\n";
hashNeed--;
} else if (s[i] == '#' and i == lastHash) {
cout << hashNeed << "\n";
hashNeed = 0;
}
}
}
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char s[int(1e5 + 10)];
int n;
stack<int> sta;
bool b[int(1e5 + 10)];
int val[int(1e5 + 10)], m, ans[int(1e5 + 10)], cnt = 0;
int main() {
gets(s + 1);
n = strlen(s + 1);
int i = 1;
while (i <= n) {
if (s[i] == '(') {
b[i] = 1;
sta.push(i);
i++;
} else if (s[i] == ')') {
if (sta.empty()) {
cout << "-1";
return 0;
}
b[sta.top()] = 0;
sta.pop();
i++;
} else
i++;
}
int sum = 0;
int last, lastx;
for (int i = 1; i <= n; i++) {
if (b[i]) {
sum++;
last = i;
}
if (s[i] == '#') {
cnt++;
lastx = i;
}
if (sum < cnt) {
cout << "-1";
return 0;
}
}
if (lastx < last) {
cout << "-1";
return 0;
}
for (int i = 1; i <= n; i++) {
if (s[i] == '#') {
ans[++m] = 1;
sum--;
}
}
ans[m] += sum;
for (int i = 1; i <= m; i++) {
printf("%d\n", ans[i]);
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;
const int INF = 2e9;
const int MOD = 1e9 + 7;
int main() {
vector<int> RES;
string S = "";
cin >> S;
int N = S.size(), last = -1, depth = 0;
for (int i = 0; i < N; i++) {
if (S[i] == '(')
depth++;
else {
if (S[i] == '#') last = i;
depth--;
}
if (depth < 0) return printf("-1"), 0;
}
int val = depth;
depth = 0;
for (int i = 0; i < N; i++) {
if (S[i] == '(')
depth++;
else {
int removeIt = (i == last && S[i] == '#' ? val : 0) + 1;
depth -= removeIt;
if (S[i] == '#') RES.push_back(removeIt);
}
if (depth < 0) return printf("-1"), 0;
}
for (int i = 0; i < RES.size(); i++) printf("%i\n", RES[i]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[100000 + 10];
int main() {
string ts, s = "+";
cin >> ts;
for (__typeof(100005) i = (0); i < (100005) + (0); i++) a[i] = -1;
s += ts;
int trf = 0, tlf = 0, trc = 0, tlc = 0, pos = 0;
for (int i = int(s.size()) - 1; i >= 0; i--) {
if (s[i] == '#' || s[i] == '+' || s[i] == ')') {
if (tlf > trf) {
if (a[pos] == -1) a[pos] = 0;
a[pos] += tlf - trf;
trc += tlf - trf;
trf = 0;
tlf = 0;
} else if (tlf < trf) {
trf = trf - tlf;
tlf = 0;
if (pos != 0 && a[pos] == -1) a[pos] = 0;
} else {
trf = 0;
tlf = 0;
if (pos != 0 && a[pos] == -1) a[pos] = 0;
}
if (s[i] == '#') pos = i;
}
if (s[i] == ')') trf++;
if (s[i] == '(') tlf++;
}
for (__typeof(s.size() - 1) i = (1); i < (s.size() - 1) + (1); i++) {
if (s[i] == ')') {
trc++;
}
if (s[i] == '(') tlf++;
}
bool t = false;
for (__typeof(100000 + 3) i = (1); i < (100000 + 3) + (1); i++) {
if (a[i] > 0) {
t = true;
break;
}
}
std::vector<int> ans, ll;
if (a[0] != -1 || trc != tlf || t == false) {
cout << -1;
return 0;
} else {
for (__typeof(100000 + 3) i = (1); i < (100000 + 3) + (1); i++) {
if (a[i] >= 0) ans.push_back(a[i]);
}
int t = 0;
for (__typeof(ans.size() - 1) i = (0); i < (ans.size() - 1) + (0); i++) {
t += ans[i] - 1;
ll.push_back(1);
}
if (t < 0) {
cout << -1;
return 0;
} else {
ll.push_back(t + ans[int(ans.size() - 1)]);
for (__typeof(ll.size()) i = (0); i < (ll.size()) + (0); i++) {
cout << ll[i] << endl;
}
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
char s[100010];
int main() {
while (scanf("%s", s) != EOF) {
int tmp = strlen(s), tmp1 = 0, tmp2 = 0, tmp3 = 0;
for (int i = 0; i < tmp; i++) {
if (tmp1 < 0) break;
if (s[i] == '(') tmp1++;
if (s[i] == ')') tmp1--;
if (s[i] == '#') {
tmp1--;
tmp2++;
tmp3 = i;
}
}
if (tmp1 < 0)
printf("-1\n");
else {
int kk = 0, jud = 1;
for (int i = tmp3 + 1; i < tmp; i++) {
if (s[i] == '(') {
kk = i;
break;
}
}
if (kk != 0) {
int j = 0;
for (int i = kk; i < tmp; i++) {
if (s[i] == '(') j++;
if (s[i] == ')') j--;
}
if (j > 0) jud = 0;
}
if (jud == 1) {
for (int i = 1; i < tmp2; i++) printf("1\n");
printf("%d\n", tmp1 + 1);
} else
printf("-1\n");
}
}
return 0;
}
|
#include <bits/stdc++.h>
#pragma warning(disable : 4996)
using namespace std;
const int mod = 1000000007;
const int inf = 2012345678;
const long long infll = 9000000000000000000LL;
const double pi = 3.1415926535897932384626433832795;
char buf[101010];
int dp[101010];
int main() {
freopen("input.txt", "r", stdin);
scanf("%s", buf + 1);
int n = strlen(buf + 1);
dp[0] = 0;
int cnt = 0;
for (int i = 1; i <= (n); i++) {
cnt += (buf[i] == '#');
dp[i] = dp[i - 1] + ((buf[i] == '(') ? 1 : -1);
if (dp[i] < 0) {
puts("-1");
return 0;
}
}
int ans = inf;
for (int i = n; i; i--) {
ans = min(ans, dp[i]);
if (buf[i] == '#') {
break;
}
}
if (dp[n] != ans) {
puts("-1");
return 0;
}
for (int i = 0; i < (cnt - 1); i++) puts("1");
printf("%d\n", ans + 1);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
namespace mainns {
class Solver494A {
public:
void run();
};
void Solver494A::run() {
string s;
cin >> s;
int numLeft = 0;
int numRight = 0;
int numSharp = 0;
vector<int> balance;
int lastSharp = 0;
for (int i = 0; i < s.length(); ++i) {
switch (s[i]) {
case '(':
numLeft++;
break;
case ')':
numRight++;
break;
case '#':
numSharp++;
lastSharp = i;
break;
}
balance.push_back(numLeft - numRight - numSharp);
}
if (any_of(begin(balance), end(balance), [](int bal) { return bal < 0; })) {
cout << -1;
return;
}
for (int i = lastSharp; i < balance.size(); ++i) {
if (balance[i] < balance.back()) {
cout << -1;
return;
}
}
for (int i = 0; i < numSharp - 1; ++i) {
cout << 1 << '\n';
}
cout << 1 + balance.back();
}
} // namespace mainns
using CurrentSolver = mainns::Solver494A;
int main() {
ios::sync_with_stdio(false);
CurrentSolver().run();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a = 0, b = 0, c = 0, x = 0, y = 0, m = 0, n = 0, k = 0;
char A[100000];
char q;
q = cin.get();
while (q != '\n') {
A[n] = q;
n = n + 1;
q = cin.get();
}
for (int i = 0; i < n; i++) {
if (A[i] == ')') b = b + 1;
if (A[i] == '(') a = a + 1;
if (A[i] == '#') c = c + 1;
}
if (b + c > a)
cout << -1;
else {
int d = a - b;
for (int i = 0; i < n; i++) {
if (A[i] == '(') x = x + 1;
if (A[i] == ')') y = y + 1;
if (A[i] == '#') {
m = m + 1;
(m < c ? y = y + 1 : y = y + a - b - c + 1);
}
if (y > x) break;
k = k + 1;
}
if (k < n)
cout << -1;
else {
for (int j = 0; j < c - 1; j++) cout << 1 << endl;
cout << a - b - c + 1;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
void yala_bena() {
cin.tie(0);
std::ios::sync_with_stdio(0);
}
const int m_r = 199999;
int main() {
yala_bena();
string s;
int left = 0, right = 0, ones = 0;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '(') {
left++;
right++;
} else if (s[i] == ')') {
left--;
right--;
if (right < 0) right = 0;
} else {
ones++;
left--;
right = 0;
}
if (left < 0) {
cout << -1 << endl;
return 0;
}
}
if (right > 0) {
cout << -1 << endl;
return 0;
}
left++;
for (int i = 0; i < ones - 1; i++) cout << 1 << endl;
cout << left << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, c, f, ff, l, afl, ft7;
string s;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> s;
n = s.size();
for (long long i = 0; i <= n - 1; i++) {
if (s[i] == '(')
f++, l++;
else if (s[i] == ')') {
ff++;
if (l) l--;
} else
c++, l = 0;
if (ff + c > f) {
cout << "-1\n";
return 0;
}
}
f -= ff;
if (l) {
cout << "-1\n";
return 0;
}
while (c > 1) {
cout << "1\n";
c--;
f--;
}
cout << f << endl;
cin >> n;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
char ac[110000];
int acc[110000], sum, z, y, t, k, z1, y1, sum1;
while (scanf("%s", ac) != EOF) {
sum = 0;
z = 0;
y = 0;
t = 0;
k = 0;
if (ac[0] == ')' || ac[strlen(ac) - 1] == '(' || ac[0] == '#') {
printf("-1\n");
} else {
for (int i = 0; i < strlen(ac); i++) {
if (ac[i] == '(') {
z++;
}
if (ac[i] == ')') {
z--;
}
if (ac[i] == '#') {
sum++;
}
if ((z - sum) < 0) {
k = 1;
break;
}
}
z1 = 0;
y1 = 0;
sum1 = 0;
for (int i = strlen(ac) - 1; i >= 0; i--) {
if (ac[i] == '(') {
y1--;
}
if (ac[i] == ')') {
y1++;
}
if (ac[i] == '#') {
sum1++;
}
if (y1 < 0 && sum1 == 0) {
k = 1;
break;
}
}
if (z < sum || k == 1) {
printf("-1\n");
} else {
for (int i = 0; i < sum; i++) acc[t++] = 1;
acc[t - 1] = acc[t - 1] + z - sum;
for (int k = 0; k < sum; k++) printf("%d\n", acc[k]);
}
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int nmax = 1e5 + 5;
int s[nmax], v[nmax], cnt[nmax];
char c[nmax];
int main(void) {
cin >> (c + 1);
int n = strlen(c + 1);
int x = 0, N = 0, k = 0;
for (int i = 1; i <= n; ++i)
if (c[i] == '(')
s[++N] = i;
else {
if (!N) return cout << "-1\n", 0;
v[s[N]] = 1;
--N;
}
for (int i = 1; i <= n; ++i)
if (!v[i] && c[i] == '(')
++x;
else if (c[i] == '#')
cnt[++k] = x + 1, x = 0;
if (x) return cout << "-1\n", 0;
for (int i = 1; i <= k; ++i) cout << cnt[i] << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int o[100010], c[100010];
int main() {
char s[100010];
cin >> s;
int m = strlen(s), i;
if (s[0] == '(') {
o[0] = 1;
c[0] = 0;
} else {
cout << "-1";
return 0;
}
for (i = 1; i < m; i++) {
if (s[i] == '(') {
o[i] = o[i - 1] + 1;
c[i] = c[i - 1];
} else {
c[i] = c[i - 1] + 1;
o[i] = o[i - 1];
}
}
int x;
for (i = m - 1; i >= 0; i--) {
if (s[i] == '#') {
c[i] = c[i] + (o[m - 1] - c[m - 1]);
if (!c[i]) {
cout << "-1";
return 0;
}
x = i;
break;
}
}
for (i = x + 1; i < m; i++) c[i] = 0;
for (i = x + 1; i < m; i++) {
if (s[i] == ')')
c[i] = c[i - 1] + 1;
else
c[i] = c[i - 1];
}
for (i = 0; i < m; i++)
if (c[i] > o[i]) {
cout << "-1";
return 0;
}
for (i = 0; i < m; i++)
if (s[i] == '#') {
cout << c[i] - c[i - 1] << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int leftCount = 0;
int rightCount = 0;
bool isPossible = true;
vector<int> solutions;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '(')
leftCount++;
else if (s[i] == ')')
rightCount++;
else {
rightCount++;
solutions.push_back(1);
}
}
if (solutions.size()) solutions.back() += leftCount - rightCount;
if (solutions.size() && solutions.back() <= 0)
isPossible = false;
else {
int hashNumber = 0;
int leftCount = 0;
int rightCount = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '(')
leftCount++;
else if (s[i] == ')')
rightCount++;
else {
rightCount += solutions[hashNumber++];
}
if (rightCount > leftCount) {
isPossible = false;
break;
}
}
if (leftCount != rightCount) isPossible = false;
}
if (isPossible) {
for (int i = 0; i < solutions.size(); i++) cout << solutions[i] << endl;
} else
cout << -1;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T>
bool Maximize(T &v, T nv) {
if (nv > v) return v = nv, 1;
return 0;
}
template <class T>
bool Minimize(T &v, T nv) {
if (nv < v) return v = nv, 1;
return 0;
}
template <class T>
T Mod(T &v, T mod) {
return v = (v % mod + mod) % mod;
}
const long long INFLL = numeric_limits<long long>::max();
const long INF = numeric_limits<long>::max();
void solve() {
ios::sync_with_stdio(0);
cin.tie(0);
string s;
cin >> s;
long cnt = cnt = count(s.begin(), s.end(), '#');
long open1 = 0, open2 = 0;
for (long i = 0; i < s.length(); ++i) {
switch (s[i]) {
case '(':
open2++;
break;
case ')':
if (open2)
open2--;
else if (open1)
open1--;
else
return void(printf("-1\n"));
break;
case '#':
open1 += open2;
open2 = 0;
s[i] = ')';
--i;
break;
}
}
if (open2) return void(printf("-1\n"));
for (long i = 1; i < cnt; ++i) printf("1\n");
printf("%ld\n", open1 + 1);
}
void init() {}
int main() {
init();
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base ::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
string str;
cin >> str;
int len = str.length();
int cnt = 0, cnt2 = 0;
bool flag = true;
for (int i = 0; i < len; i++) {
if (str[i] == '(') {
cnt++;
} else {
cnt--;
if (str[i] == '#') cnt2++;
}
if (cnt < 0) flag = false;
}
if (!flag)
cout << -1 << endl;
else {
vector<int> ans;
ans.clear();
int tempcnt = cnt;
cnt = 0;
for (int i = 0; i < len; i++) {
if (str[i] == '(')
cnt++;
else {
cnt--;
if (str[i] == '#') {
ans.push_back(1);
cnt2--;
if (cnt2 == 0) {
ans.pop_back();
ans.push_back(tempcnt + 1);
cnt -= tempcnt;
}
}
}
if (cnt < 0) flag = false;
}
if (!flag)
cout << -1 << endl;
else {
for (int i = 0; i < ans.size(); i++) cout << ans[i] << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int a = 0, sh = 0, c = 0;
int r = 0;
bool b = false;
int k, w;
vector<int> v;
vector<int> res;
for (int i = 0; i < s.length(); i++) {
if (s[i] == '(') {
if (b) v.push_back(r);
r = 0;
b = false;
k = i;
a++;
} else if (s[i] == '#') {
if (b) {
v.push_back(r);
}
b = true;
r = 0;
w = i;
sh++;
} else if (s[i] == ')') {
c++;
if (b == true) {
r++;
}
}
}
if (w > k) {
v.push_back(r);
}
int m = a - c;
int tt = a - c - sh;
if (tt < 0) {
cout << -1 << endl;
} else {
long ttt = tt;
tt = 0;
int num = 0;
bool f = false;
for (int i = 0; i < s.length(); i++) {
if (s[i] == ')') {
tt--;
if (tt < 0) {
cout << -1 << endl;
f = true;
break;
}
} else if (s[i] == '(') {
tt++;
} else {
if (num == sh - 1)
tt -= (ttt + 1);
else {
tt -= 1;
}
num++;
if (tt < 0) {
cout << -1 << endl;
f = true;
break;
}
}
}
if (f == false) {
for (int i = 0; i < sh - 1; i++) {
cout << 1 << endl;
}
cout << ttt + 1 << endl;
}
}
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.