# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
320905 | gustason | Martian DNA (BOI18_dna) | C++14 | 184 ms | 24032 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;
using ll = long long;
const int INF = 1e9 + 5;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n, r, q;
cin >> n >> r >> q;
int dna[n];
for(int i = 0; i < n; i++) {
cin >> dna[i];
}
vector<int> need(r+1, INF), cnt(r+1, 0);
for(int i = 0; i < q; i++) {
int b;
cin >> b;
cin >> need[b];
}
int good = 0, ans = INF;
set<int> begins, ends;
vector<int> pos[r+1];
for(int i = 0; i < n; i++) {
int c = dna[i];
cnt[c]++;
pos[c].push_back(i);
# | 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... |