oj.uz

Submission #423385

# Submission time Handle Problem Language Result Execution time Memory
423385 2021-06-11T04:47:25 Z qwerasdfzxcl Crossing (JOI21_crossing) C++14
26 / 100
 289 ms 9876 KB 
#include <bits/stdc++.h>

typedef long long ll;
using namespace std;
int mp[202];
string x, y;
struct Seg{
    pair<int, bool> tree[800800];
    int lazy[800800];
    pair<int, bool> combine(pair<int, bool> z, pair<int, bool> w){
        pair<int, bool> ret = {0, 0};
        if (z.first==w.first) ret.first = z.first;
        ret.second = z.second&w.second;
        return ret;
    }
    void init(int i, int l, int r){
        if (l!=r){
            int m = (l+r)>>1;
            init(i<<1, l, m); init(i<<1|1, m+1, r);
            tree[i] = combine(tree[i<<1], tree[i<<1|1]);
        }
        else{
            tree[i] = {mp[x[l]], 0};
            if (x[l]==y[l]) tree[i].second = 1;
        }
    }
    void propagate(int i, int l, int r){
        if (!lazy[i]) return;
        if (tree[i].first==lazy[i]) tree[i].second = 1;
        else tree[i].second = 0;
        if (l!=r){
            lazy[i<<1] = lazy[i], lazy[i<<1|1] = lazy[i];
        }
        lazy[i] = 0;
    }
    void update(int i, int l, int r, int s, int e, int val){
        propagate(i, l, r);
        if (r<s || e<l) return;
        if (s<=l && r<=e){
            lazy[i] = val; propagate(i, l, r);
            return;
        }
        int m = (l+r)>>1;
        update(i<<1, l, m, s, e, val);
        update(i<<1|1, m+1, r, s, e, val);
        tree[i] = combine(tree[i<<1], tree[i<<1|1]);
    }

}tree;

int main(){
    cin.tie(NULL);
    ios_base::sync_with_stdio(false);
    mp['J'] = 1, mp['O'] = 2, mp['I'] = 3;
    int n, q;
    cin >> n;
    cin >> x >> x >> x;
    cin >> q;
    cin >> y;
    tree.init(1, 0, n-1);
    if (tree.tree[1].second) cout << "Yes\n";
    else cout << "No\n";
    while(q--){
        int l, r;
        char tmp;
        cin >> l >> r >> tmp;
        tree.update(1, 1, n, l, r, mp[tmp]);
        if (tree.tree[1].second) cout << "Yes\n";
        else cout << "No\n";
    }
    return 0;
}

Compilation message

Main.cpp: In member function 'void Seg::init(int, int, int)':
Main.cpp:23:31: warning: array subscript has type 'char' [-Wchar-subscripts]
   23 |             tree[i] = {mp[x[l]], 0};
      |                               ^
