oj.uz

답안 #941313

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
941313 2024-03-08T13:29:52 Z haxorman Crossing (JOI21_crossing) C++14
100 / 100
 760 ms 24512 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 = 1e9 + 7;
 
int n, p[mxN], num[130], seg[4*mxN], lazy[4*mxN], def[mxN];
 
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) {
    if (!lazy[ind]) {
        return;
    }
    seg[ind] = (def[r] - (l ? def[l-1] : 0) + MOD) % MOD * lazy[ind] % MOD;
 
    if (l != r) {
        lazy[2*ind] = lazy[ind];
        lazy[2*ind+1] = lazy[ind];
    }
    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);
 
    seg[ind] = (seg[2*ind] + seg[2*ind+1]) % MOD;
}
 
int query(int lo, int hi, 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];
    }
 
    int mid = (l+r)/2;
    return (query(lo,hi,2*ind,l,mid) + query(lo,hi,2*ind+1,mid+1,r)) % MOD;
}
 
int hsh(string s) {
    int res = 0;
    for (int i = 0; i < n; ++i) {
        res += num[s[i]] * p[i] % MOD;
        res %= MOD;
    }
    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] = 1;
    for (int i = 1; i < n; ++i) {
        p[i] = p[i-1] * 31 % MOD;
    }
    
    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;
    for (int i = 0; i < s.size(); ++i) {
        fin.insert(hsh(s[i]));
    }
 
    int q;
    cin >> q;
 
    string t;
    cin >> t;
    
    def[0] = 1;
    seg[SZ] = num[t[0]];
    for (int i = 1; i < n; ++i) {
        def[i] = (def[i-1] + p[i]) % MOD;
        seg[i+SZ] = num[t[i]] * p[i] % MOD;
    }
    
    for (int i = SZ-1; i >= 0; --i) {
        seg[i] = (seg[2*i] + seg[2*i+1]) % MOD;
    }
    
    cout << (fin.count(query(0,n-1)) ? "Yes\n" : "No\n");
    while (q--) {
        int l, r;
        char c;
        cin >> l >> r >> c;
        --l, --r;
        
        update(l, r, num[c]);
        cout << (fin.count(query(0,n-1)) ? "Yes\n" : "No\n");
    }
}

Compilation message

Main.cpp: In function 'long long int hsh(std::string)':
Main.cpp:83:24: warning: array subscript has type 'char' [-Wchar-subscripts]
   83 |         res += num[s[i]] * p[i] % MOD;
      |                        ^
