#define DEBUG 0
#include <bits/stdc++.h>
using namespace std;
#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}
// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
public:
template<typename T>
_Debug& operator,(T val) {
cout << val << endl;
return *this;
}
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif
// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back
// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;
// ---------- END OF TEMPLATE ----------
vector<char> S,S2;
int main() {
string s;
cin >> s;
int i,j;
for (i = 0; i < s.size(); i++) {
if (!S.empty() && (S.back() == s[i])) S.pop_back();
else S.pb(s[i]);
}
if (!S.empty()) {
cout << -1 << endl;
return 0;
}
for (i = 0; i < s.size(); i++) {
S.pb(s[i]);
for (j = 0; j < S.size(); j++) S2.pb(S[j]);
for (j = i+1; j < s.size(); j++) {
if (!S2.empty() && (S2.back() == s[j])) S2.pop_back();
else S2.pb(s[j]);
}
if (!S2.empty()) cout << ')',S2.clear(),S.pop_back(),S.pop_back();
else cout << '(';
}
cout << endl;
return 0;
}
Compilation message
match.cpp: In function 'int main()':
match.cpp:64:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (i = 0; i < s.size(); i++) {
~~^~~~~~~~~~
match.cpp:72:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (i = 0; i < s.size(); i++) {
~~^~~~~~~~~~
match.cpp:74:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (j = 0; j < S.size(); j++) S2.pb(S[j]);
~~^~~~~~~~~~
match.cpp:75:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (j = i+1; j < s.size(); j++) {
~~^~~~~~~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
384 KB |
Output is correct |
3 |
Correct |
2 ms |
496 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
384 KB |
Output is correct |
3 |
Correct |
2 ms |
496 KB |
Output is correct |
4 |
Correct |
3 ms |
516 KB |
Output is correct |
5 |
Correct |
3 ms |
736 KB |
Output is correct |
6 |
Correct |
7 ms |
764 KB |
Output is correct |
7 |
Correct |
7 ms |
764 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
384 KB |
Output is correct |
3 |
Correct |
2 ms |
496 KB |
Output is correct |
4 |
Correct |
3 ms |
516 KB |
Output is correct |
5 |
Correct |
3 ms |
736 KB |
Output is correct |
6 |
Correct |
7 ms |
764 KB |
Output is correct |
7 |
Correct |
7 ms |
764 KB |
Output is correct |
8 |
Correct |
97 ms |
824 KB |
Output is correct |
9 |
Correct |
124 ms |
824 KB |
Output is correct |
10 |
Correct |
78 ms |
824 KB |
Output is correct |
11 |
Correct |
78 ms |
824 KB |
Output is correct |
12 |
Execution timed out |
2037 ms |
1260 KB |
Time limit exceeded |
13 |
Halted |
0 ms |
0 KB |
- |