oj.uz

Submission #61864

# Submission time Handle Problem Language Result Execution time Memory
61864 2018-07-27T01:23:45 Z Benq Match (CEOI16_match) C++11
37 / 100
 2000 ms 1324 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 100001;

string x;
char ans[MX];

bool ok(string t) {
    vi v;
    F0R(i,sz(t)) {
        if (t[i] == '(') v.pb(i);
        else {
            if (!sz(v) || x[v.back()] != x[i]) return 0;
            v.pop_back();
        }
    }
    FOR(i,sz(t),sz(x)) {
        if (sz(v) && x[v.back()] == x[i]) v.pop_back();
        else v.pb(i);
    }
    return sz(v) == 0;
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> x;
    string cur = "";
    if (!ok(cur)) {
        cout << -1;
        exit(0);
    }
    F0R(i,sz(x)) {
        cur += '(';
        if (!ok(cur)) cur.back() = ')';
    }
    cout << cur;
}

/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( ) 
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 3 ms 488 KB Output is correct
3 Correct 3 ms 488 KB Output is correct

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 3 ms 488 KB Output is correct
3 Correct 3 ms 488 KB Output is correct
4 Correct 8 ms 548 KB Output is correct
5 Correct 7 ms 548 KB Output is correct
6 Correct 12 ms 572 KB Output is correct
7 Correct 18 ms 576 KB Output is correct

Subtask #3
0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 3 ms 488 KB Output is correct
3 Correct 3 ms 488 KB Output is correct
4 Correct 8 ms 548 KB Output is correct
5 Correct 7 ms 548 KB Output is correct
6 Correct 12 ms 572 KB Output is correct
7 Correct 18 ms 576 KB Output is correct
8 Correct 225 ms 784 KB Output is correct
9 Correct 246 ms 784 KB Output is correct
10 Correct 209 ms 816 KB Output is correct
11 Correct 195 ms 932 KB Output is correct
12 Execution timed out 2047 ms 1324 KB Time limit exceeded
13 Halted 0 ms 0 KB -