oj.uz

Submission #940580

# Submission time Handle Problem Language Result Execution time Memory
940580 2024-03-07T10:54:17 Z haxorman Crossing (JOI21_crossing) C++14
100 / 100
 1244 ms 32024 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long

const int mxN = 2e5 + 7;
const int SZ = exp2(ceil(log2(mxN)));
const int MOD[] = {1000000007, 252099000000ll};

int n, p[mxN][2], num[130], seg[4*mxN][2], lazy[4*mxN], def[mxN][2];

string cross(string a, string b) {
    string res;
    for (int i = 0; i < n; ++i) {
        if (a[i] == b[i]) {
            res += a[i];
            continue;
        }

        set<char> ch;
        ch.insert(a[i]);
        ch.insert(b[i]);

        for (auto c : {'J', 'O', 'I'}) {
            if (!ch.count(c)) {
                res += c;
                break;
            }
        }
    }
    return res;
}

void push(int ind, int l, int r, int cnt=1) {
    if (!lazy[ind]) {
        return;
    }

    for (auto id : {0, 1}) {
        int val = def[r][id] - (l ? def[l-1][id] : 0);
        if (val < 0) {
            val += MOD[id];
        }
        seg[ind][id] = val % MOD[id] * lazy[ind] % MOD[id];
    }

    if (l != r) {
        lazy[2*ind] = lazy[ind];
        lazy[2*ind+1] = lazy[ind];

        if (cnt) {
            int mid = (l+r)/2;
            push(2*ind,l,mid,cnt-1);
            push(2*ind+1,mid+1,r,cnt-1);
        }
    }
    lazy[ind] = 0;
}

void update(int lo, int hi, int val, int ind=1, int l=0, int r=SZ-1) {
    push(ind,l,r);
    if (lo > r || l > hi) {
        return;
    }

    if (lo <= l && r <= hi) {
        lazy[ind] = val;
        push(ind,l,r);
        return;
    }

    int mid = (l+r)/2;
    update(lo,hi,val,2*ind,l,mid);
    update(lo,hi,val,2*ind+1,mid+1,r);
    
    for (auto id : {0, 1}) {
        seg[ind][id] = (seg[2*ind][id] % MOD[id] + seg[2*ind+1][id] % MOD[id]);
        seg[ind][id] %= MOD[id];
    }
}

int query(int lo, int hi, int id, int ind=1, int l=0, int r=SZ-1) {
    push(ind,l,r);
    if (lo > r || l > hi) {
        return 0;
    }

    if (lo <= l && r <= hi) {
        return seg[ind][id] % MOD[id];
    }

    int mid = (l+r)/2;
    return (query(lo,hi,id,2*ind,l,mid)+query(lo,hi,id,2*ind+1,mid+1,r)) % MOD[id];
}

int hsh(string s, int id) {
    int res = 0;
    for (int i = 0; i < n; ++i) {
        res += num[s[i]] * p[i][id] % MOD[id];
        res %= MOD[id];
    }
    return res;
}

int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    
    cin >> n;
    num['J'] = 1, num['O'] = 2, num['I'] = 3;

    p[0][0] = p[0][1] = 1;
    for (int i = 1; i < n; ++i) {
        p[i][0] = p[i-1][0] * 31 % MOD[0];
        p[i][1] = p[i-1][1] * 73 % MOD[1];
    }
    
    set<string> check;
    vector<string> s;
    for (int i = 0; i < 3; ++i) {
        string str;
        cin >> str;

        if (!check.count(str)) {
            s.push_back(str);
            check.insert(str);
        }
    }
    
    int ind = 0;
    while (ind < s.size()) {
        int len = s.size();
        for (int i = 0; i < len; ++i) {
            string str = cross(s[ind], s[i]);
            if (!check.count(str)) {
                s.push_back(str);
                check.insert(str);
            }
        }
        ++ind;
    }
     
    set<int> fin[2];
    for (int i = 0; i < s.size(); ++i) {
        for (auto id : {0, 1}) {
            fin[id].insert(hsh(s[i],id));
        }
    }
    
    int q;
    cin >> q;

    string t;
    cin >> t;
    
    def[0][0] = def[0][1] = 1;
    seg[SZ][0] = seg[SZ][1] = num[t[0]];
    for (int i = 1; i < n; ++i) {
        for (auto id : {0, 1}) {
            def[i][id] = (def[i-1][id] + p[i][id]) % MOD[id];
            seg[i+SZ][id] = num[t[i]] * p[i][id] % MOD[id];
        }
    }
    
    for (int i = SZ-1; i >= 0; --i) {
        for (auto id : {0, 1}) {
            seg[i][id] = seg[2*i][id] % MOD[id] + seg[2*i+1][id] % MOD[id];
            seg[i][id] %= MOD[id];
        }
    }
    
    int cnt = 1;
    cout << (fin[0].count(query(0,n-1,0)) && fin[1].count(query(0,n-1,1)) ?
            "Yes\n" : "No\n");
    while (q--) {
        int l, r;
        char c;
        cin >> l >> r >> c;
        --l, --r;
        
        update(l, r, num[c]);
        /*
        for (int i = l; i <= r; ++i) {
            t[i] = c;
        }

        bool a = (t == s[0]);
        bool b = (fin[0].count(query(0,n-1,0)) && fin[1].count(query(0,n-1,1)));

        if (a != b) {
            cout << t << ' ' << s[0] << "\n";
            cout << query(0,n-1,0) << ' ' << hsh(s[0],0) << "\n";
            break;
        }
        */
        cout << (fin[0].count(query(0,n-1,0)) && fin[1].count(query(0,n-1,1)) ?
                "Yes\n" : "No\n");
    }
}

