| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 530914 | SmolBrain | Mutating 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 <bits/stdc++.h>
// #include <dna.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define endl '\n'
#define pb push_back
#define conts continue
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "YES" << endl
#define no cout << "NO" << endl
#define ff first
#define ss second
#define ceil2(x,y) ((x+y-1) / (y))
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#ifndef ONLINE_JUDGE
#define debug(x) cout << #x <<" = "; print(x); cout << endl
#else
#define debug(x)
#endif
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)
bool iseven(ll n) {if ((n & 1) == 0) return true; return false;}
void print(ll t) {cout << t;}
void print(int t) {cout << t;}
void print(string t) {cout << t;}
void print(char t) {cout << t;}
void print(double t) {cout << t;}
void print(ld t) {cout << t;}
template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(pair <T, V> p) {cout << "{"; print(p.ff); cout << ","; print(p.ss); cout << "}";}
template <class T> void print(vector <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T> void print(set <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T> void print(multiset <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T, class V> void print(map <T, V> v) {cout << "[ "; for (auto i : v) {print(i); cout << " ";} cout << "]";}
template<typename T> void amin(T &a, T b) { a = min(a, b); }
template<typename T> void amax(T &a, T b) { a = max(a, b); }
void usaco(string filename) {
freopen((filename + ".in").c_str(), "r", stdin);
freopen((filename + ".out").c_str(), "w", stdout);
}
const int MOD = 1e9 + 7;
const int maxn = 1e5 + 5;
const int inf1 = 1e9 + 5;
const ll inf2 = ll(1e18) + 5;
vector<int> prea1(maxn), pret1(maxn), prec1(maxn);
vector<int> prea2(maxn), pret2(maxn), prec2(maxn);
vector<int> unmatcheda(maxn), unmatchedt(maxn), ta(maxn);
void init(string s, string t) {
int n = sz(s);
s = '+' + s, t = '+' + t;
rep1(i, n) prea1[i] = prea1[i - 1] + (s[i] == 'A');
rep1(i, n) pret1[i] = pret1[i - 1] + (s[i] == 'T');
rep1(i, n) prec1[i] = prec1[i - 1] + (s[i] == 'C');
rep1(i, n) prea2[i] = prea2[i - 1] + (t[i] == 'A');
rep1(i, n) pret2[i] = pret2[i - 1] + (t[i] == 'T');
rep1(i, n) prec2[i] = prec2[i - 1] + (t[i] == 'C');
rep1(i, n) unmatcheda[i] = unmatcheda[i - 1] + (s[i] == 'A' && t[i] != 'A');
rep1(i, n) unmatchedt[i] = unmatchedt[i - 1] + (s[i] == 'T' && t[i] != 'T');
rep1(i,n) ta[i] = ta[i-1] + (s[i] == 'T' && t[i] == 'A');
}
int get_distance(int l, int r) {
l++, r++;
if(prea1[r] - prea1[l-1] != prea2[r] - prea2[l-1]) return -1;
if(pret1[r] - pret1[l-1] != pret2[r] - pret2[l-1]) return -1;
if(prec1[r] - prec1[l-1] != prec2[r] - prec2[l-1]) return -1;
int x = unmatcheda[r] - unmatcheda[l-1];
int y = unmatchedt[r] - unmatchedt[l-1];
int z = ta[r] - ta[l-1];
return x + y - z;
}
void solve(int test_case)
{
}
int main()
{
fastio;
int t = 1;
// cin >> t;
rep1(i, t) {
solve(i);
}
return 0;
}