oj.uz

답안 #953698

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
953698 2024-03-26T13:34:52 Z GrindMachine Homework (CEOI22_homework) C++17
100 / 100
 213 ms 190232 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*

refs:
https://youtu.be/N69P-6MZor0?list=PLg_Krngrs0eC_1vn0dTjyPZMkwBOcVsgH
edi

*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

struct node{
    ll typ;
    node *l, *r;

    node(){
        typ = -1;
        l = r = nullptr;
    }
    
    node(ll t){
        typ = t;
        l = r = nullptr;
    }
    
    void insert(node* u){
        if(!l) l = u;
        else{
            if(r != nullptr){
                debug(u->typ);
            }
            r = u;
        }
    }
};

array<ll,3> dfs(node *u){
    assert(u);

    if(u->typ == 3){
        return {1,1,1};
    }

    auto [l1,r1,s1] = dfs(u->l);
    auto [l2,r2,s2] = dfs(u->r);

    ll l3 = -1, r3 = -1;
    ll s3 = s1+s2;

    if(u->typ == 1){
        l3 = l1+l2;
        r3 = max(s1+r2,s2+r1);
    }
    else{
        l3 = min(l1,l2);
        r3 = r1+r2-1;
    }

    return {l3,r3,s3};
}

void solve(int test_case)
{
    string s; cin >> s;
    ll n = sz(s);
    string new_s = "";

    rep(i,sz(s)){
        if(isalpha(s[i])) conts;
        if(s[i] == '('){
            if(s[i-1] == 'n'){
                new_s.pb('(');
            }
            else{
                new_s.pb('[');
            }
        }
        else{
            new_s.pb(s[i]);
        }
    }

    s = new_s;
    n = sz(s);
    stack<node*> stk;

    rep(i,n){
        auto ch = s[i];
        if(ch == '['){
            stk.push(new node(1));
        }
        if(ch == '('){
            stk.push(new node(2));
        }
        if(ch == '?'){
            stk.push(new node(3));
        }
        if(ch == ',' or ch == ')'){
            auto curr = stk.top();
            stk.pop();
            stk.top()->insert(curr);
        }
    }

    auto root = stk.top();
    auto [l,r,siz] = dfs(root);
    ll ans = r-l+1;
    cout << ans << endl;
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Compilation message

Main.cpp: In member function 'void node::insert(node*)':
Main.cpp:46:18: warning: statement has no effect [-Wunused-value]
   46 | #define debug(x) 42
      |                  ^~
Main.cpp:80:17: note: in expansion of macro 'debug'
   80 |                 debug(u->typ);
      |                 ^~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
13.0 / 13.0

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

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 213 ms 187652 KB Output is correct
2 Correct 196 ms 190056 KB Output is correct
3 Correct 206 ms 189648 KB Output is correct
4 Correct 205 ms 187568 KB Output is correct
5 Correct 201 ms 188364 KB Output is correct
6 Correct 202 ms 187592 KB Output is correct
7 Correct 200 ms 187852 KB Output is correct
8 Correct 199 ms 187344 KB Output is correct
9 Correct 203 ms 187860 KB Output is correct
10 Correct 198 ms 189388 KB Output is correct
11 Correct 197 ms 189924 KB Output is correct
12 Correct 211 ms 190232 KB Output is correct
13 Correct 0 ms 348 KB Output is correct

Subtask #4
30.0 / 30.0

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

Subtask #5
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 500 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 460 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 864 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 1 ms 396 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 356 KB Output is correct
45 Correct 1 ms 600 KB Output is correct
46 Correct 0 ms 352 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 1 ms 348 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 0 ms 456 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 213 ms 187652 KB Output is correct
58 Correct 196 ms 190056 KB Output is correct
59 Correct 206 ms 189648 KB Output is correct
60 Correct 205 ms 187568 KB Output is correct
61 Correct 201 ms 188364 KB Output is correct
62 Correct 202 ms 187592 KB Output is correct
63 Correct 200 ms 187852 KB Output is correct
64 Correct 199 ms 187344 KB Output is correct
65 Correct 203 ms 187860 KB Output is correct
66 Correct 198 ms 189388 KB Output is correct
67 Correct 197 ms 189924 KB Output is correct
68 Correct 211 ms 190232 KB Output is correct
69 Correct 0 ms 348 KB Output is correct
70 Correct 1 ms 348 KB Output is correct
71 Correct 0 ms 348 KB Output is correct
72 Correct 0 ms 348 KB Output is correct
73 Correct 0 ms 348 KB Output is correct
74 Correct 1 ms 348 KB Output is correct
75 Correct 1 ms 348 KB Output is correct
76 Correct 1 ms 348 KB Output is correct
77 Correct 1 ms 348 KB Output is correct
78 Correct 0 ms 348 KB Output is correct
79 Correct 1 ms 348 KB Output is correct
80 Correct 0 ms 348 KB Output is correct
81 Correct 1 ms 356 KB Output is correct
82 Correct 1 ms 460 KB Output is correct
83 Correct 1 ms 348 KB Output is correct
84 Correct 0 ms 344 KB Output is correct
85 Correct 1 ms 604 KB Output is correct
86 Correct 0 ms 604 KB Output is correct
87 Correct 1 ms 604 KB Output is correct
88 Correct 1 ms 600 KB Output is correct
89 Correct 1 ms 632 KB Output is correct
90 Correct 0 ms 464 KB Output is correct
91 Correct 0 ms 456 KB Output is correct
92 Correct 1 ms 460 KB Output is correct
93 Correct 0 ms 348 KB Output is correct
94 Correct 0 ms 348 KB Output is correct
95 Correct 1 ms 344 KB Output is correct
96 Correct 0 ms 348 KB Output is correct
97 Correct 0 ms 348 KB Output is correct
98 Correct 1 ms 604 KB Output is correct
99 Correct 1 ms 348 KB Output is correct
100 Correct 134 ms 78960 KB Output is correct
101 Correct 137 ms 78796 KB Output is correct
102 Correct 131 ms 77416 KB Output is correct
103 Correct 134 ms 79056 KB Output is correct
104 Correct 122 ms 78128 KB Output is correct
105 Correct 167 ms 114256 KB Output is correct
106 Correct 174 ms 115752 KB Output is correct
107 Correct 158 ms 117204 KB Output is correct
108 Correct 176 ms 115232 KB Output is correct
109 Correct 160 ms 114356 KB Output is correct
110 Correct 138 ms 80308 KB Output is correct
111 Correct 150 ms 78772 KB Output is correct
112 Correct 129 ms 78060 KB Output is correct
113 Correct 137 ms 79872 KB Output is correct
114 Correct 128 ms 80080 KB Output is correct
115 Correct 209 ms 184876 KB Output is correct
116 Correct 206 ms 184292 KB Output is correct
117 Correct 195 ms 185804 KB Output is correct
118 Correct 203 ms 184012 KB Output is correct
119 Correct 194 ms 183980 KB Output is correct
120 Correct 125 ms 74444 KB Output is correct
121 Correct 127 ms 75212 KB Output is correct
122 Correct 140 ms 76876 KB Output is correct
123 Correct 136 ms 73968 KB Output is correct
124 Correct 154 ms 133464 KB Output is correct
125 Correct 149 ms 134116 KB Output is correct
126 Correct 159 ms 132868 KB Output is correct
127 Correct 169 ms 134028 KB Output is correct
128 Correct 63 ms 39380 KB Output is correct
129 Correct 62 ms 41016 KB Output is correct
130 Correct 65 ms 40400 KB Output is correct
131 Correct 0 ms 600 KB Output is correct