oj.uz

Submission #750988

# Submission time Handle Problem Language Result Execution time Memory
750988 2023-05-30T17:52:48 Z joelgun14 Crossing (JOI21_crossing) C++17
49 / 100
 1432 ms 40856 KB 
// header file
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
// pragma
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
// macros
#define endl "\n"
#define ll long long
#define mp make_pair
#define ins insert
#define lb lower_bound
#define pb push_back
#define ub upper_bound
#define lll __int128
#define fi first
#define se second
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_multiset;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
string operate(string a, string b) {
    for(int it = 0; it < a.size(); ++it) {
        if(a[it] == b[it])
            continue;
        bool j = 0, o = 0, i = 0;
        if(a[it] == 'J')
            j = 1;
        else if(a[it] == 'O')
            o = 1;
        else
            i = 1;
        if(b[it] == 'J')
            j = 1;
        else if(b[it] == 'O')
            o = 1;
        else
            i = 1;
        if(!j)
            a[it] = 'J';
        else if(!o)
            a[it] = 'O';
        else
            a[it] = 'I';
    }
    return a;
}
int to_num(string s) {
    if(s == "J")
        return 0;
    else if(s == "O")
        return 1;
    else
        return 2;
}
int to_num(char x) {
    if(x == 'J')
        return 0;
    else if(x == 'O')
        return 1;
    else
        return 2;
}
const int lim = 2e5 + 5;
struct fenwick {
    int a[lim];
    fenwick() {
        memset(a, 0, sizeof(a));
    }
    void update(int idx, int val) {
        while(idx < lim) {
            a[idx] += val;
            idx += (idx&-idx);
        }
    }
    int query(int idx) {
        int res = 0;
        while(idx > 0) {
            res += a[idx];
            idx -= (idx&-idx);
        }
        return res;
    }
    int query(int l, int r) {
        return query(r) - query(l - 1);
    }
};
// buat bit 27 state 1 nya implicit disimpan di segment bawahnya
// remove segment bawahnya per segment gtu
// nanti cnt cari mutually exclusive segment
// char akhirnya berapa
// char 1, 2, 3, dan akhir
// 4 pertama -> quadruplet 1
// 4 kedua -> quadruplet 2
bool compatible[3][3][3][3][3][3][3][3];
bool possible[3][3][3][3];
int pref[lim][3][3][3];
int cnt[3][3][3][3];
// precompute itu incompatible pairsnya gmn aja
int main() {
    ios_base::sync_with_stdio(0); cin.tie(NULL);
    int n;
    cin >> n;
    // coba cek tiap possibility pengambilan
    // max pengambilan cmn 3?
    int e[n + 1][3];
    for(int i = 0; i < 3; ++i) {
        for(int j = 1; j <= n; ++j) {
            char x;
            cin >> x;
            e[j][i] = to_num(x);
        }
    }
    for(int i = 1; i <= n; ++i) {
        for(int j = 0; j < 3; ++j) {
            for(int k = 0; k < 3; ++k) {
                for(int l = 0; l < 3; ++l) {
                    pref[i][j][k][l] += pref[i - 1][j][k][l];
                }
            }
        }
        pref[i][e[i][0]][e[i][1]][e[i][2]]++;
    }
    int q;
    cin >> q;
    set<pair<pair<int, int>, int>> segments;
    for(int i = 1; i <= n; ++i) {
        char x;
        cin >> x;
        for(int j = 0; j < 3; ++j) {
            for(int k = 0; k < 3; ++k) {
                for(int l = 0; l < 3; ++l) {
                    cnt[j][k][l][to_num(x)] += pref[i][j][k][l] - pref[i - 1][j][k][l];
                }
            }
        }
        segments.insert(make_pair(make_pair(i, i), to_num(x)));
    }
    string choice[3] = {"J", "O", "I"};
    vector<vector<int>> triplets;
    for(int i = 0; i < 3; ++i) {
        for(int j = 0; j < 3; ++j) {
            for(int k = 0; k < 3; ++k) {
                triplets.push_back({i, j, k});
            }
        }
    }
    // utk tiap triple consider tiap pengambilan dengan triple itu sendiri, apa bisa buat char tertentu?
    for(auto p : triplets) {
        for(int i = 0; i < 3; ++i) {
            string tmp = choice[p[i]];
            for(int j = 0; j < 3; ++j) {
                tmp = operate(tmp, choice[p[j]]);
                for(int k = 0; k < 3; ++k) {
                    tmp = operate(tmp, choice[p[k]]);
                    possible[p[0]][p[1]][p[2]][to_num(tmp)] = 1;
                }
            }
        }
    }
    for(int trip = 0; trip < triplets.size(); ++trip) {
        for(int trip2 = trip + 1; trip2 < triplets.size(); ++trip2) {
            vector<int> p1 = triplets[trip], p2 = triplets[trip2];
            for(int i = 0; i < 3; ++i) {
                string tmp1 = choice[p1[i]];
                string tmp2 = choice[p2[i]];
                for(int j = 0; j < 3; ++j) {
                    tmp1 = operate(tmp1, choice[p1[j]]);
                    tmp2 = operate(tmp2, choice[p2[j]]);
                    for(int k = 0; k < 3; ++k) {
                        tmp1 = operate(tmp1, choice[p1[k]]);
                        tmp2 = operate(tmp2, choice[p2[k]]);
                        compatible[p1[0]][p1[1]][p1[2]][to_num(tmp1)][p2[0]][p2[1]][p2[2]][to_num(tmp2)] = 1;
                    }
                }
            }
        }
    }
    // coba permutasi size 1, 2, 3
    // given same sequence tp resultnya beda -> pasti gabisa -> O(81Q) -> 1.6e7
    // klo misal ga ada yg beda, berarti max ada 27 aja
    // klo 27, nanti cek O(27^2*Q) -> 1.4e8
    // total O(81Q)
    bool ans = 1;
    vector<vector<int>> a;
    for(int i = 0; i < 3; ++i) {
        for(int j = 0; j < 3; ++j) {
            for(int k = 0; k < 3; ++k) {
                for(int l = 0; l < 3; ++l) {
                    if(cnt[i][j][k][l] && !possible[i][j][k][l])
                        ans = 0;
                    if(cnt[i][j][k][l])
                        a.push_back({i, j, k, l});
                }
            }
        }
    }
    for(int i = 0; i < a.size(); ++i) {
        for(int j = i + 1; j < a.size(); ++j) {
            if(!compatible[a[i][0]][a[i][1]][a[i][2]][a[i][3]][a[j][0]][a[j][1]][a[j][2]][a[j][3]])
                ans = 0;
        }
    }
    if(ans)
        cout << "Yes" << endl;
    else
        cout << "No" << endl;
    while(q--) {
        // jalankan kode update
        int l, r; char x;
        cin >> l >> r >> x;
        while(segments.lower_bound(mp(make_pair(l, 0), 0)) != segments.end() && (*segments.lower_bound(mp(make_pair(l, 0), 0))).fi.se <= r) {
            pair<pair<int, int>, int> tmp = *segments.lower_bound(mp(mp(l, 0), 0));
            int cl = tmp.fi.se, cr = tmp.fi.fi, type = tmp.se;
            segments.erase(tmp);
            if(cl < l) {
                segments.ins(mp(mp(l - 1, cl), type));
            }
            if(cr > r) {
                segments.ins(mp(mp(cr, r + 1), type));
            }
            cl = max(l, cl);
            cr = min(r, cr);
            for(int i = 0; i < 3; ++i) {
                for(int j = 0; j < 3; ++j) {
                    for(int k = 0; k < 3; ++k) {
                        cnt[i][j][k][type] -= pref[cr][i][j][k] - pref[cl - 1][i][j][k];
                        cnt[i][j][k][to_num(x)] += pref[cr][i][j][k] - pref[cl - 1][i][j][k];
                    }
                }
            }
        }
        segments.ins(mp(mp(r, l), to_num(x)));
        // kode cek answer
        bool ans = 1;
        vector<vector<int>> a;
        for(int i = 0; i < 3; ++i) {
            for(int j = 0; j < 3; ++j) {
                for(int k = 0; k < 3; ++k) {
                    for(int l = 0; l < 3; ++l) {
                        if(cnt[i][j][k][l] && !possible[i][j][k][l])
                            ans = 0;
                        if(cnt[i][j][k][l])
                            a.push_back({i, j, k, l});
                    }
                }
            }
        }
        if(!ans) {
            cout << "No" << endl;
            continue;
        }
        for(int i = 0; i < a.size(); ++i) {
            for(int j = i + 1; j < a.size(); ++j) {
                if(!compatible[a[i][0]][a[i][1]][a[i][2]][a[i][3]][a[j][0]][a[j][1]][a[j][2]][a[j][3]])
                    ans = 0;
            }
        }
        if(ans)
            cout << "Yes" << endl;
        else
            cout << "No" << endl;
    }
    return 0;
}