Compilation message

Main.cpp: In function 'long long int hsh(std::string, long long int)':
Main.cpp:99:24: warning: array subscript has type 'char' [-Wchar-subscripts]
   99 |         res += num[s[i]] * p[i][id] % MOD[id];
      |                        ^
Main.cpp: In function 'int32_t main()':
Main.cpp:130:16: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::__cxx11::basic_string<char> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  130 |     while (ind < s.size()) {
      |            ~~~~^~~~~~~~~~
Main.cpp:143:23: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::__cxx11::basic_string<char> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  143 |     for (int i = 0; i < s.size(); ++i) {
      |                     ~~^~~~~~~~~~
Main.cpp:156:39: warning: array subscript has type 'char' [-Wchar-subscripts]
  156 |     seg[SZ][0] = seg[SZ][1] = num[t[0]];
      |                                       ^
Main.cpp:160:37: warning: array subscript has type 'char' [-Wchar-subscripts]
  160 |             seg[i+SZ][id] = num[t[i]] * p[i][id] % MOD[id];
      |                                     ^
Main.cpp:180:26: warning: array subscript has type 'char' [-Wchar-subscripts]
  180 |         update(l, r, num[c]);
      |                          ^
Main.cpp:171:9: warning: unused variable 'cnt' [-Wunused-variable]
  171 |     int cnt = 1;
      |         ^~~

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 167 ms 10620 KB Output is correct
2 Correct 191 ms 10836 KB Output is correct
3 Correct 233 ms 12620 KB Output is correct
4 Correct 168 ms 10608 KB Output is correct
5 Correct 208 ms 10872 KB Output is correct
6 Correct 148 ms 12624 KB Output is correct
7 Correct 170 ms 10576 KB Output is correct
8 Correct 178 ms 12672 KB Output is correct
9 Correct 166 ms 12884 KB Output is correct
10 Correct 165 ms 12880 KB Output is correct
11 Correct 168 ms 13136 KB Output is correct
12 Correct 164 ms 12880 KB Output is correct
13 Correct 166 ms 12624 KB Output is correct
14 Correct 175 ms 12880 KB Output is correct
15 Correct 165 ms 12624 KB Output is correct
16 Correct 168 ms 12676 KB Output is correct
17 Correct 172 ms 12852 KB Output is correct
18 Correct 225 ms 12628 KB Output is correct

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 167 ms 10620 KB Output is correct
2 Correct 191 ms 10836 KB Output is correct
3 Correct 233 ms 12620 KB Output is correct
4 Correct 168 ms 10608 KB Output is correct
5 Correct 208 ms 10872 KB Output is correct
6 Correct 148 ms 12624 KB Output is correct
7 Correct 170 ms 10576 KB Output is correct
8 Correct 178 ms 12672 KB Output is correct
9 Correct 166 ms 12884 KB Output is correct
10 Correct 165 ms 12880 KB Output is correct
11 Correct 168 ms 13136 KB Output is correct
12 Correct 164 ms 12880 KB Output is correct
13 Correct 166 ms 12624 KB Output is correct
14 Correct 175 ms 12880 KB Output is correct
15 Correct 165 ms 12624 KB Output is correct
16 Correct 168 ms 12676 KB Output is correct
17 Correct 172 ms 12852 KB Output is correct
18 Correct 225 ms 12628 KB Output is correct
19 Correct 573 ms 28676 KB Output is correct
20 Correct 583 ms 25104 KB Output is correct
21 Correct 290 ms 25996 KB Output is correct
22 Correct 249 ms 23584 KB Output is correct
23 Correct 203 ms 11856 KB Output is correct
24 Correct 249 ms 11928 KB Output is correct
25 Correct 256 ms 28896 KB Output is correct
26 Correct 263 ms 28528 KB Output is correct
27 Correct 334 ms 28848 KB Output is correct
28 Correct 349 ms 28680 KB Output is correct
29 Correct 343 ms 24768 KB Output is correct
30 Correct 239 ms 12048 KB Output is correct
31 Correct 347 ms 28944 KB Output is correct
32 Correct 315 ms 24096 KB Output is correct
33 Correct 246 ms 11944 KB Output is correct
34 Correct 341 ms 28680 KB Output is correct
35 Correct 255 ms 25076 KB Output is correct
36 Correct 209 ms 11904 KB Output is correct
37 Correct 199 ms 13956 KB Output is correct
38 Correct 523 ms 26904 KB Output is correct
39 Correct 181 ms 24600 KB Output is correct
40 Correct 212 ms 22512 KB Output is correct
41 Correct 653 ms 28692 KB Output is correct
42 Correct 206 ms 23884 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 167 ms 10620 KB Output is correct
2 Correct 191 ms 10836 KB Output is correct
3 Correct 233 ms 12620 KB Output is correct
4 Correct 168 ms 10608 KB Output is correct
5 Correct 208 ms 10872 KB Output is correct
6 Correct 148 ms 12624 KB Output is correct
7 Correct 170 ms 10576 KB Output is correct
8 Correct 178 ms 12672 KB Output is correct
9 Correct 166 ms 12884 KB Output is correct
10 Correct 165 ms 12880 KB Output is correct
11 Correct 168 ms 13136 KB Output is correct
12 Correct 164 ms 12880 KB Output is correct
13 Correct 166 ms 12624 KB Output is correct
14 Correct 175 ms 12880 KB Output is correct
15 Correct 165 ms 12624 KB Output is correct
16 Correct 168 ms 12676 KB Output is correct
17 Correct 172 ms 12852 KB Output is correct
18 Correct 225 ms 12628 KB Output is correct
19 Correct 191 ms 12860 KB Output is correct
20 Correct 255 ms 12724 KB Output is correct
21 Correct 166 ms 12720 KB Output is correct
22 Correct 157 ms 10836 KB Output is correct
23 Correct 173 ms 13060 KB Output is correct
24 Correct 201 ms 10576 KB Output is correct
25 Correct 168 ms 12740 KB Output is correct
26 Correct 173 ms 10820 KB Output is correct
27 Correct 167 ms 12880 KB Output is correct
28 Correct 159 ms 10576 KB Output is correct
29 Correct 183 ms 12884 KB Output is correct
30 Correct 157 ms 10520 KB Output is correct
31 Correct 169 ms 12628 KB Output is correct
32 Correct 179 ms 12948 KB Output is correct
33 Correct 170 ms 12820 KB Output is correct
34 Correct 152 ms 12624 KB Output is correct
35 Correct 181 ms 12832 KB Output is correct
36 Correct 168 ms 12640 KB Output is correct
37 Correct 173 ms 12668 KB Output is correct
38 Correct 178 ms 12924 KB Output is correct
39 Correct 167 ms 12648 KB Output is correct
40 Correct 181 ms 12912 KB Output is correct
41 Correct 166 ms 12872 KB Output is correct
42 Correct 170 ms 12740 KB Output is correct
43 Correct 169 ms 10616 KB Output is correct
44 Correct 168 ms 12836 KB Output is correct

Subtask #4
51.0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 167 ms 10620 KB Output is correct
2 Correct 191 ms 10836 KB Output is correct
3 Correct 233 ms 12620 KB Output is correct
4 Correct 168 ms 10608 KB Output is correct
5 Correct 208 ms 10872 KB Output is correct
6 Correct 148 ms 12624 KB Output is correct
7 Correct 170 ms 10576 KB Output is correct
8 Correct 178 ms 12672 KB Output is correct
9 Correct 166 ms 12884 KB Output is correct
10 Correct 165 ms 12880 KB Output is correct
11 Correct 168 ms 13136 KB Output is correct
12 Correct 164 ms 12880 KB Output is correct
13 Correct 166 ms 12624 KB Output is correct
14 Correct 175 ms 12880 KB Output is correct
15 Correct 165 ms 12624 KB Output is correct
16 Correct 168 ms 12676 KB Output is correct
17 Correct 172 ms 12852 KB Output is correct
18 Correct 225 ms 12628 KB Output is correct
19 Correct 573 ms 28676 KB Output is correct
20 Correct 583 ms 25104 KB Output is correct
21 Correct 290 ms 25996 KB Output is correct
22 Correct 249 ms 23584 KB Output is correct
23 Correct 203 ms 11856 KB Output is correct
24 Correct 249 ms 11928 KB Output is correct
25 Correct 256 ms 28896 KB Output is correct
26 Correct 263 ms 28528 KB Output is correct
27 Correct 334 ms 28848 KB Output is correct
28 Correct 349 ms 28680 KB Output is correct
29 Correct 343 ms 24768 KB Output is correct
30 Correct 239 ms 12048 KB Output is correct
31 Correct 347 ms 28944 KB Output is correct
32 Correct 315 ms 24096 KB Output is correct
33 Correct 246 ms 11944 KB Output is correct
34 Correct 341 ms 28680 KB Output is correct
35 Correct 255 ms 25076 KB Output is correct
36 Correct 209 ms 11904 KB Output is correct
37 Correct 199 ms 13956 KB Output is correct
38 Correct 523 ms 26904 KB Output is correct
39 Correct 181 ms 24600 KB Output is correct
40 Correct 212 ms 22512 KB Output is correct
41 Correct 653 ms 28692 KB Output is correct
42 Correct 206 ms 23884 KB Output is correct
43 Correct 191 ms 12860 KB Output is correct
44 Correct 255 ms 12724 KB Output is correct
45 Correct 166 ms 12720 KB Output is correct
46 Correct 157 ms 10836 KB Output is correct
47 Correct 173 ms 13060 KB Output is correct
48 Correct 201 ms 10576 KB Output is correct
49 Correct 168 ms 12740 KB Output is correct
50 Correct 173 ms 10820 KB Output is correct
51 Correct 167 ms 12880 KB Output is correct
52 Correct 159 ms 10576 KB Output is correct
53 Correct 183 ms 12884 KB Output is correct
54 Correct 157 ms 10520 KB Output is correct
55 Correct 169 ms 12628 KB Output is correct
56 Correct 179 ms 12948 KB Output is correct
57 Correct 170 ms 12820 KB Output is correct
58 Correct 152 ms 12624 KB Output is correct
59 Correct 181 ms 12832 KB Output is correct
60 Correct 168 ms 12640 KB Output is correct
61 Correct 173 ms 12668 KB Output is correct
62 Correct 178 ms 12924 KB Output is correct
63 Correct 167 ms 12648 KB Output is correct
64 Correct 181 ms 12912 KB Output is correct
65 Correct 166 ms 12872 KB Output is correct
66 Correct 170 ms 12740 KB Output is correct
67 Correct 169 ms 10616 KB Output is correct
68 Correct 168 ms 12836 KB Output is correct
69 Correct 1064 ms 26064 KB Output is correct
70 Correct 1212 ms 31348 KB Output is correct
71 Correct 206 ms 14056 KB Output is correct
72 Correct 200 ms 13976 KB Output is correct
73 Correct 211 ms 12072 KB Output is correct
74 Correct 301 ms 26068 KB Output is correct
75 Correct 220 ms 11896 KB Output is correct
76 Correct 335 ms 29372 KB Output is correct
77 Correct 315 ms 24240 KB Output is correct
78 Correct 199 ms 13904 KB Output is correct
79 Correct 218 ms 11856 KB Output is correct
80 Correct 664 ms 25084 KB Output is correct
81 Correct 237 ms 12112 KB Output is correct
82 Correct 854 ms 31644 KB Output is correct
83 Correct 830 ms 29116 KB Output is correct
84 Correct 245 ms 14184 KB Output is correct
85 Correct 260 ms 14164 KB Output is correct
86 Correct 719 ms 25620 KB Output is correct
87 Correct 826 ms 31720 KB Output is correct
88 Correct 273 ms 12064 KB Output is correct
89 Correct 745 ms 26416 KB Output is correct
90 Correct 814 ms 31684 KB Output is correct
91 Correct 258 ms 14456 KB Output is correct
92 Correct 666 ms 27368 KB Output is correct
93 Correct 238 ms 12204 KB Output is correct
94 Correct 233 ms 14000 KB Output is correct
95 Correct 251 ms 14160 KB Output is correct
96 Correct 517 ms 28304 KB Output is correct
97 Correct 241 ms 27568 KB Output is correct
98 Correct 585 ms 24096 KB Output is correct
99 Correct 1244 ms 32024 KB Output is correct
100 Correct 785 ms 26864 KB Output is correct