oj.uz

Submission #537557

# Submission time Handle Problem Language Result Execution time Memory
537557 2022-03-15T08:29:10 Z maomao90 Security Gate (JOI18_security_gate) C++17
12 / 100
 5000 ms 324 KB 
// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h> 
using namespace std;

template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}
#define REP(i, s, e) for (int i = s; i < e; i++)
#define RREP(i, s, e) for (int i = s; i >= e; i--)
typedef long long ll;
typedef long double ld;
#define MP make_pair
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
#define MT make_tuple
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;

#ifndef DEBUG
#define cerr if (0) cerr
#endif

#define INF 1000000005
#define LINF 1000000000000000005ll
#define MAXN 305
#define MOD 1000000007

int n;
string s;
int ans;

int main() {
#ifndef DEBUG
    ios::sync_with_stdio(0), cin.tie(0);
#endif
    cin >> n;
    cin >> s;
    int x = 0;
    REP (i, 0, n) {
        if (s[i] == 'x') x++;
    }
    REP (m, 0, 1 << x) {
        int j = 0;
        vi v(n, 0);
        int sm = 0;
        REP (i, 0, n) {
            char c = s[i];
            if (c == 'x') {
                c = (m >> j & 1) ? '(' : ')';
                j++;
            }
            v[i] = c == '(' ? 1 : -1;
            sm += v[i];
        }
        if (sm % 2 == 1) continue;
        bool pos = 0;
        REP (i, 0, n) {
            REP (j, i - 1, n) {
                int sm = 0;
                REP (k, 0, n) {
                    int x = v[k];
                    if (k >= i && k <= j) {
                        x *= -1;
                    }
                    sm += x;
                    if (sm < 0) {
                        break;
                    }
                }
                if (sm == 0) {
                    pos = 1;
                    break;
                }
            }
            if (pos) {
                break;
            }
        }
        if (pos) {
            ans++;
        }
    }
    cout << ans << '\n';
    return 0;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 316 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 324 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 2 ms 316 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 316 KB Output is correct
16 Correct 1 ms 320 KB Output is correct
17 Correct 1 ms 212 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 316 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 324 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 2 ms 316 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 316 KB Output is correct
16 Correct 1 ms 320 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 9 ms 232 KB Output is correct
20 Correct 6 ms 320 KB Output is correct
21 Correct 489 ms 304 KB Output is correct
22 Correct 482 ms 212 KB Output is correct
23 Correct 7 ms 212 KB Output is correct
24 Correct 432 ms 296 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 5 ms 212 KB Output is correct
27 Correct 334 ms 300 KB Output is correct
28 Correct 14 ms 212 KB Output is correct
29 Correct 3 ms 212 KB Output is correct
30 Correct 9 ms 212 KB Output is correct
31 Correct 57 ms 304 KB Output is correct

Subtask #3
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 316 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 324 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 2 ms 316 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 316 KB Output is correct
16 Correct 1 ms 320 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 9 ms 232 KB Output is correct
20 Correct 6 ms 320 KB Output is correct
21 Correct 489 ms 304 KB Output is correct
22 Correct 482 ms 212 KB Output is correct
23 Correct 7 ms 212 KB Output is correct
24 Correct 432 ms 296 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 5 ms 212 KB Output is correct
27 Correct 334 ms 300 KB Output is correct
28 Correct 14 ms 212 KB Output is correct
29 Correct 3 ms 212 KB Output is correct
30 Correct 9 ms 212 KB Output is correct
31 Correct 57 ms 304 KB Output is correct
32 Correct 106 ms 300 KB Output is correct
33 Correct 26 ms 212 KB Output is correct
34 Correct 2457 ms 296 KB Output is correct
35 Correct 53 ms 300 KB Output is correct
36 Correct 793 ms 300 KB Output is correct
37 Execution timed out 5094 ms 212 KB Time limit exceeded
38 Halted 0 ms 0 KB -

Subtask #4
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 316 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 324 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 2 ms 316 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 316 KB Output is correct
16 Correct 1 ms 320 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 9 ms 232 KB Output is correct
20 Correct 6 ms 320 KB Output is correct
21 Correct 489 ms 304 KB Output is correct
22 Correct 482 ms 212 KB Output is correct
23 Correct 7 ms 212 KB Output is correct
24 Correct 432 ms 296 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 5 ms 212 KB Output is correct
27 Correct 334 ms 300 KB Output is correct
28 Correct 14 ms 212 KB Output is correct
29 Correct 3 ms 212 KB Output is correct
30 Correct 9 ms 212 KB Output is correct
31 Correct 57 ms 304 KB Output is correct
32 Correct 106 ms 300 KB Output is correct
33 Correct 26 ms 212 KB Output is correct
34 Correct 2457 ms 296 KB Output is correct
35 Correct 53 ms 300 KB Output is correct
36 Correct 793 ms 300 KB Output is correct
37 Execution timed out 5094 ms 212 KB Time limit exceeded
38 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 316 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 324 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 2 ms 316 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 316 KB Output is correct
16 Correct 1 ms 320 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 9 ms 232 KB Output is correct
20 Correct 6 ms 320 KB Output is correct
21 Correct 489 ms 304 KB Output is correct
22 Correct 482 ms 212 KB Output is correct
23 Correct 7 ms 212 KB Output is correct
24 Correct 432 ms 296 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 5 ms 212 KB Output is correct
27 Correct 334 ms 300 KB Output is correct
28 Correct 14 ms 212 KB Output is correct
29 Correct 3 ms 212 KB Output is correct
30 Correct 9 ms 212 KB Output is correct
31 Correct 57 ms 304 KB Output is correct
32 Correct 106 ms 300 KB Output is correct
33 Correct 26 ms 212 KB Output is correct
34 Correct 2457 ms 296 KB Output is correct
35 Correct 53 ms 300 KB Output is correct
36 Correct 793 ms 300 KB Output is correct
37 Execution timed out 5094 ms 212 KB Time limit exceeded
38 Halted 0 ms 0 KB -