# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
482466 | SamAnd | Martian DNA (BOI18_dna) | C++17 | 116 ms | 19524 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>
using namespace std;
const int N = 200005;
int n, k, r;
int a[N];
int b[N];
vector<int> v[N];
int j[N];
int main()
{
scanf("%d%d%d", &n, &k, &r);
for (int i = 1; i <= n; ++i)
scanf("%d", &a[i]);
while (r--)
{
int x, y;
scanf("%d%d", &x, &y);
b[x] = y;
}
for (int i = 1; i <= n; ++i)
v[a[i]].push_back(i);
set<int> s;
for (int i = 0; i < k; ++i)
{
if (!b[i])
continue;
if (v[i].size() < b[i])
{
Compilation message (stderr)
# | 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... |