Submission #1185087

#	Time	Username	Problem	Language	Result	Execution time	Memory
1185087		swishy123	Mutating DNA (IOI21_dna)	C++20	100 / 100	47 ms	8456 KiB

dna

#include <iostream>
#include <algorithm>
#include <vector>
#include <random>
#include <chrono>
#include <set>
#include <map>
#include <stack>
#include <functional>
#include <iomanip>
#include <queue>
#include <cassert>
#include <complex>
#include <cstring>
#include <memory>
#include <bitset>
#include <sstream>
#include <cmath>
#include <numeric>
#include <numbers>
#include <fstream>
#include "dna.h"

using namespace std;

#ifndef template
#ifndef define
 
#define ll long long
#define ld long double
#define pl pair<ll, ll>
#define pi pair<int, int>
#define nl cout << '\n';
#define x first
#define y second 
#define cbit(x) __builtin_popcountll(x)
#define uid(a, b) uniform_int_distribution<ll>(a, b)(rng) 
#define siz(x) (int)x.size()
 
#endif
 
#ifndef print
void print(size_t x) {cout << x << ' ';}
void print(int x) {cout << x << ' ';}
void print(long long x) {cout << x << ' ';}
void print(float x) {cout << x << ' ';}
void print(long double x) {cout << x << ' ';}
void print(char x) {cout << x << ' ';}
void print(const char* x) {cout << x << ' ';}
void print(bool x) {cout << x << ' ';}
void print(string &x) {cout << x << ' ';}
 
template<typename T, typename V>
void print(pair<T, V> &p) {print(p.x); print(p.y);}
template<typename T>
void print(vector<T> v) {for (int i = 0; i < v.size(); i++) print(v[i]);}
template<typename T>
void print(vector<vector<T>> v) {
    for (int i = 0; i < v.size(); i++){
        for (int j = 0; j < v[i].size(); j++)
            print(v[i][j]);
        nl;
    }
}
template <typename T, typename... V>
void print(T t, V&&... v) {print(t); print(v...);}
 
#endif
 
#ifndef read
void read(int &x) {cin >> x;}
void read(long long &x) {cin >> x;}
void read(unsigned &x) {cin >> x;}
void read(unsigned long long &x) {cin >> x;}
void read(float &x) {cin >> x;}
void read(long double &x) {cin >> x;}
void read(char &x) {cin >> x;}
void read(string &x) {cin >> x;}
void read(bool &x) {cin >> x;}
 
template<typename T> 
void read(vector<T> &v) {
    for (int i = 0; i < v.size(); i++)
        read(v[i]);
}
template <typename T, typename... V>
void read(T &t, V&... v) {read(t); read(v...);}
#endif
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<class T> bool maxi(T& a, const T& b) {
    return a < b ? a = b, 1 : 0;
}
template<class T> bool mini(T& a, const T& b) {
    return a > b ? a = b, 1 : 0;
}
template<class... Args>
auto vec(size_t n, Args&&... args) {
    if constexpr(sizeof...(args) == 1)
        return vector(n, args...);
    else
        return vector(n, vec(args...));
}

#endif

using namespace std;
const ll inf = 1e18;
const ll def = 1e5+1;
const ll mod = 1e9;

int prefa[def][3];
int prefb[def][3];
int prefab[def][3][3];

map<char, int> mp = {{'A', 0}, {'T', 1}, {'C', 2}};
void init(string a, string b){
    int n = a.size();
    for (int i = 1; i <= n; i++){
        int vala = mp[a[i - 1]];
        for (int j = 0; j < 3; j++)
            prefa[i][j] = prefa[i - 1][j] + (j == vala);
        int valb = mp[b[i - 1]];
        for (int j = 0; j < 3; j++)
            prefb[i][j] = prefb[i - 1][j] + (j == valb);
        for (int j = 0; j < 3; j++) for (int u = 0; u < 3; u++)
            prefab[i][j][u] = prefab[i - 1][j][u] + ((j == vala) && (u == valb));
    }
}

int get_distance(int x, int y){
    for (int i = 0; i < 3; i++){
        int cnta = prefa[y + 1][i] - prefa[x][i];
        int cntb = prefb[y + 1][i] - prefb[x][i];
        if (cnta != cntb)
            return -1;
    }
    auto cnt = vec(3, 3, 0);
    for (int i = 0; i < 3; i++) for (int j = 0; j < 3; j++)
        cnt[i][j] = prefab[y + 1][i][j] - prefab[x][i][j];

    int left = y - x + 1, res = 0;
    for (int i = 0; i < 3; i++)
        left -= cnt[i][i];
    for (int i = 0; i < 3; i++) for (int j = i + 1; j < 3; j++){
        int val = min(cnt[i][j], cnt[j][i]);
        left -= val * 2;
        res += val;
    }
    res += (left / 3) * 2;
    return res;
}

/*
a c b
b a c
*/

// void solve(){  
//     int r, l, b;
//     read(r, l, b);

//     int x[r];
//     for (int i = 0; i < r; i++)
//         read(x[i]);
//     print(besthub(r, l, x, b));
// }       

// /*
// 1 2 3 4 
// 2 3 4 1 
// */

// int32_t main(){
//     ios_base::sync_with_stdio(0);
//     cin.tie(0); cout.tie(0);

//     // if (ifstream("input.txt").good()){
//     //     freopen("input.txt", "r", stdin);
//     //     freopen("output.txt", "w", stdout);
//     // }

//     int t;  
//     t = 1;

//     while (t--){
//         solve();
//         nl;
//     }
// }

• Subtask 1: 21 / 21
• Subtask 2: 22 / 22
• Subtask 3: 13 / 13
• Subtask 4: 28 / 28
• Subtask 5: 16 / 16