oj.uz

Submission #485132

# Submission time Handle Problem Language Result Execution time Memory
485132 2021-11-06T10:14:37 Z MrDeboo Mutating DNA (IOI21_dna) C++17
100 / 100
 41 ms 7412 KB 
#include "dna.h"
#include "bits/stdc++.h"
using namespace std;
int n;
int g[3][3][100000];
void init(std::string a, std::string b) {
	n=a.size();
	for(int i=0;i<3;i++){
		for(int w=0;w<3;w++){
			g[i][w][0]=0;
		}
	}
	for(int i=0;i<n;i++){
		if(i){
			for(int w=0;w<3;w++){
				for(int j=0;j<3;j++){
					g[j][w][i]=g[j][w][i-1];
				}
			}
		}
		if(a[i]!=b[i])g[(a[i]=='A'?0:1+(a[i]=='T'))][(b[i]=='A'?0:1+(b[i]=='T'))][i]++;
	}
}

int get_distance(int l, int r) {
	int ans=0;
	int a[3][3];
	int x[3]={0,0,0},y[3]={0,0,0};
	for(int w=0;w<3;w++){
		for(int j=0;j<3;j++){
			a[w][j]=g[w][j][r]-(l?g[w][j][l-1]:0);
			x[w]+=a[w][j];
			y[j]+=a[w][j];
		}
	}
	// cout<<x[0]<<' '<<y[0]<<endl;
	if(x[0]!=y[0]||x[1]!=y[1]||x[2]!=y[2])return -1;
	for(int i=0;i<3;i++){
		for(int w=0;w<3;w++){
			int k=min(a[i][w],a[w][i]);
			ans+=k;
			a[i][w]-=k;
			a[w][i]-=k;
		}
	}
	int g=0;
	for(int i=0;i<3;i++){
		for(int w=i+1;w<3;w++){
			g+=a[i][w];
			g+=a[w][i];
		}
	}
	return ans+(g/3)*2;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 7052 KB Output is correct
2 Correct 34 ms 7044 KB Output is correct
3 Correct 34 ms 6668 KB Output is correct
4 Correct 34 ms 6976 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 4 ms 4536 KB Output is correct
5 Correct 4 ms 4532 KB Output is correct
6 Correct 4 ms 4556 KB Output is correct
7 Correct 4 ms 4300 KB Output is correct
8 Correct 4 ms 4556 KB Output is correct
9 Correct 3 ms 4556 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 4 ms 4536 KB Output is correct
5 Correct 4 ms 4532 KB Output is correct
6 Correct 4 ms 4556 KB Output is correct
7 Correct 4 ms 4300 KB Output is correct
8 Correct 4 ms 4556 KB Output is correct
9 Correct 3 ms 4556 KB Output is correct
10 Correct 41 ms 7016 KB Output is correct
11 Correct 34 ms 7048 KB Output is correct
12 Correct 33 ms 7008 KB Output is correct
13 Correct 35 ms 7176 KB Output is correct
14 Correct 35 ms 7372 KB Output is correct
15 Correct 32 ms 7292 KB Output is correct
16 Correct 30 ms 6920 KB Output is correct
17 Correct 31 ms 7152 KB Output is correct
18 Correct 31 ms 7280 KB Output is correct
19 Correct 31 ms 7024 KB Output is correct
20 Correct 29 ms 7276 KB Output is correct
21 Correct 29 ms 7296 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 4 ms 4536 KB Output is correct
5 Correct 4 ms 4532 KB Output is correct
6 Correct 4 ms 4556 KB Output is correct
7 Correct 4 ms 4300 KB Output is correct
8 Correct 4 ms 4556 KB Output is correct
9 Correct 3 ms 4556 KB Output is correct
10 Correct 4 ms 4144 KB Output is correct
11 Correct 4 ms 4556 KB Output is correct
12 Correct 4 ms 4300 KB Output is correct
13 Correct 4 ms 4556 KB Output is correct
14 Correct 4 ms 4556 KB Output is correct
15 Correct 4 ms 4556 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 7052 KB Output is correct
2 Correct 34 ms 7044 KB Output is correct
3 Correct 34 ms 6668 KB Output is correct
4 Correct 34 ms 6976 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 4 ms 4536 KB Output is correct
12 Correct 4 ms 4532 KB Output is correct
13 Correct 4 ms 4556 KB Output is correct
14 Correct 4 ms 4300 KB Output is correct
15 Correct 4 ms 4556 KB Output is correct
16 Correct 3 ms 4556 KB Output is correct
17 Correct 41 ms 7016 KB Output is correct
18 Correct 34 ms 7048 KB Output is correct
19 Correct 33 ms 7008 KB Output is correct
20 Correct 35 ms 7176 KB Output is correct
21 Correct 35 ms 7372 KB Output is correct
22 Correct 32 ms 7292 KB Output is correct
23 Correct 30 ms 6920 KB Output is correct
24 Correct 31 ms 7152 KB Output is correct
25 Correct 31 ms 7280 KB Output is correct
26 Correct 31 ms 7024 KB Output is correct
27 Correct 29 ms 7276 KB Output is correct
28 Correct 29 ms 7296 KB Output is correct
29 Correct 4 ms 4144 KB Output is correct
30 Correct 4 ms 4556 KB Output is correct
31 Correct 4 ms 4300 KB Output is correct
32 Correct 4 ms 4556 KB Output is correct
33 Correct 4 ms 4556 KB Output is correct
34 Correct 4 ms 4556 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 35 ms 6676 KB Output is correct
37 Correct 34 ms 7040 KB Output is correct
38 Correct 38 ms 7140 KB Output is correct
39 Correct 37 ms 7360 KB Output is correct
40 Correct 33 ms 7412 KB Output is correct
41 Correct 3 ms 4556 KB Output is correct
42 Correct 33 ms 7132 KB Output is correct
43 Correct 32 ms 7276 KB Output is correct
44 Correct 33 ms 7284 KB Output is correct
45 Correct 29 ms 7052 KB Output is correct
46 Correct 30 ms 7304 KB Output is correct
47 Correct 32 ms 7284 KB Output is correct