oj.uz

Submission #985257

# Submission time Handle Problem Language Result Execution time Memory
985257 2024-05-17T13:54:21 Z underwaterkillerwhale Crossing (JOI21_crossing) C++17
3 / 100
 7000 ms 73000 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 = 137;

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;

    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;
    };
    set<string> S = {A, B, C};
    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 (i, L - 1, R - 1) T[i] = 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 174 ms 63976 KB Output is correct
2 Correct 209 ms 64072 KB Output is correct
3 Correct 220 ms 63896 KB Output is correct
4 Correct 199 ms 64076 KB Output is correct
5 Correct 188 ms 64060 KB Output is correct
6 Correct 190 ms 63828 KB Output is correct
7 Correct 162 ms 64080 KB Output is correct
8 Correct 208 ms 63984 KB Output is correct
9 Correct 209 ms 64372 KB Output is correct
10 Correct 209 ms 64084 KB Output is correct
11 Correct 207 ms 64092 KB Output is correct
12 Correct 215 ms 64132 KB Output is correct
13 Correct 209 ms 64084 KB Output is correct
14 Correct 210 ms 64084 KB Output is correct
15 Correct 212 ms 64080 KB Output is correct
16 Correct 208 ms 64052 KB Output is correct
17 Correct 211 ms 63964 KB Output is correct
18 Correct 219 ms 64068 KB Output is correct

Subtask #2
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 174 ms 63976 KB Output is correct
2 Correct 209 ms 64072 KB Output is correct
3 Correct 220 ms 63896 KB Output is correct
4 Correct 199 ms 64076 KB Output is correct
5 Correct 188 ms 64060 KB Output is correct
6 Correct 190 ms 63828 KB Output is correct
7 Correct 162 ms 64080 KB Output is correct
8 Correct 208 ms 63984 KB Output is correct
9 Correct 209 ms 64372 KB Output is correct
10 Correct 209 ms 64084 KB Output is correct
11 Correct 207 ms 64092 KB Output is correct
12 Correct 215 ms 64132 KB Output is correct
13 Correct 209 ms 64084 KB Output is correct
14 Correct 210 ms 64084 KB Output is correct
15 Correct 212 ms 64080 KB Output is correct
16 Correct 208 ms 64052 KB Output is correct
17 Correct 211 ms 63964 KB Output is correct
18 Correct 219 ms 64068 KB Output is correct
19 Execution timed out 7009 ms 73000 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 174 ms 63976 KB Output is correct
2 Correct 209 ms 64072 KB Output is correct
3 Correct 220 ms 63896 KB Output is correct
4 Correct 199 ms 64076 KB Output is correct
5 Correct 188 ms 64060 KB Output is correct
6 Correct 190 ms 63828 KB Output is correct
7 Correct 162 ms 64080 KB Output is correct
8 Correct 208 ms 63984 KB Output is correct
9 Correct 209 ms 64372 KB Output is correct
10 Correct 209 ms 64084 KB Output is correct
11 Correct 207 ms 64092 KB Output is correct
12 Correct 215 ms 64132 KB Output is correct
13 Correct 209 ms 64084 KB Output is correct
14 Correct 210 ms 64084 KB Output is correct
15 Correct 212 ms 64080 KB Output is correct
16 Correct 208 ms 64052 KB Output is correct
17 Correct 211 ms 63964 KB Output is correct
18 Correct 219 ms 64068 KB Output is correct
19 Correct 206 ms 63828 KB Output is correct
20 Correct 220 ms 63824 KB Output is correct
21 Correct 210 ms 64080 KB Output is correct
22 Correct 140 ms 63828 KB Output is correct
23 Correct 210 ms 64084 KB Output is correct
24 Correct 185 ms 63828 KB Output is correct
25 Correct 211 ms 64616 KB Output is correct
26 Correct 161 ms 63984 KB Output is correct
27 Correct 213 ms 64080 KB Output is correct
28 Correct 195 ms 63728 KB Output is correct
29 Correct 210 ms 64084 KB Output is correct
30 Correct 145 ms 64248 KB Output is correct
31 Correct 217 ms 64080 KB Output is correct
32 Incorrect 222 ms 64084 KB Output isn't correct
33 Halted 0 ms 0 KB -

Subtask #4
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 174 ms 63976 KB Output is correct
2 Correct 209 ms 64072 KB Output is correct
3 Correct 220 ms 63896 KB Output is correct
4 Correct 199 ms 64076 KB Output is correct
5 Correct 188 ms 64060 KB Output is correct
6 Correct 190 ms 63828 KB Output is correct
7 Correct 162 ms 64080 KB Output is correct
8 Correct 208 ms 63984 KB Output is correct
9 Correct 209 ms 64372 KB Output is correct
10 Correct 209 ms 64084 KB Output is correct
11 Correct 207 ms 64092 KB Output is correct
12 Correct 215 ms 64132 KB Output is correct
13 Correct 209 ms 64084 KB Output is correct
14 Correct 210 ms 64084 KB Output is correct
15 Correct 212 ms 64080 KB Output is correct
16 Correct 208 ms 64052 KB Output is correct
17 Correct 211 ms 63964 KB Output is correct
18 Correct 219 ms 64068 KB Output is correct
19 Execution timed out 7009 ms 73000 KB Time limit exceeded
20 Halted 0 ms 0 KB -