# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
941123 | 2024-03-08T07:30:22 Z | FKS | Martian DNA (BOI18_dna) | C++14 | 38 ms | 4196 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> req; for (int i = 0;i < r;i++) { int x, y; cin >> x >> y; req[x] = y; } int min_len = 1e9; int j = 0; for (int i = 0;i < n;i++) { if (i) req[dna[i-1]]++; for (j;j < min(n, 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); } } if (min_len == 1e9) cout << "impossible"; else if (min_len) cout << min_len; else if (min_len == 0) cout << "impossible"; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 344 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 14 ms | 1112 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 38 ms | 4196 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |