oj.uz

Submission #638965

# Submission time Handle Problem Language Result Execution time Memory
638965 2022-09-08T06:24:20 Z IWTIM Mutating DNA (IOI21_dna) C++17
100 / 100
 101 ms 10240 KB 
# include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = long double; // or double, if TL is tight
using str = string; // yay python! 
 
// pairs
using pii = pair<int,int>;
using pl = pair<ll,ll>;
using pd = pair<db,db>;
#define mp make_pair
#define f first
#define s second
 
#define tcT template<class T
#define tcTU tcT, class U
// ^ lol this makes everything look weird but I'll try it
tcT> using V = vector<T>; 
tcT, size_t SZ> using AR = array<T,SZ>; 
using vi = V<int>;
using vb = V<bool>;
using vl = V<ll>;
using vd = V<db>;
using vs = V<str>;
using vpi = V<pii>;
using vpl = V<pl>;
using vpd = V<pd>;
 
// vectors
// oops size(x), rbegin(x), rend(x) need C++17
#define sz(x) int((x).size())
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define rall(x) x.rbegin(), x.rend() 
#define sor(x) sort(all(x)) 
#define rsz resize
#define ins insert 
#define pb push_back
#define eb emplace_back
#define ft front()
#define bk back()
 
#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 rep(a) F0R(_,a)
#define each(a,x) for (auto& a: x)
const int MOD = 998244353;
const int MX = 2e5+5;
const ll BIG = 1e18; // not too close to LLONG_MAX
const db PI = acos((db)-1);
const int dx[4]{1,0,-1,0}, dy[4]{0,1,0,-1}; // for every grid problem!!
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); 
template<class T> using pqg = priority_queue<T,vector<T>,greater<T>>;
struct DSU {
	vi e; void init(int N) { e = vi(N,-1); }
	int get(int x) { return e[x] < 0 ? x : e[x] = get(e[x]); } 
	bool sameSet(int a, int b) { return get(a) == get(b); }
	int size(int x) { return -e[get(x)]; }
	bool unite(int x, int y) { // union by size
		x = get(x), y = get(y); if (x == y) return 0;
		if (e[x] > e[y]) swap(x,y);
		e[x] += e[y]; e[y] = x; return 1;
	}
};
/*
inline namespace Helpers {
	//////////// is_iterable
	// https://stackoverflow.com/questions/13830158/check-if-a-variable-type-is-iterable
	// this gets used only when we can call begin() and end() on that type
	tcT, class = void> struct is_iterable : false_type {};
	tcT> struct is_iterable<T, void_t<decltype(begin(declval<T>())),
	                                  decltype(end(declval<T>()))
	                                 >
	                       > : true_type {};
	tcT> constexpr bool is_iterable_v = is_iterable<T>::value;
 
	//////////// is_readable
	tcT, class = void> struct is_readable : false_type {};
	tcT> struct is_readable<T,
	        typename std::enable_if_t<
	            is_same_v<decltype(cin >> declval<T&>()), istream&>
	        >
	    > : true_type {};
	tcT> constexpr bool is_readable_v = is_readable<T>::value;
 
	//////////// is_printable
	// // https://nafe.es/posts/2020-02-29-is-printable/
	tcT, class = void> struct is_printable : false_type {};
	tcT> struct is_printable<T,
	        typename std::enable_if_t<
	            is_same_v<decltype(cout << declval<T>()), ostream&>
	        >
	    > : true_type {};
	tcT> constexpr bool is_printable_v = is_printable<T>::value;
}*/
using ll = long long;
using db = long double; // or double, if TL is tight
using str = string; // yay python! 
 
// pairs
using pii = pair<int,int>;
using pl = pair<ll,ll>;
using pd = pair<db,db>;
#define mp make_pair
#define f first
#define s second
 
#define tcT template<class T
#define tcTU tcT, class U
// ^ lol this makes everything look weird but I'll try it
tcT> using V = vector<T>; 
tcT, size_t SZ> using AR = array<T,SZ>; 
using vi = V<int>;
using vb = V<bool>;
using vl = V<ll>;
using vd = V<db>;
using vs = V<str>;
using vpi = V<pii>;
using vpl = V<pl>;
using vpd = V<pd>;
 
