oj.uz

Submission #64864

# Submission time Handle Problem Language Result Execution time Memory
64864 2018-08-06T00:19:15 Z Benq Security Gate (JOI18_security_gate) C++11
12 / 100
 5000 ms 1012 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;

int n,ans;
string s;

/*void search(int ind, int mn, int mx, int mndif, int mxdif, int cur) {
    mn = min(mn,cur), mx = max(mx,cur);
    mxdif = max(mxdif,cur-mn);
    mndif = min(mndif,cur-mx);
    if (ind == sz(s)) {
        if (cur-2*mxdif <= 0 && cur-2*mndif >= 0) ans ++;
        return;
    }
    if (s[ind] != '(') search(ind+1,mn,mx,mndif,mxdif,cur+1);
    if (s[ind] != ')') search(ind+1,mn,mx,mndif,mxdif,cur+1);
}*/

bool ok(string s) {
    F0R(i,sz(s)+1) FOR(j,i,sz(s)+1) {
        int sum = 0;
        F0R(k,sz(s)) {
            if (k < i || k >= j) sum += 2*(s[k] == '(')-1;
            else sum += 2*(s[k] != '(')-1;
            if (sum < 0) break;
        }
        if (sum == 0) return 1;
    }
    return 0;
}

void search(int ind) {
    if (ind == sz(s)) {
        if (ok(s)) ans ++;
        return;
    }
    if (s[ind] == 'x') {
        s[ind] = '(';
        search(ind+1);
        s[ind] = ')';
        search(ind+1);
        s[ind] = 'x';
    } else search(ind+1);
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> n >> s;
    if (n % 2 == 1) {
        cout << 0;
        exit(0);
    }
    // search(0,0,0,0,0,0);
    search(0);
    cout << ans;
}