Compilation message

Main.cpp: In function 'std::string operate(std::string, std::string)':
Main.cpp:24:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |     for(int it = 0; it < a.size(); ++it) {
      |                     ~~~^~~~~~~~~~
Main.cpp:27:28: warning: variable 'i' set but not used [-Wunused-but-set-variable]
   27 |         bool j = 0, o = 0, i = 0;
      |                            ^
Main.cpp: In function 'int main()':
Main.cpp:162:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  162 |     for(int trip = 0; trip < triplets.size(); ++trip) {
      |                       ~~~~~^~~~~~~~~~~~~~~~~
Main.cpp:163:41: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  163 |         for(int trip2 = trip + 1; trip2 < triplets.size(); ++trip2) {
      |                                   ~~~~~~^~~~~~~~~~~~~~~~~
Main.cpp:199:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  199 |     for(int i = 0; i < a.size(); ++i) {
      |                    ~~^~~~~~~~~~
Main.cpp:200:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  200 |         for(int j = i + 1; j < a.size(); ++j) {
      |                            ~~^~~~~~~~~~
Main.cpp:254:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  254 |         for(int i = 0; i < a.size(); ++i) {
      |                        ~~^~~~~~~~~~
Main.cpp:255:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  255 |             for(int j = i + 1; j < a.size(); ++j) {
      |                                ~~^~~~~~~~~~

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 224 ms 1044 KB Output is correct
2 Correct 252 ms 1040 KB Output is correct
3 Correct 192 ms 972 KB Output is correct
4 Correct 231 ms 1008 KB Output is correct
5 Correct 239 ms 1076 KB Output is correct
6 Correct 230 ms 952 KB Output is correct
7 Correct 245 ms 1168 KB Output is correct
8 Correct 246 ms 1084 KB Output is correct
9 Correct 257 ms 1068 KB Output is correct
10 Correct 281 ms 1172 KB Output is correct
11 Correct 257 ms 1036 KB Output is correct
12 Correct 261 ms 944 KB Output is correct
13 Correct 254 ms 972 KB Output is correct
14 Correct 246 ms 1088 KB Output is correct
15 Correct 258 ms 1048 KB Output is correct
16 Correct 249 ms 1000 KB Output is correct
17 Correct 260 ms 1176 KB Output is correct
18 Correct 141 ms 1092 KB Output is correct

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 224 ms 1044 KB Output is correct
2 Correct 252 ms 1040 KB Output is correct
3 Correct 192 ms 972 KB Output is correct
4 Correct 231 ms 1008 KB Output is correct
5 Correct 239 ms 1076 KB Output is correct
6 Correct 230 ms 952 KB Output is correct
7 Correct 245 ms 1168 KB Output is correct
8 Correct 246 ms 1084 KB Output is correct
9 Correct 257 ms 1068 KB Output is correct
10 Correct 281 ms 1172 KB Output is correct
11 Correct 257 ms 1036 KB Output is correct
12 Correct 261 ms 944 KB Output is correct
13 Correct 254 ms 972 KB Output is correct
14 Correct 246 ms 1088 KB Output is correct
15 Correct 258 ms 1048 KB Output is correct
16 Correct 249 ms 1000 KB Output is correct
17 Correct 260 ms 1176 KB Output is correct
18 Correct 141 ms 1092 KB Output is correct
19 Correct 478 ms 40000 KB Output is correct
20 Correct 401 ms 40428 KB Output is correct
21 Correct 602 ms 38220 KB Output is correct
22 Correct 549 ms 34616 KB Output is correct
23 Correct 380 ms 5104 KB Output is correct
24 Correct 393 ms 5196 KB Output is correct
25 Correct 655 ms 40640 KB Output is correct
26 Correct 636 ms 40648 KB Output is correct
27 Correct 530 ms 40856 KB Output is correct
28 Correct 551 ms 40744 KB Output is correct
29 Correct 499 ms 39428 KB Output is correct
30 Correct 341 ms 5196 KB Output is correct
31 Correct 526 ms 40592 KB Output is correct
32 Correct 567 ms 37152 KB Output is correct
33 Correct 380 ms 5068 KB Output is correct
34 Correct 594 ms 40532 KB Output is correct
35 Correct 556 ms 30840 KB Output is correct
36 Correct 371 ms 4992 KB Output is correct
37 Correct 386 ms 5032 KB Output is correct
38 Correct 294 ms 40396 KB Output is correct
39 Correct 470 ms 40752 KB Output is correct
40 Correct 570 ms 27768 KB Output is correct
41 Correct 405 ms 40836 KB Output is correct
42 Correct 236 ms 40116 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 224 ms 1044 KB Output is correct
2 Correct 252 ms 1040 KB Output is correct
3 Correct 192 ms 972 KB Output is correct
4 Correct 231 ms 1008 KB Output is correct
5 Correct 239 ms 1076 KB Output is correct
6 Correct 230 ms 952 KB Output is correct
7 Correct 245 ms 1168 KB Output is correct
8 Correct 246 ms 1084 KB Output is correct
9 Correct 257 ms 1068 KB Output is correct
10 Correct 281 ms 1172 KB Output is correct
11 Correct 257 ms 1036 KB Output is correct
12 Correct 261 ms 944 KB Output is correct
13 Correct 254 ms 972 KB Output is correct
14 Correct 246 ms 1088 KB Output is correct
15 Correct 258 ms 1048 KB Output is correct
16 Correct 249 ms 1000 KB Output is correct
17 Correct 260 ms 1176 KB Output is correct
18 Correct 141 ms 1092 KB Output is correct
19 Correct 621 ms 1100 KB Output is correct
20 Correct 386 ms 1148 KB Output is correct
21 Correct 325 ms 972 KB Output is correct
22 Correct 290 ms 972 KB Output is correct
23 Correct 343 ms 1032 KB Output is correct
24 Correct 325 ms 1004 KB Output is correct
25 Correct 332 ms 1080 KB Output is correct
26 Correct 305 ms 924 KB Output is correct
27 Correct 331 ms 1016 KB Output is correct
28 Correct 300 ms 984 KB Output is correct
29 Correct 335 ms 1112 KB Output is correct
30 Correct 295 ms 1008 KB Output is correct
31 Correct 663 ms 1096 KB Output is correct
32 Correct 671 ms 1260 KB Output is correct
33 Correct 741 ms 1076 KB Output is correct
34 Correct 574 ms 1064 KB Output is correct
35 Correct 791 ms 1256 KB Output is correct
36 Correct 761 ms 1056 KB Output is correct
37 Correct 755 ms 1068 KB Output is correct
38 Correct 688 ms 1020 KB Output is correct
39 Correct 803 ms 1132 KB Output is correct
40 Correct 740 ms 1048 KB Output is correct
41 Correct 713 ms 1044 KB Output is correct
42 Correct 699 ms 1120 KB Output is correct
43 Correct 647 ms 1144 KB Output is correct
44 Correct 711 ms 1024 KB Output is correct

Subtask #4
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 224 ms 1044 KB Output is correct
2 Correct 252 ms 1040 KB Output is correct
3 Correct 192 ms 972 KB Output is correct
4 Correct 231 ms 1008 KB Output is correct
5 Correct 239 ms 1076 KB Output is correct
6 Correct 230 ms 952 KB Output is correct
7 Correct 245 ms 1168 KB Output is correct
8 Correct 246 ms 1084 KB Output is correct
9 Correct 257 ms 1068 KB Output is correct
10 Correct 281 ms 1172 KB Output is correct
11 Correct 257 ms 1036 KB Output is correct
12 Correct 261 ms 944 KB Output is correct
13 Correct 254 ms 972 KB Output is correct
14 Correct 246 ms 1088 KB Output is correct
15 Correct 258 ms 1048 KB Output is correct
16 Correct 249 ms 1000 KB Output is correct
17 Correct 260 ms 1176 KB Output is correct
18 Correct 141 ms 1092 KB Output is correct
19 Correct 478 ms 40000 KB Output is correct
20 Correct 401 ms 40428 KB Output is correct
21 Correct 602 ms 38220 KB Output is correct
22 Correct 549 ms 34616 KB Output is correct
23 Correct 380 ms 5104 KB Output is correct
24 Correct 393 ms 5196 KB Output is correct
25 Correct 655 ms 40640 KB Output is correct
26 Correct 636 ms 40648 KB Output is correct
27 Correct 530 ms 40856 KB Output is correct
28 Correct 551 ms 40744 KB Output is correct
29 Correct 499 ms 39428 KB Output is correct
30 Correct 341 ms 5196 KB Output is correct
31 Correct 526 ms 40592 KB Output is correct
32 Correct 567 ms 37152 KB Output is correct
33 Correct 380 ms 5068 KB Output is correct
34 Correct 594 ms 40532 KB Output is correct
35 Correct 556 ms 30840 KB Output is correct
36 Correct 371 ms 4992 KB Output is correct
37 Correct 386 ms 5032 KB Output is correct
38 Correct 294 ms 40396 KB Output is correct
39 Correct 470 ms 40752 KB Output is correct
40 Correct 570 ms 27768 KB Output is correct
41 Correct 405 ms 40836 KB Output is correct
42 Correct 236 ms 40116 KB Output is correct
43 Correct 621 ms 1100 KB Output is correct
44 Correct 386 ms 1148 KB Output is correct
45 Correct 325 ms 972 KB Output is correct
46 Correct 290 ms 972 KB Output is correct
47 Correct 343 ms 1032 KB Output is correct
48 Correct 325 ms 1004 KB Output is correct
49 Correct 332 ms 1080 KB Output is correct
50 Correct 305 ms 924 KB Output is correct
51 Correct 331 ms 1016 KB Output is correct
52 Correct 300 ms 984 KB Output is correct
53 Correct 335 ms 1112 KB Output is correct
54 Correct 295 ms 1008 KB Output is correct
55 Correct 663 ms 1096 KB Output is correct
56 Correct 671 ms 1260 KB Output is correct
57 Correct 741 ms 1076 KB Output is correct
58 Correct 574 ms 1064 KB Output is correct
59 Correct 791 ms 1256 KB Output is correct
60 Correct 761 ms 1056 KB Output is correct
61 Correct 755 ms 1068 KB Output is correct
62 Correct 688 ms 1020 KB Output is correct
63 Correct 803 ms 1132 KB Output is correct
64 Correct 740 ms 1048 KB Output is correct
65 Correct 713 ms 1044 KB Output is correct
66 Correct 699 ms 1120 KB Output is correct
67 Correct 647 ms 1144 KB Output is correct
68 Correct 711 ms 1024 KB Output is correct
69 Correct 1062 ms 34428 KB Output is correct
70 Correct 1174 ms 40460 KB Output is correct
71 Correct 478 ms 5068 KB Output is correct
72 Correct 460 ms 5144 KB Output is correct
73 Correct 494 ms 5168 KB Output is correct
74 Correct 645 ms 34252 KB Output is correct
75 Correct 461 ms 5028 KB Output is correct
76 Correct 756 ms 40684 KB Output is correct
77 Correct 648 ms 34336 KB Output is correct
78 Correct 470 ms 5252 KB Output is correct
79 Correct 479 ms 5176 KB Output is correct
80 Correct 1250 ms 29696 KB Output is correct
81 Correct 1063 ms 5068 KB Output is correct
82 Correct 1432 ms 40816 KB Output is correct
83 Correct 1271 ms 38252 KB Output is correct
84 Correct 1030 ms 5256 KB Output is correct
85 Correct 1057 ms 5128 KB Output is correct
86 Correct 1101 ms 31396 KB Output is correct
87 Correct 1209 ms 40644 KB Output is correct
88 Correct 1008 ms 5164 KB Output is correct
89 Correct 1173 ms 35968 KB Output is correct
90 Correct 1321 ms 40576 KB Output is correct
91 Correct 1022 ms 5168 KB Output is correct
92 Correct 1272 ms 31036 KB Output is correct
93 Correct 1054 ms 5144 KB Output is correct
94 Correct 1056 ms 5140 KB Output is correct
95 Correct 1053 ms 5096 KB Output is correct
96 Correct 325 ms 40424 KB Output is correct
97 Incorrect 633 ms 40716 KB Output isn't correct
98 Halted 0 ms 0 KB -