oj.uz

답안 #704651

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
704651 2023-03-02T14:40:51 Z Cyanmond Lottery (CEOI18_lot) C++17
45 / 100
 38 ms 65536 KB 
#include <bits/stdc++.h>

int main() {
    int N, L;
    std::cin >> N >> L;
    std::vector<int> A(N);
    for (auto &e : A) {
        std::cin >> e;
    }
    int Q;
    std::cin >> Q;
    std::vector<std::pair<int, int>> K(Q);
    for (int i = 0; i < Q; ++i) {
        std::cin >> K[i].first;
        K[i].second = i;
    }
    std::sort(K.begin(), K.end());
    const int U = N - L + 1;
    std::vector<std::vector<short>> countSim(U, std::vector<short>(U, 0));

    for (int w = 1; w < U; ++w) {
        std::vector<int> ids;
        for (int i = 0; i < N - w; ++i) {
            if (A[i] == A[i + w]) {
                ids.push_back(i);
            }
        }

        auto add = [&](int l, int r) {
            int x = std::max(0, -l);
            --countSim[l + x][l + w + x];
            if (r + w < U) ++countSim[r][r + w];
        };
        for (const int i : ids) {
            add(i - L + 1, i + 1);
        }
    }
    for (int i = 0; i < U; ++i) {
        for (int j = 0; j < U; ++j) {
            if (i != 0 and j != 0) {
                countSim[i][j] += countSim[i - 1][j - 1];
            }
        }
    }
    std::vector<std::vector<short>> addVal(Q + 1, std::vector<short>(N));
    std::vector<int> level(L + 1);
    for (int i = 0; i <= L; ++i) {
        int c = 0;
        while (c != Q and K[c].first < i) {
            ++c;
        }
        level[i] = c;
    }
    for (int i = 0; i < U; ++i) {
        for (int j = i + 1; j < U; ++j) {
            ++addVal[level[countSim[i][j] + L]][i];
            ++addVal[level[countSim[i][j] + L]][j];
        }
    }
    std::vector<std::vector<short>> answer(Q, std::vector<short>(N));
    std::vector<short> nowData(U, 0);
    for (int i = 0; i < Q; ++i) {
        for (int j = 0; j < U; ++j) {
            nowData[j] += addVal[i][j];
        }
        answer[K[i].second] = nowData;
    }
    for (const auto &vec : answer) {
        for (int i = 0; i < U; ++i) {
            std::cout << vec[i] << (i == U - 1 ? '\n' : ' ');
        }
    }
}

Subtask #1
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 300 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 2 ms 468 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 300 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 2 ms 468 KB Output is correct
13 Correct 36 ms 8220 KB Output is correct
14 Correct 19 ms 4044 KB Output is correct
15 Correct 27 ms 3916 KB Output is correct
16 Correct 27 ms 6716 KB Output is correct
17 Correct 38 ms 5968 KB Output is correct
18 Correct 38 ms 5948 KB Output is correct

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 32 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 32 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 300 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 2 ms 468 KB Output is correct
13 Correct 36 ms 8220 KB Output is correct
14 Correct 19 ms 4044 KB Output is correct
15 Correct 27 ms 3916 KB Output is correct
16 Correct 27 ms 6716 KB Output is correct
17 Correct 38 ms 5968 KB Output is correct
18 Correct 38 ms 5948 KB Output is correct
19 Runtime error 32 ms 65536 KB Execution killed with signal 9
20 Halted 0 ms 0 KB -