# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
704651 | Cyanmond | Lottery (CEOI18_lot) | C++17 | 38 ms | 65536 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |