oj.uz

Submission #704890

# Submission time Handle Problem Language Result Execution time Memory
704890 2023-03-03T06:27:28 Z Cyanmond Crossing (JOI21_crossing) C++17
26 / 100
 7000 ms 7812 KB 
#include <bits/stdc++.h>

std::string cross(const std::string &a, const std::string &b) {
    std::string c;
    c.reserve(a.size());
    for (int i = 0; i < (int)a.size(); ++i) {
        if (a[i] == b[i]) {
            c.push_back(a[i]);
        } else {
            char x = 'J' xor 'O' xor 'I';
            x ^= a[i];
            x ^= b[i];
            c.push_back(x);
        }
    }
    return c;
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int N;
    std::cin >> N;
    std::string S1, S2, S3;
    std::cin >> S1 >> S2 >> S3;
    int Q;
    std::cin >> Q;
    std::string T0;
    std::cin >> T0;
    std::vector<int> L(Q), R(Q);
    std::vector<char> C(Q);
    for (int i = 0; i < Q; ++i) {
        std::cin >> L[i] >> R[i] >> C[i];
        --L[i];
    }

    std::set<std::string> flowers;
    std::queue<std::string> ns;
    ns.push(S1);
    ns.push(S2);
    ns.push(S3);
    flowers.insert(S1);
    flowers.insert(S2);
    flowers.insert(S3);
    while (not ns.empty()) {
        const auto t = ns.front();
        ns.pop();
        auto nflowers = flowers;
        for (const auto &q : flowers) {
            const auto r = cross(t, q);
            if (nflowers.find(r) == nflowers.end()) {
                nflowers.insert(r);
                ns.push(r);
            }
        }
        flowers = nflowers;
    }

    const int M = (int)flowers.size();
    assert(M <= 20);
    std::vector<std::string> fs;
    for (const auto &e : flowers) {
        fs.push_back(e);
    }
    std::cout << (flowers.find(T0) != flowers.end() ? "Yes" : "No") << std::endl;
    for (int x = 0; x < Q; ++x) {
        std::string u = T0;
        for (int i = L[x]; i < R[x]; ++i) T0[i] = C[x];
        std::cout << (flowers.find(T0) != flowers.end() ? "Yes" : "No") << std::endl;
    }
    /*
    std::vector<int> sameLimitL(M, N), sameLimitR(M, 0);
    std::vector<std::vector<std::pair<int, int>>> pressInfo(M);
    for (int x = 0; x < M; ++x) {
        const auto &f = fs[x];
        for (int i = 0; i < N; ++i) {
            if (f[i] != T0[i]) {
                sameLimitL[x] = i;
                break;
            }
        }
        for (int i = N - 1; i >= 0; --i) {
            if (f[i] != T0[i]) {
                sameLimitR[i] = i + 1;
                break;
            }
        }

        int lastI = 0;
        for (int i = 1; i < N; ++i) {
            if (fs[lastI] != fs[i]) {
                pressInfo[x].push_back({lastI, i - lastI});
                lastI = i;
            }
        }
        pressInfo[x].push_back({lastI, N - lastI});
    }

    std::cout << (flowers.find(T0) != flowers.end() ? "Yes" : "No") << std::endl;
    for (int i = 0; i < Q; ++i) {
        bool answer = false;
        for (int x = 0; x < M; ++x) {
            // judge
            if (sameLimitL[x] < L[i]) {
                continue;
            }
            if (sameLimitR[x] > R[i]) {
                continue;
            }
            auto itr = std::lower_bound(pressInfo[x].begin(), pressInfo[x].end(), std::make_pair(L[i], N + 1));
            --itr;
            if (itr->first + itr->second < R[i]) {
                continue;
            }
            if (fs[x][L[i]] != C[i]) {
                continue;
            }
            answer = true;
            break;
        }
        std::cout << (answer ? "Yes" : "No") << std::endl;
    }
    */
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 247 ms 3892 KB Output is correct
2 Correct 273 ms 4188 KB Output is correct
3 Correct 308 ms 4064 KB Output is correct
4 Correct 263 ms 4044 KB Output is correct
5 Correct 267 ms 4204 KB Output is correct
6 Correct 258 ms 3948 KB Output is correct
7 Correct 277 ms 4044 KB Output is correct
8 Correct 269 ms 4156 KB Output is correct
9 Correct 269 ms 4220 KB Output is correct
10 Correct 278 ms 4112 KB Output is correct
11 Correct 302 ms 4188 KB Output is correct
12 Correct 274 ms 4268 KB Output is correct
13 Correct 270 ms 4172 KB Output is correct
14 Correct 266 ms 4180 KB Output is correct
15 Correct 273 ms 4188 KB Output is correct
16 Correct 272 ms 4144 KB Output is correct
17 Correct 278 ms 4412 KB Output is correct
18 Correct 298 ms 4048 KB Output is correct

Subtask #2
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 247 ms 3892 KB Output is correct
2 Correct 273 ms 4188 KB Output is correct
3 Correct 308 ms 4064 KB Output is correct
4 Correct 263 ms 4044 KB Output is correct
5 Correct 267 ms 4204 KB Output is correct
6 Correct 258 ms 3948 KB Output is correct
7 Correct 277 ms 4044 KB Output is correct
8 Correct 269 ms 4156 KB Output is correct
9 Correct 269 ms 4220 KB Output is correct
10 Correct 278 ms 4112 KB Output is correct
11 Correct 302 ms 4188 KB Output is correct
12 Correct 274 ms 4268 KB Output is correct
13 Correct 270 ms 4172 KB Output is correct
14 Correct 266 ms 4180 KB Output is correct
15 Correct 273 ms 4188 KB Output is correct
16 Correct 272 ms 4144 KB Output is correct
17 Correct 278 ms 4412 KB Output is correct
18 Correct 298 ms 4048 KB Output is correct
19 Execution timed out 7015 ms 7812 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 247 ms 3892 KB Output is correct
2 Correct 273 ms 4188 KB Output is correct
3 Correct 308 ms 4064 KB Output is correct
4 Correct 263 ms 4044 KB Output is correct
5 Correct 267 ms 4204 KB Output is correct
6 Correct 258 ms 3948 KB Output is correct
7 Correct 277 ms 4044 KB Output is correct
8 Correct 269 ms 4156 KB Output is correct
9 Correct 269 ms 4220 KB Output is correct
10 Correct 278 ms 4112 KB Output is correct
11 Correct 302 ms 4188 KB Output is correct
12 Correct 274 ms 4268 KB Output is correct
13 Correct 270 ms 4172 KB Output is correct
14 Correct 266 ms 4180 KB Output is correct
15 Correct 273 ms 4188 KB Output is correct
16 Correct 272 ms 4144 KB Output is correct
17 Correct 278 ms 4412 KB Output is correct
18 Correct 298 ms 4048 KB Output is correct
19 Correct 282 ms 4016 KB Output is correct
20 Correct 319 ms 3980 KB Output is correct
21 Correct 347 ms 4312 KB Output is correct
22 Correct 281 ms 3836 KB Output is correct
23 Correct 319 ms 4108 KB Output is correct
24 Correct 293 ms 4064 KB Output is correct
25 Correct 341 ms 4148 KB Output is correct
26 Correct 274 ms 4016 KB Output is correct
27 Correct 281 ms 4172 KB Output is correct
28 Correct 256 ms 3844 KB Output is correct
29 Correct 275 ms 4280 KB Output is correct
30 Correct 259 ms 3876 KB Output is correct
31 Correct 280 ms 4188 KB Output is correct
32 Correct 281 ms 4164 KB Output is correct
33 Correct 352 ms 4172 KB Output is correct
34 Correct 268 ms 3952 KB Output is correct
35 Correct 273 ms 4136 KB Output is correct
36 Correct 277 ms 4328 KB Output is correct
37 Correct 270 ms 4200 KB Output is correct
38 Correct 277 ms 4168 KB Output is correct
39 Correct 268 ms 4160 KB Output is correct
40 Correct 274 ms 4184 KB Output is correct
41 Correct 276 ms 4208 KB Output is correct
42 Correct 270 ms 4268 KB Output is correct
43 Correct 278 ms 4104 KB Output is correct
44 Correct 267 ms 4212 KB Output is correct

Subtask #4
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 247 ms 3892 KB Output is correct
2 Correct 273 ms 4188 KB Output is correct
3 Correct 308 ms 4064 KB Output is correct
4 Correct 263 ms 4044 KB Output is correct
5 Correct 267 ms 4204 KB Output is correct
6 Correct 258 ms 3948 KB Output is correct
7 Correct 277 ms 4044 KB Output is correct
8 Correct 269 ms 4156 KB Output is correct
9 Correct 269 ms 4220 KB Output is correct
10 Correct 278 ms 4112 KB Output is correct
11 Correct 302 ms 4188 KB Output is correct
12 Correct 274 ms 4268 KB Output is correct
13 Correct 270 ms 4172 KB Output is correct
14 Correct 266 ms 4180 KB Output is correct
15 Correct 273 ms 4188 KB Output is correct
16 Correct 272 ms 4144 KB Output is correct
17 Correct 278 ms 4412 KB Output is correct
18 Correct 298 ms 4048 KB Output is correct
19 Execution timed out 7015 ms 7812 KB Time limit exceeded
20 Halted 0 ms 0 KB -