oj.uz

Submission #533814

# Submission time Handle Problem Language Result Execution time Memory
533814 2022-03-07T11:05:33 Z RaresFelix Crossing (JOI21_crossing) C++17
26 / 100
 1776 ms 192292 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
using namespace std;

#define LT(x) ((x) == 'I' ? 2 : (x) == 'O')
#define CMB(x, y) (((x) == (y)) ? (x) : (3 - ((x) + (y))))
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

#define MN 257171
int n, q;
vector<int> C[10], P;
struct SL {
    vector<int> B;
    int Vl[4 * MN], Eq[4 * MN], Lz[4 * MN];
    void bld(int u, int s, int d) {
        Lz[u] = Vl[u] = Eq[u] = 0;
        if(s == d) {
            Vl[u] = B[s];
            Eq[u] = (B[s] == P[s]);
            return;
        }
        bld(u * 2, s, (s + d) / 2);
        bld(u * 2 + 1, (s + d) / 2 + 1, d);
        Vl[u] = ((Vl[u * 2] == Vl[u * 2 + 1]) ? Vl[u * 2] : -1);
        Eq[u] = Eq[u * 2] && Eq[u * 2 + 1];
    }
    SL(vector<int> E) : B(std::move(E)){
        bld(1, 0, n-1);
    }
    void prp(int u, int s, int d) {
        if(!Lz[u]) return;
        int v = Lz[u] - 3;
        Eq[u] = (Vl[u] == v);
        if(s != d)
            Lz[u * 2] = Lz[u * 2 + 1] = Lz[u];
        Lz[u] = 0;
    }
    void pset(int l, int r, int v, int u, int s, int d) {
        prp(u, s, d);
        if(r < s || d < l) return;
        if(l <= s && d <= r) {
            Lz[u] = v + 3;
            prp(u, s, d);
            return;
        }
        pset(l, r, v, u * 2, s, (s + d) / 2);
        pset(l, r, v, u * 2 + 1, (s + d) / 2 + 1, d);
        Vl[u] = ((Vl[u * 2] == Vl[u * 2 + 1] )? Vl[u * 2] : -1);
        Eq[u] = Eq[u * 2] && Eq[u * 2 + 1];
    }
};
vector<SL> SS;
void af() {
    int ok = 0;
    for(auto &it : SS) ok |= it.Eq[1];
    cout << (ok ? "Yes\n" : "No\n");
}
void rd(vi &C) {
    string w;
    cin >> w;
    for(auto it : w) C.push_back(LT(it));
}
int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);
    cin >> n;
    for(int i = 0; i < 3; ++i) rd(C[i]);
    int nr = 2;
    for(int i = 0; i < 3; ++i)
        for(int j = i + 1; j < 3; ++j)
            for(int k = !(++nr); k < n; ++k) C[nr].push_back(CMB(C[i][k], C[j][k]));
    for(int i = 0; i < n; ++i) C[6].push_back(CMB(C[0][i], CMB(C[1][i], C[2][i])));
    for(int i = 7; i <= 9; ++i)
        for(int k = 0; k < n;  ++k) C[i].push_back(CMB(C[i-4][k], C[i-7][k]));
    cin >> q;
    rd(P);
    for(int i = 0; i < 10; ++i)
        SS.emplace_back(C[i]);
    af();
    for(int i = 1, l, r; i <= q; ++i) {
        char c;
        cin >> l >> r >> c;
        --l, --r;
        for(auto &it : SS)
            it.pset(l, r, LT(c), 1, 0, n - 1);
        af();
    }
    return 0;
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 254 ms 145320 KB Output is correct
2 Correct 286 ms 145360 KB Output is correct
3 Correct 271 ms 145444 KB Output is correct
4 Correct 240 ms 145416 KB Output is correct
5 Correct 242 ms 145444 KB Output is correct
6 Correct 242 ms 145428 KB Output is correct
7 Correct 253 ms 145412 KB Output is correct
8 Correct 286 ms 145360 KB Output is correct
9 Correct 257 ms 145476 KB Output is correct
10 Correct 252 ms 145520 KB Output is correct
11 Correct 260 ms 145412 KB Output is correct
12 Correct 263 ms 145456 KB Output is correct
13 Correct 259 ms 145536 KB Output is correct
14 Correct 269 ms 145388 KB Output is correct
15 Correct 258 ms 145436 KB Output is correct
16 Correct 276 ms 145320 KB Output is correct
17 Correct 262 ms 145324 KB Output is correct
18 Correct 257 ms 145428 KB Output is correct

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 254 ms 145320 KB Output is correct
2 Correct 286 ms 145360 KB Output is correct
3 Correct 271 ms 145444 KB Output is correct
4 Correct 240 ms 145416 KB Output is correct
5 Correct 242 ms 145444 KB Output is correct
6 Correct 242 ms 145428 KB Output is correct
7 Correct 253 ms 145412 KB Output is correct
8 Correct 286 ms 145360 KB Output is correct
9 Correct 257 ms 145476 KB Output is correct
10 Correct 252 ms 145520 KB Output is correct
11 Correct 260 ms 145412 KB Output is correct
12 Correct 263 ms 145456 KB Output is correct
13 Correct 259 ms 145536 KB Output is correct
14 Correct 269 ms 145388 KB Output is correct
15 Correct 258 ms 145436 KB Output is correct
16 Correct 276 ms 145320 KB Output is correct
17 Correct 262 ms 145324 KB Output is correct
18 Correct 257 ms 145428 KB Output is correct
19 Correct 1628 ms 192036 KB Output is correct
20 Correct 1355 ms 191972 KB Output is correct
21 Correct 1102 ms 190964 KB Output is correct
22 Correct 1036 ms 189492 KB Output is correct
23 Correct 477 ms 148228 KB Output is correct
24 Correct 461 ms 148148 KB Output is correct
25 Correct 1089 ms 191932 KB Output is correct
26 Correct 1194 ms 191988 KB Output is correct
27 Correct 1351 ms 191940 KB Output is correct
28 Correct 1322 ms 191916 KB Output is correct
29 Correct 1291 ms 191540 KB Output is correct
30 Correct 533 ms 148180 KB Output is correct
31 Correct 1273 ms 191944 KB Output is correct
32 Correct 1249 ms 191004 KB Output is correct
33 Correct 462 ms 148148 KB Output is correct
34 Correct 1333 ms 192272 KB Output is correct
35 Correct 950 ms 188116 KB Output is correct
36 Correct 435 ms 148144 KB Output is correct
37 Correct 442 ms 148120 KB Output is correct
38 Correct 1073 ms 192200 KB Output is correct
39 Correct 524 ms 192292 KB Output is correct
40 Correct 1016 ms 171368 KB Output is correct
41 Correct 1776 ms 192196 KB Output is correct
42 Correct 189 ms 192152 KB Output is correct

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 254 ms 145320 KB Output is correct
2 Correct 286 ms 145360 KB Output is correct
3 Correct 271 ms 145444 KB Output is correct
4 Correct 240 ms 145416 KB Output is correct
5 Correct 242 ms 145444 KB Output is correct
6 Correct 242 ms 145428 KB Output is correct
7 Correct 253 ms 145412 KB Output is correct
8 Correct 286 ms 145360 KB Output is correct
9 Correct 257 ms 145476 KB Output is correct
10 Correct 252 ms 145520 KB Output is correct
11 Correct 260 ms 145412 KB Output is correct
12 Correct 263 ms 145456 KB Output is correct
13 Correct 259 ms 145536 KB Output is correct
14 Correct 269 ms 145388 KB Output is correct
15 Correct 258 ms 145436 KB Output is correct
16 Correct 276 ms 145320 KB Output is correct
17 Correct 262 ms 145324 KB Output is correct
18 Correct 257 ms 145428 KB Output is correct
19 Correct 309 ms 145452 KB Output is correct
20 Correct 292 ms 145380 KB Output is correct
21 Correct 269 ms 145368 KB Output is correct
22 Correct 242 ms 145428 KB Output is correct
23 Correct 268 ms 145360 KB Output is correct
24 Correct 259 ms 145348 KB Output is correct
25 Correct 287 ms 145320 KB Output is correct
26 Correct 252 ms 145360 KB Output is correct
27 Correct 287 ms 145432 KB Output is correct
28 Correct 243 ms 145448 KB Output is correct
29 Correct 265 ms 145388 KB Output is correct
30 Correct 249 ms 145472 KB Output is correct
31 Incorrect 268 ms 145316 KB Output isn't correct
32 Halted 0 ms 0 KB -

