# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1133049 | lopkus | Martian DNA (BOI18_dna) | C++20 | 2092 ms | 8264 KiB |
#include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, dic, r;
cin >> n >> dic >> r;
vector<int> a(n + 1);
for(int i = 1; i <= n; i++) {
cin >> a[i];
}
int ans = n + 1;
vector<int> p(r + 1);
vector<int> k(r + 1);
for(int i = 1; i <= r; i++) {
cin >> p[i] >> k[i];
}
for(int i = 1; i <= n; i++) {
map<int,int> M;
for(int j = i; j <= n; j++) {
M[a[j]] += 1;
int ok = 1;
for(int q = 1; q <= r; q++) {
if(M[p[q]] >= k[q]) {
}
# | 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... |