# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
981509 | 2024-05-13T09:31:26 Z | faqinyeager | Mutating DNA (IOI21_dna) | C++17 | 22 ms | 4884 KB |
#include "dna.h" #include <bits/stdc++.h> int n, a_cnt, b_cnt; int asum[100050][3], bsum[100050][3]; void init(std::string a, std::string b){ n = (int)a.size(); for(int i = 0; i < n; i++){ asum[i][a[i] - 'A'] ++; bsum[i][b[i] - 'A'] ++; } for(int i = 1; i < n; i++){ for(int j = 0; j < 3; j++){ asum[i][j] += asum[i - 1][j]; bsum[i][j] += bsum[i - 1][j]; } } } int get_distance(int x, int y){ for(int j = 0; j < 3; j++){ if(asum[y][j] - asum[x - 1][j] != bsum[y][j] - bsum[x - 1][j]){ return -1; } } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 22 ms | 4884 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 2396 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 2396 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 2396 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 22 ms | 4884 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |