Submission #491533

#	Time	Username	Problem	Language	Result	Execution time	Memory
491533		JerryLiu06	Mutating DNA (IOI21_dna)	C++17	35 / 100	46 ms	7312 KiB

dna

// https://oj.uz/problem/view/IOI21_dna

#include <bits/stdc++.h>
 
using namespace std;
 
using ll = long long;
using ld = long double;
using db = double;
using str = string;
 
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using pd = pair<db, db>;
 
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<ll>;
using vd = vector<db>;
using vs = vector<str>;
using vpi = vector<pi>;
using vpl = vector<pl>;
using vpd = vector<pd>;
 
#define FASTIO ios_base::sync_with_stdio(false); cin.tie(0);
#define FASTIOF ios_base::sync_with_stdio(false); fin.tie(0);
 
#define mp make_pair
#define f first
#define s second
 
#define sz(x) (int)(x).size()
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define sor(x) sort(all(x))
#define rsz resize
#define ins insert 
#define ft front()
#define bk back()
#define pb push_back
#define pf push_front
 
#define lb lower_bound
#define ub upper_bound
 
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) FOR(i, 0, a)
#define ROF(i, a, b) for (int i = (b) - 1; i >= (a); i--)
#define R0F(i, a) ROF(i, 0, a)
#define EACH(a, x) for (auto& a : x)
 
ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); }
ll fdiv(ll a, ll b) { return a / b - ((a ^ b) < 0 && a % b); }
 
template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
 
template<class T> void remDup(vector<T>& v) { sor(v); v.erase(unique(all(v)), v.end()); }
 
const int MOD = 1e9 + 7;
const int MX = 1e5 + 10;
const ll INF = 1e18;

int N, Q; int MP[150]; int pref[MX][3][3];

void init(str S1, str S2) {
    N = sz(S1); 

    MP['A'] = 0;
    MP['C'] = 1;
    MP['T'] = 2;

    FOR(i, 1, N + 1) {
        int curI = MP[S1[i - 1]];
        int curJ = MP[S2[i - 1]];

        F0R(j, 3) {
            F0R(k, 3) {
                pref[i][j][k] = pref[i - 1][j][k];
            }
        }
        pref[i][curI][curJ]++;
    }
}
int get_distance(int x, int y) {
    x++, y++;

    int sub[3][3], cnt[3];
    
    F0R(i, 3) {
        cnt[i] = 0;
    }
    F0R(i, 3) {
        F0R(j, 3) {
            sub[i][j] = pref[y][i][j] - pref[x - 1][i][j];

            cnt[i] += sub[i][j];
            cnt[j] -= sub[i][j];
        }
    }
    F0R(i, 3) {
        if (cnt[i] != 0) {
            return -1;
        }
    }
    int ans = 0;

    F0R(i, 3) {
        FOR(j, i + 1, 3) {
            ans += min(sub[i][j], sub[j][i]);

            sub[i][j] -= min(sub[i][j], sub[j][i]);
            sub[j][i] -= min(sub[i][j], sub[j][i]);
        }
    }
    if (sub[1][0]) ans += 2 * sub[1][0];
    if (sub[0][1]) ans += 2 * sub[0][1];

    return ans;
}

Compilation message (stderr)

dna.cpp: In function 'void init(str, str)':
dna.cpp:74:32: warning: array subscript has type 'char' [-Wchar-subscripts]
   74 |         int curI = MP[S1[i - 1]];
      |                                ^
dna.cpp:75:32: warning: array subscript has type 'char' [-Wchar-subscripts]
   75 |         int curJ = MP[S2[i - 1]];
      |                                ^

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