# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
605397 | Tigerpants | DNA 돌연변이 (IOI21_dna) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <numeric>
#include <algorithm>
using namespace std;
typedef vector<vector<int>> int33;
map<char, int> get_index;
map<int, char> get_char;
int n;
vector<pair<int, int>> segtree_span;
vector<int33> segtree;
vector<char> origin;
vector<char> mutated;
int33 calculate_crossmultiply(int index) {
int33 result{{0, 0, 0}, {0, 0, 0}, {0, 0, 0}};
result[get_index[origin[index]]][get_index[mutated[index]]] = 1;
return result;
}
int33 combine(int33 a, int33 b) {