oj.uz

Submission #962055

# Submission time Handle Problem Language Result Execution time Memory
962055 2024-04-13T06:22:43 Z vqpahmad Crossing (JOI21_crossing) C++14
100 / 100
 260 ms 19564 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define F
#define S second
#define endl '\n'
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
const int mod = 1e9 + 7, base = 131;
const int N =  1e6 + 15;
const ll inf = 1e18;
const int off = (1 << 18);
vector<int> s[3];
int T[N];
char str[N];
int n, Q;
struct modint{
	int val;
	modint(ll v=0) { val = v % mod; if (val < 0) val += mod; }
	modint operator-(modint rhs){ return modint(val-rhs.val); }
	modint operator+(modint rhs){ return modint(val+rhs.val); }
	modint operator*(modint rhs){ return modint(1ll*val*rhs.val); }
	bool operator==(modint rhs){ return val==rhs.val ;};
	operator int(){
		return val;
	}
};
struct Sgt {
#define ls (idx<<1)
#define rs (idx<<1|1)
    struct data {
        modint pws, val;
	  int tag = 0;
        data() : pws(0), val(0), tag(-1) {}
    } t[off * 2];
    void pull(int idx) {
        t[idx].pws = t[ls].pws+t[rs].pws;
        t[idx].val = t[ls].val+t[rs].val;
        return;
    }
    void push(int idx) {
        if (~t[idx].tag) {
            t[idx].val = t[idx].pws * modint(t[idx].tag);

            if (idx < off)
                t[ls].tag = t[rs].tag = t[idx].tag;

            t[idx].tag = ~0;
        }

        return;
    }
    void build() {
	    modint p = 1;
	for (int idx = off; idx < off * 2; idx++, p=p*modint(base)) {
		t[idx].pws = p;
		t[idx].val = p * modint(T[idx - off]);
		t[idx].tag = ~0;
	}
	for (int idx = off - 1; idx >= 1; idx--) {
		pull(idx);
	}
    }
    void update(int l, int r, int val, int idx = 1, int lo = 0, int hi = off) {
        push(idx);

        if (r <= lo || hi <= l)
            return;

        if (l <= lo && hi <= r) {
            t[idx].tag = val;
            push(idx);
            return;
        }

        int mi = (lo + hi) >> 1;
        update(l, r, val, ls, lo, mi);
        update(l, r, val, rs, mi, hi);
        pull(idx);
    }
#undef ls
#undef rs
} seg;
modint hsh(vector<int> cur) {
    modint res = 0;
    modint p=1;
    for (int i = 0; i < n; i++, p = p * modint(base)) {
	    res = res + modint(cur[i])*p;
    }

    return res;
}
vector<int> cross(vector<int> lhs, vector<int> rhs) {
    vector<int> cur(n);

    for (int i = 0, p = 1; i < n; i++, p = 1ll * p * base % mod) {
        int c = 0;

        if (lhs[i] == rhs[i])
            c = lhs[i];
        else if (lhs[i] != 0 && rhs[i] != 0)
            c = 0;
        else if (lhs[i] != 1 && rhs[i] != 1)
            c = 1;
        else if (lhs[i] != 2 && rhs[i] != 2)
            c = 2;

        cur[i] = c;
    }

    return cur;
}
int32_t main() {
    cin >> n;

    for (int k = 0; k < 3; k++) {
        scanf("%s", str);
        s[k].resize(n);

        for (int i = 0; i < n; i++) {
            if (str[i] == 'J')
                s[k][i] = 0;

            if (str[i] == 'O')
                s[k][i] = 1;

            if (str[i] == 'I')
                s[k][i] = 2;
        }
    }

    vector<modint> st;
    st.pb(hsh(s[0]));
    st.pb(hsh(s[1]));
    st.pb(hsh(s[2]));
    st.pb(hsh(cross(s[0], s[1])));
    st.pb(hsh(cross(s[1], s[2])));
    st.pb(hsh(cross(s[0], s[2])));
    st.pb(hsh(cross(s[0], cross(s[1], s[2]))));
    st.pb(hsh(cross(s[1], cross(s[0], s[2]))));
    st.pb(hsh(cross(s[2], cross(s[0], s[1]))));
    scanf("%d", &Q);
    scanf("%s", str);

    for (int i = 0; i < n; i++) {
        if (str[i] == 'J')
            T[i] = 0;

        if (str[i] == 'O')
            T[i] = 1;

        if (str[i] == 'I')
            T[i] = 2;
    }

    seg.build();
  if (find(all(st), seg.t[1].val)!=st.end()){
        puts("Yes");
    } else {
        puts("No");
    }

    while (Q--) {
        int L, R;
        char C;
        scanf("%d %d %c", &L, &R, &C);
        int c = 0;

        if (C == 'J')
            c = 0;

        if (C == 'O')
            c = 1;

        if (C == 'I')
            c = 2;

        seg.update(L - 1, R, c);
	  if (find(all(st), seg.t[1].val)!=st.end()){
            puts("Yes");
	  }
	  else {
		puts("No");
	  }
    }
}

