oj.uz

Submission #483897

# Submission time Handle Problem Language Result Execution time Memory
483897 2021-11-01T08:59:26 Z dnaux Mutating DNA (IOI21_dna) C++17
100 / 100
 56 ms 8552 KB 
#include <bits/stdc++.h>
#define endline "\n"
#define pb push_back
#define mp make_pair
#define st first
#define nd second
#define lsb(i) i&(-i)
#define sz(i) (int)i.size()
 
typedef long long ll;
using namespace std;
const ll INF = 1e18L;
constexpr int mod = int(1e9) + 7;
 
ll t=1, n, q, k, cases = 0; 
string a, b;
vector<array<int,3>> coua,coub; // 0 = A, 1 = T, 2 = C
vector<array<int,6>> diff; // 0 = TA, 1 = AT, 2 = CA, 3 = AC, 4 = TC, 5 = CT

void init(string a, string b){
	n = sz(a);
	coua.resize(n + 1);coub.resize(n + 1);diff.resize(n + 1);
	for(int i = 1; i <= n; i++){
		for(int j = 0; j < 3; j++){
			coua[i][j] = coua[i - 1][j];
			coub[i][j] = coub[i - 1][j];
		}
		int xa = a[i - 1] == 'A' ? 0 : (a[i - 1] == 'T' ? 1 : 2);
		coua[i][xa]++;
		int xb = b[i - 1] == 'A' ? 0 : (b[i - 1] == 'T' ? 1 : 2);
		coub[i][xb]++;
	}
	for(int i = 1; i <= n; i++){
		for(int j = 0; j < 6; j++){
			diff[i][j] = diff[i - 1][j];
		}
		if(a[i - 1] == 'T'){
			if(b[i - 1] == 'A')diff[i][0]++;
			else if(b[i - 1] == 'C')diff[i][4]++;
		}
		else if(a[i - 1] == 'A'){
			if(b[i - 1] == 'T')diff[i][1]++;
			else if(b[i - 1] == 'C')diff[i][3]++;	
		}
		else{
			if(b[i - 1] == 'A')diff[i][2]++;
			else if(b[i - 1] == 'T')diff[i][5]++;
		}
	}
}

int get_distance(int x, int y){
	x++;y++;

	if(coua[y][0] - coua[x - 1][0] != coub[y][0] - coub[x - 1][0]){
		return -1;
	}

	else if(coua[y][1] - coua[x - 1][1] != coub[y][1] - coub[x - 1][1]){
		return -1;
	}

	else if(coua[y][2] - coua[x - 1][2] != coub[y][2] - coub[x - 1][2]){
		return -1;
	}

	ll ans = 0, bruh = 0;

	ans += min(diff[y][0] - diff[x - 1][0], diff[y][1] - diff[x - 1][1]);
	bruh += abs((diff[y][0] - diff[x - 1][0]) - (diff[y][1] - diff[x - 1][1]));
	//cout << ans << '/';

	ans += min(diff[y][2] - diff[x - 1][2], diff[y][3] - diff[x - 1][3]);
	bruh += abs((diff[y][2] - diff[x - 1][2]) - (diff[y][3] - diff[x - 1][3]));
	//cout << ans << '/';

	ans += min(diff[y][4] - diff[x - 1][4], diff[y][5] - diff[x - 1][5]);
	bruh += abs((diff[y][4] - diff[x - 1][4]) - (diff[y][5] - diff[x - 1][5]));
	//cout << diff[y][4] << " " << diff[x - 1][4] << " " << diff[y][5] << " " << diff[x - 1][5] << endline;

	ans += (bruh / 3) * 2;

	return ans;
}