/* 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
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 404 KB Output is correct
3 Correct 2 ms 460 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 3 ms 664 KB Output is correct
7 Correct 2 ms 664 KB Output is correct
8 Correct 4 ms 752 KB Output is correct
9 Correct 3 ms 752 KB Output is correct
10 Correct 3 ms 752 KB Output is correct
11 Correct 2 ms 752 KB Output is correct
12 Correct 3 ms 752 KB Output is correct
13 Correct 6 ms 752 KB Output is correct
14 Correct 3 ms 756 KB Output is correct
15 Correct 4 ms 760 KB Output is correct
16 Correct 2 ms 764 KB Output is correct
17 Correct 4 ms 768 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 404 KB Output is correct
3 Correct 2 ms 460 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 3 ms 664 KB Output is correct
7 Correct 2 ms 664 KB Output is correct
8 Correct 4 ms 752 KB Output is correct
9 Correct 3 ms 752 KB Output is correct
10 Correct 3 ms 752 KB Output is correct
11 Correct 2 ms 752 KB Output is correct
12 Correct 3 ms 752 KB Output is correct
13 Correct 6 ms 752 KB Output is correct
14 Correct 3 ms 756 KB Output is correct
15 Correct 4 ms 760 KB Output is correct
16 Correct 2 ms 764 KB Output is correct
17 Correct 4 ms 768 KB Output is correct
18 Correct 4 ms 772 KB Output is correct
19 Correct 14 ms 776 KB Output is correct
20 Correct 13 ms 780 KB Output is correct
21 Correct 650 ms 792 KB Output is correct
22 Correct 903 ms 916 KB Output is correct
23 Correct 9 ms 916 KB Output is correct
24 Correct 562 ms 980 KB Output is correct
25 Correct 3 ms 980 KB Output is correct
26 Correct 11 ms 980 KB Output is correct
27 Correct 552 ms 992 KB Output is correct
28 Correct 32 ms 992 KB Output is correct
29 Correct 6 ms 992 KB Output is correct
30 Correct 20 ms 992 KB Output is correct
31 Correct 88 ms 992 KB Output is correct

Subtask #3
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 404 KB Output is correct
3 Correct 2 ms 460 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 3 ms 664 KB Output is correct
7 Correct 2 ms 664 KB Output is correct
8 Correct 4 ms 752 KB Output is correct
9 Correct 3 ms 752 KB Output is correct
10 Correct 3 ms 752 KB Output is correct
11 Correct 2 ms 752 KB Output is correct
12 Correct 3 ms 752 KB Output is correct
13 Correct 6 ms 752 KB Output is correct
14 Correct 3 ms 756 KB Output is correct
15 Correct 4 ms 760 KB Output is correct
16 Correct 2 ms 764 KB Output is correct
17 Correct 4 ms 768 KB Output is correct
18 Correct 4 ms 772 KB Output is correct
19 Correct 14 ms 776 KB Output is correct
20 Correct 13 ms 780 KB Output is correct
21 Correct 650 ms 792 KB Output is correct
22 Correct 903 ms 916 KB Output is correct
23 Correct 9 ms 916 KB Output is correct
24 Correct 562 ms 980 KB Output is correct
25 Correct 3 ms 980 KB Output is correct
26 Correct 11 ms 980 KB Output is correct
27 Correct 552 ms 992 KB Output is correct
28 Correct 32 ms 992 KB Output is correct
29 Correct 6 ms 992 KB Output is correct
30 Correct 20 ms 992 KB Output is correct
31 Correct 88 ms 992 KB Output is correct
32 Correct 119 ms 1012 KB Output is correct
33 Correct 41 ms 1012 KB Output is correct
34 Correct 3332 ms 1012 KB Output is correct
35 Correct 68 ms 1012 KB Output is correct
36 Correct 1225 ms 1012 KB Output is correct
37 Execution timed out 5074 ms 1012 KB Time limit exceeded
38 Halted 0 ms 0 KB -

Subtask #4
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 404 KB Output is correct
3 Correct 2 ms 460 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 3 ms 664 KB Output is correct
7 Correct 2 ms 664 KB Output is correct
8 Correct 4 ms 752 KB Output is correct
9 Correct 3 ms 752 KB Output is correct
10 Correct 3 ms 752 KB Output is correct
11 Correct 2 ms 752 KB Output is correct
12 Correct 3 ms 752 KB Output is correct
13 Correct 6 ms 752 KB Output is correct
14 Correct 3 ms 756 KB Output is correct
15 Correct 4 ms 760 KB Output is correct
16 Correct 2 ms 764 KB Output is correct
17 Correct 4 ms 768 KB Output is correct
18 Correct 4 ms 772 KB Output is correct
19 Correct 14 ms 776 KB Output is correct
20 Correct 13 ms 780 KB Output is correct
21 Correct 650 ms 792 KB Output is correct
22 Correct 903 ms 916 KB Output is correct
23 Correct 9 ms 916 KB Output is correct
24 Correct 562 ms 980 KB Output is correct
25 Correct 3 ms 980 KB Output is correct
26 Correct 11 ms 980 KB Output is correct
27 Correct 552 ms 992 KB Output is correct
28 Correct 32 ms 992 KB Output is correct
29 Correct 6 ms 992 KB Output is correct
30 Correct 20 ms 992 KB Output is correct
31 Correct 88 ms 992 KB Output is correct
32 Correct 119 ms 1012 KB Output is correct
33 Correct 41 ms 1012 KB Output is correct
34 Correct 3332 ms 1012 KB Output is correct
35 Correct 68 ms 1012 KB Output is correct
36 Correct 1225 ms 1012 KB Output is correct
37 Execution timed out 5074 ms 1012 KB Time limit exceeded
38 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 404 KB Output is correct
3 Correct 2 ms 460 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 3 ms 664 KB Output is correct
7 Correct 2 ms 664 KB Output is correct
8 Correct 4 ms 752 KB Output is correct
9 Correct 3 ms 752 KB Output is correct
10 Correct 3 ms 752 KB Output is correct
11 Correct 2 ms 752 KB Output is correct
12 Correct 3 ms 752 KB Output is correct
13 Correct 6 ms 752 KB Output is correct
14 Correct 3 ms 756 KB Output is correct
15 Correct 4 ms 760 KB Output is correct
16 Correct 2 ms 764 KB Output is correct
17 Correct 4 ms 768 KB Output is correct
18 Correct 4 ms 772 KB Output is correct
19 Correct 14 ms 776 KB Output is correct
20 Correct 13 ms 780 KB Output is correct
21 Correct 650 ms 792 KB Output is correct
22 Correct 903 ms 916 KB Output is correct
23 Correct 9 ms 916 KB Output is correct
24 Correct 562 ms 980 KB Output is correct
25 Correct 3 ms 980 KB Output is correct
26 Correct 11 ms 980 KB Output is correct
27 Correct 552 ms 992 KB Output is correct
28 Correct 32 ms 992 KB Output is correct
29 Correct 6 ms 992 KB Output is correct
30 Correct 20 ms 992 KB Output is correct
31 Correct 88 ms 992 KB Output is correct
32 Correct 119 ms 1012 KB Output is correct
33 Correct 41 ms 1012 KB Output is correct
34 Correct 3332 ms 1012 KB Output is correct
35 Correct 68 ms 1012 KB Output is correct
36 Correct 1225 ms 1012 KB Output is correct
37 Execution timed out 5074 ms 1012 KB Time limit exceeded
38 Halted 0 ms 0 KB -