Compilation message

Main.cpp: In function 'int32_t main()':
Main.cpp:119:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  119 |         scanf("%s", str);
      |         ~~~~~^~~~~~~~~~~
Main.cpp:144:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  144 |     scanf("%d", &Q);
      |     ~~~~~^~~~~~~~~~
Main.cpp:145:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  145 |     scanf("%s", str);
      |     ~~~~~^~~~~~~~~~~
Main.cpp:168:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  168 |         scanf("%d %d %c", &L, &R, &C);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 102 ms 10636 KB Output is correct
2 Correct 106 ms 10800 KB Output is correct
3 Correct 116 ms 10760 KB Output is correct
4 Correct 101 ms 10836 KB Output is correct
5 Correct 95 ms 10728 KB Output is correct
6 Correct 93 ms 10580 KB Output is correct
7 Correct 99 ms 10856 KB Output is correct
8 Correct 103 ms 10736 KB Output is correct
9 Correct 107 ms 10732 KB Output is correct
10 Correct 104 ms 10832 KB Output is correct
11 Correct 100 ms 10876 KB Output is correct
12 Correct 101 ms 10728 KB Output is correct
13 Correct 100 ms 10760 KB Output is correct
14 Correct 99 ms 10804 KB Output is correct
15 Correct 111 ms 10788 KB Output is correct
16 Correct 104 ms 10736 KB Output is correct
17 Correct 102 ms 10836 KB Output is correct
18 Correct 107 ms 11136 KB Output is correct

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 102 ms 10636 KB Output is correct
2 Correct 106 ms 10800 KB Output is correct
3 Correct 116 ms 10760 KB Output is correct
4 Correct 101 ms 10836 KB Output is correct
5 Correct 95 ms 10728 KB Output is correct
6 Correct 93 ms 10580 KB Output is correct
7 Correct 99 ms 10856 KB Output is correct
8 Correct 103 ms 10736 KB Output is correct
9 Correct 107 ms 10732 KB Output is correct
10 Correct 104 ms 10832 KB Output is correct
11 Correct 100 ms 10876 KB Output is correct
12 Correct 101 ms 10728 KB Output is correct
13 Correct 100 ms 10760 KB Output is correct
14 Correct 99 ms 10804 KB Output is correct
15 Correct 111 ms 10788 KB Output is correct
16 Correct 104 ms 10736 KB Output is correct
17 Correct 102 ms 10836 KB Output is correct
18 Correct 107 ms 11136 KB Output is correct
19 Correct 204 ms 19300 KB Output is correct
20 Correct 222 ms 19224 KB Output is correct
21 Correct 168 ms 18848 KB Output is correct
22 Correct 139 ms 17868 KB Output is correct
23 Correct 118 ms 12068 KB Output is correct
24 Correct 132 ms 11932 KB Output is correct
25 Correct 154 ms 19140 KB Output is correct
26 Correct 154 ms 19172 KB Output is correct
27 Correct 180 ms 19196 KB Output is correct
28 Correct 169 ms 19148 KB Output is correct
29 Correct 179 ms 18880 KB Output is correct
30 Correct 124 ms 11956 KB Output is correct
31 Correct 169 ms 19368 KB Output is correct
32 Correct 160 ms 18608 KB Output is correct
33 Correct 120 ms 11980 KB Output is correct
34 Correct 173 ms 19188 KB Output is correct
35 Correct 135 ms 17148 KB Output is correct
36 Correct 119 ms 11988 KB Output is correct
37 Correct 120 ms 11860 KB Output is correct
38 Correct 197 ms 19048 KB Output is correct
39 Correct 129 ms 19300 KB Output is correct
40 Correct 144 ms 16760 KB Output is correct
41 Correct 240 ms 19564 KB Output is correct
42 Correct 94 ms 18572 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 102 ms 10636 KB Output is correct
2 Correct 106 ms 10800 KB Output is correct
3 Correct 116 ms 10760 KB Output is correct
4 Correct 101 ms 10836 KB Output is correct
5 Correct 95 ms 10728 KB Output is correct
6 Correct 93 ms 10580 KB Output is correct
7 Correct 99 ms 10856 KB Output is correct
8 Correct 103 ms 10736 KB Output is correct
9 Correct 107 ms 10732 KB Output is correct
10 Correct 104 ms 10832 KB Output is correct
11 Correct 100 ms 10876 KB Output is correct
12 Correct 101 ms 10728 KB Output is correct
13 Correct 100 ms 10760 KB Output is correct
14 Correct 99 ms 10804 KB Output is correct
15 Correct 111 ms 10788 KB Output is correct
16 Correct 104 ms 10736 KB Output is correct
17 Correct 102 ms 10836 KB Output is correct
18 Correct 107 ms 11136 KB Output is correct
19 Correct 110 ms 10664 KB Output is correct
20 Correct 105 ms 10576 KB Output is correct
21 Correct 98 ms 10728 KB Output is correct
22 Correct 96 ms 10940 KB Output is correct
23 Correct 100 ms 10832 KB Output is correct
24 Correct 101 ms 10752 KB Output is correct
25 Correct 106 ms 10760 KB Output is correct
26 Correct 96 ms 10836 KB Output is correct
27 Correct 106 ms 10692 KB Output is correct
28 Correct 91 ms 10532 KB Output is correct
29 Correct 100 ms 10788 KB Output is correct
30 Correct 97 ms 10700 KB Output is correct
31 Correct 98 ms 10832 KB Output is correct
32 Correct 112 ms 10832 KB Output is correct
33 Correct 102 ms 10832 KB Output is correct
34 Correct 94 ms 10744 KB Output is correct
35 Correct 101 ms 10908 KB Output is correct
36 Correct 107 ms 10892 KB Output is correct
37 Correct 114 ms 10836 KB Output is correct
38 Correct 101 ms 10976 KB Output is correct
39 Correct 101 ms 10800 KB Output is correct
40 Correct 102 ms 10836 KB Output is correct
41 Correct 99 ms 10836 KB Output is correct
42 Correct 111 ms 10860 KB Output is correct
43 Correct 97 ms 10900 KB Output is correct
44 Correct 103 ms 10980 KB Output is correct