// vectors
// oops size(x), rbegin(x), rend(x) need C++17
#define sz(x) int((x).size())
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define rall(x) x.rbegin(), x.rend() 
#define sor(x) sort(all(x)) 
#define rsz resize
#define ins insert 
#define pb push_back
#define eb emplace_back
#define ft front()
#define bk back()
 
#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 rep(a) F0R(_,a)
#define each(a,x) for (auto& a: x)
template<class T> using pqg = priority_queue<T,vector<T>,greater<T>>;
 
/*
inline namespace Helpers {
	//////////// is_iterable
	// https://stackoverflow.com/questions/13830158/check-if-a-variable-type-is-iterable
	// this gets used only when we can call begin() and end() on that type
	tcT, class = void> struct is_iterable : false_type {};
	tcT> struct is_iterable<T, void_t<decltype(begin(declval<T>())),
	                                  decltype(end(declval<T>()))
	                                 >
	                       > : true_type {};
	tcT> constexpr bool is_iterable_v = is_iterable<T>::value;
 
	//////////// is_readable
	tcT, class = void> struct is_readable : false_type {};
	tcT> struct is_readable<T,
	        typename std::enable_if_t<
	            is_same_v<decltype(cin >> declval<T&>()), istream&>
	        >
	    > : true_type {};
	tcT> constexpr bool is_readable_v = is_readable<T>::value;
 
	//////////// is_printable
	// // https://nafe.es/posts/2020-02-29-is-printable/
	tcT, class = void> struct is_printable : false_type {};
	tcT> struct is_printable<T,
	        typename std::enable_if_t<
	            is_same_v<decltype(cout << declval<T>()), ostream&>
	        >
	    > : true_type {};
	tcT> constexpr bool is_printable_v = is_printable<T>::value;
}*/
const int N = 3e5 + 5;
int n,tree[N][4][4];
int go(char ch) {
	if (ch == 'A') return 1;
	if (ch == 'T') return 2;
	return 3;
}
void update(int idx, int x, int y, int ty) {
	for (int i = idx; i < N; i+=i&(-i)) {
		tree[i][x][y]++;
	}
}
int getans(int x, int y, int le, int ri) {
	int pas = 0;
	for (int i = ri; i > 0; i-=i&(-i)) {
		pas += tree[i][x][y];
	}
	for (int i = le - 1; i > 0; i-=i&(-i)) {
		pas -= tree[i][x][y];
	}
	return pas;
}
void init(std::string a, std::string b) {
	n = (int)a.size();
	for (int i = 0; i < n; i++) {
		update(i + 1,go(a[i]),go(b[i]),0);
		update(i + 1,go(a[i]),0,1);
		update(i + 1,0,go(b[i]),1);
	}
}

