# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
966768 | 2024-04-20T10:19:30 Z | SuPythony | Mutating DNA (IOI21_dna) | C++17 | 23 ms | 2832 KB |
#include "dna.h" #include <bits/stdc++.h> using namespace std; vector<int> pf(1e5+1,0); void init(string a, string b) { for (int i=1; i<=a.size(); i++) { if (a[i]!=b[i]) { pf[i]=pf[i-1]+1; } else { pf[i]=pf[i-1]; } } } int get_distance(int x, int y) { int c=pf[y]-pf[x-1]; return c/2+c%2; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 23 ms | 2832 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 604 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 604 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 604 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 23 ms | 2832 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |