제출 #771441

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
771441		marvinthang	DNA 돌연변이 (IOI21_dna)	C++17	100 / 100	70 ms	23524 KiB

dna

/*************************************
*    author: marvinthang             *
*    created: 03.07.2023 09:32:34    *
*************************************/

#include "dna.h"
#include <bits/stdc++.h>

using namespace std;

#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i--; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
    #include "debug.h"
#else
    #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
    #define DB(...) 23
    #define db(...) 23
    #define debug(...) 23
#endif

template <class U, class V> scan_op(pair <U, V>)  { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>)  { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")";  else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }

// end of template

vector <vector <vector <int>>> pref;

void init(string a, string b) {
	int n = a.size();
	pref.resize(n + 1, vector<vector<int>>(3, vector<int>(3)));
	REP(i, n) {
		pref[i + 1] = pref[i];
		++pref[i + 1][a[i] == 'A' ? 0 : a[i] == 'C' ? 1 : 2][b[i] == 'A' ? 0 : b[i] == 'C' ? 1 : 2];
	}
}

int get_distance(int x, int y) {
	int v = 0, res = 0;
	REP(i, 3) {
		int j = i == 2 ? 0 : i + 1;
		int a = pref[y + 1][i][j] - pref[x][i][j];
		int b = pref[y + 1][j][i] - pref[x][j][i];
		res += min(a, b);
		if (!i) v = a - b;
		else if (v != a - b) return -1;
	}
	return res + abs(v) * 2;
}

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