int get_distance(int x, int y) {
	x++;y++;
	for (int i = 1; i <= 3; i++) {
		if (getans(0,i,x,y) != getans(i,0,x,y)) return -1;
	}
	vector <vector <int> > val = vector < vector < int > >(4, vector <int>(4,0));
	for (int i = 1; i <= 3; i++) {
		for (int j = 1; j <= 3; j++) {
			val[i][j] += getans(i,j,x,y);
		}
	}
	int ans = 0, rem = 0;
	for (int i = 1; i <= 3; i++) {
		for (int j = i + 1; j <= 3; j++) {
			int mn = min(val[i][j], val[j][i]);
			ans += mn;
			rem += val[i][j] + val[j][i] - 2 * mn;
		}
	}
	assert(!(rem % 3));
	return ans + rem * 2 / 3;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 82 ms 9724 KB Output is correct
2 Correct 89 ms 9832 KB Output is correct
3 Correct 85 ms 9276 KB Output is correct
4 Correct 89 ms 9848 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 11 ms 7216 KB Output is correct
5 Correct 13 ms 7372 KB Output is correct
6 Correct 12 ms 7296 KB Output is correct
7 Correct 11 ms 6860 KB Output is correct
8 Correct 11 ms 7308 KB Output is correct
9 Correct 10 ms 7380 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 11 ms 7216 KB Output is correct
5 Correct 13 ms 7372 KB Output is correct
6 Correct 12 ms 7296 KB Output is correct
7 Correct 11 ms 6860 KB Output is correct
8 Correct 11 ms 7308 KB Output is correct
9 Correct 10 ms 7380 KB Output is correct
10 Correct 83 ms 9700 KB Output is correct
11 Correct 93 ms 9780 KB Output is correct
12 Correct 88 ms 9640 KB Output is correct
13 Correct 85 ms 9840 KB Output is correct
14 Correct 99 ms 10156 KB Output is correct
15 Correct 91 ms 10096 KB Output is correct
16 Correct 84 ms 9584 KB Output is correct
17 Correct 79 ms 9756 KB Output is correct
18 Correct 81 ms 10120 KB Output is correct
19 Correct 75 ms 9552 KB Output is correct
20 Correct 78 ms 9744 KB Output is correct
21 Correct 83 ms 10112 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 11 ms 7216 KB Output is correct
5 Correct 13 ms 7372 KB Output is correct
6 Correct 12 ms 7296 KB Output is correct
7 Correct 11 ms 6860 KB Output is correct
8 Correct 11 ms 7308 KB Output is correct
9 Correct 10 ms 7380 KB Output is correct
10 Correct 11 ms 6740 KB Output is correct
11 Correct 12 ms 7380 KB Output is correct
12 Correct 12 ms 6872 KB Output is correct
13 Correct 11 ms 7368 KB Output is correct
14 Correct 12 ms 7400 KB Output is correct
15 Correct 11 ms 7380 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 82 ms 9724 KB Output is correct
2 Correct 89 ms 9832 KB Output is correct
3 Correct 85 ms 9276 KB Output is correct
4 Correct 89 ms 9848 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 316 KB Output is correct
11 Correct 11 ms 7216 KB Output is correct
12 Correct 13 ms 7372 KB Output is correct
13 Correct 12 ms 7296 KB Output is correct
14 Correct 11 ms 6860 KB Output is correct
15 Correct 11 ms 7308 KB Output is correct
16 Correct 10 ms 7380 KB Output is correct
17 Correct 83 ms 9700 KB Output is correct
18 Correct 93 ms 9780 KB Output is correct
19 Correct 88 ms 9640 KB Output is correct
20 Correct 85 ms 9840 KB Output is correct
21 Correct 99 ms 10156 KB Output is correct
22 Correct 91 ms 10096 KB Output is correct
23 Correct 84 ms 9584 KB Output is correct
24 Correct 79 ms 9756 KB Output is correct
25 Correct 81 ms 10120 KB Output is correct
26 Correct 75 ms 9552 KB Output is correct
27 Correct 78 ms 9744 KB Output is correct
28 Correct 83 ms 10112 KB Output is correct
29 Correct 11 ms 6740 KB Output is correct
30 Correct 12 ms 7380 KB Output is correct
31 Correct 12 ms 6872 KB Output is correct
32 Correct 11 ms 7368 KB Output is correct
33 Correct 12 ms 7400 KB Output is correct
34 Correct 11 ms 7380 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 83 ms 9180 KB Output is correct
37 Correct 92 ms 9772 KB Output is correct
38 Correct 101 ms 9724 KB Output is correct
39 Correct 87 ms 10108 KB Output is correct
40 Correct 86 ms 10136 KB Output is correct
41 Correct 10 ms 7380 KB Output is correct
42 Correct 86 ms 9640 KB Output is correct
43 Correct 97 ms 10108 KB Output is correct
44 Correct 80 ms 10132 KB Output is correct
45 Correct 76 ms 9596 KB Output is correct
46 Correct 96 ms 10240 KB Output is correct
47 Correct 84 ms 10112 KB Output is correct