Subtask #4
51.0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 102 ms 10636 KB Output is correct
2 Correct 106 ms 10800 KB Output is correct
3 Correct 116 ms 10760 KB Output is correct
4 Correct 101 ms 10836 KB Output is correct
5 Correct 95 ms 10728 KB Output is correct
6 Correct 93 ms 10580 KB Output is correct
7 Correct 99 ms 10856 KB Output is correct
8 Correct 103 ms 10736 KB Output is correct
9 Correct 107 ms 10732 KB Output is correct
10 Correct 104 ms 10832 KB Output is correct
11 Correct 100 ms 10876 KB Output is correct
12 Correct 101 ms 10728 KB Output is correct
13 Correct 100 ms 10760 KB Output is correct
14 Correct 99 ms 10804 KB Output is correct
15 Correct 111 ms 10788 KB Output is correct
16 Correct 104 ms 10736 KB Output is correct
17 Correct 102 ms 10836 KB Output is correct
18 Correct 107 ms 11136 KB Output is correct
19 Correct 204 ms 19300 KB Output is correct
20 Correct 222 ms 19224 KB Output is correct
21 Correct 168 ms 18848 KB Output is correct
22 Correct 139 ms 17868 KB Output is correct
23 Correct 118 ms 12068 KB Output is correct
24 Correct 132 ms 11932 KB Output is correct
25 Correct 154 ms 19140 KB Output is correct
26 Correct 154 ms 19172 KB Output is correct
27 Correct 180 ms 19196 KB Output is correct
28 Correct 169 ms 19148 KB Output is correct
29 Correct 179 ms 18880 KB Output is correct
30 Correct 124 ms 11956 KB Output is correct
31 Correct 169 ms 19368 KB Output is correct
32 Correct 160 ms 18608 KB Output is correct
33 Correct 120 ms 11980 KB Output is correct
34 Correct 173 ms 19188 KB Output is correct
35 Correct 135 ms 17148 KB Output is correct
36 Correct 119 ms 11988 KB Output is correct
37 Correct 120 ms 11860 KB Output is correct
38 Correct 197 ms 19048 KB Output is correct
39 Correct 129 ms 19300 KB Output is correct
40 Correct 144 ms 16760 KB Output is correct
41 Correct 240 ms 19564 KB Output is correct
42 Correct 94 ms 18572 KB Output is correct
43 Correct 110 ms 10664 KB Output is correct
44 Correct 105 ms 10576 KB Output is correct
45 Correct 98 ms 10728 KB Output is correct
46 Correct 96 ms 10940 KB Output is correct
47 Correct 100 ms 10832 KB Output is correct
48 Correct 101 ms 10752 KB Output is correct
49 Correct 106 ms 10760 KB Output is correct
50 Correct 96 ms 10836 KB Output is correct
51 Correct 106 ms 10692 KB Output is correct
52 Correct 91 ms 10532 KB Output is correct
53 Correct 100 ms 10788 KB Output is correct
54 Correct 97 ms 10700 KB Output is correct
55 Correct 98 ms 10832 KB Output is correct
56 Correct 112 ms 10832 KB Output is correct
57 Correct 102 ms 10832 KB Output is correct
58 Correct 94 ms 10744 KB Output is correct
59 Correct 101 ms 10908 KB Output is correct
60 Correct 107 ms 10892 KB Output is correct
61 Correct 114 ms 10836 KB Output is correct
62 Correct 101 ms 10976 KB Output is correct
63 Correct 101 ms 10800 KB Output is correct
64 Correct 102 ms 10836 KB Output is correct
65 Correct 99 ms 10836 KB Output is correct
66 Correct 111 ms 10860 KB Output is correct
67 Correct 97 ms 10900 KB Output is correct
68 Correct 103 ms 10980 KB Output is correct
69 Correct 223 ms 17784 KB Output is correct
70 Correct 244 ms 19212 KB Output is correct
71 Correct 117 ms 11992 KB Output is correct
72 Correct 120 ms 11976 KB Output is correct
73 Correct 123 ms 11968 KB Output is correct
74 Correct 180 ms 17820 KB Output is correct
75 Correct 120 ms 11856 KB Output is correct
76 Correct 167 ms 19140 KB Output is correct
77 Correct 157 ms 17780 KB Output is correct
78 Correct 123 ms 11884 KB Output is correct
79 Correct 118 ms 12000 KB Output is correct
80 Correct 159 ms 16744 KB Output is correct
81 Correct 120 ms 11984 KB Output is correct
82 Correct 173 ms 19292 KB Output is correct
83 Correct 183 ms 18804 KB Output is correct
84 Correct 123 ms 11972 KB Output is correct
85 Correct 118 ms 11980 KB Output is correct
86 Correct 177 ms 17376 KB Output is correct
87 Correct 198 ms 19140 KB Output is correct
88 Correct 126 ms 11888 KB Output is correct
89 Correct 173 ms 18156 KB Output is correct
90 Correct 169 ms 19240 KB Output is correct
91 Correct 124 ms 12028 KB Output is correct
92 Correct 155 ms 17288 KB Output is correct
93 Correct 116 ms 11860 KB Output is correct
94 Correct 117 ms 11884 KB Output is correct
95 Correct 119 ms 12272 KB Output is correct
96 Correct 195 ms 19040 KB Output is correct
97 Correct 126 ms 19292 KB Output is correct
98 Correct 161 ms 16844 KB Output is correct
99 Correct 260 ms 19548 KB Output is correct
100 Correct 109 ms 18740 KB Output is correct