# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
657637 | MilosMilutinovic | Martian DNA (BOI18_dna) | C++14 | 34 ms | 4540 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.
/**
* author: wxhtzdy
* created: 10.11.2022 15:50:40
**/
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k, r;
cin >> n >> k >> r;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> need(k, -1);
for (int i = 0; i < n; i++) {
int b, q;
cin >> b >> q;
need[b] = q;
}
int cnt_good = 0;
vector<int> cnt(k);
int ptr = -1;
int ans = n + 1;
auto Add = [&](int x) {
cnt[x] += 1;
if (cnt[x] == need[x]) {
# | 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... |