oj.uz

Submission #985273

# Submission time Handle Problem Language Result Execution time Memory
985273 2024-05-17T14:08:05 Z underwaterkillerwhale Crossing (JOI21_crossing) C++17
26 / 100
 7000 ms 72760 KB 
#include <bits/stdc++.h>
#define se              second
#define fs              first
#define mp              make_pair
#define pb              push_back
#define ll              long long
#define ii              pair<ll,ll>
#define ld              long double
#define SZ(v)           (int)v.size()
#define ALL(v)          v.begin(), v.end()
#define bit(msk, i)     ((msk >> i) & 1)
#define iter(id, v)     for(auto id : v)
#define rep(i,m,n)      for(int i=(m); i<=(n); i++)
#define reb(i,m,n)      for(int i=(m); i>=(n); i--)
using namespace std;

mt19937_64 rd(chrono :: steady_clock :: now().time_since_epoch().count());
ll Rand(ll l, ll r) { return uniform_int_distribution<ll> (l, r)(rd); }

const int N = 1e6 + 7;
const ll Mod = 1e9 + 7;
const int szBL = 916;
const ll INF = 1e9;
const int BASE = 1337;

int n, Q;
ll pw[N], hs[30][N];

void initHS () {
    pw[0] = 1;
    rep (i, 1, n * 2) pw[i] = pw[i - 1] * BASE;
    rep (i, 0, 29) hs[i][0] = 1;
    vector<char> c = {'J', 'O', 'I'};
    rep (i, 1, n)
    iter (id, c)
        hs[id - 'A'][i] = (hs[id - 'A'][i - 1] * BASE % Mod + id - 'A') % Mod;
}

ll getHS (string S) {
    ll res = 0;
    rep (i, 1, n) res = (res * BASE % Mod + S[i - 1]  - 'A') % Mod;
    return res;
}

void solution () {
    cin >> n;
    string A, B, C;
    cin >> A >> B >> C;
    vector<char> c = {'J', 'O', 'I'};

    set<string> S = {A, B, C};
    auto Merge = [] (string A, string B) {
        static string res;
        res.resize(SZ(A));
        rep (i, 0, SZ(A) - 1)
            if (A[i] == B[i]) res[i] = A[i];
            else {
                static set<char> c;
                c = {'J', 'O', 'I'};
                c.erase(A[i]);
                c.erase(B[i]);
                res[i] = *c.begin();
            }
        return res;
    };
    int prevsz = SZ(S);
    while (1) {
        static set<string> newStr;
        newStr.clear();
        iter (&id1, S)
        iter( &id2, S) newStr.insert(Merge(id1, id2));
        iter (&id, newStr) S.insert(id);
        if (SZ(S) == prevsz) break;
        else prevsz = SZ(S);
    }
    set<ll> vecHS;
    initHS();
    iter (&id, S) vecHS.insert(getHS(id));
    cin >> Q;
    string T; cin >> T;
    if (vecHS.find(getHS(T)) != vecHS.end()) cout <<"Yes\n";
    else cout <<"No\n";
    rep (i, 1, Q) {
        int L, R;
        char C;
        cin >> L >> R >> C;
        rep (j, L - 1, R - 1) T[j] = char(C);
        if (vecHS.find(getHS(T)) != vecHS.end()) cout <<"Yes\n";
        else cout <<"No\n";
    }
}

#define file(name) freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout);

int main () {
//    file("c");
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    ll num_Test = 1;
//    cin >> num_Test;
    while(num_Test--)
        solution();
}
/*
18 3
2 5
6 21
13 19
9 17
14 17
19 20
2 16
2 10
9 14
19 20
14 16
1 3
17 19
14 21
18 19
4 7
5 12
1 13

*/

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 168 ms 63444 KB Output is correct
2 Correct 206 ms 63464 KB Output is correct
3 Correct 211 ms 63568 KB Output is correct
4 Correct 194 ms 63372 KB Output is correct
5 Correct 183 ms 63576 KB Output is correct
6 Correct 185 ms 63456 KB Output is correct
7 Correct 162 ms 63480 KB Output is correct
8 Correct 204 ms 63564 KB Output is correct
9 Correct 210 ms 63572 KB Output is correct
10 Correct 204 ms 63572 KB Output is correct
11 Correct 205 ms 63572 KB Output is correct
12 Correct 208 ms 63688 KB Output is correct
13 Correct 202 ms 63568 KB Output is correct
14 Correct 206 ms 63512 KB Output is correct
15 Correct 206 ms 63392 KB Output is correct
16 Correct 204 ms 63632 KB Output is correct
17 Correct 203 ms 63572 KB Output is correct
18 Correct 212 ms 63568 KB Output is correct

