oj.uz

답안 #989946

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
989946 2024-05-29T07:06:29 Z LucaIlie Homework (CEOI22_homework) C++17
53 / 100
 106 ms 56760 KB 
#include <iostream>
#include <stack>

using namespace std;
string s;
int cnt, n;
#define nmax 1000001

int lSon[nmax], rSon[nmax], parent[nmax], arb[nmax], minn[nmax], maxx[nmax], sizee[nmax];
// 0 - frunza, 1 - maxim, -1 - minim


int is_min( int i ) {
    if( s[i] == 'm' && s[i + 1] == 'i' && s[i + 2] == 'n' )
        return 1;
    return 0;
}

int is_max( int i ) {
    if( s[i] == 'm' && s[i + 1] == 'a' && s[i + 2] == 'x' )
        return 1;
    return 0;
}

void init( int l, int vf ) {
    if( l >= n )
        return;
    //cout << l << " " << vf << "\n";
    if( is_min( l ) ) {
        arb[vf] = -1;
        cnt++;
        lSon[vf] = cnt;
        parent[cnt] = vf;
        init( l + 4, cnt );
    } else if( is_max( l ) ) {
        arb[vf] = 1;
        cnt++;
        lSon[vf] = cnt;
        parent[cnt] = vf;
        init( l + 4, cnt );
    } else if( s[l] == ',' ) {
        cnt++;
        parent[cnt] = parent[vf];
        rSon[parent[vf]] = cnt;
        init( l + 1, cnt );
    } else if( s[l] == ')' ) {
        init( l + 1, parent[vf] );
    } else {
        init( l + 1, vf );
    }
}

void dfs( int vf ) {
    if( arb[vf] == 0 ) {
        sizee[vf] = 1;
        minn[vf] = maxx[vf] = 1;
        //cout << vf << " " << arb[vf];
        //cout << "\n";
        return;
    }
    dfs( lSon[vf] );
    dfs( rSon[vf] );
    sizee[vf] = sizee[lSon[vf]] + sizee[rSon[vf]];
    if( arb[vf] == -1 ) {
        minn[vf] = min( minn[lSon[vf]], minn[rSon[vf]] );
        maxx[vf] = maxx[lSon[vf]] + maxx[rSon[vf]] - 1;
    } else {
        minn[vf] = minn[lSon[vf]] + minn[rSon[vf]];
        maxx[vf] = max( sizee[lSon[vf]] + maxx[rSon[vf]], sizee[rSon[vf]] + maxx[lSon[vf]] );
    }
    //cout << vf << " " << arb[vf] << " ";
    //cout << maxx[vf] << " " << minn[vf] << " " << sizee[vf] << "\n";
}

