# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
941110 |
2024-03-08T07:20:12 Z |
FKS |
Martian DNA (BOI18_dna) |
C++14 |
|
2000 ms |
9416 KB |
#include <bits/stdc++.h>
using namespace std;
#define max(a, b) (a > b ? a : b)
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, k, r;cin>>n>>k>>r;
int* dna = new int[n];
for (int i = 0;i < n;i++)
cin >> dna[i];
unordered_map<int, int> creq;
for (int i = 0;i < r;i++)
{
int x, y;
cin >> x >> y;
creq[x] = y;
}
int min_len = 1e9;
for (int i = 0;i < n;i++)
{
unordered_map<int, int> req = creq;
for (int j = i;j < i + min_len;j++)
{
if (req[dna[j]])
{
req[dna[j]]--;
}
if (req[dna[j]] == 0)
req.erase(dna[j]);
if (!req.size())
min_len = min(min_len, j - i + 1);
}
}
cout << min_len;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Correct |
1 ms |
600 KB |
Output is correct |
3 |
Correct |
1 ms |
348 KB |
Output is correct |
4 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
74 ms |
456 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
2052 ms |
1628 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
2053 ms |
9416 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |