oj.uz

Submission #833184

# Submission time Handle Problem Language Result Execution time Memory
833184 2023-08-22T02:57:43 Z maomao90 Crossing (JOI21_crossing) C++17
26 / 100
 7000 ms 1852 KB 
// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h> 
using namespace std;

#define REP(i, s, e) for (int i = (s); i < (e); i++)
#define RREP(i, s, e) for (int i = (s); i >= (e); i--)
template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}

typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define SZ(_a) (int) _a.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<iii> viii;

#ifndef DEBUG
#define cerr if (0) cerr
#endif

const int INF = 1000000005;
const ll LINF = 1000000000000000005ll;
const int MAXN = 200005;

int n;
set<string> st, nst;
int q;
string t;

int main() {
#ifndef DEBUG
    ios::sync_with_stdio(0), cin.tie(0);
#endif
    cin >> n;
    REP (i, 0, 3) {
        string s; cin >> s;
        st.insert(s);
    }
    while (1) {
        for (string a : st) {
            for (string b : st) {
                string c = a;
                REP (i, 0, n) {
                    if (a[i] == b[i]) {
                        c[i] = a[i];
                    } else {
                        c[i] = 'J' + 'O' + 'I' - a[i] - b[i];
                    }
                }
                nst.insert(c);
            }
        }
        if (SZ(nst) == SZ(st)) {
            break;
        }
        swap(st, nst);
    }
    assert(SZ(st) <= 50);
    cin >> q;
    cin >> t;
    if (st.find(t) != st.end()) {
        cout << "Yes\n";
    } else {
        cout << "No\n";
    }
    while (q--) {
        int l, r; char c; cin >> l >> r >> c;
        l--; r--;
        REP (i, l, r + 1) {
            t[i] = c;
        }
        if (st.find(t) != st.end()) {
            cout << "Yes\n";
        } else {
            cout << "No\n";
        }
    }
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 844 KB Output is correct
2 Correct 31 ms 844 KB Output is correct
3 Correct 44 ms 844 KB Output is correct
4 Correct 32 ms 852 KB Output is correct
5 Correct 30 ms 852 KB Output is correct
6 Correct 30 ms 848 KB Output is correct
7 Correct 30 ms 884 KB Output is correct
8 Correct 36 ms 896 KB Output is correct
9 Correct 31 ms 852 KB Output is correct
10 Correct 32 ms 844 KB Output is correct
11 Correct 31 ms 852 KB Output is correct
12 Correct 31 ms 852 KB Output is correct
13 Correct 30 ms 892 KB Output is correct
14 Correct 31 ms 844 KB Output is correct
15 Correct 31 ms 844 KB Output is correct
16 Correct 32 ms 1020 KB Output is correct
17 Correct 30 ms 844 KB Output is correct
18 Correct 47 ms 852 KB Output is correct

Subtask #2
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 844 KB Output is correct
2 Correct 31 ms 844 KB Output is correct
3 Correct 44 ms 844 KB Output is correct
4 Correct 32 ms 852 KB Output is correct
5 Correct 30 ms 852 KB Output is correct
6 Correct 30 ms 848 KB Output is correct
7 Correct 30 ms 884 KB Output is correct
8 Correct 36 ms 896 KB Output is correct
9 Correct 31 ms 852 KB Output is correct
10 Correct 32 ms 844 KB Output is correct
11 Correct 31 ms 852 KB Output is correct
12 Correct 31 ms 852 KB Output is correct
13 Correct 30 ms 892 KB Output is correct
14 Correct 31 ms 844 KB Output is correct
15 Correct 31 ms 844 KB Output is correct
16 Correct 32 ms 1020 KB Output is correct
17 Correct 30 ms 844 KB Output is correct
18 Correct 47 ms 852 KB Output is correct
19 Correct 3151 ms 1852 KB Output is correct
20 Execution timed out 7064 ms 1452 KB Time limit exceeded
21 Halted 0 ms 0 KB -

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 844 KB Output is correct
2 Correct 31 ms 844 KB Output is correct
3 Correct 44 ms 844 KB Output is correct
4 Correct 32 ms 852 KB Output is correct
5 Correct 30 ms 852 KB Output is correct
6 Correct 30 ms 848 KB Output is correct
7 Correct 30 ms 884 KB Output is correct
8 Correct 36 ms 896 KB Output is correct
9 Correct 31 ms 852 KB Output is correct
10 Correct 32 ms 844 KB Output is correct
11 Correct 31 ms 852 KB Output is correct
12 Correct 31 ms 852 KB Output is correct
13 Correct 30 ms 892 KB Output is correct
14 Correct 31 ms 844 KB Output is correct
15 Correct 31 ms 844 KB Output is correct
16 Correct 32 ms 1020 KB Output is correct
17 Correct 30 ms 844 KB Output is correct
18 Correct 47 ms 852 KB Output is correct
19 Correct 33 ms 852 KB Output is correct
20 Correct 42 ms 828 KB Output is correct
21 Correct 33 ms 844 KB Output is correct
22 Correct 31 ms 852 KB Output is correct
23 Correct 34 ms 840 KB Output is correct
24 Correct 33 ms 892 KB Output is correct
25 Correct 33 ms 852 KB Output is correct
26 Correct 37 ms 796 KB Output is correct
27 Correct 32 ms 844 KB Output is correct
28 Correct 30 ms 852 KB Output is correct
29 Correct 32 ms 852 KB Output is correct
30 Correct 29 ms 852 KB Output is correct
31 Correct 36 ms 840 KB Output is correct
32 Correct 35 ms 864 KB Output is correct
33 Correct 34 ms 852 KB Output is correct
34 Correct 31 ms 844 KB Output is correct
35 Correct 34 ms 852 KB Output is correct
36 Correct 35 ms 852 KB Output is correct
37 Correct 35 ms 844 KB Output is correct
38 Correct 35 ms 1012 KB Output is correct
39 Correct 34 ms 872 KB Output is correct
40 Correct 34 ms 796 KB Output is correct
41 Correct 34 ms 912 KB Output is correct
42 Correct 35 ms 972 KB Output is correct
43 Correct 32 ms 852 KB Output is correct
44 Correct 34 ms 964 KB Output is correct

Subtask #4
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 844 KB Output is correct
2 Correct 31 ms 844 KB Output is correct
3 Correct 44 ms 844 KB Output is correct
4 Correct 32 ms 852 KB Output is correct
5 Correct 30 ms 852 KB Output is correct
6 Correct 30 ms 848 KB Output is correct
7 Correct 30 ms 884 KB Output is correct
8 Correct 36 ms 896 KB Output is correct
9 Correct 31 ms 852 KB Output is correct
10 Correct 32 ms 844 KB Output is correct
11 Correct 31 ms 852 KB Output is correct
12 Correct 31 ms 852 KB Output is correct
13 Correct 30 ms 892 KB Output is correct
14 Correct 31 ms 844 KB Output is correct
15 Correct 31 ms 844 KB Output is correct
16 Correct 32 ms 1020 KB Output is correct
17 Correct 30 ms 844 KB Output is correct
18 Correct 47 ms 852 KB Output is correct
19 Correct 3151 ms 1852 KB Output is correct
20 Execution timed out 7064 ms 1452 KB Time limit exceeded
21 Halted 0 ms 0 KB -