int main() {
    cin >> s;
    n = s.size();
    cnt = 1;
    init( 0, 1 );
    dfs( 1 );
    cout << 1 - minn[1] + maxx[1];
    return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 12636 KB Output is correct
2 Correct 1 ms 12636 KB Output is correct
3 Correct 1 ms 12636 KB Output is correct
4 Correct 1 ms 12632 KB Output is correct
5 Correct 1 ms 12636 KB Output is correct
6 Correct 1 ms 12636 KB Output is correct
7 Correct 1 ms 12636 KB Output is correct
8 Correct 1 ms 12636 KB Output is correct
9 Correct 1 ms 12636 KB Output is correct
10 Correct 1 ms 12636 KB Output is correct
11 Correct 1 ms 12632 KB Output is correct
12 Correct 1 ms 12636 KB Output is correct
13 Correct 2 ms 12636 KB Output is correct
14 Correct 1 ms 12636 KB Output is correct
15 Correct 1 ms 12636 KB Output is correct
16 Correct 2 ms 12636 KB Output is correct
17 Correct 1 ms 12636 KB Output is correct
18 Correct 1 ms 12732 KB Output is correct
19 Correct 1 ms 12636 KB Output is correct
20 Correct 1 ms 12636 KB Output is correct
21 Correct 1 ms 12636 KB Output is correct
22 Correct 2 ms 12636 KB Output is correct
23 Correct 1 ms 12636 KB Output is correct
24 Correct 1 ms 12636 KB Output is correct
25 Correct 1 ms 12636 KB Output is correct
26 Correct 1 ms 12636 KB Output is correct
27 Correct 1 ms 12636 KB Output is correct
28 Correct 1 ms 12636 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 12636 KB Output is correct
2 Correct 1 ms 12636 KB Output is correct
3 Correct 1 ms 12636 KB Output is correct
4 Correct 1 ms 12632 KB Output is correct
5 Correct 1 ms 12636 KB Output is correct
6 Correct 1 ms 12636 KB Output is correct
7 Correct 1 ms 12636 KB Output is correct
8 Correct 1 ms 12636 KB Output is correct
9 Correct 1 ms 12636 KB Output is correct
10 Correct 1 ms 12636 KB Output is correct
11 Correct 1 ms 12632 KB Output is correct
12 Correct 1 ms 12636 KB Output is correct
13 Correct 2 ms 12636 KB Output is correct
14 Correct 1 ms 12636 KB Output is correct
15 Correct 1 ms 12636 KB Output is correct
16 Correct 2 ms 12636 KB Output is correct
17 Correct 1 ms 12636 KB Output is correct
18 Correct 1 ms 12732 KB Output is correct
19 Correct 1 ms 12636 KB Output is correct
20 Correct 1 ms 12636 KB Output is correct
21 Correct 1 ms 12636 KB Output is correct
22 Correct 2 ms 12636 KB Output is correct
23 Correct 1 ms 12636 KB Output is correct
24 Correct 1 ms 12636 KB Output is correct
25 Correct 1 ms 12636 KB Output is correct
26 Correct 1 ms 12636 KB Output is correct
27 Correct 1 ms 12636 KB Output is correct
28 Correct 1 ms 12636 KB Output is correct
29 Correct 1 ms 12636 KB Output is correct
30 Correct 1 ms 12636 KB Output is correct
31 Correct 1 ms 12636 KB Output is correct
32 Correct 1 ms 12636 KB Output is correct
33 Correct 1 ms 12636 KB Output is correct
34 Correct 1 ms 12636 KB Output is correct
35 Correct 1 ms 12636 KB Output is correct
36 Correct 1 ms 12736 KB Output is correct
37 Correct 1 ms 12636 KB Output is correct
38 Correct 1 ms 12636 KB Output is correct
39 Correct 1 ms 12636 KB Output is correct
40 Correct 1 ms 12636 KB Output is correct
41 Correct 1 ms 12728 KB Output is correct
42 Correct 2 ms 12636 KB Output is correct
43 Correct 2 ms 12636 KB Output is correct
44 Correct 1 ms 12636 KB Output is correct
45 Correct 1 ms 12636 KB Output is correct
46 Correct 1 ms 12636 KB Output is correct
47 Correct 1 ms 12732 KB Output is correct
48 Correct 1 ms 12636 KB Output is correct
49 Correct 1 ms 12636 KB Output is correct
50 Correct 1 ms 12636 KB Output is correct
51 Correct 1 ms 12636 KB Output is correct
52 Correct 1 ms 12636 KB Output is correct
53 Correct 1 ms 12632 KB Output is correct
54 Correct 1 ms 12636 KB Output is correct
55 Correct 1 ms 12632 KB Output is correct
56 Correct 1 ms 12636 KB Output is correct

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 106 ms 56760 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 12636 KB Output is correct
2 Correct 1 ms 12636 KB Output is correct
3 Correct 1 ms 12636 KB Output is correct
4 Correct 1 ms 12632 KB Output is correct
5 Correct 1 ms 12636 KB Output is correct
6 Correct 1 ms 12636 KB Output is correct
7 Correct 1 ms 12636 KB Output is correct
8 Correct 1 ms 12636 KB Output is correct
9 Correct 1 ms 12636 KB Output is correct
10 Correct 1 ms 12636 KB Output is correct
11 Correct 1 ms 12632 KB Output is correct
12 Correct 1 ms 12636 KB Output is correct
13 Correct 2 ms 12636 KB Output is correct
14 Correct 1 ms 12636 KB Output is correct
15 Correct 1 ms 12636 KB Output is correct
16 Correct 2 ms 12636 KB Output is correct
17 Correct 1 ms 12636 KB Output is correct
18 Correct 1 ms 12732 KB Output is correct
19 Correct 1 ms 12636 KB Output is correct
20 Correct 1 ms 12636 KB Output is correct
21 Correct 1 ms 12636 KB Output is correct
22 Correct 2 ms 12636 KB Output is correct
23 Correct 1 ms 12636 KB Output is correct
24 Correct 1 ms 12636 KB Output is correct
25 Correct 1 ms 12636 KB Output is correct
26 Correct 1 ms 12636 KB Output is correct
27 Correct 1 ms 12636 KB Output is correct
28 Correct 1 ms 12636 KB Output is correct
29 Correct 1 ms 12636 KB Output is correct
30 Correct 1 ms 12636 KB Output is correct
31 Correct 1 ms 12636 KB Output is correct
32 Correct 1 ms 12636 KB Output is correct
33 Correct 1 ms 12636 KB Output is correct
34 Correct 1 ms 12636 KB Output is correct
35 Correct 1 ms 12636 KB Output is correct
36 Correct 1 ms 12736 KB Output is correct
37 Correct 1 ms 12636 KB Output is correct
38 Correct 1 ms 12636 KB Output is correct
39 Correct 1 ms 12636 KB Output is correct
40 Correct 1 ms 12636 KB Output is correct
41 Correct 1 ms 12728 KB Output is correct
42 Correct 2 ms 12636 KB Output is correct
43 Correct 2 ms 12636 KB Output is correct
44 Correct 1 ms 12636 KB Output is correct
45 Correct 1 ms 12636 KB Output is correct
46 Correct 1 ms 12636 KB Output is correct
47 Correct 1 ms 12732 KB Output is correct
48 Correct 1 ms 12636 KB Output is correct
49 Correct 1 ms 12636 KB Output is correct
50 Correct 1 ms 12636 KB Output is correct
51 Correct 1 ms 12636 KB Output is correct
52 Correct 1 ms 12636 KB Output is correct
53 Correct 1 ms 12632 KB Output is correct
54 Correct 1 ms 12636 KB Output is correct
55 Correct 1 ms 12632 KB Output is correct
56 Correct 1 ms 12636 KB Output is correct
57 Correct 2 ms 12636 KB Output is correct
58 Correct 1 ms 12636 KB Output is correct
59 Correct 1 ms 12632 KB Output is correct
60 Correct 2 ms 12636 KB Output is correct
61 Correct 1 ms 12636 KB Output is correct
62 Correct 1 ms 12768 KB Output is correct
63 Correct 1 ms 12636 KB Output is correct
64 Correct 1 ms 12636 KB Output is correct
65 Correct 1 ms 12636 KB Output is correct
66 Correct 1 ms 12632 KB Output is correct
67 Correct 1 ms 12636 KB Output is correct
68 Correct 2 ms 12632 KB Output is correct
69 Correct 1 ms 12636 KB Output is correct
70 Correct 1 ms 12764 KB Output is correct
71 Correct 1 ms 12636 KB Output is correct
72 Correct 1 ms 12632 KB Output is correct
73 Correct 1 ms 12660 KB Output is correct
74 Correct 2 ms 12636 KB Output is correct
75 Correct 1 ms 12636 KB Output is correct
76 Correct 2 ms 12636 KB Output is correct
77 Correct 1 ms 12636 KB Output is correct
78 Correct 1 ms 12636 KB Output is correct
79 Correct 2 ms 12740 KB Output is correct
80 Correct 1 ms 12636 KB Output is correct
81 Correct 1 ms 12708 KB Output is correct
82 Correct 2 ms 12636 KB Output is correct
83 Correct 2 ms 12636 KB Output is correct
84 Correct 2 ms 12636 KB Output is correct
85 Correct 1 ms 12732 KB Output is correct
86 Correct 1 ms 12636 KB Output is correct

Subtask #5
0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 12636 KB Output is correct
2 Correct 1 ms 12636 KB Output is correct
3 Correct 1 ms 12636 KB Output is correct
4 Correct 1 ms 12632 KB Output is correct
5 Correct 1 ms 12636 KB Output is correct
6 Correct 1 ms 12636 KB Output is correct
7 Correct 1 ms 12636 KB Output is correct
8 Correct 1 ms 12636 KB Output is correct
9 Correct 1 ms 12636 KB Output is correct
10 Correct 1 ms 12636 KB Output is correct
11 Correct 1 ms 12632 KB Output is correct
12 Correct 1 ms 12636 KB Output is correct
13 Correct 2 ms 12636 KB Output is correct
14 Correct 1 ms 12636 KB Output is correct
15 Correct 1 ms 12636 KB Output is correct
16 Correct 2 ms 12636 KB Output is correct
17 Correct 1 ms 12636 KB Output is correct
18 Correct 1 ms 12732 KB Output is correct
19 Correct 1 ms 12636 KB Output is correct
20 Correct 1 ms 12636 KB Output is correct
21 Correct 1 ms 12636 KB Output is correct
22 Correct 2 ms 12636 KB Output is correct
23 Correct 1 ms 12636 KB Output is correct
24 Correct 1 ms 12636 KB Output is correct
25 Correct 1 ms 12636 KB Output is correct
26 Correct 1 ms 12636 KB Output is correct
27 Correct 1 ms 12636 KB Output is correct
28 Correct 1 ms 12636 KB Output is correct
29 Correct 1 ms 12636 KB Output is correct
30 Correct 1 ms 12636 KB Output is correct
31 Correct 1 ms 12636 KB Output is correct
32 Correct 1 ms 12636 KB Output is correct
33 Correct 1 ms 12636 KB Output is correct
34 Correct 1 ms 12636 KB Output is correct
35 Correct 1 ms 12636 KB Output is correct
36 Correct 1 ms 12736 KB Output is correct
37 Correct 1 ms 12636 KB Output is correct
38 Correct 1 ms 12636 KB Output is correct
39 Correct 1 ms 12636 KB Output is correct
40 Correct 1 ms 12636 KB Output is correct
41 Correct 1 ms 12728 KB Output is correct
42 Correct 2 ms 12636 KB Output is correct
43 Correct 2 ms 12636 KB Output is correct
44 Correct 1 ms 12636 KB Output is correct
45 Correct 1 ms 12636 KB Output is correct
46 Correct 1 ms 12636 KB Output is correct
47 Correct 1 ms 12732 KB Output is correct
48 Correct 1 ms 12636 KB Output is correct
49 Correct 1 ms 12636 KB Output is correct
50 Correct 1 ms 12636 KB Output is correct
51 Correct 1 ms 12636 KB Output is correct
52 Correct 1 ms 12636 KB Output is correct
53 Correct 1 ms 12632 KB Output is correct
54 Correct 1 ms 12636 KB Output is correct
55 Correct 1 ms 12632 KB Output is correct
56 Correct 1 ms 12636 KB Output is correct
57 Runtime error 106 ms 56760 KB Execution killed with signal 11
58 Halted 0 ms 0 KB -