# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
397387 | KoD | Martian DNA (BOI18_dna) | C++17 | 142 ms | 13996 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>
template <class T>
using Vec = std::vector<T>;
int main() {
int N, K, R;
std::cin >> N >> K >> R;
Vec<int> A(N);
for (auto& x: A) {
std::cin >> x;
}
Vec<Vec<int>> pos(K);
for (int i = 0; i < N; ++i) {
pos[A[i]].push_back(i);
}
Vec<int> need(K);
while (R--) {
int b;
std::cin >> b;
std::cin >> need[b];
}
int right = 0;
for (int i = 0; i < K; ++i) {
if (need[i] == 0) {
continue;
}
if (need[i] > (int) pos[i].size()) {
std::cout << "impossible\n";
return 0;
# | 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... |