oj.uz

답안 #950477

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
950477 2024-03-20T10:50:10 Z glebustim Crossing (JOI21_crossing) C++17
26 / 100
 7000 ms 7032 KB 
#include <bits/extc++.h>
using namespace std;
using namespace __gnu_pbds;

#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define all(a) a.begin(), a.end()
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using vi = vector<int>;
using oset = tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>;

const ll MOD = 1e18 + 3, P = 5;
const vector<array<int, 3>> o = {{0, 0, 1}, {0, 1, 0}, {1, 0, 0}, {0, 2, 2}, {2, 0, 2}, {2, 2, 0}, {1, 1, 2}, {1, 2, 1}, {2, 1, 1}};
int n;
vi A, B, C;
unordered_set<string> ps;

void all_combs() {
    for (auto x: o) {
        string s(n, '.');
        for (int i = 0; i < n; ++i) {
            int y = (A[i] * x[0] + B[i] * x[1] + C[i] * x[2]) % 3;
            if (y == 0)
                s[i] = 'J';
            else if (y == 1)
                s[i] = 'O';
            else
                s[i] = 'I';
        }
        ps.insert(s);
    }
}

void check_string(string &s) {
    if (ps.find(s) != ps.end())
        cout << "Yes\n";
    else
        cout << "No\n";
}

int main() {
    fast;
    cin >> n;
    A.resize(n);
    B.resize(n);
    C.resize(n);
    string s;
    cin >> s;
    for (int i = 0; i < n; ++i) {
        if (s[i] == 'J')
            A[i] = 0;
        else if (s[i] == 'O')
            A[i] = 1;
        else
            A[i] = 2;
    }
    cin >> s;
    for (int i = 0; i < n; ++i) {
        if (s[i] == 'J')
            B[i] = 0;
        else if (s[i] == 'O')
            B[i] = 1;
        else
            B[i] = 2;
    }
    cin >> s;
    for (int i = 0; i < n; ++i) {
        if (s[i] == 'J')
            C[i] = 0;
        else if (s[i] == 'O')
            C[i] = 1;
        else
            C[i] = 2;
    }
    all_combs();
    int q;
    cin >> q >> s;
    check_string(s);
    while (q--) {
        int l, r;
        char c;
        cin >> l >> r >> c;
        --l;
        --r;
        for (int i = l; i <= r; ++i)
            s[i] = c;
        check_string(s);
    }
}

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 2384 KB Output is correct
2 Correct 33 ms 2524 KB Output is correct
3 Correct 44 ms 2388 KB Output is correct
4 Correct 35 ms 2324 KB Output is correct
5 Correct 31 ms 2388 KB Output is correct
6 Correct 30 ms 2444 KB Output is correct
7 Correct 31 ms 2384 KB Output is correct
8 Correct 33 ms 2332 KB Output is correct
9 Correct 33 ms 2396 KB Output is correct
10 Correct 34 ms 2384 KB Output is correct
11 Correct 41 ms 2460 KB Output is correct
12 Correct 33 ms 2384 KB Output is correct
13 Correct 32 ms 2396 KB Output is correct
14 Correct 33 ms 2356 KB Output is correct
15 Correct 33 ms 2384 KB Output is correct
16 Correct 35 ms 2388 KB Output is correct
17 Correct 33 ms 2380 KB Output is correct
18 Correct 48 ms 2368 KB Output is correct

Subtask #2
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 2384 KB Output is correct
2 Correct 33 ms 2524 KB Output is correct
3 Correct 44 ms 2388 KB Output is correct
4 Correct 35 ms 2324 KB Output is correct
5 Correct 31 ms 2388 KB Output is correct
6 Correct 30 ms 2444 KB Output is correct
7 Correct 31 ms 2384 KB Output is correct
8 Correct 33 ms 2332 KB Output is correct
9 Correct 33 ms 2396 KB Output is correct
10 Correct 34 ms 2384 KB Output is correct
11 Correct 41 ms 2460 KB Output is correct
12 Correct 33 ms 2384 KB Output is correct
13 Correct 32 ms 2396 KB Output is correct
14 Correct 33 ms 2356 KB Output is correct
15 Correct 33 ms 2384 KB Output is correct
16 Correct 35 ms 2388 KB Output is correct
17 Correct 33 ms 2380 KB Output is correct
18 Correct 48 ms 2368 KB Output is correct
19 Execution timed out 7098 ms 7032 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #3
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 2384 KB Output is correct
2 Correct 33 ms 2524 KB Output is correct
3 Correct 44 ms 2388 KB Output is correct
4 Correct 35 ms 2324 KB Output is correct
5 Correct 31 ms 2388 KB Output is correct
6 Correct 30 ms 2444 KB Output is correct
7 Correct 31 ms 2384 KB Output is correct
8 Correct 33 ms 2332 KB Output is correct
9 Correct 33 ms 2396 KB Output is correct
10 Correct 34 ms 2384 KB Output is correct
11 Correct 41 ms 2460 KB Output is correct
12 Correct 33 ms 2384 KB Output is correct
13 Correct 32 ms 2396 KB Output is correct
14 Correct 33 ms 2356 KB Output is correct
15 Correct 33 ms 2384 KB Output is correct
16 Correct 35 ms 2388 KB Output is correct
17 Correct 33 ms 2380 KB Output is correct
18 Correct 48 ms 2368 KB Output is correct
19 Correct 36 ms 2384 KB Output is correct
20 Correct 46 ms 2228 KB Output is correct
21 Correct 34 ms 2384 KB Output is correct
22 Correct 30 ms 2380 KB Output is correct
23 Correct 34 ms 2544 KB Output is correct
24 Correct 32 ms 2384 KB Output is correct
25 Correct 35 ms 2564 KB Output is correct
26 Correct 34 ms 2388 KB Output is correct
27 Correct 34 ms 2384 KB Output is correct
28 Correct 30 ms 2276 KB Output is correct
29 Correct 34 ms 2396 KB Output is correct
30 Correct 30 ms 2388 KB Output is correct
31 Correct 37 ms 2360 KB Output is correct
32 Correct 37 ms 2388 KB Output is correct
33 Correct 36 ms 2384 KB Output is correct
34 Correct 33 ms 2392 KB Output is correct
35 Correct 37 ms 2388 KB Output is correct
36 Correct 35 ms 2400 KB Output is correct
37 Correct 37 ms 2388 KB Output is correct
38 Correct 37 ms 2384 KB Output is correct
39 Correct 37 ms 2384 KB Output is correct
40 Correct 36 ms 2392 KB Output is correct
41 Correct 37 ms 2384 KB Output is correct
42 Correct 36 ms 2356 KB Output is correct
43 Correct 37 ms 2324 KB Output is correct
44 Correct 36 ms 2388 KB Output is correct

Subtask #4
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 2384 KB Output is correct
2 Correct 33 ms 2524 KB Output is correct
3 Correct 44 ms 2388 KB Output is correct
4 Correct 35 ms 2324 KB Output is correct
5 Correct 31 ms 2388 KB Output is correct
6 Correct 30 ms 2444 KB Output is correct
7 Correct 31 ms 2384 KB Output is correct
8 Correct 33 ms 2332 KB Output is correct
9 Correct 33 ms 2396 KB Output is correct
10 Correct 34 ms 2384 KB Output is correct
11 Correct 41 ms 2460 KB Output is correct
12 Correct 33 ms 2384 KB Output is correct
13 Correct 32 ms 2396 KB Output is correct
14 Correct 33 ms 2356 KB Output is correct
15 Correct 33 ms 2384 KB Output is correct
16 Correct 35 ms 2388 KB Output is correct
17 Correct 33 ms 2380 KB Output is correct
18 Correct 48 ms 2368 KB Output is correct
19 Execution timed out 7098 ms 7032 KB Time limit exceeded
20 Halted 0 ms 0 KB -