Main.cpp: In function 'int main()':
Main.cpp:67:39: warning: array subscript has type 'char' [-Wchar-subscripts]
   67 |         tree.update(1, 1, n, l, r, mp[tmp]);
      |                                       ^~~

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 79 ms 7128 KB Output is correct
2 Correct 86 ms 7120 KB Output is correct
3 Correct 81 ms 7172 KB Output is correct
4 Correct 71 ms 7152 KB Output is correct
5 Correct 88 ms 7048 KB Output is correct
6 Correct 72 ms 7092 KB Output is correct
7 Correct 74 ms 7072 KB Output is correct
8 Correct 79 ms 7124 KB Output is correct
9 Correct 76 ms 7108 KB Output is correct
10 Correct 91 ms 7276 KB Output is correct
11 Correct 76 ms 7064 KB Output is correct
12 Correct 81 ms 7108 KB Output is correct
13 Correct 77 ms 7120 KB Output is correct
14 Correct 75 ms 7108 KB Output is correct
15 Correct 77 ms 7168 KB Output is correct
16 Correct 77 ms 7192 KB Output is correct
17 Correct 77 ms 7060 KB Output is correct
18 Correct 76 ms 7108 KB Output is correct

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 79 ms 7128 KB Output is correct
2 Correct 86 ms 7120 KB Output is correct
3 Correct 81 ms 7172 KB Output is correct
4 Correct 71 ms 7152 KB Output is correct
5 Correct 88 ms 7048 KB Output is correct
6 Correct 72 ms 7092 KB Output is correct
7 Correct 74 ms 7072 KB Output is correct
8 Correct 79 ms 7124 KB Output is correct
9 Correct 76 ms 7108 KB Output is correct
10 Correct 91 ms 7276 KB Output is correct
11 Correct 76 ms 7064 KB Output is correct
12 Correct 81 ms 7108 KB Output is correct
13 Correct 77 ms 7120 KB Output is correct
14 Correct 75 ms 7108 KB Output is correct
15 Correct 77 ms 7168 KB Output is correct
16 Correct 77 ms 7192 KB Output is correct
17 Correct 77 ms 7060 KB Output is correct
18 Correct 76 ms 7108 KB Output is correct
19 Correct 230 ms 9756 KB Output is correct
20 Correct 236 ms 8104 KB Output is correct
21 Correct 156 ms 9600 KB Output is correct
22 Correct 158 ms 9596 KB Output is correct
23 Correct 118 ms 7424 KB Output is correct
24 Correct 116 ms 7320 KB Output is correct
25 Correct 167 ms 9676 KB Output is correct
26 Correct 172 ms 9640 KB Output is correct
27 Correct 185 ms 9772 KB Output is correct
28 Correct 200 ms 9784 KB Output is correct
29 Correct 186 ms 9808 KB Output is correct
30 Correct 128 ms 7284 KB Output is correct
31 Correct 185 ms 9704 KB Output is correct
32 Correct 184 ms 9632 KB Output is correct
33 Correct 119 ms 7292 KB Output is correct
34 Correct 190 ms 9852 KB Output is correct
35 Correct 157 ms 9732 KB Output is correct
36 Correct 116 ms 7324 KB Output is correct
37 Correct 116 ms 7340 KB Output is correct
38 Correct 188 ms 8188 KB Output is correct
39 Correct 132 ms 7672 KB Output is correct
40 Correct 160 ms 8516 KB Output is correct
41 Correct 289 ms 9876 KB Output is correct
42 Correct 54 ms 7780 KB Output is correct

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 79 ms 7128 KB Output is correct
2 Correct 86 ms 7120 KB Output is correct
3 Correct 81 ms 7172 KB Output is correct
4 Correct 71 ms 7152 KB Output is correct
5 Correct 88 ms 7048 KB Output is correct
6 Correct 72 ms 7092 KB Output is correct
7 Correct 74 ms 7072 KB Output is correct
8 Correct 79 ms 7124 KB Output is correct
9 Correct 76 ms 7108 KB Output is correct
10 Correct 91 ms 7276 KB Output is correct
11 Correct 76 ms 7064 KB Output is correct
12 Correct 81 ms 7108 KB Output is correct
13 Correct 77 ms 7120 KB Output is correct
14 Correct 75 ms 7108 KB Output is correct
15 Correct 77 ms 7168 KB Output is correct
16 Correct 77 ms 7192 KB Output is correct
17 Correct 77 ms 7060 KB Output is correct
18 Correct 76 ms 7108 KB Output is correct
19 Correct 88 ms 7176 KB Output is correct
20 Correct 82 ms 7160 KB Output is correct
21 Incorrect 76 ms 7104 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #4
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 79 ms 7128 KB Output is correct
2 Correct 86 ms 7120 KB Output is correct
3 Correct 81 ms 7172 KB Output is correct
4 Correct 71 ms 7152 KB Output is correct
5 Correct 88 ms 7048 KB Output is correct
6 Correct 72 ms 7092 KB Output is correct
7 Correct 74 ms 7072 KB Output is correct
8 Correct 79 ms 7124 KB Output is correct
9 Correct 76 ms 7108 KB Output is correct
10 Correct 91 ms 7276 KB Output is correct
11 Correct 76 ms 7064 KB Output is correct
12 Correct 81 ms 7108 KB Output is correct
13 Correct 77 ms 7120 KB Output is correct
14 Correct 75 ms 7108 KB Output is correct
15 Correct 77 ms 7168 KB Output is correct
16 Correct 77 ms 7192 KB Output is correct
17 Correct 77 ms 7060 KB Output is correct
18 Correct 76 ms 7108 KB Output is correct
19 Correct 230 ms 9756 KB Output is correct
20 Correct 236 ms 8104 KB Output is correct
21 Correct 156 ms 9600 KB Output is correct
22 Correct 158 ms 9596 KB Output is correct
23 Correct 118 ms 7424 KB Output is correct
24 Correct 116 ms 7320 KB Output is correct
25 Correct 167 ms 9676 KB Output is correct
26 Correct 172 ms 9640 KB Output is correct
27 Correct 185 ms 9772 KB Output is correct
28 Correct 200 ms 9784 KB Output is correct
29 Correct 186 ms 9808 KB Output is correct
30 Correct 128 ms 7284 KB Output is correct
31 Correct 185 ms 9704 KB Output is correct
32 Correct 184 ms 9632 KB Output is correct
33 Correct 119 ms 7292 KB Output is correct
34 Correct 190 ms 9852 KB Output is correct
35 Correct 157 ms 9732 KB Output is correct
36 Correct 116 ms 7324 KB Output is correct
37 Correct 116 ms 7340 KB Output is correct
38 Correct 188 ms 8188 KB Output is correct
39 Correct 132 ms 7672 KB Output is correct
40 Correct 160 ms 8516 KB Output is correct
41 Correct 289 ms 9876 KB Output is correct
42 Correct 54 ms 7780 KB Output is correct
43 Correct 88 ms 7176 KB Output is correct
44 Correct 82 ms 7160 KB Output is correct
45 Incorrect 76 ms 7104 KB Output isn't correct
46 Halted 0 ms 0 KB -