Subtask #2
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 168 ms 63444 KB Output is correct
2 Correct 206 ms 63464 KB Output is correct
3 Correct 211 ms 63568 KB Output is correct
4 Correct 194 ms 63372 KB Output is correct
5 Correct 183 ms 63576 KB Output is correct
6 Correct 185 ms 63456 KB Output is correct
7 Correct 162 ms 63480 KB Output is correct
8 Correct 204 ms 63564 KB Output is correct
9 Correct 210 ms 63572 KB Output is correct
10 Correct 204 ms 63572 KB Output is correct
11 Correct 205 ms 63572 KB Output is correct
12 Correct 208 ms 63688 KB Output is correct
13 Correct 202 ms 63568 KB Output is correct
14 Correct 206 ms 63512 KB Output is correct
15 Correct 206 ms 63392 KB Output is correct
16 Correct 204 ms 63632 KB Output is correct
17 Correct 203 ms 63572 KB Output is correct
18 Correct 212 ms 63568 KB Output is correct
19 Execution timed out 7039 ms 72760 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 168 ms 63444 KB Output is correct
2 Correct 206 ms 63464 KB Output is correct
3 Correct 211 ms 63568 KB Output is correct
4 Correct 194 ms 63372 KB Output is correct
5 Correct 183 ms 63576 KB Output is correct
6 Correct 185 ms 63456 KB Output is correct
7 Correct 162 ms 63480 KB Output is correct
8 Correct 204 ms 63564 KB Output is correct
9 Correct 210 ms 63572 KB Output is correct
10 Correct 204 ms 63572 KB Output is correct
11 Correct 205 ms 63572 KB Output is correct
12 Correct 208 ms 63688 KB Output is correct
13 Correct 202 ms 63568 KB Output is correct
14 Correct 206 ms 63512 KB Output is correct
15 Correct 206 ms 63392 KB Output is correct
16 Correct 204 ms 63632 KB Output is correct
17 Correct 203 ms 63572 KB Output is correct
18 Correct 212 ms 63568 KB Output is correct
19 Correct 201 ms 63456 KB Output is correct
20 Correct 219 ms 63520 KB Output is correct
21 Correct 207 ms 63592 KB Output is correct
22 Correct 137 ms 63572 KB Output is correct
23 Correct 207 ms 63488 KB Output is correct
24 Correct 184 ms 63556 KB Output is correct
25 Correct 206 ms 63572 KB Output is correct
26 Correct 149 ms 63568 KB Output is correct
27 Correct 219 ms 63576 KB Output is correct
28 Correct 173 ms 63572 KB Output is correct
29 Correct 208 ms 63620 KB Output is correct
30 Correct 152 ms 63568 KB Output is correct
31 Correct 213 ms 63576 KB Output is correct
32 Correct 200 ms 63568 KB Output is correct
33 Correct 206 ms 63980 KB Output is correct
34 Correct 151 ms 63932 KB Output is correct
35 Correct 206 ms 64080 KB Output is correct
36 Correct 206 ms 63984 KB Output is correct
37 Correct 223 ms 64148 KB Output is correct
38 Correct 209 ms 63992 KB Output is correct
39 Correct 207 ms 64084 KB Output is correct
40 Correct 207 ms 64084 KB Output is correct
41 Correct 208 ms 63896 KB Output is correct
42 Correct 217 ms 63988 KB Output is correct
43 Correct 165 ms 64088 KB Output is correct
44 Correct 206 ms 64080 KB Output is correct

Subtask #4
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 168 ms 63444 KB Output is correct
2 Correct 206 ms 63464 KB Output is correct
3 Correct 211 ms 63568 KB Output is correct
4 Correct 194 ms 63372 KB Output is correct
5 Correct 183 ms 63576 KB Output is correct
6 Correct 185 ms 63456 KB Output is correct
7 Correct 162 ms 63480 KB Output is correct
8 Correct 204 ms 63564 KB Output is correct
9 Correct 210 ms 63572 KB Output is correct
10 Correct 204 ms 63572 KB Output is correct
11 Correct 205 ms 63572 KB Output is correct
12 Correct 208 ms 63688 KB Output is correct
13 Correct 202 ms 63568 KB Output is correct
14 Correct 206 ms 63512 KB Output is correct
15 Correct 206 ms 63392 KB Output is correct
16 Correct 204 ms 63632 KB Output is correct
17 Correct 203 ms 63572 KB Output is correct
18 Correct 212 ms 63568 KB Output is correct
19 Execution timed out 7039 ms 72760 KB Time limit exceeded
20 Halted 0 ms 0 KB -