oj.uz

Submission #937697

# Submission time Handle Problem Language Result Execution time Memory
937697 2024-03-04T11:28:49 Z zwezdinv Modern Machine (JOI23_ho_t5) C++17
11 / 100
 3000 ms 10208 KB 
#include <bits/stdc++.h>

int main() {
        std::cin.tie(nullptr)->sync_with_stdio(false);

        int n, m;
        std::cin >> n >> m;
        std::string c;
        std::cin >> c;
        int st = 0;
        for (int i = 0; i < n; ++i) {
                st |= (c[i] == 'R') << i;
        }
        std::vector<std::vector<int>> ss(1 << n, std::vector<int>(n));
        for (int mask = 0; mask < 1 << n; ++mask) {
                for (int i = 0; i < n; ++i) {
                        int m4sk = mask;
                        int ptr = i;
                        m4sk |= 1 << i;
                        while (0 <= ptr && ptr < n) {
                                m4sk ^= 1 << ptr;
                                if (~m4sk >> ptr & 1) {
                                        ptr++;
                                } else {
                                        ptr--;
                                }
                        }
                        ss[mask][i] = m4sk;
                }
        }
        std::vector<int> a(m);
        for (auto& i : a) std::cin >> i, --i;
        std::vector<int> qq(1 << n, -1);
        std::vector<int> pos(m, -1);
        std::vector<int> leader(m, -1);
        std::vector<std::vector<std::pair<int, int>>> que(m);
        int q;
        std::cin >> q;
        std::vector<int> ans(q);
        for (int i = 0; i < q; ++i) {
                int l, r;
                std::cin >> l >> r;
                --l, --r;
                que[r].emplace_back(l, i);
        }
        auto get = [&](int u) -> int {
                while (u != leader[u]) u = leader[u] = leader[leader[u]];
                return u;
        }; 
        for (int i = 0; i < m; ++i) {
                if (qq[st] == -1) {
                        qq[st] = i;
                        pos[i] = st;
                        leader[i] = i;
                } else {
                        leader[i] = qq[st];
                }
                std::vector<int> nw(1 << n, -1);
                for (int j = 0; j < 1 << n; ++j) {
                        if (qq[j] == -1) continue;
                        int k = ss[j][a[i]];
                        if (nw[k] != -1) {
                                leader[qq[j]] = nw[k];
                        } else {
                                nw[k] = qq[j];
                                pos[qq[j]] = k;
                        }
                }
                qq = nw;
                for (auto [l, id] : que[i]) {
                        ans[id] = __builtin_popcount(pos[get(l)]);
                }
        }
        for (auto i : ans) std::cout << i << '\n';
}

Subtask #1
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Execution timed out 3046 ms 5212 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Execution timed out 3046 ms 5212 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Execution timed out 3046 ms 5212 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 147 ms 8776 KB Output is correct
3 Correct 140 ms 9216 KB Output is correct
4 Correct 132 ms 8880 KB Output is correct
5 Correct 126 ms 10208 KB Output is correct
6 Correct 133 ms 8136 KB Output is correct

Subtask #5
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 147 ms 8776 KB Output is correct
3 Correct 140 ms 9216 KB Output is correct
4 Correct 132 ms 8880 KB Output is correct
5 Correct 126 ms 10208 KB Output is correct
6 Correct 133 ms 8136 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Execution timed out 3096 ms 5212 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 147 ms 8776 KB Output is correct
3 Correct 140 ms 9216 KB Output is correct
4 Correct 132 ms 8880 KB Output is correct
5 Correct 126 ms 10208 KB Output is correct
6 Correct 133 ms 8136 KB Output is correct
7 Correct 0 ms 600 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 528 KB Output is correct
11 Runtime error 3 ms 520 KB Execution killed with signal 6
12 Halted 0 ms 0 KB -

Subtask #7
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Execution timed out 3046 ms 5212 KB Time limit exceeded
8 Halted 0 ms 0 KB -