oj.uz

답안 #77701

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
77701 2018-09-29T20:28:32 Z duality 괄호 문자열 (CEOI16_match) C++11
10 / 100
 3 ms 508 KB 
#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 ----------

string s;
vector<char> S;
int yes[100000];
int findAns(int l,int r) {
    if (l > r) return 0;
    int i;
    vi pos;
    for (i = r; i >= l; i--) {
        if (S.empty() && (s[l] == s[i])) break;
        else if (S.empty()) pos.pb(i);
        if (!S.empty() && (S.back() == s[i])) S.pop_back();
        else S.pb(s[i]);
    }
    yes[l] = 1,yes[i] = 0;
    findAns(l+1,i-1);
    int p = i+1;
    for (i = (int) pos.size()-1; i >= 0; i--) {
        if (s[p] == s[pos[i]]) {
            yes[p] = 1,yes[pos[i]] = 0;
            findAns(p+1,pos[i]-1);
            if (pos[i]+1 <= r) p = pos[i]+1;
        }
    }
    return 0;
}
int main() {
    cin >> s;

    int i;
    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;
    }
    findAns(0,s.size()-1);
    for (i = 0; i < s.size(); i++) {
        if (yes[i]) cout << '(';
        else cout << ')';
    }
    cout << endl;

    return 0;
}

Compilation message

match.cpp: In function 'int main()':
match.cpp:87:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < s.size(); i++) {
                 ~~^~~~~~~~~~
match.cpp:96:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < s.size(); i++) {
                 ~~^~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 508 KB Output is correct
3 Correct 2 ms 508 KB Output is correct

Subtask #2
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 508 KB Output is correct
3 Correct 2 ms 508 KB Output is correct
4 Incorrect 3 ms 508 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 63.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 508 KB Output is correct
3 Correct 2 ms 508 KB Output is correct
4 Incorrect 3 ms 508 KB Output isn't correct
5 Halted 0 ms 0 KB -