oj.uz

Submission #621022

# Submission time Handle Problem Language Result Execution time Memory
621022 2022-08-03T11:10:48 Z amunduzbaev Mutating DNA (IOI21_dna) C++17
100 / 100
 41 ms 5436 KB 
#include "dna.h"
#ifndef EVAL
#include "grader.cpp"
#endif
#include "bits/stdc++.h"
using namespace std;

#define ar array

const int N = 1e5 + 5;
ar<int, 4> pref[N];

void init(string a, string b) {
	int n = a.size();
	for(int i=0;i<n;i++){
		if(i) pref[i] = pref[i-1];
		if(a[i] == b[i]) pref[i][3]++;
		else {
			if(a[i] == 'A' && b[i] == 'T') pref[i][0]++;
			if(a[i] == 'T' && b[i] == 'C') pref[i][1]++;
			if(a[i] == 'C' && b[i] == 'A') pref[i][2]++;
			swap(a[i], b[i]);
			if(a[i] == 'A' && b[i] == 'T') pref[i][0]--;
			if(a[i] == 'T' && b[i] == 'C') pref[i][1]--;
			if(a[i] == 'C' && b[i] == 'A') pref[i][2]--;
		}
	}
}

int get_distance(int x, int y) {
	ar<int, 4> a = pref[y];
	if(x){
		for(int t=0;t<4;t++) a[t] -= pref[x-1][t];
	}
	
	if(a[0] == a[1] && a[1] == a[2]){
		//~ cout<<a[0]<<" "<<a[1]<<" "<<a[2]<<"\n";
		int res = y - x + 1 - a[3];
		a[0] = abs(a[0]);
		assert((res - a[0] * 3) % 2 == 0);
		res = (res - a[0] * 3) / 2 + a[0] * 2;
		return res;
	}
	return -1;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 4980 KB Output is correct
2 Correct 31 ms 5060 KB Output is correct
3 Correct 32 ms 4880 KB Output is correct
4 Correct 30 ms 5056 KB Output is correct
5 Correct 1 ms 312 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 312 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 308 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 3 ms 2516 KB Output is correct
5 Correct 3 ms 2636 KB Output is correct
6 Correct 3 ms 2516 KB Output is correct
7 Correct 3 ms 2388 KB Output is correct
8 Correct 3 ms 2620 KB Output is correct
9 Correct 3 ms 2660 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 308 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 3 ms 2516 KB Output is correct
5 Correct 3 ms 2636 KB Output is correct
6 Correct 3 ms 2516 KB Output is correct
7 Correct 3 ms 2388 KB Output is correct
8 Correct 3 ms 2620 KB Output is correct
9 Correct 3 ms 2660 KB Output is correct
10 Correct 31 ms 5044 KB Output is correct
11 Correct 41 ms 5128 KB Output is correct
12 Correct 29 ms 5264 KB Output is correct
13 Correct 29 ms 5236 KB Output is correct
14 Correct 29 ms 5368 KB Output is correct
15 Correct 28 ms 5324 KB Output is correct
16 Correct 27 ms 5144 KB Output is correct
17 Correct 29 ms 5240 KB Output is correct
18 Correct 29 ms 5256 KB Output is correct
19 Correct 27 ms 5152 KB Output is correct
20 Correct 32 ms 5236 KB Output is correct
21 Correct 27 ms 5336 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 308 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 3 ms 2516 KB Output is correct
5 Correct 3 ms 2636 KB Output is correct
6 Correct 3 ms 2516 KB Output is correct
7 Correct 3 ms 2388 KB Output is correct
8 Correct 3 ms 2620 KB Output is correct
9 Correct 3 ms 2660 KB Output is correct
10 Correct 4 ms 2324 KB Output is correct
11 Correct 4 ms 2644 KB Output is correct
12 Correct 4 ms 2388 KB Output is correct
13 Correct 4 ms 2620 KB Output is correct
14 Correct 3 ms 2644 KB Output is correct
15 Correct 3 ms 2644 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 4980 KB Output is correct
2 Correct 31 ms 5060 KB Output is correct
3 Correct 32 ms 4880 KB Output is correct
4 Correct 30 ms 5056 KB Output is correct
5 Correct 1 ms 312 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 312 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 308 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 3 ms 2516 KB Output is correct
12 Correct 3 ms 2636 KB Output is correct
13 Correct 3 ms 2516 KB Output is correct
14 Correct 3 ms 2388 KB Output is correct
15 Correct 3 ms 2620 KB Output is correct
16 Correct 3 ms 2660 KB Output is correct
17 Correct 31 ms 5044 KB Output is correct
18 Correct 41 ms 5128 KB Output is correct
19 Correct 29 ms 5264 KB Output is correct
20 Correct 29 ms 5236 KB Output is correct
21 Correct 29 ms 5368 KB Output is correct
22 Correct 28 ms 5324 KB Output is correct
23 Correct 27 ms 5144 KB Output is correct
24 Correct 29 ms 5240 KB Output is correct
25 Correct 29 ms 5256 KB Output is correct
26 Correct 27 ms 5152 KB Output is correct
27 Correct 32 ms 5236 KB Output is correct
28 Correct 27 ms 5336 KB Output is correct
29 Correct 4 ms 2324 KB Output is correct
30 Correct 4 ms 2644 KB Output is correct
31 Correct 4 ms 2388 KB Output is correct
32 Correct 4 ms 2620 KB Output is correct
33 Correct 3 ms 2644 KB Output is correct
34 Correct 3 ms 2644 KB Output is correct
35 Correct 1 ms 304 KB Output is correct
36 Correct 32 ms 4796 KB Output is correct
37 Correct 38 ms 5028 KB Output is correct
38 Correct 31 ms 5268 KB Output is correct
39 Correct 32 ms 5400 KB Output is correct
40 Correct 39 ms 5436 KB Output is correct
41 Correct 4 ms 2656 KB Output is correct
42 Correct 27 ms 5224 KB Output is correct
43 Correct 27 ms 5384 KB Output is correct
44 Correct 27 ms 5368 KB Output is correct
45 Correct 26 ms 5248 KB Output is correct
46 Correct 26 ms 5368 KB Output is correct
47 Correct 34 ms 5324 KB Output is correct