oj.uz

Submission #77700

# Submission time Handle Problem Language Result Execution time Memory
77700 2018-09-29T20:20:10 Z duality Match (CEOI16_match) C++11
37 / 100
 2000 ms 3720 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;
    for (i = r; i >= l; i--) {
        if (S.empty() && (s[l] == s[i])) break;
        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);
    findAns(i+1,r);
    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 yes[i] = 1,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:78:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < s.size(); i++) {
                 ~~^~~~~~~~~~
match.cpp:87:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < s.size(); i++) {
                 ~~^~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 2 ms 440 KB Output is correct

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 2 ms 440 KB Output is correct
4 Correct 2 ms 584 KB Output is correct
5 Correct 2 ms 584 KB Output is correct
6 Correct 2 ms 584 KB Output is correct
7 Correct 3 ms 584 KB Output is correct

Subtask #3
0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 2 ms 440 KB Output is correct
4 Correct 2 ms 584 KB Output is correct
5 Correct 2 ms 584 KB Output is correct
6 Correct 2 ms 584 KB Output is correct
7 Correct 3 ms 584 KB Output is correct
8 Correct 4 ms 596 KB Output is correct
9 Correct 11 ms 724 KB Output is correct
10 Correct 5 ms 740 KB Output is correct
11 Correct 4 ms 756 KB Output is correct
12 Correct 97 ms 1956 KB Output is correct
13 Correct 45 ms 2308 KB Output is correct
14 Correct 619 ms 2752 KB Output is correct
15 Correct 11 ms 3428 KB Output is correct
16 Correct 14 ms 3504 KB Output is correct
17 Correct 79 ms 3720 KB Output is correct
18 Correct 16 ms 3720 KB Output is correct
19 Correct 1024 ms 3720 KB Output is correct
20 Correct 414 ms 3720 KB Output is correct
21 Execution timed out 2055 ms 3720 KB Time limit exceeded