text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long i, j, k, l, n, m, t;
string a, b, c, d;
cin >> a;
int after = 0;
int op, cl, ha;
op = cl = ha = 0;
int lst;
for (i = 0; i < a.size(); i++) {
if (a[i] == '(')
op++;
else if (a[i] == ')')
cl++;
else {
ha++;
lst = i;
}
}
for (i = lst + 1; i < a.size(); i++) {
if (a[i] == ')') after++;
}
int dif = op - cl;
int flag = 0;
int arr[100005];
int si = 0;
if (dif <= 0 || dif < ha)
flag = 1;
else {
int op1, cl1;
op1 = cl1 = 0;
for (i = 0; i < a.size(); i++) {
if (a[i] == '(') {
op1++;
} else if (a[i] == ')') {
cl1++;
} else {
if (i != lst) {
cl1++;
arr[si++] = 1;
} else {
arr[si++] = op - cl1 - after;
cl1 = op - after;
}
}
if (cl1 > op1) flag = 1;
}
if (cl1 != op1) flag = 1;
}
if (flag)
cout << "-1" << endl;
else {
for (i = 0; i < si; i++) cout << arr[i] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int counter = 0;
int num = 0;
for (int i = 0; i < s.length(); i++) {
if (s[i] == '(') {
counter++;
} else if (s[i] == ')') {
counter--;
} else {
num++;
}
}
int arr[num];
for (int i = 0; i < num - 1; i++) {
arr[i] = 1;
counter--;
}
if (num >= 1) {
arr[num - 1] = counter;
}
counter = 0;
num = 0;
bool flag = false;
for (int i = 0; i < s.length(); i++) {
if (s[i] == '(') {
counter++;
} else if (s[i] == ')') {
counter--;
} else {
if (arr[num] <= 0) flag = true;
counter -= arr[num];
num++;
}
if (counter < 0) {
flag = true;
}
}
if (flag == true || counter != 0) {
cout << "-1" << endl;
} else {
for (int i = 0; i < num; i++) {
cout << arr[i] << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long x = 0, y = 0, flag = 1, c = 0, i;
string s;
cin >> s;
for (i = 0; i < s.length(); i++) {
if (s[i] == '(') {
x++;
y++;
} else {
x--;
y = max(0ll, --y);
if (s[i] == '#') {
y = 0;
c++;
}
if (x < 0) flag = -1;
}
}
if (y > 0 || flag == -1)
cout << "-1\n";
else {
for (i = 0; i < c - 1; i++) cout << "1\n";
cout << x + 1 << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> v;
int main() {
string s;
cin >> s;
int n = s.size(), cnt = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '(')
cnt++;
else
cnt--;
if (s[i] == '#') v.push_back(1);
if (cnt < 0) {
cout << -1;
return 0;
}
}
v[v.size() - 1] += cnt;
int vec = 0;
cnt = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '(')
cnt++;
else if (s[i] == ')')
cnt--;
else {
cnt -= v[vec];
vec++;
}
if (cnt < 0) {
cout << -1;
return 0;
}
}
for (int i = 0; i < v.size(); i++) cout << v[i] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int inf = (int)1e9;
const long long llinf = (long long)3e18;
const int N = (int)1e5 + 111;
const long double PI = (long double)acos(-1);
int main() {
string s;
cin >> s;
bool ok = true;
int n = s.length(), k = 0, cur = 0;
vector<int> ans;
for (int i = 0; i < n; i++) {
if (s[i] == '#') {
ans.push_back(1);
cur--;
k++;
}
if (s[i] == '(') cur++;
if (s[i] == ')') cur--;
}
if (cur >= 0) ans[k - 1] += cur;
k = 0;
cur = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '#') cur -= ans[k++];
if (s[i] == '(') cur++;
if (s[i] == ')') cur--;
if (cur < 0) ok = false;
}
if (cur != 0) ok = false;
if (ok) {
for (int i = 0; i < k; i++) cout << ans[i] << endl;
} else
cout << -1;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3f;
const int MOD = (int)1e9 + 7;
const int N = (int)1e5 + 7;
char read_char() {
char c;
for (;;) {
c = getchar();
if (c >= 'A' && c <= 'Z') return c;
}
}
long long powmod(long long a, long long b) {
long long res = 1;
a %= MOD;
for (; b; b >>= 1) {
if (b & 1) res = res * a % MOD;
a = a * a % MOD;
}
return res;
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long add(long long a, long long b) {
a = ((a + b) % MOD + MOD) % MOD;
return a;
}
long long mul(long long a, long long b) { return a * b % MOD; }
char s[N];
int a[N];
vector<int> sta;
vector<int> cnt;
void Init() {
memset(a, -1, sizeof(a));
cnt.clear();
sta.clear();
}
int Solve() {
int len = strlen(s);
for (int i = (0); i < (len); ++i) {
if (s[i] == '(') {
sta.push_back(i);
} else if (s[i] == ')') {
if (sta.empty())
return !puts("-1");
else
sta.pop_back();
} else {
cnt.push_back(i);
}
}
if ((int)(sta).size() < (int)(cnt).size() || sta.back() > cnt.back())
return !puts("-1");
for (int i = (0); i < ((int)(sta).size()); ++i) a[sta[i]] = 0;
for (int i = (0); i < ((int)(cnt).size()); ++i) a[cnt[i]] = 1;
int t1 = 0, t2 = 0;
for (int i = (0); i < (len); ++i) {
if (a[i] == -1) continue;
if (a[i] == 0)
t1++;
else
t2++;
if (t2 > t1) return !puts("-1");
}
for (int i = (0); i < ((int)(cnt).size()); ++i)
printf("%d\n", i == (int)(cnt).size() - 1
? (int)(sta).size() - (int)(cnt).size() + 1
: 1);
}
int main() {
while (~scanf("%s", s)) {
Init();
Solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long dp[100020];
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
string s;
cin >> s;
long long sta = 0;
long long la = -1;
long long num = 0;
for (long long i = 0; i < s.size(); i++) {
if (s[i] == '(')
sta++;
else
sta--;
if (sta < 0) {
cout << -1 << endl;
return 0;
}
if (s[i] == '#') {
la = i;
num++;
}
dp[i] = sta;
}
for (long long i = la; i < s.size(); i++) {
dp[i] -= sta;
if (dp[i] < 0) {
cout << -1 << endl;
return 0;
}
}
for (long long i = 0; i < num - 1; i++) cout << 1 << endl;
cout << 1 + sta << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int a = 0;
vector<int> ans;
for (int i = 0; i < s.length(); i++) {
if (s[i] == '(')
a++;
else if (s[i] == ')')
a--;
else {
if (a <= 0) {
cout << -1;
return 0;
}
a--;
ans.push_back(1);
}
if (a < 0) {
cout << -1;
return 0;
}
}
int i = s.length() - 1;
int ile = 0;
while (s[i] != '#') {
if (s[i] == '(')
ile++;
else
ile--;
if (ile > 0) {
cout << -1;
return 0;
}
i--;
}
ans[ans.size() - 1] += a;
for (int i = 0; i < ans.size(); i++) {
cout << ans[i] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> ans;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
string s;
cin >> s;
int v = 0, n = s.size(), num = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '(')
v++;
else if (s[i] == ')')
v--;
else {
ans.push_back(1);
v--;
num = i;
}
if (v < 0) {
cout << -1 << endl;
return 0;
}
}
ans.back() += v;
v = 0;
for (int i = 0; i < n; i++) {
if (s[i] == ')')
v--;
else if (s[i] == '(')
v++;
else if (i == num)
v -= ans.back();
else
v--;
if (v < 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;
template <class C>
void mini(C &a4, C b4) {
a4 = min(a4, b4);
}
template <class C>
void maxi(C &a4, C b4) {
a4 = max(a4, b4);
}
template <class T>
ostream &operator<<(ostream &os, vector<T> V) {
os << "[";
for (auto vv : V) os << vv << ",";
return os << "]";
}
template <class L, class R>
ostream &operator<<(ostream &os, pair<L, R> P) {
return os << "(" << P.first << "," << P.second << ")";
}
const int mod = 1e9 + 7, N = 1e6;
long long INF = 1e18;
int main() {
string s;
cin >> s;
int n = ((int)s.size());
int lastpos = 0;
int th = 0, to = 0, tc = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '(') to++;
if (s[i] == ')') tc++;
if (s[i] == '#') th++;
if (s[i] == '#') lastpos = i;
}
int diff = to - tc;
if (th > diff) {
cout << -1;
return 0;
}
vector<int> ans;
int co = 0, cc = 0;
for (int i = 0; i < lastpos; i++) {
if (s[i] == '#') {
ans.push_back(1);
diff--;
cc++;
}
if (s[i] == ')') cc++;
if (s[i] == '(') co++;
if (cc > co) {
cout << -1;
return 0;
}
}
cc += diff;
ans.push_back(diff);
if (cc > co) {
cout << -1;
return 0;
}
for (int i = lastpos + 1; i < n; i++) {
if (s[i] == ')') cc++;
if (s[i] == '(') co++;
if (cc > co) {
cout << -1;
return 0;
}
}
for (auto i : ans) cout << i << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3fffffff;
const int SINF = 0x7fffffff;
const long long LINF = 0x3fffffffffffffff;
const long long SLINF = 0x7fffffffffffffff;
const int MAXN = 100007;
int n;
char s[MAXN];
int ka, ans[MAXN];
void init();
void input();
void work();
int main() {
init();
input();
work();
}
void init() { ios::sync_with_stdio(false); }
void input() { scanf("%s", s + 1); }
void work() {
n = strlen(s + 1);
int cc = 0;
for (int i = 1; i <= n; ++i) {
if (s[i] == '(')
++cc;
else {
--cc;
if (cc < 0) {
printf("-1\n");
return;
}
if (s[i] == '#') ans[++ka] = 1;
}
}
ans[ka] += cc;
int ia = 0;
cc = 0;
for (int i = 1; i <= n; ++i) {
if (s[i] == '(')
++cc;
else {
if (s[i] == '#')
cc -= ans[++ia];
else
--cc;
if (cc < 0) {
printf("-1\n");
return;
}
}
}
for (int i = 1; i <= ka; ++i) printf("%d\n", ans[i]);
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> res;
int main() {
string s;
getline(cin, s);
int delta = 0;
for (int i = 0; i < s.length(); i++) {
if (s[i] == '(')
delta++;
else
delta--;
}
if (delta < 0) {
cout << -1 << endl;
return 0;
}
delta++;
int last = s.length() - 1;
while (s[last] != '#') last--;
int balance = 0;
for (int i = 0; i < s.length(); i++) {
if (s[i] == '(') balance++;
if (s[i] == ')') balance--;
if (s[i] == '#' && i != last) {
res.push_back(1);
balance--;
}
if (s[i] == '#' && i == last) {
res.push_back(delta);
balance -= delta;
}
if (balance < 0) {
cout << -1 << endl;
return 0;
}
}
for (int i = 0; i < res.size(); i++) cout << res[i] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> ans;
bool func() {
bool check = false;
for (int i = ans.size() - 1; i >= 0; i--)
if (ans[i] > 1) {
ans[i]--;
return true;
}
return false;
}
int main() {
char c = getchar();
int r = -1, st = 0;
while (c != '\n') {
bool Do = true;
if (c == '(') st++;
if (c == ')') {
if (st != 0)
st--;
else if (ans.size() == 0) {
cout << -1;
return 0;
} else {
if (!func()) {
cout << -1;
return 0;
}
}
}
if (c == '#') {
r++;
if (st == 0) {
if (!func()) {
cout << -1;
return 0;
} else
ans.push_back(1);
} else {
Do = false;
c = getchar();
while (c == ')') {
if (st != 0)
st--;
else if (!func()) {
cout << -1;
return 0;
}
c = getchar();
}
ans.push_back(0);
if (st != 0) {
ans[r] = st;
st = 0;
} else if (!func()) {
cout << -1;
return 0;
} else
ans[r] = 1;
}
}
if (Do) c = getchar();
}
if (st != 0) {
cout << -1;
return 0;
}
for (int i = 0; i < ans.size(); i++) cout << ans[i] << endl;
return 0;
}
|
#include <bits/stdc++.h>
char str[100010];
int main() {
int val = 0, ma = 0;
scanf("%s", str + 1);
int n = strlen(str + 1);
for (int c = 1; c <= n; c++) {
if (str[c] == '(')
val++;
else if (str[c] == ')')
val--;
else
ma++;
}
if (ma > val) {
printf("-1");
return 0;
}
int v2 = 0, co = 1;
for (int c = 1; c <= n; c++) {
if (str[c] == '(')
v2++;
else if (str[c] == ')')
v2--;
else {
if (co == ma) {
v2 -= (val - ma + 1);
} else {
v2--;
co++;
}
}
if (v2 < 0) {
printf("-1");
return 0;
}
}
for (int c = 1; c < ma; c++) printf("1\n");
printf("%d", val - ma + 1);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
int k = 0;
for (int i = 0; i < str.length(); i++)
if (str[i] == '#') k++;
vector<int> s(k, 1);
int s1 = 0;
int s2 = 0;
for (int i = 0; i < str.length(); i++)
if (str[i] == '(')
s1++;
else if (str[i] == ')')
s2++;
s[k - 1] = s1 - k + 1 - s2;
s1 = 0;
s2 = 0;
bool flag = true;
k = 0;
for (int i = 0; i < str.length(); i++) {
if (s2 > s1) flag = false;
if (str[i] == '(')
s1++;
else if (str[i] == '#')
s2 += s[k++];
else
s2++;
}
if (flag && s[s.size() - 1] > 0)
for (int i = 0; i < s.size(); i++) cout << s[i] << "\n";
else
cout << "-1";
return 0;
}
|
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:256000000")
using namespace std;
int main() {
string s;
cin >> s;
int n = s.length();
vector<int> b(n);
int bal = 0;
int last = -1;
for (int i = 0; i < n; ++i) {
if (s[i] == '(')
b[i] = 1;
else
b[i] = -1;
if (s[i] == '#') last = i;
bal += b[i];
if (bal < 0) {
cout << "-1" << endl;
return 0;
}
}
if (bal != 0 && last == -1) {
cout << "-1" << endl;
return 0;
}
if (last != -1) b[last] -= bal;
bal = 0;
for (int i = 0; i < n; ++i) {
bal += b[i];
if (bal < 0) {
cout << "-1" << endl;
return 0;
}
}
for (int i = 0; i < n; ++i) {
if (s[i] == '#') printf("%d\n", -b[i]);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n, m, i, count = 0, open = 0, flag = 0;
string s;
vector<int> ans;
bool check = false;
cin >> s;
for (i = s.length() - 1; i >= 0; i--) {
if (s[i] == ')')
count++;
else if (s[i] == '(' && count > 0)
count--;
else if (s[i] == '(' && check)
open++;
else if (s[i] == '(') {
flag = 1;
break;
} else {
if (check && open > 0) {
ans.push_back(open);
open = 0;
} else if (check) {
ans.push_back(1);
count++;
}
check = true;
}
}
if (count != 0)
flag = 1;
else if (check && open <= 0)
flag = 1;
if (flag)
cout << "-1" << endl;
else {
if (check) cout << open + count << " ";
for (i = ans.size() - 1; i >= 0; i--) cout << ans[i] << " ";
cout << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T BIGMOD(T n, T m, T mod) {
long long int ans = 1;
long long int k = n;
while (m) {
if (m & 1) {
ans *= k;
if (ans > mod) ans %= mod;
}
k *= k;
if (k > mod) k %= mod;
m >>= 1;
}
return ans;
}
template <class T>
string toString(T n) {
ostringstream ost;
ost << n;
ost.flush();
return ost.str();
}
template <class T>
string toBinary(T n) {
string ret = "";
while (n) {
if (n % 2 == 1)
ret += '1';
else
ret += '0';
n >>= 1;
}
reverse(ret.begin(), ret.end());
return ret;
}
void combination(int n, vector<vector<int> > &ret) {
ret.resize(n + 1, vector<int>(n + 1, 0));
for (int i = 1; i <= n; i++) {
ret[i][0] = ret[i][i] = 1;
for (int j = 1; j < i; j++) {
ret[i][j] = ret[i - 1][j] + ret[i - 1][j - 1];
}
}
}
int toInt(string s) {
int r = 0;
istringstream sin(s);
sin >> r;
return r;
}
long long int toLInt(string s) {
long long int r = 0;
istringstream sin(s);
sin >> r;
return r;
}
vector<string> parse(string temp) {
vector<string> ans;
ans.clear();
string s;
istringstream iss(temp);
while (iss >> s) ans.push_back(s);
return ans;
}
template <class T>
inline T gcd(T a, T b) {
if (a < 0) return gcd(-a, b);
if (b < 0) return gcd(a, -b);
return (b == 0) ? a : gcd(b, a % b);
}
template <class T>
inline T lcm(T a, T b) {
if (a < 0) return lcm(-a, b);
if (b < 0) return lcm(a, -b);
return a * (b / gcd(a, b));
}
template <class T>
inline T power(T b, T p) {
if (p < 0) return -1;
if (b <= 0) return -2;
if (!p) return 1;
return b * power(b, p - 1);
}
template <class T>
inline int asd(T &ret) {
char r;
bool start = false, neg = false;
ret = 0;
bool isaNumber = false;
while (true) {
r = getchar();
if (r == EOF) {
return 0;
}
if ((r - '0' < 0 || r - '0' > 9) && r != '-' && !start) {
continue;
}
if ((r - '0' < 0 || r - '0' > 9) && r != '-' && start) {
break;
}
if (start) ret *= 10;
start = true;
if (r == '-')
neg = true;
else
ret += r - '0';
}
if (neg) ret *= -1;
return 1;
}
template <class T>
inline int asd(T &ret1, T &ret2) {
asd(ret1);
asd(ret2);
}
template <class T>
inline int asd(T &ret1, T &ret2, T &ret3) {
asd(ret1, ret2);
asd(ret3);
}
template <class T>
inline int asd(T &ret1, T &ret2, T &ret3, T &ret4) {
asd(ret1, ret2);
asd(ret3, ret4);
}
template <class T>
inline void asdasd(T x, char y) {
if (x < 0) {
putchar('-');
x = -x;
}
char buf[21], *p = buf;
do {
*p++ = '0' + x % 10;
x /= 10;
} while (x);
do {
putchar(*--p);
} while (p > buf);
if (y == 0)
putchar('\n');
else if (y == 1)
putchar(' ');
}
template <typename value_type>
istream &operator>>(istream &in, vector<value_type> &a) {
if (!a.size()) {
size_t n;
asd(n);
a.resize(n);
}
for (typename vector<value_type>::iterator iter = a.begin(); iter != a.end();
++iter)
asd(*iter);
return in;
}
template <typename value_type>
ostream &operator<<(ostream &out, const vector<value_type> &a) {
int sz = a.size();
for (int i = (int)(0); i <= (int)(sz - 1); i++) asdasd(a[i], i != sz);
return out;
}
template <typename value_type>
ostream &operator<<(ostream &out, const vector<vector<value_type> > &a) {
int sza = a.size();
int szb = a[0].size();
for (int i = (int)(0); i <= (int)(sza - 1); i++) {
for (int j = (int)(0); j <= (int)(szb - 1); j++) asdasd(a[i][j], j != sza);
puts("");
}
return out;
}
template <typename value_type>
ostream &operator<<(ostream &out, const set<value_type> &a) {
for (__typeof(a.begin()) e = a.begin(); e != a.end(); ++e)
asdasd(*e, e != a.end());
return out;
}
template <typename key_type, typename value_type>
ostream &operator<<(ostream &in, map<key_type, value_type> &a) {
for (__typeof(a.begin()) e = a.begin(); e != a.end(); ++e) {
cout << (*e).first << " -> " << (*e).second << endl;
}
return in;
}
template <typename key_type, typename value_type>
istream &operator>>(istream &in, pair<key_type, value_type> &p) {
in >> p.first >> p.second;
return in;
}
template <typename key_type, typename value_type>
ostream &operator<<(ostream &out, const pair<key_type, value_type> &p) {
out << "(" << p.first << ", " << p.second << ")";
return out;
}
vector<int> inverseArray(int n, int m) {
vector<int> modI(n + 1, 0);
modI[1] = 1;
for (int i = 2; i <= n; i++) {
modI[i] = (-(m / i) * modI[m % i]) % m + m;
}
return modI;
}
pair<long long int, pair<long long int, long long int> > extendedEuclid(
long long int a, long long int b) {
long long int x = 1, y = 0;
long long int xLast = 0, yLast = 1;
long long int q, r, m, n;
while (a != 0) {
q = b / a;
r = b % a;
m = xLast - q * x;
n = yLast - q * y;
xLast = x, yLast = y;
x = m, y = n;
b = a, a = r;
}
return make_pair(b, make_pair(xLast, yLast));
}
long long int modInverse(long long int a, long long int m) {
return (extendedEuclid(a, m).second.first + m) % m;
}
int cca[100001];
int ccb[100001];
char inp[100001 + 10];
vector<int> ans;
int main() {
int n;
gets(&inp[1]);
n = strlen(&inp[1]);
bool res = true;
int last;
int eop, ecl;
eop = ecl = 0;
for (int i = n; i >= 1; i--) {
if (inp[i] == '#') {
last = i;
break;
} else if (inp[i] == '(')
eop++;
else
ecl++;
}
for (int i = 1; i <= n; i++) {
if (inp[i] == '(') {
cca[i] = cca[i - 1] + 1;
ccb[i] = ccb[i - 1];
} else if (inp[i] == ')') {
ccb[i] = ccb[i - 1] + 1;
cca[i] = cca[i - 1];
} else {
if (i != last) {
ccb[i] = ccb[i - 1] + 1;
cca[i] = cca[i - 1];
ans.push_back(1);
} else {
int need = (cca[i - 1] + eop) - (ccb[i - 1] + ecl);
if (need >= 1) {
ccb[i] = ccb[i - 1] + need;
} else {
res = false;
}
cca[i] = cca[i - 1];
ans.push_back(need);
}
}
if (ccb[i] <= cca[i])
;
else {
res = false;
break;
}
}
if (cca[n] == ccb[n] && res) {
for (int i = (int)(0); i <= (int)(ans.size() - 1); i++) {
asdasd(ans[i], 0);
}
} else {
cout << -1 << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char str[100002];
vector<int> ans;
int main() {
gets(str);
int n = strlen(str), bal = 0;
for (int i = 0; i < n; ++i) {
if (str[i] == '(')
++bal;
else if (str[i] == ')')
--bal;
else
ans.push_back(0);
}
for (int i = 0; i + 1 < ans.size(); ++i) {
ans[i] = 1;
bal--;
}
if (bal <= 0) {
puts("-1");
return 0;
}
ans.back() = bal;
int p = 0;
bal = 0;
for (int i = 0; i < n; ++i) {
if (str[i] == '(') ++bal;
if (str[i] == ')') --bal;
if (str[i] == '#') {
bal -= ans[p];
++p;
}
if (bal < 0) {
puts("-1");
return 0;
}
}
for (int u : ans) printf("%d\n", u);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void SOLVE() {
string s;
cin >> s;
long long n = s.size();
vector<long long> pref(n);
vector<long long> kek(n);
for (long long i = 0; i < n; i++) {
pref[i] = s[i] == '(';
kek[i] = s[i] == '#';
if (i) {
pref[i] += pref[i - 1];
kek[i] += kek[i - 1];
}
}
long long need = pref[n - 1] - (n - pref[n - 1] - kek[n - 1]);
if (need <= 0 || kek[n - 1] > need) {
cout << "-1\n";
return;
}
long long ct = 1, add = 0;
vector<long long> ans;
for (long long i = 0; i < n; i++) {
if (s[i] == '#') {
long long op = pref[i];
long long cl =
i + 1 - kek[i] - pref[i] + add + (ct < kek[n - 1] ? 1 : need);
if (cl > op) {
cout << "-1\n";
return;
}
ans.push_back(ct < kek[n - 1] ? 1 : need);
need -= ans.back();
add += ans.back();
ct++;
} else {
long long op = pref[i];
long long cl = i + 1 - kek[i] - pref[i] + add;
if (cl > op) {
cout << "-1\n";
return;
}
}
}
for (auto now : ans) cout << now << '\n';
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cout << fixed;
cout.precision(10);
long long Q = 1;
while (Q--) {
SOLVE();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int hashes = 0, starts = 0, ends = 0;
for (int i = 0; i < s.length(); i++) {
if (s[i] == '#') {
hashes++;
} else if (s[i] == '(') {
starts++;
} else if (s[i] == ')') {
ends++;
}
}
if (starts - ends < hashes) {
cout << -1 << endl;
return 0;
}
string ns = "";
int cnt = 0;
for (int i = 0; i < s.length(); i++) {
if (s[i] == '#') {
cnt++;
if (cnt == hashes) {
int temp = starts - hashes - ends + 1;
for (int j = 0; j < temp; j++) {
ns += ')';
}
} else {
ns += ')';
}
} else {
ns += s[i];
}
}
int ss = 0, es = 0;
for (int i = 0; i < ns.length(); i++) {
if (ns[i] == ')') {
es++;
} else
ss++;
if (ss < es) {
cout << -1 << endl;
return 0;
}
}
if (ss != es) {
cout << -1 << endl;
return 0;
}
for (int i = 0; i < hashes; i++) {
if (i == hashes - 1) {
cout << starts - hashes - ends + 1 << endl;
} else
cout << 1 << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int i, j, k, n, m, a1 = 0, a0 = 0, a2 = 0, c = 0, d;
vector<char> vc, s;
char a;
vector<long long int> vi;
while (cin >> a) {
s.push_back(a);
}
for (i = 0; i < s.size(); i++) {
if (s[i] == '(')
a1++;
else if (s[i] == ')')
a2++;
else
a0++;
}
if (a1 < a2 + a0) {
cout << -1 << endl;
return 0;
}
d = a1 - a2;
a1 = 0;
a2 = 0;
for (i = 0; i < s.size(); i++) {
if (a1 < a2) {
cout << -1 << endl;
return 0;
}
if (s[i] == '(') {
a1++;
vc.push_back('(');
} else if (s[i] == ')') {
a2++;
vc.push_back(')');
} else if (s[i] == '#' && a0 == 1) {
vi.push_back(d);
for (j = 0; j < d; j++) {
vc.push_back(')');
a2++;
}
} else {
a2++;
d--;
a0--;
vc.push_back(')');
vi.push_back(1);
}
}
for (i = 0; i < vi.size(); i++) {
cout << vi[i] << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
char s[150000];
scanf("%s", s);
int n = strlen(s);
int bal = 0;
int ans[n], sz = 0;
for (int i = 0; i < n; ++i) {
if (s[i] == '(') {
++bal;
} else {
--bal;
if (bal < 0) {
puts("-1");
return 0;
}
if (s[i] == '#') {
ans[sz++] = 1;
}
}
}
ans[sz - 1] += bal;
int cnt = 0;
bal = 0;
for (int i = 0; i < n; ++i) {
if (s[i] == '(')
++bal;
else if (s[i] == ')')
--bal;
else {
bal -= ans[cnt];
++cnt;
}
if (bal < 0) {
puts("-1");
return 0;
}
}
if (bal != 0) {
puts("-1");
return 0;
}
for (int i = 0; i < sz; ++i) {
printf("%d\n", ans[i]);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int mx[300000] = {0};
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
string x;
cin >> x;
long long int n = x.size();
long long int a = 0;
long long int b = 0;
long long int prefix[300000][2];
long long int cnt = 0;
long long int flag = -1;
for (long long int i = x.size() - 1; i >= 0; i--) {
if (x[i] == '#') {
flag = i;
break;
}
}
for (auto i : x) {
if (i == '#')
;
else {
if (i == '(')
a++;
else
b++;
if (a < b) {
cout << "-1";
return 0;
}
}
prefix[cnt][0] = a;
prefix[cnt][1] = b;
cnt++;
}
mx[n] = LLONG_MAX;
for (long long int i = x.size() - 1; i >= 0; i--) {
mx[i] = min(mx[i + 1], prefix[i][0] - prefix[i][1]);
}
vector<long long int> ans;
long long int bp = 0;
for (long long int i = 0; i < x.size(); i++) {
if (x[i] == '#') {
if (i == flag) {
if (mx[i] - bp == 0) {
{
cout << "-1";
return 0;
}
}
ans.push_back(mx[i] - bp);
b = b + mx[i] - bp;
;
bp++;
break;
}
if (mx[i] - bp == 0) {
{
cout << "-1";
return 0;
}
}
ans.push_back(1);
b++;
bp++;
}
}
if (a != b) {
cout << "-1";
return 0;
}
for (auto i : ans) cout << i << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> v;
string s;
cin >> s;
int n = s.length(), x = 0, a = 0, ind;
for (int i = 0; i < n; i++) {
if (s[i] == '(')
x++;
else if (s[i] == ')')
x--;
else {
x--;
ind = i;
v.push_back(1);
}
}
if (x < 0) {
cout << -1 << endl;
return 0;
}
for (int i = 0; i < n; i++) {
if (s[i] == '(')
a++;
else
a--;
if (i == ind) a -= x;
if (a < 0) {
cout << -1 << endl;
return 0;
}
}
n = v.size();
for (int i = 1; i < n; i++) {
cout << v[i] << endl;
}
cout << x + 1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
char s[100100];
int n, b = 0, d = -1, f = 0, t = 0;
vector<int> temp;
scanf("%s", s);
n = strlen(s);
for (int i = 0; i < n; i++) {
if (s[i] == '(') {
b++;
} else if (s[i] == ')') {
b--;
}
if (s[i] == '#') {
b--;
d = i;
t++;
}
if (b < 0) {
printf("-1");
return 0;
}
}
for (int i = d + 1; i < n; i++) {
if (s[i] == '(') {
f++;
} else if (s[i] == ')') {
f = max(0, f - 1);
}
}
if (f > 0) {
printf("-1");
return 0;
}
for (int i = 0; i < t - 1; i++) {
printf("1\n");
}
printf("%d\n", b + 1);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#pragma GCC diagnostic ignored "-Wformat"
int main() {
ios::sync_with_stdio(0);
string s;
cin >> s;
int delta = 0, nhash = 0, lasthash = -1;
for (int i = 0; i < (int)(s.size()); ++i) {
if (s[i] == '(')
++delta;
else if (s[i] == ')')
--delta;
else
--delta, ++nhash, lasthash = i;
if (delta < 0) {
cout << "-1" << endl;
return 0;
}
}
string ss;
int D = 0;
for (int i = 0; i < (int)(s.size()); ++i) {
if (s[i] == '(') ++D;
if (s[i] == ')') --D;
if (s[i] == '#') --D;
if (i == lasthash) D -= delta;
if (D < 0) {
cout << "-1" << endl;
return 0;
}
}
vector<int> ans(nhash, 1);
ans[ans.size() - 1] = delta + 1;
for (int i : ans) printf("%i\n", i);
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T>
bool uin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T>
bool uax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
ios::sync_with_stdio(false);
cout.precision(10);
cout << fixed;
string s;
cin >> s;
int b = 0;
int cnt = 0, last = -1;
for (int i = 0; i < (int)(s.size()); ++i) {
if (s[i] == '(')
++b;
else if (s[i] == ')')
--b;
else {
++cnt;
last = i;
}
}
int bb = 0;
bool ok = b >= cnt;
for (int i = 0; i < (int)(s.size()); ++i) {
if (s[i] == '(')
++bb;
else if (s[i] == ')')
--bb;
else if (i != last)
--bb;
else
bb -= b - cnt + 1;
ok &= bb >= 0;
}
if (ok) {
for (int i = 0; i < (int)(cnt - 1); ++i) cout << 1 << '\n';
cout << b - cnt + 1 << '\n';
} else {
cout << -1 << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n = 0;
char st[100002];
cin >> st;
n = strlen(st);
int last = 0;
int c = 0;
int val = 0;
for (int i = 0; i < n; i++) {
if (st[i] == '#') {
c++;
last = i;
}
if (st[i] == '(')
val++;
else if (st[i] == ')' || st[i] == '#')
val--;
}
val++;
if (val <= 0) {
cout << -1;
return 0;
}
st[last] = '.';
int num1 = 0;
for (int i = 0; i < n; i++) {
if (st[i] == '(')
num1++;
else if (st[i] == ')' || st[i] == '#')
num1--;
else if (st[i] == '.')
num1 -= val;
if (num1 < 0) {
cout << -1;
return 0;
}
}
for (int i = 1; i < c; i++) {
cout << 1 << endl;
}
cout << val;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string st;
int sz, total, last, pos;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> st;
sz = st.size();
for (int i = 0; i < sz; i++) {
total += st[i] == '(' ? 1 : -1;
if (st[i] == '#') pos = i;
}
if (total < 0) {
cout << "-1\n";
return 0;
}
last = 1 + total;
total = 0;
for (int i = 0; i < sz; i++) {
total += (i == pos) ? -last : (st[i] == '(' ? 1 : -1);
if (total < 0) {
cout << "-1\n";
return 0;
}
}
for (int i = 0; i < sz; i++) {
if (st[i] == '#')
if (i == pos)
cout << last << "\n";
else
cout << "1\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
char* s = new char[100001];
cin >> s;
int left = 0, immLeft = 0, h = 0;
queue<int>& q = *new queue<int>();
for (int i = 0; i < strlen(s); i++) {
char c = s[i];
switch (c) {
case '(': {
left++;
immLeft++;
break;
}
case ')': {
if (left == 0) {
cout << -1;
return 0;
}
left--;
immLeft = max(0, immLeft - 1);
break;
}
default: {
if (left == 0) {
cout << -1;
return 0;
}
h++;
left--;
immLeft = 0;
}
}
}
if (immLeft > 0 || (left > 0 && h == 0)) {
cout << -1;
return 0;
}
while (h > 1) {
cout << 1 << endl;
h--;
}
cout << left + 1;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
int d = 0;
bool ok = true;
int c = 0;
for (int i = 0; i < n; ++i) {
if (s[i] == '(')
d++;
else if (s[i] == ')')
d--;
else {
c++;
d--;
}
if (d < 0) ok = false;
}
int cc = 0;
int dd = 0;
for (int i = 0; i < n; ++i) {
if (s[i] == '#') cc++, dd--;
if (s[i] == '(') dd++;
if (s[i] == ')') dd--;
if (cc == c and s[i] == '#') {
dd -= d;
}
if (dd < 0) ok = false;
}
if (not ok)
cout << -1 << endl;
else {
for (int i = 0; i < c - 1; ++i) {
cout << 1 << endl;
}
cout << 1 + d << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int Maxn = 100010;
char s[Maxn];
vector<int> rep;
int main() {
scanf("%s", s);
int ls = strlen(s);
int last;
for (int i = 0; i < ls; i++)
if (s[i] == '#') last = i;
int cnt1 = 0, cnt2 = 0;
for (int i = 0; i < last; i++) {
if (s[i] == '(') {
cnt1++;
} else {
cnt2++;
if (s[i] == '#') rep.push_back(1);
if (cnt2 > cnt1) {
puts("-1");
return 0;
}
}
}
int t1 = 0, t2 = 0;
for (int i = ls - 1; i > last; i--)
if (s[i] == '(')
t1++;
else
t2++;
int kk = cnt1 + t1 - cnt2 - t2;
if (kk < 1) {
puts("-1");
return 0;
}
rep.push_back(kk);
cnt2 += kk;
if (cnt2 > cnt1) {
puts("-1");
return 0;
}
for (int i = last + 1; i < ls; i++) {
if (s[i] == '(')
cnt1++;
else
cnt2++;
if (cnt2 > cnt1) {
puts("-1");
return 0;
}
}
for (int i = 0; i < rep.size(); i++) printf("%d\n", rep[i]);
}
|
#include <bits/stdc++.h>
using namespace std;
const int M = 1e5 + 10;
int ans[M];
char s[M];
int main() {
scanf("%s", s);
int n = strlen(s);
int last = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '#') last = i;
}
int flag = 0, num = 0, cnt = 0;
for (int i = 0; i <= last; i++) {
if (s[i] == '(')
num++;
else if (s[i] == ')')
num--;
else {
num--;
ans[cnt++] = 1;
}
if (num < 0) flag = 1;
}
int num1 = num;
for (int i = last + 1; i < n; i++) {
if (s[i] == '(')
num++;
else
num--;
if (num < 0) flag = 1;
}
num1 -= num;
ans[cnt - 1] += num;
if (num1 < 0) flag = 1;
for (int i = last + 1; i < n; i++) {
if (s[i] == '(')
num1++;
else
num1--;
if (num1 < 0) flag = 1;
}
if (flag)
printf("-1\n");
else {
for (int i = 0; i < cnt; i++) printf("%d\n", ans[i]);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
string s;
cin >> s;
vector<long long> val;
long long type1 = 0, type2 = 0, type3 = 0;
long long ch1 = 0, ch2 = 0;
if (s.size() == 1) {
cout << -1 << endl;
return 0;
}
for (long long i = 0; i < s.size(); ++i) {
if (s[i] == '(') {
type1++;
ch1++;
} else if (s[i] == ')') {
type2++;
ch2++;
if (type1 != 0) {
type1--;
}
} else if (s[i] == '#') {
type3++;
type1 = 0;
}
if (ch1 < ch2 + type3) {
cout << -1 << endl;
return 0;
}
}
if (type1 > 0) {
cout << -1 << endl;
return 0;
}
for (long long i = 0; i < type3 - 1; ++i) {
cout << 1 << endl;
ch2++;
}
cout << ch1 - ch2 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
inline long long int pwr(long long int x, long long int y, long long int p) {
long long int z = 1;
for (; y; y >>= 1, x = x * x % p)
if (y & 1) z = z * x % p;
return z;
}
int main() {
string s;
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> s;
vector<int> v;
long long int cnt1 = 0, cnther = 0, cl = 0, cr = 0, end, fl = 0, flag = 0,
fl2 = 0;
for (int i = 0; i < s.length(); i++) {
if (s[i] == '#') {
cnt1++;
}
}
for (int i = 0; i < s.length(); i++) {
if (s[i] == '#') {
cnther++;
if (cr >= cl) {
cout << "-1" << endl;
return 0;
} else if (cnther != cnt1) {
v.push_back(1);
cr++;
} else {
end = i;
fl = cl - cr;
break;
}
} else if (s[i] == '(') {
cl++;
} else if (s[i] == ')') {
cr++;
}
if (cr > cl) {
cout << "-1" << endl;
return 0;
}
}
cr = 0;
cl = 0;
for (int i = end + 1; i < s.length(); i++) {
if (s[i] == '(') {
cl++;
} else if (s[i] == ')') {
cr++;
}
}
fl2 = cl - cr;
if (fl2 > 0) {
cout << -1 << endl;
return 0;
}
cl = 0;
cr = 0;
for (int i = end + 1; i < s.length(); i++) {
if (s[i] == '(') {
cl++;
} else if (s[i] == ')') {
cr++;
}
if (cl - cr < fl2) {
flag = 1;
}
}
if (flag) {
if (cl != 0) {
cout << "-1" << endl;
return 0;
}
}
if (cl - cr + fl > 0)
v.push_back(cl - cr + fl);
else {
cout << "-1" << endl;
return 0;
}
for (int i = 0; i < v.size(); i++) {
cout << v[i] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000001;
const double EPS = 10e-9;
int main() {
char tab[100001];
int a, b, opened = 0, opened_2 = 0, possible = 1, possible_2 = 1,
amount_hashes = 0, amount_hashes_2 = 0;
scanf("%s", tab);
for (int i = 0; possible && i < strlen(tab); i++)
if (tab[i] == '#') {
amount_hashes++;
possible = opened > 0;
opened--;
} else if (tab[i] == ')') {
possible = opened > 0;
opened--;
} else {
opened++;
}
for (int i = strlen(tab) - 1; possible_2 && i >= 0; i--)
if (tab[i] == '#') {
break;
} else if (tab[i] == '(') {
possible_2 = opened_2 > 0;
opened_2--;
} else {
opened_2++;
}
if ((!possible) || (!possible_2))
printf("-1\n");
else {
for (int i = 0; i < amount_hashes - 1; i++) printf("1\n");
printf("%d\n", opened + 1);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int hashes = 0;
int count = 0;
for (int i = 0; i < s.size(); ++i) {
if (s[i] == '(') {
++count;
} else {
--count;
hashes += (s[i] == '#');
if (count < 0) {
cout << -1 << endl;
return 0;
}
}
}
vector<int> values;
for (int i = 1; i < hashes; ++i) {
values.push_back(1);
}
values.push_back(count + 1);
count = 0;
int index = 0;
for (int i = 0; i < s.size(); ++i) {
if (s[i] == '(') {
++count;
} else if (s[i] == ')') {
--count;
} else {
count -= values[index++];
}
if (count < 0) {
cout << -1 << endl;
return 0;
}
}
if (count != 0) {
cout << -1 << endl;
return 0;
}
for (int i = 0; i < hashes; ++i) {
cout << values[i] << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
string s;
cin >> s;
int last_change = 0;
int cnt = 0;
for (int i = 0; i < (int)s.size(); ++i) {
if (s[i] == '#') {
last_change = i;
++cnt;
}
}
int lvl = 0;
for (int i = 0; i < (int)s.size(); ++i) {
if (s[i] == '#' && i != last_change) s[i] = ')';
if (s[i] == ')')
--lvl;
else {
if (s[i] == '(') ++lvl;
}
}
if (lvl <= 0) {
cout << -1 << endl;
return 0;
}
int last_add = lvl;
lvl = 0;
for (int i = 0; i < (int)s.size(); ++i) {
if (s[i] == '(')
++lvl;
else {
if (s[i] == ')')
--lvl;
else {
lvl -= last_add;
}
}
if (lvl < 0) {
cout << -1 << endl;
return 0;
}
}
for (int i = 0; i < cnt; ++i) {
if (i + 1 == cnt)
cout << last_add << endl;
else
cout << 1 << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
char s[N];
int main() {
while (~scanf("%s", s)) {
int sum = 0, flag = 1, len = strlen(s), cnt = 0;
int last;
for (int i = 0; i < len; i++) {
if (s[i] == '#') last = i;
}
for (int i = 0; i <= last; i++) {
if (s[i] == '(')
sum++;
else if (s[i] == ')')
sum--;
else if (s[i] == '#') {
sum--;
cnt++;
}
if (sum < 0) {
flag = 0;
break;
}
}
sum++;
int sum2 = 0, flag2 = 1;
for (int i = last + 1; i < len; i++) {
if (s[i] == '(')
sum2++;
else
sum2--;
}
if (sum2 > 0 || s[len - 1] == '(') flag2 = 0;
if (flag && flag2) {
for (int i = 0; i < cnt; i++) {
if (i != cnt - 1)
printf("%d\n", 1);
else
printf("%d\n", sum + sum2 == 0 ? -1 : sum + sum2);
}
} else
printf("%d\n", -1);
}
return 0;
}
|
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:1164777216")
using namespace std;
template <class T>
inline T sqr(T x) {
return x * x;
}
const double pi = acos(-1.0), eps = 1e-9;
const int INF = 1000 * 1000 * 1000 + 5, MAXN = 100005, MOD = 1000007;
void prepare(string s) {
if ((int)s.size() != 0) {
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
}
}
string s;
vector<int> pos;
int num1[MAXN], num2[MAXN], ans[MAXN], Min[MAXN];
bool check() {
for (int i = 0; i < (int)s.size(); ++i)
if (num1[i] < num2[i]) return false;
return true;
}
void solve() {
cin >> s;
bool flag = false;
for (int i = 0; i < (int)s.size(); ++i)
if (s[i] == '#') {
s[i] = ')';
flag = true;
ans[i]++;
pos.push_back(i);
}
if (s[0] == '(')
num1[0]++;
else
num2[0]++;
for (int i = 1; i < (int)s.size(); i++) {
if (s[i] == '(') {
num1[i] = num1[i - 1] + 1;
num2[i] = num2[i - 1];
} else {
num2[i] = num2[i - 1] + 1;
num1[i] = num1[i - 1];
}
}
if (!flag) {
if (!check()) cout << -1;
return;
}
int cnt = num1[(int)s.size() - 1] - num2[(int)s.size() - 1];
if (!check())
cout << -1;
else {
int Num = 0;
Min[(int)s.size() - 1] = num1[(int)s.size() - 1] - num2[(int)s.size() - 1];
for (int i = (int)s.size() - 2; i >= pos[0]; i--)
Min[i] = min(Min[i + 1], num1[i] - num2[i]);
int tmp = INF;
for (int i = pos[0]; i <= pos.back(); i++) tmp = min(tmp, Min[i]);
tmp = max(tmp, num1[pos.back()] - num2[pos.back()]);
if (cnt > tmp)
cout << -1;
else {
ans[pos[(int)pos.size() - 1]] += cnt;
for (int i = pos.back() + 1; i < (int)s.size(); i++)
if (num1[i] - num2[i] - cnt < 0) {
cout << -1;
return;
}
for (int i = 0; i < (int)pos.size(); ++i) cout << ans[pos[i]] << '\n';
}
}
}
int main() {
prepare("");
srand(time(NULL));
solve();
return 0;
}
|
#include <bits/stdc++.h>
int main() {
char str[100010];
int i, a, b, c, sum, q, pos, s[100010], j;
while (scanf("%s", str) != EOF) {
sum = q = pos = 0;
a = b = c = 0;
j = 0;
for (i = 0; i < strlen(str); i++) {
if (str[i] == '(') {
a++;
sum++;
}
if (str[i] == ')') {
b++;
sum--;
}
if (str[i] == '#') {
c++;
s[j++] = 1;
}
}
if (a < b + c)
q = 1;
else {
s[j - 1] += sum - c;
j = 0;
sum = 0;
for (i = 0; i < strlen(str); i++) {
if (str[i] == '(') {
sum++;
}
if (str[i] == ')') {
sum--;
}
if (str[i] == '#') {
sum -= s[j++];
}
if (sum < 0) q = 1;
}
}
if (q) {
printf("-1\n");
} else
for (i = 0; i < j; i++) {
printf("%d\n", s[i]);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
int ans[1000000], c = 0, op = 0, pos;
for (int i = 0; a[i] != '\0'; i++) {
if (a[i] == '#') {
ans[c++] = 1;
a[i] = ')';
pos = i;
}
}
for (int i = 0; a[i] != '\0'; i++) {
if (i == pos) continue;
if (a[i] == '(')
op++;
else
op--;
}
ans[c - 1] = op;
for (int i = 0; i < op - 1; i++) a.replace(pos, 1, "))");
op = 0;
for (int i = 0; a[i] != '\0'; i++) {
if (a[i] == '(')
op++;
else
op--;
if (op < 0) {
cout << -1;
return 0;
}
}
for (int i = 0; i < c; i++) cout << ans[i] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = (int)1e3 + 4;
long long int l, n, op, cl, ans, f, r, q, h, h1, a[1000005];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
string s;
cin >> s;
n = s.length();
for (long long int i = 0; i < n; i++) {
if (s[i] == '(') op++;
if (s[i] == ')') cl++;
if (s[i] == '#') h++;
}
ans = op - cl;
h1 = h;
cl = op = 0;
if (ans < 0 || (ans - h) < 0) {
cout << -1;
return 0;
}
for (long long int i = 0; i < n; i++) {
if (cl > op) {
cout << -1;
return 0;
}
if (s[i] == '#') {
if (h == 1) {
a[f] = ans;
cl += ans;
} else {
a[f] = 1;
cl++;
ans--;
}
h--;
f++;
}
if (s[i] == '(') {
op++;
}
if (s[i] == ')') {
cl++;
}
}
for (long long int i = 0; i < h1; i++) cout << a[i] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100010;
char str[MAXN];
vector<int> ans;
int main() {
int i, j;
scanf("%s", str);
int a = 0, b = 0, c = 0;
ans.clear();
int len = strlen(str);
for (i = 0; i < len; i++) {
if (str[i] == '(')
a++;
else if (str[i] == ')')
b++;
else if (str[i] == '#')
c++;
}
int num = 0;
int flag = 1;
for (i = 0; i < len; i++) {
if (str[i] == '#') {
if (c == 1) {
if (a - b <= 0) flag = 0;
ans.push_back(a - b);
num -= a - b;
c--;
} else {
ans.push_back(1);
num--;
c--;
b++;
}
} else if (str[i] == '(')
num++;
else
num--;
if (num < 0) {
flag = 0;
break;
}
}
if (num < 0 || !flag)
printf("-1\n");
else {
for (i = 0; i < ans.size(); i++) printf("%d\n", ans[i]);
}
return 0;
}
|
#include <bits/stdc++.h>
template <class T>
inline T gcd(T x, T y) {
if (!y) return x;
return gcd(y, x % y);
}
template <class T>
inline void read(T& x) {
bool fu = 0;
char c;
for (c = getchar(); c <= 32; c = getchar())
;
if (c == '-') fu = 1, c = getchar();
for (x = 0; c > 32; c = getchar()) x = x * 10 + c - '0';
if (fu) x = -x;
};
template <class T>
inline void read(T& x, T& y) {
read(x);
read(y);
}
template <class T>
inline void read(T& x, T& y, T& z) {
read(x);
read(y);
read(z);
}
using namespace std;
const int MAX = 1000005;
int A[MAX];
int main() {
string s;
int l;
cin >> s;
l = s.length();
int a = 0, j = -1;
bool c = true;
vector<int> v;
for (int i = l - 1; i >= 0; --i)
if (s[i] == '#') {
j = i;
break;
}
for (int i = 0; i < l; ++i) {
if (s[i] == '(')
a++;
else if (s[i] == ')')
a--;
else {
v.push_back(1);
a--;
}
A[i] = a;
}
int vx = v.size(), k = 0;
v[vx - 1] += A[l - 1];
a = 0;
for (int i = 0; i < l; ++i) {
if (s[i] == '(')
a++;
else if (s[i] == ')')
a--;
else {
if (v[k] < 1) {
c = false;
break;
}
a -= v[k++];
}
if (a < 0 or (i == l - 1 and a != 0)) {
c = false;
break;
}
}
if (c) {
for (int i = 0, y = v.size(); i < y; ++i) cout << v[i] << endl;
} else {
cout << -1 << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;
const long long MOD = 1e9 + 7;
int N, M, K, Q, T;
char str[MAXN];
int main() {
int i, j;
scanf("%s", str);
N = 0;
while (str[N] != 0) ++N;
stack<int> stk;
int cnt = 0;
int idx = 0;
for (i = 0; i < N; ++i) {
if (str[i] == '(')
stk.push(i);
else {
if (stk.empty()) {
printf("-1");
return 0;
}
stk.pop();
if (str[i] == '#') {
++cnt;
idx = i;
}
}
}
if (!stk.empty() && idx < stk.top()) {
printf("-1");
return 0;
}
for (i = 1; i < cnt; ++i) {
printf("1\n");
}
printf("%d\n", 1 + stk.size());
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> v;
int main() {
string s;
ios::sync_with_stdio(false);
;
int m, n, i, j, k, sum = 0, num;
cin >> s;
for (j = s.length() - 1; j >= 0; j--) {
if (s[j] == ')') sum++;
if (s[j] == '(') sum--;
if (sum < 0) {
cout << -1 << endl;
return 0;
}
if (s[j] == '#') {
num = j;
break;
}
}
int ans = 0;
for (i = 0; i < s.length(); i++) {
if (s[i] == '(') ans++;
if (s[i] == ')') ans--;
if (ans < 0) {
cout << -1 << endl;
return 0;
}
if (s[i] == '#') {
if (i != num) {
if (ans >= 1) {
v.push_back(1);
ans--;
} else {
cout << -1 << endl;
return 0;
}
} else {
if (ans <= sum) {
cout << -1 << endl;
return 0;
} else {
v.push_back(ans - sum);
}
}
}
}
for (i = 0; i < v.size(); i++) cout << v[i] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000000;
const long long INFll = 1000000000000000000ll;
const int MOD = 1000000007;
char s[100100];
int ans[100100];
int main() {
gets(s);
int n = strlen(s);
int op = 0, cl = 0, k = 0;
for (int i = 0; i < n; ++i)
if (s[i] == '(')
++op;
else {
++cl;
if (s[i] == '#') ++k;
}
int bal = 0;
for (int i = 0; i < n; ++i) {
if (s[i] == '(')
++bal;
else
--bal;
if (bal < 0) {
puts("-1");
return 0;
}
}
for (int i = 0; i < k - 1; ++i) ans[i] = 1;
ans[k - 1] = op - cl + 1;
k = bal = 0;
for (int i = 0; i < n; ++i) {
if (s[i] == '(')
++bal;
else if (s[i] == ')')
--bal;
else
bal -= ans[k++];
if (bal < 0) {
puts("-1");
return 0;
}
}
for (int i = 0; i < k; ++i) printf("%d\n", ans[i]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n = 0;
vector<int> v(0), w(0);
bool f = 1;
string s;
int main() {
cin >> s;
n = s.size();
int ind = 0;
int a = 0;
for (int i = n - 1; i >= 0; i--) {
if (s[i] == '#') {
ind = i;
break;
} else if (s[i] == ')') {
a++;
} else
a--;
}
if (a < 0) a = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '(')
v.push_back(1);
else if (s[i] == ')') {
if (int(v.size()) == 0) {
f = 0;
break;
}
v.pop_back();
} else {
if (i != ind && int(v.size()) > 0) {
w.push_back(1);
v.pop_back();
} else {
int b = int(v.size()) - a;
if (b < 1) {
f = 0;
break;
}
w.push_back(b);
while (b--) v.pop_back();
}
}
}
if (v.size() == 0 && f == 1) {
for (int i = 0; i < int(w.size()); i++) cout << w[i] << endl;
} else
cout << -1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool find(string s) {
stack<char> tmp;
for (int i = 0; i < s.length(); i++) {
if (s[i] == '(') {
tmp.push('(');
} else if (s[i] == ')') {
if (tmp.size() == 0) {
return false;
} else {
tmp.pop();
}
}
}
if (tmp.size() == 0) {
return true;
} else {
return false;
}
}
int main() {
string s;
cin >> s;
int cnt1 = 0, cnt2 = 0, cnt3 = 0;
for (int i = 0; i < s.length(); i++) {
if (s[i] == '(') {
cnt1 += 1;
} else if (s[i] == ')') {
cnt2 += 1;
} else {
cnt3 += 1;
}
}
string s2;
int cnt4 = 0;
for (int i = 0; i < s.length(); i++) {
if (s[i] == '#') {
cnt4 += 1;
if ((cnt4) == cnt3) {
if ((cnt1 - cnt2 - (cnt3 - 1)) < 1) {
cout << "-1\n";
return 0;
}
for (int j = 0; j < (cnt1 - cnt2 - (cnt3 - 1)); j++) {
s2 += ')';
}
} else {
s2 += ')';
}
} else {
s2 += s[i];
}
}
if (find(s2)) {
for (int i = 0; i < (cnt3 - 1); i++) {
cout << "1\n";
}
cout << cnt1 - cnt2 - (cnt3 - 1) << "\n";
} else {
cout << -1 << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 10;
int N;
char str[MAXN];
int main() {
if (fopen("input.txt", "r")) {
freopen("input.txt", "r", stdin);
}
ios_base::sync_with_stdio(false);
gets(str + 1);
N = strlen(str + 1);
int sharp = 0;
for (int i = 1; i <= N; i++) {
if (str[i] == '#') {
sharp++;
}
}
int psum = 0;
for (int i = 1; i <= N; i++) {
psum += (str[i] == '(' ? 1 : -1);
if (psum < 0) {
puts("-1");
return 0;
}
}
int p = 0, scnt = 0;
for (int i = 1; i <= N; i++) {
char c = str[i];
if (c == '(') {
p++;
} else if (c == ')') {
p--;
} else {
if (++scnt == sharp) {
p -= (psum + 1);
} else {
p--;
}
}
if (p < 0) {
puts("-1");
return 0;
}
}
for (int i = 1; i < sharp; i++) {
puts("1");
}
printf("%d\n", psum + 1);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
int s = 0, sum = 0, k, x = 0;
string a;
vector<int> b;
cin >> a;
for (int i = 0; i < a.size(); i++) {
if (a[i] == '#') {
int j = i;
string c = "#";
for (; a[j + 1] != '(' && j + 1 < a.size(); j++) c += a[j + 1];
sort(c.begin(), c.end());
for (; i <= j; i++) a[i] = c[j - i];
}
}
for (int i = 0; i < a.size(); i++) {
if (a[i] == '(')
sum++;
else if (a[i] == ')')
sum--;
else
s++;
}
if (sum < s)
cout << -1;
else {
k = sum - s + 1;
sum = 0;
for (int i = 0; i < a.size(); i++) {
if (a[i] == '(')
sum++;
else if (a[i] == ')')
sum--;
else {
if (s == 1) {
b.push_back(k);
sum -= k;
x = i;
if (sum < 0) {
cout << -1;
return 0;
}
break;
} else {
b.push_back(1);
sum--;
}
s--;
}
if (sum < 0) {
cout << -1;
return 0;
}
}
for (int i = x + 1; i < a.size(); i++) {
if (a[i] == '(')
sum++;
else if (a[i] == ')')
sum--;
if (sum < 0) {
cout << -1;
return 0;
}
}
if (sum != 0)
cout << -1;
else {
for (int i = 0; i < b.size(); i++) cout << b[i] << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char a[100010];
vector<int> v;
int main() {
int t = 1, tc;
int i, j, k, l, m, n;
while (~scanf("%s", &a)) {
v.clear();
int prev = 0;
l = strlen(a);
for (i = 0; i < l && prev >= 0; i++) {
if (a[i] == '(')
prev++;
else if (a[i] == ')')
prev--;
else if (a[i] == '#') {
v.push_back(1);
prev--;
}
}
if (prev < 0) {
printf("-1\n");
continue;
}
if (prev > 0) v[v.size() - 1] += prev;
prev = 0;
j = 0;
for (i = 0; i < l && prev >= 0; i++) {
if (a[i] == '(')
prev++;
else if (a[i] == ')')
prev--;
else if (a[i] == '#') {
prev -= v[j];
j++;
}
}
if (prev < 0) {
printf("-1\n");
continue;
}
for (i = 0; i < v.size(); i++) printf("%d\n", v[i]);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
using dd = long double;
namespace {
static bool constexpr dbg = 0;
ll constexpr N = -1;
ll n;
vector<ll> res;
string s;
void init() { cin >> s; }
void solve() {
ll c = 0;
for (auto ch : s) {
if (ch == '(') {
++c;
continue;
}
--c;
if (c < 0) {
cout << -1;
return;
}
if (ch == '#') res.push_back(1);
}
if (c > 0) res.back() += c;
c = 0;
ll idx = 0;
for (auto ch : s) {
if (ch == '(')
++c;
else if (ch == ')')
--c;
else
c -= res[idx++];
if (c < 0) {
cout << -1;
return;
}
}
for (auto ch : res) cout << ch << '\n';
}
} // namespace
int main() {
if (!dbg) {
std::ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
cout << fixed << setprecision(20);
init();
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void) {
string t;
cin >> t;
vector<int> n(t.size(), 0);
vector<int> ans;
int lastSharpIdx = 0;
for (int i = 0; i < n.size(); i++) {
char c = t[i];
if (c == '(')
n[i] = 1;
else if (c == ')')
n[i] = -1;
else {
n[i] = -1;
lastSharpIdx = i;
ans.push_back(1);
}
}
n[lastSharpIdx] = 0;
ans.pop_back();
int sum = 0;
for (int i = 0; i < n.size(); i++) {
sum += n[i];
}
if (sum <= 0) {
cout << -1 << endl;
return 0;
}
n[lastSharpIdx] = -sum;
ans.push_back(sum);
sum = 0;
for (int i = 0; i < n.size(); i++) {
sum += n[i];
if (sum < 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;
const int N = 1e5 + 200;
stack<int> st;
vector<int> v;
int a[N], b[N];
int main() {
string s;
cin >> s;
int flag = 0, n = 0, m = 0;
int len = s.length();
for (int i = 0; i < len; i++) {
if (s[i] == '(')
st.push(i);
else if (s[i] == ')') {
if (st.empty()) {
flag = 1;
break;
} else
st.pop();
} else
b[++m] = i;
}
while (!st.empty()) {
a[++n] = st.top();
st.pop();
}
sort(a + 1, a + 1 + n);
int t = 1;
for (int i = 1; i <= m; i++) {
if (i == m) {
int ans = 0;
for (int j = t; j <= n; j++) {
if (a[j] < b[i])
ans++;
else
flag = 1;
}
if (ans == 0)
flag = 1;
else
v.push_back(ans);
} else {
if (t <= n && a[t] < b[i]) {
v.push_back(1);
t++;
} else
flag = 1;
}
}
if (flag)
puts("-1");
else
for (int i = 0; i < v.size(); i++) cout << v[i] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long g(long long a, long long b) {
if (b == 0)
return a;
else
return g(b, a % b);
}
char s[100010];
int main() {
int i, j, k, n, x, y, l, lst, op, cl, ans, op1, cl1, fl, hs;
x = y = op = cl = op1 = cl1 = fl = hs = 0;
cin >> s;
l = strlen(s);
for (i = 0; i < l; i++) {
if (s[i] == '#') hs++;
}
for (i = l - 1; i >= 0; i--) {
if (s[i] == '#') {
lst = i;
break;
}
}
for (i = 0; i < lst; i++) {
if (s[i] == '(')
op++;
else {
cl++;
if (cl > op) {
fl = 1;
break;
}
}
}
for (i = lst + 1; i < l; i++) {
if (s[i] == '(')
op1++;
else
cl1++;
}
ans = op + op1 - cl - cl1;
if (ans <= 0 || (ans + cl) > op) fl = 1;
cl += ans;
for (i = lst + 1; i < l; i++) {
if (s[i] == '(')
op++;
else {
cl++;
if (cl > op) {
fl = 1;
break;
}
}
}
if (fl) {
cout << "-1\n";
} else {
for (i = 1; i < hs; i++) cout << "1\n";
cout << ans << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string s;
int n, sk[110000], pos, sum[110000];
int main() {
cin >> s;
n = s.length();
sum[0] = 0;
for (int i = 1; i <= n; i++) {
if (s[i - 1] == '(')
sum[i] = sum[i - 1] + 1;
else {
sum[i] = sum[i - 1] - 1;
if (sum[i] < 0) {
cout << -1;
return 0;
}
if (s[i - 1] == '#') {
sk[i] = 1;
pos = i;
}
}
}
sk[pos] += sum[n];
for (int i = 1; i <= n; i++) {
if (s[i - 1] == '(')
sum[i] = sum[i - 1] + 1;
else {
if (s[i - 1] == '#')
sum[i] = sum[i - 1] - sk[i];
else
sum[i] = sum[i - 1] - 1;
if (sum[i] < 0) {
cout << -1;
return 0;
}
}
}
for (int i = 1; i <= n; i++)
if (s[i - 1] == '#') cout << sk[i] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char str[100010];
int num[100010];
int main() {
int p, i, j, k, len, ans;
while (cin >> str) {
len = strlen(str);
p = 0;
k = 0;
bool flag = 1;
for (i = 0; i < len; i++) {
if (str[i] == '(') {
p++;
} else {
if (str[i] == ')') {
if (p <= 0) {
flag = 0;
break;
} else {
p--;
}
} else {
k++;
if (p <= 0) {
flag = 0;
break;
} else {
p--;
}
}
}
}
if (!flag) {
puts("-1");
continue;
}
flag = 1;
p = 0;
for (i = 0; i < len; i++) {
if (str[i] == '(') {
p++;
} else {
p--;
}
}
ans = p + 1;
p = 0;
j = 0;
for (i = 0; i < len; i++) {
if (str[i] == '(') {
p++;
} else {
if (str[i] == ')') {
p--;
} else {
j++;
if (j != k) {
p--;
} else {
p -= ans;
}
}
}
if (p < 0) {
flag = 0;
break;
}
}
if (!flag || p != 0) {
puts("-1");
continue;
}
for (i = 0; i < k - 1; i++) {
printf("%d\n", 1);
}
printf("%d\n", ans);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string second;
int a[100001], k, t;
int main() {
cin >> second;
for (int i = 0; i < second.length(); i++)
if (second[i] == '(')
a[i] = a[i - 1] + 1;
else
a[i] = a[i - 1] - 1;
for (int i = 0; i < second.length(); i++)
if (a[i] < 0) {
cout << -1 << endl;
return 0;
}
for (int i = second.length() - 1; i >= 0; i--)
if (second[i] == '#') {
k = a[second.length() - 1] + 1;
a[i] -= a[second.length() - 1];
for (int j = i + 1; j < second.length(); j++)
if (second[j] == '(')
a[j] = a[j - 1] + 1;
else
a[j] = a[j - 1] - 1;
break;
}
if (a[second.length() - 1] != 0) {
cout << -1 << endl;
return 0;
}
for (int i = 0; i < second.length(); i++)
if (a[i] < 0) {
cout << -1 << endl;
return 0;
}
for (int i = 0; i < second.length(); i++)
if (second[i] == '#') t++;
for (int i = 1; i < t; i++) cout << 1 << endl;
cout << k << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
char s[maxn];
int vis[maxn], len;
bool check(char s[]) {
int cnt = 0;
for (int i = 0; i < len; i++) {
if (s[i] == '(')
cnt++;
else if (s[i] == ')')
cnt--;
else
cnt -= vis[i];
if (cnt < 0) return false;
}
if (cnt == 0) return true;
return false;
}
int main() {
while (scanf("%s", s) != EOF) {
memset(vis, 0, sizeof(vis));
len = strlen(s);
int tot = 0, c = 0;
for (int i = 0; i < len; i++) {
if (s[i] == '(')
tot++;
else if (s[i] == ')')
tot--;
else {
c++;
vis[i] = 1;
}
}
if (tot - (c - 1) <= 0)
printf("-1\n");
else {
int last = (tot - (c - 1) ? tot - (c - 1) : 1);
for (int i = len - 1; i >= 0; i--) {
if (s[i] == '#') {
vis[i] = last;
break;
}
}
if (!check(s))
printf("-1\n");
else {
for (int i = 1; i <= c - 1; i++) printf("1\n");
printf("%d\n", last);
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void RI() {}
template <typename... T>
void RI(int& head, T&... tail) {
scanf("%d", &head);
RI(tail...);
}
char s[100010];
int main() {
int n = strlen(gets(s));
int last = -1;
int zz = 0;
for (int i = 0; i < int(n); i++)
if (s[i] == '#') {
zz++;
s[i] = ')';
last = i;
}
int cl = count(s, s + n, '(');
int cr = count(s, s + n, ')');
if (cr > cl) return puts("-1"), 0;
int cnt = 0;
for (int i = 0; i < int(n); i++) {
if (s[i] == '(')
cnt++;
else
cnt--;
if (i == last) cnt -= cl - cr;
if (cnt < 0) return puts("-1"), 0;
}
if (cnt != 0) return puts("-1"), 0;
for (int i = 0; i < int(zz - 1); i++) puts("1");
printf("%d\n", cl - cr + 1);
return 0;
}
|
#include <bits/stdc++.h>
const int maxn = 100010;
char s[maxn];
int main() {
int a = 0, b = 0, c = 0, i;
scanf("%s", s);
int len = strlen(s);
if (s[0] == ')' || s[len - 1] == '(' || s[0] == '#') {
printf("-1\n");
return 0;
}
for (i = len - 1; i >= 0; i--) {
if (s[i] == '(') a++;
if (s[i] == ')') b++;
if (a > b) {
printf("-1\n");
return 0;
}
if (s[i] == '#') break;
}
a = 0, b = 0;
for (i = 0; i < len; i++) {
if (s[i] == '(') a++;
if (s[i] == ')') {
if (s[i - 1] == '(') {
s[i - 1] = '.';
s[i] = '.';
b--;
a--;
}
b++;
}
if (s[i] == '#') {
b++;
c++;
}
if (b > a) {
printf("-1\n");
return 0;
}
}
b -= c;
if (a - b < c) {
printf("-1\n");
return 0;
}
a = 0;
for (i = 0; i < len; i++) {
if (s[i] == '(') a++;
if (s[i] == ')') {
b--;
a--;
}
if (s[i] == '#') {
if (c > 1) {
printf("1\n");
a--;
c--;
} else
printf("%d\n", a - b);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
const long long int INFLL = 1e18;
const double EPS = 1e-8;
template <class T>
T &chmin(T &a, const T &b) {
return a = min(a, b);
}
template <class T>
T &chmax(T &a, const T &b) {
return a = max(a, b);
}
string s;
int c;
int mv = INF;
int sc;
int main() {
cin >> s;
int n = s.length();
for (int i = (0); i < (int)(n); i++) {
if (s[i] == '(')
c++;
else
c--;
if (c < 0) return puts("-1");
if (s[i] == '#') mv = c, sc++;
chmin(mv, c);
}
if (mv < c) return puts("-1");
for (int i = (0); i < (int)(sc - 1); i++) printf("1\n");
if (sc > 0) printf("%d\n", c + 1);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
set<int> st;
string s;
vector<int> v;
int main() {
cin >> s;
int cnt = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '#') {
if (cnt <= 0) {
cout << -1;
return 0;
}
v.push_back(cnt);
cnt--;
}
if (s[i] == ')')
cnt--;
else if (s[i] == '(')
cnt++;
if (cnt < 0) {
cout << -1 << endl;
return 0;
}
}
string a = "";
int c = 1;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '#') {
if (c == v.size()) {
for (int j = 0; j < cnt + 1; j++) a += ')';
} else
a += ')';
c++;
} else {
a += s[i];
}
}
v[v.size() - 1] = cnt + 1;
cnt = 0;
for (int i = 0; i < a.size(); i++) {
if (a[i] == '(')
cnt++;
else if (a[i] == ')')
cnt--;
if (cnt < 0) {
cout << -1;
return 0;
}
}
if (cnt > 0) {
cout << -1 << endl;
return 0;
}
for (int i = 0; i < v.size() - 1; i++) {
cout << 1 << endl;
}
cout << v[v.size() - 1] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T>
void dbgarr(T *a, int s, int t) {
for (int i = s; i <= t; i++) cerr << a[i] << ' ';
cerr << endl;
}
char buf[200000];
int sum[200000];
vector<int> vec;
bool yes() {
int p = -1;
int n = strlen(&buf[1]);
for (int i = 1; i <= n; i++) {
if (buf[i] == '(') sum[i] = sum[i - 1] + 1;
if (buf[i] == ')') sum[i] = sum[i - 1] - 1;
if (buf[i] == '#') {
sum[i] = sum[i - 1] - 1;
p = i;
}
if (sum[i] < 0) return false;
}
vec.clear();
int dt = sum[n];
for (int i = 1; i <= n; i++) {
if (i < p)
if (buf[i] == '#') vec.push_back(1);
if (i == p) {
vec.push_back(1 + dt);
sum[i] = sum[i] - dt;
}
if (i > p) {
if (buf[i] == '(') sum[i] = sum[i - 1] + 1;
if (buf[i] == ')') sum[i] = sum[i - 1] - 1;
}
if (sum[i] < 0) return false;
}
return true;
}
int main() {
scanf("%s", &buf[1]);
if (yes()) {
int size = vec.size();
for (int i = 0; i < size; i++) printf("%d\n", vec[i]);
} else
printf("-1\n");
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
long long dx[] = {-1, 0, 1, 0};
long long dy[] = {0, -1, 0, 1};
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
string s;
cin >> s;
long long n = s.size();
long long cnt = 0;
vector<long long> ans;
for (long long i = 0; i < n; i++) {
if (s[i] == '(')
cnt++;
else
cnt--;
if (cnt < 0) {
cout << -1;
return 0;
}
}
if (cnt < 0) {
cout << -1;
return 0;
}
long long val = cnt;
long long cnt2 = cnt;
for (long long i = n - 1; i >= 0; i--) {
if (s[i] == '#') {
long long k = min(cnt2, val);
ans.push_back(k + 1);
val -= k;
} else if (s[i] == ')')
cnt2++;
}
long long x = 0;
string res = "";
reverse(ans.begin(), ans.end());
for (long long i = 0; i < n; i++) {
if (s[i] == '#') {
res = res + string(ans[x], ')');
x++;
} else
res += s[i];
}
cnt = 0;
for (long long i = 0; i < res.size(); i++) {
if (res[i] == ')')
cnt--;
else
cnt++;
if (cnt < 0) {
cout << -1 << "\n";
return 0;
}
}
if (cnt != 0) {
cout << -1;
return 0;
}
for (auto i : ans) cout << i << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
char s[100010];
int ans[100010], top, last;
int main() {
scanf("%s", s);
int len = strlen(s);
top = 0;
int g = 0;
for (int i = len - 1; i >= 0; i--) {
if (s[i] == '(')
g--;
else if (s[i] == ')')
g++;
else {
last = i;
break;
}
if (g < 0) {
top = -1;
break;
}
}
if (top < 0) {
puts("-1");
return 0;
}
int f = 0;
for (int i = 0; i < len; i++) {
if (s[i] == '(')
f++;
else if (s[i] == ')')
f--;
else {
if (i != last) {
f--;
ans[top++] = 1;
} else {
if (f > g) {
ans[top++] = f - g;
f = g;
} else {
top = -1;
break;
}
}
}
if (f < 0) {
top = -1;
break;
}
}
if (f != 0) top = -1;
if (top < 0)
puts("-1");
else {
for (int i = 0; i < top; i++) printf("%d\n", ans[i]);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
string s;
while (cin >> s) {
int len = s.length(), last = -1, cnt = 0;
for (int i = 0; i < len; ++i)
if (s[i] == '#') {
++cnt;
last = i;
}
int rem = 0;
bool can = 1;
for (int i = len - 1; i > last; --i) {
rem += s[i] == '(' ? 1 : -1;
if (rem > 0) can = 0;
}
int cur = 0;
vector<int> ans(cnt, 1);
for (int i = 0; i < last; ++i) {
if (s[i] == '(')
++cur;
else
--cur;
if (cur < 0) can = 0;
}
if (cur + rem < 1)
can = 0;
else
ans[cnt - 1] = cur + rem;
if (!can)
cout << "-1\n";
else {
for (int i = 0; i < cnt; ++i) cout << ans[i] << '\n';
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int infInt = 1e9;
int a[200010];
string s;
int main() {
cin.sync_with_stdio(0);
cin.tie(0);
int character = 0;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '#') character++;
}
int j = -1, balance = 0;
for (int i = s.size() - 1; i >= 0; i--) {
if (s[i] == '(') {
balance--;
if (balance < 0 and j >= 0) {
a[j]++;
balance++;
} else if (balance < 0) {
cout << -1 << "\n";
return 0;
}
} else if (s[i] == ')') {
balance++;
} else {
j++;
a[j]++;
balance++;
}
}
if (balance == 0) {
for (int i = character - 1; i >= 0; i--) cout << a[i] << "\n";
} else {
cout << -1 << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long maxn = 1e5 + 5;
const long long mod = 1000000007;
long long t;
long long i, j;
long long n, m, k;
long long x, y;
vector<long long> g;
string s;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> s;
for (i = 0; i <= s.size() - 1; i++) {
if (s[i] == '(')
x++;
else if (s[i] == ')')
y++;
else
k++;
}
if (x <= y || (x - y) < k)
cout << -1;
else {
long long tmp1 = 0;
long long tmp2 = 0;
long long tmp3 = x - y;
long long zzz = 0;
for (i = 0; i < s.size(); i++) {
if (s[i] == '(')
tmp1++;
else if (s[i] == ')')
tmp1--;
if (tmp1 < 0) {
zzz = 1;
break;
}
if (s[i] == '#') {
if (tmp1 <= 0) {
zzz = 1;
break;
}
tmp2++;
if (tmp2 < k) {
g.push_back(1);
tmp3--;
tmp1--;
} else {
tmp1 -= tmp3;
g.push_back(tmp3);
if (tmp1 < 0) {
zzz = 1;
break;
}
}
}
}
if (zzz == 1)
cout << -1 << '\n';
else {
for (i = 0; i <= g.size() - 1; i++) cout << g[i] << '\n';
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void) {
char str[100010];
scanf("%s", str);
int length = strlen(str);
vector<int> jml;
int tot = 0;
for (int i = 0; i < length; i++) {
if (str[i] == '#' || str[i] == ')') {
tot--;
if (str[i] == '#') jml.push_back(tot);
} else {
tot++;
}
if (tot < 0) {
printf("-1");
return 0;
}
}
vector<int> ans;
for (int i = 0; i < jml.size() - 1; i++) {
ans.push_back(1);
}
ans.push_back(1 + tot);
int totz = 0;
int j = length - 1;
while (str[j] != '#') {
if (str[j] == '(')
totz++;
else
totz--;
j--;
if (totz > 0) {
printf("-1");
return 0;
}
}
for (int i = 0; i < ans.size(); i++) {
printf("%d\n", ans[i]);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using namespace std;
string s;
int n;
int A[100000], idx;
int main() {
cin >> s;
n = s.length();
idx = 0;
int val = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '(')
val++;
else if (s[i] == ')')
val--;
else {
A[idx++] = 1;
val--;
}
if (val < 0) {
printf("-1\n");
return 0;
}
}
A[idx - 1] += val;
val = 0;
int cnt = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '(')
val++;
else if (s[i] == ')')
val--;
else
val -= A[cnt++];
if (val < 0) {
printf("-1\n");
return 0;
}
}
for (int i = 0; i < idx; i++) printf("%d\n", A[i]);
return 0;
}
|
#include <bits/stdc++.h>
char ch[100100];
int a[100100];
int main() {
scanf("%s", ch);
int len = strlen(ch);
int sum_l = 0, sum_r = 0, sum_j = 0, mk = 0;
for (int i = 0; i < len; i++) {
if (ch[i] == '(') sum_l++;
if (ch[i] == ')') sum_r++;
if (ch[i] == '#') sum_j++;
}
int tem = sum_l - sum_r;
for (int i = 0; i < sum_j; i++) {
if (i == sum_j - 1) {
a[i] = tem - sum_j + 1;
} else {
a[i] = 1;
}
}
int x = 1;
sum_l = sum_r = mk = 0;
for (int i = 0; i < len; i++) {
if (a[sum_j - 1] < 1) {
x = 0;
break;
}
if (ch[i] == '(') sum_l++;
if (ch[i] == ')') sum_r++;
if (ch[i] == '#') {
sum_r += a[mk++];
}
if (sum_l < sum_r) {
x = 0;
break;
}
}
if (x) {
for (int i = 0; i < sum_j; i++) {
printf("%d\n", a[i]);
}
} else {
printf("-1\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const double eps = 1e-8;
char ch[100010];
int main(void) {
while (~scanf("%s", ch)) {
int len = strlen(ch);
int cnt1 = 0, cnt2 = 0, cnt = 0;
int pos;
for (int i = 0; i < len; i++) {
if (ch[i] == '(') cnt1++;
if (ch[i] == ')') cnt2++;
if (ch[i] == '#') {
cnt++;
pos = i;
}
}
if (cnt2 + cnt > cnt1) {
printf("-1\n");
continue;
}
int del = cnt1 - cnt2 - cnt;
int tmp = del;
bool f = 0;
vector<int> vec;
for (int i = len - 1; i >= 0; i--) {
if (ch[i] == '(') cnt1--;
if (ch[i] == ')') cnt2--;
if (ch[i] == '#') {
vec.push_back(1 + del);
del = 0;
if (cnt2 + 1 + del > cnt1) {
f = 1;
}
}
if (cnt2 > cnt1) {
f = 1;
}
}
cnt1 = cnt2 = cnt = 0;
for (int i = 0; i < len; i++) {
if (ch[i] == '(') cnt1++;
if (ch[i] == ')') cnt2++;
if (ch[i] == '#') {
if (pos == i)
cnt2 += tmp + 1;
else
cnt2++;
}
if (cnt2 > cnt1) f = 1;
}
if (f) {
printf("-1\n");
vec.clear();
}
for (int i = (int)vec.size() - 1; i >= 0; i--) {
printf("%d\n", vec[i]);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename T1, typename T2>
ostream& operator<<(ostream& out, pair<T1, T2> a) {
return (out << "(" << a.first << "; " << a.second << ")");
}
const int nmax = 1000 * 1000;
const int inf = 1000 * 1000 * 1000;
const int mod = 1000 * 1000 * 1000 + 7;
const int pi = M_PI;
const long long infl = 1000ll * 1000ll * 1000ll * 1000ll * 1000ll * 1000ll;
string s;
int q[nmax];
vector<int> answer;
int main() {
getline(cin, s);
int ind = inf;
for (int i = 0; i < (int)s.length(); i++)
if (s[i] == '#') ind = i;
int c = 0;
for (int i = 0; i < min((int)s.length(), ind); i++) {
if (s[i] == '#') answer.push_back(1);
if (s[i] == '(')
c++;
else
c--;
if (c < 0) {
cout << -1 << endl;
return 0;
}
}
int c1 = 0;
for (int i = ind; i < (int)s.length(); i++)
if (s[i] == ')')
c1++;
else if (s[i] == '(')
c1--;
if (c < c1 + 1) {
cout << -1 << endl;
return 0;
}
answer.push_back(c - c1);
ind = 0, c = 0;
for (int i = 0; i < (int)s.length(); i++) {
if (s[i] == '(')
c++;
else if (s[i] == ')')
c--;
else
c -= answer[ind++];
if (c < 0) {
cout << -1 << endl;
return 0;
}
}
if (c != 0) {
cout << -1 << endl;
return 0;
}
for (int i = 0; i < (int)answer.size(); i++) cout << answer[i] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
char s[100001];
int slen;
bool ok(int lastdash, int lastval) {
if (lastval < 1) return false;
int cur = 0;
for (int i = (0); i < (slen); ++i) {
if (s[i] == '(') ++cur;
if (s[i] == ')' || s[i] == '#' && i != lastdash) --cur;
if (i == lastdash) cur -= lastval;
if (cur < 0) return false;
}
return cur == 0;
}
void run() {
scanf("%s", s);
slen = strlen(s);
int nopen = 0, nclose = 0, ndash = 0, lastdash = -1;
for (int i = (0); i < (slen); ++i)
if (s[i] == '(')
++nopen;
else if (s[i] == ')')
++nclose;
else
++ndash, lastdash = i;
int lastval = nopen - nclose - (ndash - 1);
if (ok(lastdash, lastval)) {
for (int i = (0); i < (ndash); ++i)
printf("%d\n", i != ndash - 1 ? 1 : lastval);
} else {
printf("-1\n");
}
}
int main() {
run();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXI = numeric_limits<int>::max() / 2;
const int MINI = numeric_limits<int>::min() / 2;
const long long MAXL = numeric_limits<long long>::max() / 2;
const long long MINL = numeric_limits<long long>::min() / 2;
int main(int argc, char* argv[]) {
int i, j;
string s;
cin >> s;
int n = s.size(), ls = -1;
for ((ls) = (n - 1); (ls) >= (0); --(ls))
if (s[ls] == '#') break;
bool f = true;
int res = 0;
vector<int> ans;
for ((i) = (n - 1); (i) >= (ls + 1); --(i)) {
if (s[i] == ')')
++res;
else if (--res < 0) {
f = false;
break;
}
}
if (f) {
int cnt = 0;
for ((i) = (0); (i) < (ls); ++(i)) {
if (s[i] == '(')
++cnt;
else {
if (--cnt < 0) {
f = false;
break;
}
if (s[i] == '#') ans.push_back(1);
}
}
if (res >= cnt)
f = false;
else
ans.push_back(cnt - res);
}
if (f) {
for ((i) = (0); (i) < (ans.size()); ++(i)) cout << ans[i] << endl;
} else {
cout << -1 << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int d, n = 0;
for (char c : s) {
if (c == '(')
++d;
else if (c == ')')
--d;
else
++n;
}
vector<int> ans(n, 1);
ans.back() = d - ans.size() + 1;
if (ans.back() < 1) {
cout << -1 << endl;
return 0;
}
int stack = 0;
int idx = 0;
for (char c : s) {
if (c == '(')
++stack;
else if (c == ')') {
--stack;
if (stack < 0) {
cout << -1 << endl;
return 0;
}
} else {
stack -= ans[idx++];
if (stack < 0) {
cout << -1 << endl;
return 0;
}
}
}
if (stack != 0) {
cout << -1 << endl;
return 0;
}
for (int i : ans) cout << i << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long int LINF = 0x3f3f3f3f3f3f3f3fll;
mt19937 rng((int)chrono::steady_clock::now().time_since_epoch().count());
const int MAX = (int)1e5 + 10;
int main() {
ios::sync_with_stdio(false);
;
string second;
cin >> second;
int cnt = 0;
int at = 0;
for (char c : second) {
if (c == ')') {
at--;
} else if (c == '(') {
at++;
} else {
cnt++;
if (at < cnt) {
cout << -1 << '\n';
return 0;
}
}
}
if (at < cnt) {
cout << -1 << '\n';
return 0;
}
int rest = at;
vector<int> resp;
at = 0;
int q = 0;
int mn = 0;
for (char c : second) {
if (c == ')') {
at--;
} else if (c == '(') {
at++;
} else {
q++;
if (q < cnt) {
resp.push_back(1);
rest--;
at--;
} else {
resp.push_back(rest);
at -= rest;
}
}
mn = min(mn, at);
}
if (mn < 0) {
cout << -1 << '\n';
return 0;
}
for (int e : resp) {
cout << e << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double eps = 1e9;
char s[100010];
int kol = 0;
vector<int> a;
int s1, s2;
int r[100010];
int t[4 * 100010];
void build(int v, int tl, int tr) {
if (tl == tr)
t[v] = r[tl];
else {
int tm = (tl + tr) / 2;
build(v * 2, tl, tm);
build(v * 2 + 1, tm + 1, tr);
t[v] = min(t[v * 2], t[v * 2 + 1]);
}
}
int sum(int v, int tl, int tr, int l, int r) {
if (l > r) return 1e8;
if (l == tl && r == tr) return t[v];
int tm = (tl + tr) / 2;
return min(sum(v * 2, tl, tm, l, min(r, tm)),
sum(v * 2 + 1, tm + 1, tr, max(l, tm + 1), r));
}
int main() {
gets(s);
int sz = strlen(s);
for (int i = 0; i < sz; i++) {
if (s[i] == '(') {
kol++;
s1++;
} else if (s[i] == ')') {
kol--;
if (kol < 0) {
cout << "-1";
exit(0);
}
s2++;
} else if (kol > 0) {
a.push_back(1);
kol--;
} else {
if (kol <= 0) {
cout << "-1";
exit(0);
}
}
r[i] = kol;
}
if (a.size() == 0) {
cout << "-1";
return 0;
}
build(1, 0, sz - 1);
int p = 0;
int e = 0;
int kol = r[sz - 1];
for (int i = 0; i < sz; i++) {
if (s[i] == '#') {
int r = sum(1, 0, sz - 1, i, sz - 1);
if (r - e > 0) {
a[p] += r - e;
kol -= r - e;
e += (r - e);
}
p++;
}
}
if (kol != 0) {
cout << -1;
return 0;
}
for (int i = 0; i < a.size(); i++) {
printf("%d\n", a[i]);
}
}
|
#include <bits/stdc++.h>
using namespace std;
char s[100005];
int c1, c2;
int l;
int flag;
int pos;
void ini() {
int i;
l = strlen(s);
c1 = c2 = 0;
flag = 1;
for (i = 0; i < l; i++) {
if (s[i] == '(')
c1++;
else
c2++;
if (c1 < c2) {
flag = 0;
}
}
if (c1 < c2) {
flag = 0;
} else {
if (s[l - 1] == '(') {
flag = 0;
}
}
pos = -1;
for (i = l - 1; i >= 0; i--) {
if (s[i] == '#') {
pos = i;
break;
}
}
int cha = c1 - c2;
int cc1 = 0;
int cc2 = 0;
for (i = 0; i < l; i++) {
if (s[i] == '(')
cc1++;
else {
if (s[i] == '#' && i == pos) {
cc2 = cc2 + cha + 1;
} else {
cc2++;
}
}
if (cc1 < cc2) {
flag = 0;
}
}
}
void solve() {
if (flag == 0) {
printf("-1\n");
return;
}
int i;
for (i = 0; i < l; i++) {
if (s[i] == '#') {
if (i == pos) {
printf("%d\n", c1 - c2 + 1);
} else {
printf("1\n");
}
}
}
}
void out() {}
int main() {
while (scanf("%s", s) != EOF) {
ini();
solve();
out();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string s;
int n;
bool solve() {
int cnt = 0, del = 0;
int i;
for (i = n - 1; i >= 0 && s[i] != '#'; i--) {
if (s[i] == '(')
del++;
else
del--;
if (del > 0) return false;
}
int d = 0;
for (int j = 0; j < n; j++) {
if (s[j] == '(')
d++;
else {
if (d <= 0) {
return false;
}
d--;
}
}
for (; i >= 0; i--) {
if (s[i] == '(')
del++;
else if (s[i] == ')')
del--;
else if (s[i] == '#')
cnt++;
}
if (del < cnt) return false;
for (int i = 0; i < cnt - 1; i++) puts("1");
printf("%d\n", del - cnt + 1);
return true;
}
int main() {
cin >> s;
n = s.length();
if (!solve()) puts("-1");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int i, k, b, n, m, r = 0, x = 0, y = 0, z = 0, h = 0, l;
string s;
cin >> s;
n = s.size();
int a[n];
for (i = 0; i < n; i++) {
if (s[i] == '(')
x++;
else if (s[i] == ')' && x > 0)
x--;
else if (s[i] == ')')
z = 1;
else if (s[i] == '#' && x > 0) {
a[y] = 1;
y++;
x--;
k = i;
l = x;
} else if (s[i] == '#')
z = 1;
}
x = l;
if (y > 0) {
r = 0;
for (i = k + 1; i < n; i++) {
if (s[i] == '(') {
x++;
r++;
} else if (s[i] == ')' && x > 0)
x--;
else
h = 1;
if (s[i] == ')' && r > 0) r--;
}
a[y - 1] = x + 1;
}
if (z == 1 || h == 1 || r != 0)
cout << "-1";
else {
for (i = 0; i < y; i++) {
cout << a[i] << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
string s;
cin >> s;
int n = s.size();
vector<int> seq(n + 1, 0);
vector<int> ind;
for (int i = 1; i <= n; i++) {
if (s[i - 1] == ')' || s[i - 1] == '#') {
seq[i] = seq[i - 1] - 1;
if (s[i - 1] == '#') {
ind.push_back(i - 1);
}
} else {
seq[i] = seq[i - 1] + 1;
}
if (seq[i] < 0) {
cout << -1 << endl;
return 0;
}
}
if (seq[n] == 0) {
for (int i = 0; i < ind.size(); i++) {
cout << 1 << endl;
}
} else {
seq[ind[ind.size() - 1]] -= seq[n];
int val = seq[n];
for (int i = ind[ind.size() - 1] + 1; i <= n; i++) {
if (s[i - 1] == ')' || s[i - 1] == '#') {
seq[i] = seq[i - 1] - 1;
} else {
seq[i] = seq[i - 1] + 1;
}
if (seq[i] < 0) {
cout << -1 << endl;
return 0;
}
}
for (int i = 0; i < (int)ind.size() - 1; i++) {
cout << 1 << endl;
}
cout << 1 + val << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string s;
int main() {
cin >> s;
int id = s.size() - 1;
while (s[id] != '#') id--;
int cnt = 0;
int bn = 0;
int ans = 1;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '(')
cnt++;
else if (s[i] == ')')
cnt--;
else {
bn++;
cnt--;
}
if (cnt < 0) {
cout << "-1\n";
return 0;
}
}
ans += cnt;
cnt = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '(')
cnt++;
else if (s[i] == ')')
cnt--;
else {
if (i != id)
cnt--;
else
cnt -= ans;
}
if (cnt < 0) {
cout << "-1\n";
return 0;
}
}
for (int i = 1; i < bn; i++) {
printf("1\n");
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int modpow(long long int a, long long int n, long long int temp) {
long long int res = 1, y = a;
while (n > 0) {
if (n & 1) res = (res * y) % temp;
y = (y * y) % temp;
n /= 2;
}
return res % temp;
}
char ch[1000006];
int arr[1000006];
stack<int> stk;
int main() {
int i, len, flg = 1, c = 0, cnt = 0, flag, val, sz, j;
scanf("%s", ch);
len = strlen(ch);
for (i = 0; i < len; ++i) {
if (ch[i] == '#') cnt++;
}
for (i = 0; i < len; ++i) {
if (ch[i] == '(')
stk.push(1);
else if (ch[i] == '#') {
stk.push(2);
} else {
flag = 1;
c = 0;
while (!(stk.empty())) {
val = stk.top();
stk.pop();
if (val == 1) {
flag = 0;
break;
} else if (val == 2) {
c++;
}
}
if (flag == 1) {
flg = 0;
break;
} else {
for (j = 0; j < c; ++j) {
stk.push(2);
}
}
}
}
if (flg == 0) {
printf("-1\n");
return 0;
} else {
sz = stk.size();
c = 0;
for (i = 0; i < sz; ++i) {
arr[i] = stk.top();
stk.pop();
if (arr[i] == 2) c++;
}
if (c != cnt) {
return 1;
}
if (arr[0] != 2) {
printf("-1\n");
return 0;
}
cnt = 0;
flag = 0;
for (i = sz - 1; i >= 0; i--) {
if (arr[i] == 1) {
cnt++;
} else {
if (cnt == 0) {
flag = 1;
break;
}
cnt--;
}
}
if (flag) {
printf("-1\n");
return 0;
}
cnt = 0;
for (i = sz - 1; i > 0; i--) {
if (arr[i] == 1) {
cnt++;
} else {
printf("1\n");
cnt--;
}
}
if (cnt == 0)
printf("-1\n");
else
printf("%d\n", cnt);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100100;
int n;
char s[MAXN];
vector<int> ans;
string str;
void read() { scanf("%s", &s); }
void solve() {
n = strlen(s);
int totalOpen = 0, totalClose = 0, totalSharp = 0;
for (int i = 0; i < n; i++)
if (s[i] == '(')
totalOpen++;
else if (s[i] == ')')
totalClose++;
else
totalSharp++;
if (totalClose + totalSharp > totalOpen) {
cout << "-1\n";
return;
}
int balance = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '(')
balance++;
else if (s[i] == ')') {
balance--;
if (balance < 0) {
cout << "-1\n";
return;
}
} else {
if (balance == 0) {
cout << "-1\n";
return;
}
ans.push_back(1);
balance--;
}
}
ans[(int)ans.size() - 1] += balance;
int index = 0;
for (int i = 0; i < n; i++) {
if (s[i] != '#')
str.push_back(s[i]);
else {
for (int j = 0; j < ans[index]; j++) str.push_back(')');
index++;
}
}
balance = 0;
for (int i = 0; i < (int)str.size(); i++) {
if (str[i] == '(')
balance++;
else
balance--;
if (balance < 0) {
cout << "-1\n";
return;
}
}
for (int i = 0; i < (int)ans.size(); i++) printf("%d\n", ans[i]);
}
int main() {
read();
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char s[100001];
int main() {
int l, cnt = 0, n = 0, p;
scanf("%s", s);
l = strlen(s);
for (int i = 0; i < l; i++) {
if (s[i] == '(') {
cnt++;
} else if (s[i] == ')') {
cnt--;
} else {
n++;
p = i;
s[i] = ')';
}
}
if (n > cnt) {
printf("-1\n");
} else {
int crt = 0;
for (int i = 0; i < l && crt >= 0; i++) {
if (s[i] == '(') {
crt++;
} else {
crt--;
}
if (p == i) {
crt -= cnt - n;
}
}
if (crt < 0) {
printf("-1\n");
} else {
for (int i = 1; i < n; i++) {
printf("1\n");
}
printf("%d\n", cnt - n + 1);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int a[100010];
int main() {
long long int c = 0, flag = 0, o = 0;
string s;
cin >> s;
long long int n = s.length(), l = 0;
vector<long long int> v;
if (s[n - 1] == '(')
cout << "-1";
else {
for (long long int i = 0; i < n; i++) {
if (s[i] == '#') {
c++;
}
}
for (long long int i = 0; i < n; i++) {
if (s[i] == '(') {
o++;
l++;
} else if (s[i] == ')') {
l--;
if (o > 0) o--;
} else {
o = 0;
l--;
}
if (l < 0) {
flag = 1;
break;
}
}
if (flag || o > 0)
cout << "-1";
else {
for (long long int i = 0; i < c - 1; i++) cout << "1" << endl;
cout << l + 1 << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1000000007;
const int INF = 2147483647;
vector<int> solve(string& s) {
int n, i, j, a, b;
n = s.size();
a = b = 0;
j = -1;
vector<int> ans;
for (i = n - 1; i >= 0; --i) {
if (s[i] == '(') {
++b;
} else if (s[i] == ')') {
--b;
} else {
j = i;
break;
}
if (b > 0) return ans;
}
for (i = 0; i < j; ++i) {
if (s[i] == '#') {
s[i] = ')';
ans.push_back(1);
}
}
for (i = 0; i <= j; ++i) {
if (s[i] == '(') {
++a;
} else if (s[i] == ')') {
--a;
} else {
a += b;
if (a < 1) {
a = 1;
break;
}
ans.push_back(a);
a = 0;
}
if (a < 0) break;
}
if (a) ans.clear();
return ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
string s;
cin >> s;
vector<int> ans = solve(s);
if (ans.empty()) cout << -1 << "\n";
for (auto x : ans) cout << x << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int pos = -1;
int t1 = 0, t2 = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '(')
t1++;
else
t1--;
if (s[i] == '#') pos = i;
}
if (t1 < 0) {
cout << -1;
return 0;
}
t1++;
for (int i = 0; i < s.size(); i++) {
if (i == pos)
t2 -= t1;
else if (s[i] == '(')
t2++;
else
t2--;
if (t2 < 0) {
cout << -1;
return 0;
}
}
for (int i = 0; i < s.size(); i++)
if (s[i] == '#')
if (i == pos)
cout << t1 << endl;
else
cout << 1 << endl;
;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<long long> V;
string S;
cin >> S;
long long L = 0;
int a = S.size(), b;
while (S[a] != ')' && a + 1) {
a--;
}
b = a;
while (S[b] != '(' && b + 1) {
b--;
}
while (b + 1) {
S[a] = S[b] = '*';
while (S[a] != ')' && a + 1) {
a--;
}
if (b > a) {
b = a;
}
while (S[b] != '(' && b + 1) {
b--;
}
}
for (int i = 0; i < S.size(); i++) {
if (S[i] == '(') {
L++;
} else if (S[i] == ')') {
cout << "-1";
return 0;
} else if (S[i] == '#') {
V.push_back(L);
L = 0;
}
}
if (L) {
cout << "-1";
return 0;
}
long long something = 0;
for (int i = 0; i < V.size() - 1; i++) {
if (V[i]) {
something += V[i] - 1;
V[i] = 1;
} else {
if (!something) {
cout << "-1";
return 0;
} else {
V[i] = 1;
something--;
}
}
}
V[V.size() - 1] += something;
if (!V[V.size() - 1]) {
cout << "-1";
return 0;
} else {
for (int i = 0; i < V.size(); i++) {
cout << V[i] << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string input;
cin >> input;
vector<int> hash_values;
int count_hash = 0;
int count_hash1 = 0;
int diff = 0;
for (int i = 0; i < input.size(); i++) {
if (input[i] == '(')
diff++;
else if (input[i] == ')')
diff--;
else {
count_hash++;
count_hash1++;
}
}
if ((diff <= 0) || (abs(diff) < count_hash)) {
cout << "-1" << endl;
return 0;
}
int update_diff = 0;
int last = 0;
for (int i = 0; i < input.size(); i++) {
if (input[i] == '(')
update_diff++;
else if (input[i] == ')')
update_diff--;
else if (count_hash > 1) {
count_hash--;
update_diff--;
diff--;
if (update_diff < 0) {
cout << "-1" << endl;
return 0;
}
} else {
int test = 0;
int till_now = 0;
for (int j = 0; j < input.size(); j++) {
if (input[j] == '(')
test++;
else if (input[j] == ')')
test--;
else {
till_now++;
if (till_now == count_hash1) {
test -= diff;
} else {
test--;
}
}
if (test < 0) {
cout << "-1" << endl;
return 0;
}
}
break;
}
}
for (int i = 0; i < count_hash1 - 1; i++) {
cout << 1 << endl;
}
cout << diff << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
inline bool ascending(int i, int j) { return (i < j); }
inline bool descending(int i, int j) { return (i > j); }
const int MN = 1000 + 10;
const double maxn = 1e15;
int comp(const void *a, const void *b) { return (*(int *)a - *(int *)b); }
int main() {
string s;
cin >> s;
int tek = 0, index = 0, tek1 = 0;
for (__typeof(0) i = 0; i != int(s.size()); i++) {
if (tek < 0) {
cout << -1 << endl;
return 0;
}
if (s[i] == '(')
++tek;
else if (s[i] == ')')
--tek;
else
tek--, ++index;
}
if (tek < 0) {
cout << -1 << endl;
return 0;
}
for (int i = int(s.size()) - 1; i >= 0; --i) {
if (tek1 > 0) {
cout << -1 << endl;
return 0;
}
if (s[i] == '#') break;
if (s[i] == '(')
++tek1;
else if (s[i] == ')')
--tek1;
}
if (tek1 > 0) {
cout << -1 << endl;
return 0;
}
for (__typeof(0) i = 0; i != index - 1; i++) {
cout << 1 << endl;
}
cout << tek + 1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string s;
vector<int> v;
int main() {
cin >> s;
int n = s.length();
int last = -1;
for (int i = 0; i < n; i++)
if (s[i] == '#') {
v.push_back(1);
last = i;
}
bool good = 1;
int tmp = 0;
for (int i = n - 1; i >= 0; i--) {
if (s[i] == ')') {
tmp++;
} else if (s[i] == '(') {
tmp--;
if (tmp == -1) {
if (i > last) {
good = 0;
break;
}
v.back()++;
tmp++;
}
} else {
tmp++;
}
}
if (!good || tmp > 0)
cout << -1 << endl;
else
for (int i = 0; i < v.size(); i++) cout << v[i] << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string s;
int ar[100002];
int main() {
int n, i, j, l = 0, r = 0, sum = 0, ok = 1, now = 0, f = -1, sum1 = 0,
ok1 = 0;
cin >> s;
int len = s.size();
for (i = len - 1; i >= 0; i--) {
if (s[i] == '#') {
f = i;
break;
}
}
for (i = 0; i <= f; i++) {
if (s[i] == '(')
l++, sum++;
else if (s[i] == ')') {
if (sum <= 0) {
ok = 0;
break;
}
r++;
sum--;
} else if (s[i] == '#') {
if (sum >= 1) {
ar[++now] = 1;
r++;
sum--;
} else {
ok = 0;
break;
}
}
}
for (i = len - 1; 1; i--) {
if (s[i] == '#') {
f = i;
break;
}
}
sum1 = 0;
if (f != -1) {
for (i = f + 1; i < len; i++) {
if (s[i] == '(')
sum1++, ok1++;
else {
sum1--;
if (ok1 > 0) ok1--;
}
}
sum++;
if (ok1 >= 1) ok = 0;
if (sum + sum1 <= 0)
ok = 0;
else
ar[now] = sum + sum1;
}
if (ok) {
for (i = 1; i <= now; i++) cout << ar[i] << endl;
} else
cout << -1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
int numright = 0;
int numleft = 0;
int numhash = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '(') {
numleft++;
} else if (s[i] == ')') {
numright++;
}
if (s[i] == '#') {
numhash++;
}
}
int re = abs(numleft - numright);
if (re < numhash) {
cout << -1 << endl;
} else {
vector<int> v;
vector<int> l(n, 0);
vector<int> r(n, 0);
int hash = 0;
if (s[0] == '(') {
l[0] = 1;
} else {
cout << -1 << endl;
return 0;
}
for (int i = 1; i < n; i++) {
if (s[i] == '(') {
l[i] = l[i - 1] + 1;
r[i] = r[i - 1];
} else if (s[i] == ')') {
r[i] = r[i - 1] + 1;
l[i] = l[i - 1];
} else {
hash++;
if (hash == numhash) {
int xx = numleft - numright;
xx -= numhash;
xx++;
r[i] = xx + r[i - 1];
l[i] = l[i - 1];
v.push_back(xx);
} else {
r[i] = r[i - 1] + 1;
l[i] = l[i - 1];
v.push_back(1);
}
}
}
for (int i = 0; i < n; i++) {
if (l[i] < r[i]) {
cout << -1 << endl;
return 0;
}
}
for (int i = 0; i < v.size(); i++) {
cout << v[i] << endl;
}
}
}
|
#include <bits/stdc++.h>
char p[101000];
int main() {
int i, c = 0, t, s = 0;
scanf("%s", p);
for (i = 0; p[i]; i++) {
if (p[i] == '(') c++;
if (p[i] == '#' || p[i] == ')') {
c--;
}
if (p[i] == '#') t = i;
if (c < 0) break;
}
if (p[i]) {
printf("-1\n");
} else {
for (i = 0; p[i]; i++) {
if (p[i] == '#') {
if (i == t) {
s -= (1 + c);
} else
s--;
} else if (p[i] == ')')
s--;
else
s++;
if (s < 0) break;
}
if (p[i]) {
printf("-1\n");
} else {
for (i = 0; p[i]; i++) {
if (p[i] == '#') {
if (i == t) {
printf("%d\n", 1 + c);
} else
printf("1\n");
}
}
}
}
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.