# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
340187 | blue | Martian DNA (BOI18_dna) | C++11 | 116 ms | 4588 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 <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int N, K, R;
cin >> N >> K >> R;
int D[N+1];
for(int i = 1; i <= N; i++) cin >> D[i];
vector<int> req(K, 0);
vector<int> act(K, 0);
int a, r, b;
for(int i = 1; i <= R; i++)
{
cin >> a >> r;
req[a] = r;
}
a = 1;
int g = 0;
int res = 2000000000;
for(int i = 0; i < K; i++) g += req[i] == 0;
for(b = 1; b <= N && g < K; b++)
{
act[D[b]]++;
if(req[D[b]] == act[D[b]]) g++;
}
# | 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... |