/*int main(){
    #ifdef local
        freopen("trie.gir","r",stdin);
        freopen("trie.cik","w",stdout);
    #endif
    ios_base::sync_with_stdio(false);cin.tie(NULL);
    //cin>>t;
   	//for(; cases <= t; cases++)solve();
    cin >> n >> q;
    cin >> a >> b;

    init(a, b);

    for(int i = 0; i < q; i++){
    	int x, y;
    	cin >> x >> y;
    	cout << get_distance(x, y) << endline;
    }
    return 0;
}*/

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 7924 KB Output is correct
2 Correct 34 ms 8000 KB Output is correct
3 Correct 35 ms 7592 KB Output is correct
4 Correct 38 ms 8064 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 7 ms 5708 KB Output is correct
5 Correct 6 ms 5676 KB Output is correct
6 Correct 6 ms 5708 KB Output is correct
7 Correct 7 ms 5324 KB Output is correct
8 Correct 6 ms 5708 KB Output is correct
9 Correct 5 ms 5708 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 7 ms 5708 KB Output is correct
5 Correct 6 ms 5676 KB Output is correct
6 Correct 6 ms 5708 KB Output is correct
7 Correct 7 ms 5324 KB Output is correct
8 Correct 6 ms 5708 KB Output is correct
9 Correct 5 ms 5708 KB Output is correct
10 Correct 56 ms 8048 KB Output is correct
11 Correct 36 ms 8096 KB Output is correct
12 Correct 32 ms 8044 KB Output is correct
13 Correct 35 ms 8136 KB Output is correct
14 Correct 36 ms 8456 KB Output is correct
15 Correct 35 ms 8352 KB Output is correct
16 Correct 32 ms 7980 KB Output is correct
17 Correct 32 ms 8076 KB Output is correct
18 Correct 33 ms 8332 KB Output is correct
19 Correct 30 ms 8080 KB Output is correct
20 Correct 31 ms 8100 KB Output is correct
21 Correct 31 ms 8448 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 7 ms 5708 KB Output is correct
5 Correct 6 ms 5676 KB Output is correct
6 Correct 6 ms 5708 KB Output is correct
7 Correct 7 ms 5324 KB Output is correct
8 Correct 6 ms 5708 KB Output is correct
9 Correct 5 ms 5708 KB Output is correct
10 Correct 6 ms 5196 KB Output is correct
11 Correct 9 ms 5708 KB Output is correct
12 Correct 6 ms 5396 KB Output is correct
13 Correct 6 ms 5708 KB Output is correct
14 Correct 6 ms 5792 KB Output is correct
15 Correct 5 ms 5708 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 7924 KB Output is correct
2 Correct 34 ms 8000 KB Output is correct
3 Correct 35 ms 7592 KB Output is correct
4 Correct 38 ms 8064 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 7 ms 5708 KB Output is correct
12 Correct 6 ms 5676 KB Output is correct
13 Correct 6 ms 5708 KB Output is correct
14 Correct 7 ms 5324 KB Output is correct
15 Correct 6 ms 5708 KB Output is correct
16 Correct 5 ms 5708 KB Output is correct
17 Correct 56 ms 8048 KB Output is correct
18 Correct 36 ms 8096 KB Output is correct
19 Correct 32 ms 8044 KB Output is correct
20 Correct 35 ms 8136 KB Output is correct
21 Correct 36 ms 8456 KB Output is correct
22 Correct 35 ms 8352 KB Output is correct
23 Correct 32 ms 7980 KB Output is correct
24 Correct 32 ms 8076 KB Output is correct
25 Correct 33 ms 8332 KB Output is correct
26 Correct 30 ms 8080 KB Output is correct
27 Correct 31 ms 8100 KB Output is correct
28 Correct 31 ms 8448 KB Output is correct
29 Correct 6 ms 5196 KB Output is correct
30 Correct 9 ms 5708 KB Output is correct
31 Correct 6 ms 5396 KB Output is correct
32 Correct 6 ms 5708 KB Output is correct
33 Correct 6 ms 5792 KB Output is correct
34 Correct 5 ms 5708 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 36 ms 7744 KB Output is correct
37 Correct 35 ms 8136 KB Output is correct
38 Correct 34 ms 8204 KB Output is correct
39 Correct 34 ms 8544 KB Output is correct
40 Correct 35 ms 8552 KB Output is correct
41 Correct 5 ms 5708 KB Output is correct
42 Correct 35 ms 8144 KB Output is correct
43 Correct 35 ms 8448 KB Output is correct
44 Correct 32 ms 8504 KB Output is correct
45 Correct 30 ms 8172 KB Output is correct
46 Correct 32 ms 8516 KB Output is correct
47 Correct 32 ms 8424 KB Output is correct