Main.cpp: In function 'int32_t main()':
Main.cpp:113: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]
  113 |     while (ind < s.size()) {
      |            ~~~~^~~~~~~~~~
Main.cpp:126: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]
  126 |     for (int i = 0; i < s.size(); ++i) {
      |                     ~~^~~~~~~~~~
Main.cpp:137:23: warning: array subscript has type 'char' [-Wchar-subscripts]
  137 |     seg[SZ] = num[t[0]];
      |                       ^
Main.cpp:140:29: warning: array subscript has type 'char' [-Wchar-subscripts]
  140 |         seg[i+SZ] = num[t[i]] * p[i] % MOD;
      |                             ^
Main.cpp:154:26: warning: array subscript has type 'char' [-Wchar-subscripts]
  154 |         update(l, r, num[c]);
      |                          ^

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 98 ms 6996 KB Output is correct
2 Correct 112 ms 7108 KB Output is correct
3 Correct 120 ms 9216 KB Output is correct
4 Correct 108 ms 7156 KB Output is correct
5 Correct 104 ms 7172 KB Output is correct
6 Correct 109 ms 9496 KB Output is correct
7 Correct 111 ms 7192 KB Output is correct
8 Correct 107 ms 9044 KB Output is correct
9 Correct 107 ms 9036 KB Output is correct
10 Correct 113 ms 9572 KB Output is correct
11 Correct 105 ms 9156 KB Output is correct
12 Correct 107 ms 9044 KB Output is correct
13 Correct 108 ms 9108 KB Output is correct
14 Correct 114 ms 9808 KB Output is correct
15 Correct 106 ms 9244 KB Output is correct
16 Correct 106 ms 9156 KB Output is correct
17 Correct 114 ms 9044 KB Output is correct
18 Correct 112 ms 7436 KB Output is correct

Subtask #2
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 98 ms 6996 KB Output is correct
2 Correct 112 ms 7108 KB Output is correct
3 Correct 120 ms 9216 KB Output is correct
4 Correct 108 ms 7156 KB Output is correct
5 Correct 104 ms 7172 KB Output is correct
6 Correct 109 ms 9496 KB Output is correct
7 Correct 111 ms 7192 KB Output is correct
8 Correct 107 ms 9044 KB Output is correct
9 Correct 107 ms 9036 KB Output is correct
10 Correct 113 ms 9572 KB Output is correct
11 Correct 105 ms 9156 KB Output is correct
12 Correct 107 ms 9044 KB Output is correct
13 Correct 108 ms 9108 KB Output is correct
14 Correct 114 ms 9808 KB Output is correct
15 Correct 106 ms 9244 KB Output is correct
16 Correct 106 ms 9156 KB Output is correct
17 Correct 114 ms 9044 KB Output is correct
18 Correct 112 ms 7436 KB Output is correct
19 Correct 189 ms 19808 KB Output is correct
20 Correct 201 ms 17640 KB Output is correct
21 Correct 153 ms 20440 KB Output is correct
22 Correct 146 ms 18716 KB Output is correct
23 Correct 130 ms 10072 KB Output is correct
24 Correct 130 ms 9808 KB Output is correct
25 Correct 152 ms 21520 KB Output is correct
26 Correct 143 ms 21200 KB Output is correct
27 Correct 164 ms 21260 KB Output is correct
28 Correct 188 ms 21264 KB Output is correct
29 Correct 169 ms 19804 KB Output is correct
30 Correct 135 ms 9832 KB Output is correct
31 Correct 161 ms 21180 KB Output is correct
32 Correct 166 ms 19256 KB Output is correct
33 Correct 140 ms 9808 KB Output is correct
34 Correct 157 ms 21136 KB Output is correct
35 Correct 146 ms 19336 KB Output is correct
36 Correct 130 ms 9808 KB Output is correct
37 Correct 131 ms 11856 KB Output is correct
38 Correct 180 ms 19248 KB Output is correct
39 Correct 117 ms 19220 KB Output is correct
40 Correct 116 ms 19928 KB Output is correct
41 Correct 216 ms 21516 KB Output is correct
42 Correct 86 ms 16656 KB Output is correct

Subtask #3
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 98 ms 6996 KB Output is correct
2 Correct 112 ms 7108 KB Output is correct
3 Correct 120 ms 9216 KB Output is correct
4 Correct 108 ms 7156 KB Output is correct
5 Correct 104 ms 7172 KB Output is correct
6 Correct 109 ms 9496 KB Output is correct
7 Correct 111 ms 7192 KB Output is correct
8 Correct 107 ms 9044 KB Output is correct
9 Correct 107 ms 9036 KB Output is correct
10 Correct 113 ms 9572 KB Output is correct
11 Correct 105 ms 9156 KB Output is correct
12 Correct 107 ms 9044 KB Output is correct
13 Correct 108 ms 9108 KB Output is correct
14 Correct 114 ms 9808 KB Output is correct
15 Correct 106 ms 9244 KB Output is correct
16 Correct 106 ms 9156 KB Output is correct
17 Correct 114 ms 9044 KB Output is correct
18 Correct 112 ms 7436 KB Output is correct
19 Correct 112 ms 7120 KB Output is correct
20 Correct 117 ms 6996 KB Output is correct
21 Correct 108 ms 9036 KB Output is correct
22 Correct 101 ms 6992 KB Output is correct
23 Correct 114 ms 9568 KB Output is correct
24 Correct 108 ms 6988 KB Output is correct
25 Correct 111 ms 9044 KB Output is correct
26 Correct 116 ms 6996 KB Output is correct
27 Correct 108 ms 9040 KB Output is correct
28 Correct 104 ms 6988 KB Output is correct
29 Correct 107 ms 9044 KB Output is correct
30 Correct 104 ms 7072 KB Output is correct
31 Correct 110 ms 9044 KB Output is correct
32 Correct 116 ms 7004 KB Output is correct
33 Correct 108 ms 9184 KB Output is correct
34 Correct 100 ms 9040 KB Output is correct
35 Correct 111 ms 9124 KB Output is correct
36 Correct 111 ms 9276 KB Output is correct
37 Correct 108 ms 9048 KB Output is correct
38 Correct 115 ms 9216 KB Output is correct
39 Correct 110 ms 9280 KB Output is correct
40 Correct 110 ms 9040 KB Output is correct
41 Correct 107 ms 9092 KB Output is correct
42 Correct 109 ms 9164 KB Output is correct
43 Correct 112 ms 7228 KB Output is correct
44 Correct 111 ms 9040 KB Output is correct

Subtask #4
51.0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 98 ms 6996 KB Output is correct
2 Correct 112 ms 7108 KB Output is correct
3 Correct 120 ms 9216 KB Output is correct
4 Correct 108 ms 7156 KB Output is correct
5 Correct 104 ms 7172 KB Output is correct
6 Correct 109 ms 9496 KB Output is correct
7 Correct 111 ms 7192 KB Output is correct
8 Correct 107 ms 9044 KB Output is correct
9 Correct 107 ms 9036 KB Output is correct
10 Correct 113 ms 9572 KB Output is correct
11 Correct 105 ms 9156 KB Output is correct
12 Correct 107 ms 9044 KB Output is correct
13 Correct 108 ms 9108 KB Output is correct
14 Correct 114 ms 9808 KB Output is correct
15 Correct 106 ms 9244 KB Output is correct
16 Correct 106 ms 9156 KB Output is correct
17 Correct 114 ms 9044 KB Output is correct
18 Correct 112 ms 7436 KB Output is correct
19 Correct 189 ms 19808 KB Output is correct
20 Correct 201 ms 17640 KB Output is correct
21 Correct 153 ms 20440 KB Output is correct
22 Correct 146 ms 18716 KB Output is correct
23 Correct 130 ms 10072 KB Output is correct
24 Correct 130 ms 9808 KB Output is correct
25 Correct 152 ms 21520 KB Output is correct
26 Correct 143 ms 21200 KB Output is correct
27 Correct 164 ms 21260 KB Output is correct
28 Correct 188 ms 21264 KB Output is correct
29 Correct 169 ms 19804 KB Output is correct
30 Correct 135 ms 9832 KB Output is correct
31 Correct 161 ms 21180 KB Output is correct
32 Correct 166 ms 19256 KB Output is correct
33 Correct 140 ms 9808 KB Output is correct
34 Correct 157 ms 21136 KB Output is correct
35 Correct 146 ms 19336 KB Output is correct
36 Correct 130 ms 9808 KB Output is correct
37 Correct 131 ms 11856 KB Output is correct
38 Correct 180 ms 19248 KB Output is correct
39 Correct 117 ms 19220 KB Output is correct
40 Correct 116 ms 19928 KB Output is correct
41 Correct 216 ms 21516 KB Output is correct
42 Correct 86 ms 16656 KB Output is correct
43 Correct 112 ms 7120 KB Output is correct
44 Correct 117 ms 6996 KB Output is correct
45 Correct 108 ms 9036 KB Output is correct
46 Correct 101 ms 6992 KB Output is correct
47 Correct 114 ms 9568 KB Output is correct
48 Correct 108 ms 6988 KB Output is correct
49 Correct 111 ms 9044 KB Output is correct
50 Correct 116 ms 6996 KB Output is correct
51 Correct 108 ms 9040 KB Output is correct
52 Correct 104 ms 6988 KB Output is correct
53 Correct 107 ms 9044 KB Output is correct
54 Correct 104 ms 7072 KB Output is correct
55 Correct 110 ms 9044 KB Output is correct
56 Correct 116 ms 7004 KB Output is correct
57 Correct 108 ms 9184 KB Output is correct
58 Correct 100 ms 9040 KB Output is correct
59 Correct 111 ms 9124 KB Output is correct
60 Correct 111 ms 9276 KB Output is correct
61 Correct 108 ms 9048 KB Output is correct
62 Correct 115 ms 9216 KB Output is correct
63 Correct 110 ms 9280 KB Output is correct
64 Correct 110 ms 9040 KB Output is correct
65 Correct 107 ms 9092 KB Output is correct
66 Correct 109 ms 9164 KB Output is correct
67 Correct 112 ms 7228 KB Output is correct
68 Correct 111 ms 9040 KB Output is correct
69 Correct 641 ms 21096 KB Output is correct
70 Correct 760 ms 24124 KB Output is correct
71 Correct 129 ms 11860 KB Output is correct
72 Correct 125 ms 11860 KB Output is correct
73 Correct 135 ms 9812 KB Output is correct
74 Correct 188 ms 20304 KB Output is correct
75 Correct 134 ms 9896 KB Output is correct
76 Correct 200 ms 21956 KB Output is correct
77 Correct 197 ms 19056 KB Output is correct
78 Correct 127 ms 11652 KB Output is correct
79 Correct 133 ms 9812 KB Output is correct
80 Correct 530 ms 19816 KB Output is correct
81 Correct 161 ms 9812 KB Output is correct
82 Correct 697 ms 24316 KB Output is correct
83 Correct 673 ms 23296 KB Output is correct
84 Correct 156 ms 9812 KB Output is correct
85 Correct 157 ms 9808 KB Output is correct
86 Correct 502 ms 20500 KB Output is correct
87 Correct 608 ms 24180 KB Output is correct
88 Correct 163 ms 9976 KB Output is correct
89 Correct 543 ms 22040 KB Output is correct
90 Correct 590 ms 24268 KB Output is correct
91 Correct 162 ms 11960 KB Output is correct
92 Correct 577 ms 21596 KB Output is correct
93 Correct 160 ms 9984 KB Output is correct
94 Correct 157 ms 11852 KB Output is correct
95 Correct 155 ms 11856 KB Output is correct
96 Correct 179 ms 20924 KB Output is correct
97 Correct 169 ms 22216 KB Output is correct
98 Correct 471 ms 22152 KB Output is correct
99 Correct 756 ms 24512 KB Output is correct
100 Correct 660 ms 19448 KB Output is correct