Subtask #4
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 254 ms 145320 KB Output is correct
2 Correct 286 ms 145360 KB Output is correct
3 Correct 271 ms 145444 KB Output is correct
4 Correct 240 ms 145416 KB Output is correct
5 Correct 242 ms 145444 KB Output is correct
6 Correct 242 ms 145428 KB Output is correct
7 Correct 253 ms 145412 KB Output is correct
8 Correct 286 ms 145360 KB Output is correct
9 Correct 257 ms 145476 KB Output is correct
10 Correct 252 ms 145520 KB Output is correct
11 Correct 260 ms 145412 KB Output is correct
12 Correct 263 ms 145456 KB Output is correct
13 Correct 259 ms 145536 KB Output is correct
14 Correct 269 ms 145388 KB Output is correct
15 Correct 258 ms 145436 KB Output is correct
16 Correct 276 ms 145320 KB Output is correct
17 Correct 262 ms 145324 KB Output is correct
18 Correct 257 ms 145428 KB Output is correct
19 Correct 1628 ms 192036 KB Output is correct
20 Correct 1355 ms 191972 KB Output is correct
21 Correct 1102 ms 190964 KB Output is correct
22 Correct 1036 ms 189492 KB Output is correct
23 Correct 477 ms 148228 KB Output is correct
24 Correct 461 ms 148148 KB Output is correct
25 Correct 1089 ms 191932 KB Output is correct
26 Correct 1194 ms 191988 KB Output is correct
27 Correct 1351 ms 191940 KB Output is correct
28 Correct 1322 ms 191916 KB Output is correct
29 Correct 1291 ms 191540 KB Output is correct
30 Correct 533 ms 148180 KB Output is correct
31 Correct 1273 ms 191944 KB Output is correct
32 Correct 1249 ms 191004 KB Output is correct
33 Correct 462 ms 148148 KB Output is correct
34 Correct 1333 ms 192272 KB Output is correct
35 Correct 950 ms 188116 KB Output is correct
36 Correct 435 ms 148144 KB Output is correct
37 Correct 442 ms 148120 KB Output is correct
38 Correct 1073 ms 192200 KB Output is correct
39 Correct 524 ms 192292 KB Output is correct
40 Correct 1016 ms 171368 KB Output is correct
41 Correct 1776 ms 192196 KB Output is correct
42 Correct 189 ms 192152 KB Output is correct
43 Correct 309 ms 145452 KB Output is correct
44 Correct 292 ms 145380 KB Output is correct
45 Correct 269 ms 145368 KB Output is correct
46 Correct 242 ms 145428 KB Output is correct
47 Correct 268 ms 145360 KB Output is correct
48 Correct 259 ms 145348 KB Output is correct
49 Correct 287 ms 145320 KB Output is correct
50 Correct 252 ms 145360 KB Output is correct
51 Correct 287 ms 145432 KB Output is correct
52 Correct 243 ms 145448 KB Output is correct
53 Correct 265 ms 145388 KB Output is correct
54 Correct 249 ms 145472 KB Output is correct
55 Incorrect 268 ms 145316 KB Output isn't correct
56 Halted 0 ms 0 KB -