oj.uz

Submission #77850

# Submission time Handle Problem Language Result Execution time Memory
77850 2018-09-30T20:02:06 Z duality Match (CEOI16_match) C++11
100 / 100
 37 ms 21512 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 trie[100001][26],parent[100001],num = 0;
int pos[100000][26],best[100000][26];
int findAns(int l,int r) {
    if (l > r) return 0;
    int p = best[r][s[l]-'a'];
    s[l] = '(',s[p] = ')';
    findAns(l+1,p-1),findAns(p+1,r);
    return 0;
}
int main() {
    cin >> s;

    int i,j,c = 0;
    for (i = 0; i < s.size(); i++) {
        if (!S.empty() && (S.back() == s[i])) c = parent[c],S.pop_back();
        else {
            if (trie[c][s[i]-'a'] == 0) trie[c][s[i]-'a'] = ++num,parent[num] = c;
            c = trie[c][s[i]-'a'],S.pb(s[i]);
        }
        pos[c][s[i]-'a'] = i;
        for (j = 0; j < 26; j++) best[i][j] = pos[c][j];
    }
    if (!S.empty()) {
        cout << -1 << endl;
        return 0;
    }
    findAns(0,s.size()-1);
    cout << s << endl;

    return 0;
}

Compilation message

match.cpp: In function 'int main()':
match.cpp:73: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 500 KB Output is correct
3 Correct 2 ms 584 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 500 KB Output is correct
3 Correct 2 ms 584 KB Output is correct
4 Correct 2 ms 648 KB Output is correct
5 Correct 2 ms 688 KB Output is correct
6 Correct 2 ms 820 KB Output is correct
7 Correct 2 ms 980 KB Output is correct

Subtask #3
63.0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 500 KB Output is correct
3 Correct 2 ms 584 KB Output is correct
4 Correct 2 ms 648 KB Output is correct
5 Correct 2 ms 688 KB Output is correct
6 Correct 2 ms 820 KB Output is correct
7 Correct 2 ms 980 KB Output is correct
8 Correct 3 ms 1652 KB Output is correct
9 Correct 4 ms 1912 KB Output is correct
10 Correct 4 ms 2064 KB Output is correct
11 Correct 4 ms 2216 KB Output is correct
12 Correct 23 ms 13632 KB Output is correct
13 Correct 20 ms 14980 KB Output is correct
14 Correct 21 ms 16088 KB Output is correct
15 Correct 15 ms 16088 KB Output is correct
16 Correct 16 ms 16088 KB Output is correct
17 Correct 25 ms 16088 KB Output is correct
18 Correct 18 ms 16088 KB Output is correct
19 Correct 26 ms 20848 KB Output is correct
20 Correct 21 ms 20848 KB Output is correct
21 Correct 37 ms 21512 KB Output is correct