Submission #816342

# Submission time Handle Problem Language Result Execution time Memory
816342 2023-08-09T04:52:29 Z penguinman Mutating DNA (IOI21_dna) C++17
100 / 100
89 ms 23628 KB
#include "dna.h"

#include <bits/stdc++.h>

using std::cin;
using std::cout;
using std::vector;
using std::string;
using ll = long long;
using vi = vector<ll>;
using vii = vector<vi>;
using pii = std::pair<ll,ll>;

#define rep(i,j,k) for(ll i=ll(j); i<ll(k); i++)
#define REP(i,j,k) for(ll i=ll(j); i<=ll(k); i++)
#define per(i,j,k) for(ll i=ll(j); i>=ll(k); i--)
#define ln "\n"
#define all(a) a.begin(), a.end()
#define pb emplace_back
#define mp std::make_pair

vector<vii> sum;
ll N;

void init(std::string a, std::string b) {
	string S = "ACT";
	N = a.size();
	sum.resize(N+1, vii(3, vi(3)));
	rep(i,0,N){
		ll l = 0, r = 0;
		rep(j,0,3){
			if(S[j] == a[i]) l = j;
		}
		rep(j,0,3){
			if(S[j] == b[i]) r = j;
		}
		rep(j,0,3){
			rep(k,0,3){
				sum[i+1][j][k] = sum[i][j][k];
			}
		}
		sum[i+1][l][r]++;
	}
}

int get_distance(int x, int y) {
	y++;
	vii num(3,vi(3));
	rep(i,0,3){
		rep(j,0,3) num[i][j] = sum[y][i][j]-sum[x][i][j];
	}
	int ans = 0;
	rep(i,0,3) num[i][i] = 0;
	rep(i,0,3){
		rep(j,i+1,3){
			ll val = std::min(num[i][j], num[j][i]);
			num[i][j] -= val;
			num[j][i] -= val;
			ans += val;
		}
	}
	if(num[0][1]+num[0][2] != num[1][0]+num[2][0]) return -1;
	if(num[1][0]+num[1][2] != num[0][1]+num[2][1]) return -1;
	if(num[2][1]+num[2][0] != num[0][2]+num[1][2]) return -1;
	ll cnt = 0;
	rep(i,0,3){
		rep(j,0,3) cnt += num[i][j];
	}
	assert(cnt%3 == 0);
	ans += cnt/3*2;
	return ans;
}
# Verdict Execution time Memory Grader output
1 Correct 72 ms 22840 KB Output is correct
2 Correct 70 ms 23100 KB Output is correct
3 Correct 58 ms 21276 KB Output is correct
4 Correct 78 ms 23092 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 23 ms 20348 KB Output is correct
5 Correct 29 ms 20600 KB Output is correct
6 Correct 22 ms 20496 KB Output is correct
7 Correct 28 ms 19352 KB Output is correct
8 Correct 21 ms 20584 KB Output is correct
9 Correct 24 ms 20788 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 23 ms 20348 KB Output is correct
5 Correct 29 ms 20600 KB Output is correct
6 Correct 22 ms 20496 KB Output is correct
7 Correct 28 ms 19352 KB Output is correct
8 Correct 21 ms 20584 KB Output is correct
9 Correct 24 ms 20788 KB Output is correct
10 Correct 67 ms 22840 KB Output is correct
11 Correct 60 ms 23100 KB Output is correct
12 Correct 81 ms 22080 KB Output is correct
13 Correct 69 ms 22612 KB Output is correct
14 Correct 88 ms 23472 KB Output is correct
15 Correct 65 ms 23460 KB Output is correct
16 Correct 67 ms 21904 KB Output is correct
17 Correct 57 ms 22416 KB Output is correct
18 Correct 78 ms 23340 KB Output is correct
19 Correct 60 ms 21976 KB Output is correct
20 Correct 61 ms 22444 KB Output is correct
21 Correct 63 ms 23376 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 23 ms 20348 KB Output is correct
5 Correct 29 ms 20600 KB Output is correct
6 Correct 22 ms 20496 KB Output is correct
7 Correct 28 ms 19352 KB Output is correct
8 Correct 21 ms 20584 KB Output is correct
9 Correct 24 ms 20788 KB Output is correct
10 Correct 21 ms 18884 KB Output is correct
11 Correct 21 ms 20564 KB Output is correct
12 Correct 25 ms 19280 KB Output is correct
13 Correct 21 ms 20492 KB Output is correct
14 Correct 28 ms 20540 KB Output is correct
15 Correct 27 ms 20532 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 72 ms 22840 KB Output is correct
2 Correct 70 ms 23100 KB Output is correct
3 Correct 58 ms 21276 KB Output is correct
4 Correct 78 ms 23092 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 296 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 23 ms 20348 KB Output is correct
12 Correct 29 ms 20600 KB Output is correct
13 Correct 22 ms 20496 KB Output is correct
14 Correct 28 ms 19352 KB Output is correct
15 Correct 21 ms 20584 KB Output is correct
16 Correct 24 ms 20788 KB Output is correct
17 Correct 67 ms 22840 KB Output is correct
18 Correct 60 ms 23100 KB Output is correct
19 Correct 81 ms 22080 KB Output is correct
20 Correct 69 ms 22612 KB Output is correct
21 Correct 88 ms 23472 KB Output is correct
22 Correct 65 ms 23460 KB Output is correct
23 Correct 67 ms 21904 KB Output is correct
24 Correct 57 ms 22416 KB Output is correct
25 Correct 78 ms 23340 KB Output is correct
26 Correct 60 ms 21976 KB Output is correct
27 Correct 61 ms 22444 KB Output is correct
28 Correct 63 ms 23376 KB Output is correct
29 Correct 21 ms 18884 KB Output is correct
30 Correct 21 ms 20564 KB Output is correct
31 Correct 25 ms 19280 KB Output is correct
32 Correct 21 ms 20492 KB Output is correct
33 Correct 28 ms 20540 KB Output is correct
34 Correct 27 ms 20532 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 89 ms 21308 KB Output is correct
37 Correct 68 ms 23044 KB Output is correct
38 Correct 72 ms 22244 KB Output is correct
39 Correct 76 ms 23480 KB Output is correct
40 Correct 76 ms 23628 KB Output is correct
41 Correct 21 ms 20564 KB Output is correct
42 Correct 71 ms 22152 KB Output is correct
43 Correct 74 ms 23440 KB Output is correct
44 Correct 62 ms 23392 KB Output is correct
45 Correct 71 ms 22112 KB Output is correct
46 Correct 53 ms 23452 KB Output is correct
47 Correct 83 ms 23372 KB Output is correct