oj.uz

답안 #833183

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
833183 2023-08-22T02:57:11 Z maomao90 Crossing (JOI21_crossing) C++17
26 / 100
 7000 ms 5572 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);
    }
    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

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 2172 KB Output is correct
2 Correct 33 ms 2408 KB Output is correct
3 Correct 41 ms 2268 KB Output is correct
4 Correct 31 ms 2252 KB Output is correct
5 Correct 32 ms 2380 KB Output is correct
6 Correct 30 ms 2236 KB Output is correct
7 Correct 31 ms 2340 KB Output is correct
8 Correct 32 ms 2308 KB Output is correct
9 Correct 32 ms 2420 KB Output is correct
10 Correct 34 ms 2380 KB Output is correct
11 Correct 32 ms 2400 KB Output is correct
12 Correct 32 ms 2432 KB Output is correct
13 Correct 32 ms 2368 KB Output is correct
14 Correct 32 ms 2348 KB Output is correct
15 Correct 32 ms 2380 KB Output is correct
16 Correct 32 ms 2388 KB Output is correct
17 Correct 32 ms 2348 KB Output is correct
18 Correct 41 ms 2256 KB Output is correct

Subtask #2
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 2172 KB Output is correct
2 Correct 33 ms 2408 KB Output is correct
3 Correct 41 ms 2268 KB Output is correct
4 Correct 31 ms 2252 KB Output is correct
5 Correct 32 ms 2380 KB Output is correct
6 Correct 30 ms 2236 KB Output is correct
7 Correct 31 ms 2340 KB Output is correct
8 Correct 32 ms 2308 KB Output is correct
9 Correct 32 ms 2420 KB Output is correct
10 Correct 34 ms 2380 KB Output is correct
11 Correct 32 ms 2400 KB Output is correct
12 Correct 32 ms 2432 KB Output is correct
13 Correct 32 ms 2368 KB Output is correct
14 Correct 32 ms 2348 KB Output is correct
15 Correct 32 ms 2380 KB Output is correct
16 Correct 32 ms 2388 KB Output is correct
17 Correct 32 ms 2348 KB Output is correct
18 Correct 41 ms 2256 KB Output is correct
19 Correct 3120 ms 5572 KB Output is correct
20 Execution timed out 7040 ms 3588 KB Time limit exceeded
21 Halted 0 ms 0 KB -

Subtask #3
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 2172 KB Output is correct
2 Correct 33 ms 2408 KB Output is correct
3 Correct 41 ms 2268 KB Output is correct
4 Correct 31 ms 2252 KB Output is correct
5 Correct 32 ms 2380 KB Output is correct
6 Correct 30 ms 2236 KB Output is correct
7 Correct 31 ms 2340 KB Output is correct
8 Correct 32 ms 2308 KB Output is correct
9 Correct 32 ms 2420 KB Output is correct
10 Correct 34 ms 2380 KB Output is correct
11 Correct 32 ms 2400 KB Output is correct
12 Correct 32 ms 2432 KB Output is correct
13 Correct 32 ms 2368 KB Output is correct
14 Correct 32 ms 2348 KB Output is correct
15 Correct 32 ms 2380 KB Output is correct
16 Correct 32 ms 2388 KB Output is correct
17 Correct 32 ms 2348 KB Output is correct
18 Correct 41 ms 2256 KB Output is correct
19 Correct 34 ms 2308 KB Output is correct
20 Correct 44 ms 2256 KB Output is correct
21 Correct 38 ms 2368 KB Output is correct
22 Correct 31 ms 2156 KB Output is correct
23 Correct 34 ms 2332 KB Output is correct
24 Correct 33 ms 2296 KB Output is correct
25 Correct 34 ms 2344 KB Output is correct
26 Correct 31 ms 2252 KB Output is correct
27 Correct 35 ms 2520 KB Output is correct
28 Correct 32 ms 2188 KB Output is correct
29 Correct 34 ms 2348 KB Output is correct
30 Correct 31 ms 2256 KB Output is correct
31 Correct 36 ms 2360 KB Output is correct
32 Correct 38 ms 2320 KB Output is correct
33 Correct 36 ms 2440 KB Output is correct
34 Correct 36 ms 2272 KB Output is correct
35 Correct 39 ms 2408 KB Output is correct
36 Correct 35 ms 2416 KB Output is correct
37 Correct 36 ms 2368 KB Output is correct
38 Correct 37 ms 2408 KB Output is correct
39 Correct 36 ms 2440 KB Output is correct
40 Correct 39 ms 2520 KB Output is correct
41 Correct 38 ms 2332 KB Output is correct
42 Correct 36 ms 2380 KB Output is correct
43 Correct 34 ms 2356 KB Output is correct
44 Correct 36 ms 2412 KB Output is correct

Subtask #4
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 2172 KB Output is correct
2 Correct 33 ms 2408 KB Output is correct
3 Correct 41 ms 2268 KB Output is correct
4 Correct 31 ms 2252 KB Output is correct
5 Correct 32 ms 2380 KB Output is correct
6 Correct 30 ms 2236 KB Output is correct
7 Correct 31 ms 2340 KB Output is correct
8 Correct 32 ms 2308 KB Output is correct
9 Correct 32 ms 2420 KB Output is correct
10 Correct 34 ms 2380 KB Output is correct
11 Correct 32 ms 2400 KB Output is correct
12 Correct 32 ms 2432 KB Output is correct
13 Correct 32 ms 2368 KB Output is correct
14 Correct 32 ms 2348 KB Output is correct
15 Correct 32 ms 2380 KB Output is correct
16 Correct 32 ms 2388 KB Output is correct
17 Correct 32 ms 2348 KB Output is correct
18 Correct 41 ms 2256 KB Output is correct
19 Correct 3120 ms 5572 KB Output is correct
20 Execution timed out 7040 ms 3588 KB Time limit exceeded
21 Halted 0 ms 0 KB -