oj.uz

Submission #618902

# Submission time Handle Problem Language Result Execution time Memory
618902 2022-08-02T08:16:30 Z KLPP Mutating DNA (IOI21_dna) C++17
100 / 100
 67 ms 6048 KB 
#include "dna.h"
#include<bits/stdc++.h>

using namespace std;
typedef long long int lld;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define trav(a,v) for(auto a:v)

int pref[1000000][3][3];
map<char,int> m;
void init(std::string a, std::string b) {
	m['A']=0;
	m['C']=1;
	m['T']=2;
	rep(j,0,3){
		rep(k,0,3){
			pref[0][j][k]=0;
		}
	}
	rep(i,0,(int)a.size()){
		rep(j,0,3){
			rep(k,0,3){
				pref[i+1][j][k]=pref[i][j][k];
			}
		}
		pref[i+1][m[a[i]]][m[b[i]]]++;
	}
}
int arr[3][3];
int get_distance(int x, int y) {
	y++;
	rep(i,0,3){
		rep(j,0,3){
			arr[i][j]=pref[y][i][j]-pref[x][i][j];
		}
	}
	int bal[3];
	rep(i,0,3)bal[i]=0;
	rep(i,0,3){
		rep(j,0,3){
			bal[i]+=arr[i][j];
			bal[j]-=arr[i][j];
		}
	}
	rep(i,0,3){
		if(bal[i]!=0)return -1;
	}
	int ans=0;
	rep(i,0,3){
		rep(j,0,3){
			if(i==j)arr[i][j]=0;
			int k=min(arr[i][j],arr[j][i]);
			ans+=k;
			arr[i][j]-=k;
			arr[j][i]-=k;
			//cerr<<arr[i][j]<<" ";
		}//cerr<<endl;
	}
	int tot=0;
	rep(i,0,3){
		rep(j,0,3){
			tot+=arr[i][j];
		}
	}
	tot/=3;
	tot*=2;
	ans+=tot;
	return ans;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 5628 KB Output is correct
2 Correct 49 ms 5644 KB Output is correct
3 Correct 47 ms 5368 KB Output is correct
4 Correct 39 ms 5652 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

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 260 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 7 ms 4308 KB Output is correct
5 Correct 6 ms 4308 KB Output is correct
6 Correct 5 ms 4308 KB Output is correct
7 Correct 5 ms 4052 KB Output is correct
8 Correct 6 ms 4352 KB Output is correct
9 Correct 5 ms 4308 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 1 ms 260 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 7 ms 4308 KB Output is correct
5 Correct 6 ms 4308 KB Output is correct
6 Correct 5 ms 4308 KB Output is correct
7 Correct 5 ms 4052 KB Output is correct
8 Correct 6 ms 4352 KB Output is correct
9 Correct 5 ms 4308 KB Output is correct
10 Correct 57 ms 5716 KB Output is correct
11 Correct 36 ms 5720 KB Output is correct
12 Correct 41 ms 5640 KB Output is correct
13 Correct 44 ms 5888 KB Output is correct
14 Correct 39 ms 6032 KB Output is correct
15 Correct 34 ms 5896 KB Output is correct
16 Correct 35 ms 5748 KB Output is correct
17 Correct 48 ms 5888 KB Output is correct
18 Correct 35 ms 6048 KB Output is correct
19 Correct 30 ms 5756 KB Output is correct
20 Correct 33 ms 5892 KB Output is correct
21 Correct 49 ms 6020 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 1 ms 260 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 7 ms 4308 KB Output is correct
5 Correct 6 ms 4308 KB Output is correct
6 Correct 5 ms 4308 KB Output is correct
7 Correct 5 ms 4052 KB Output is correct
8 Correct 6 ms 4352 KB Output is correct
9 Correct 5 ms 4308 KB Output is correct
10 Correct 6 ms 4052 KB Output is correct
11 Correct 6 ms 4308 KB Output is correct
12 Correct 9 ms 4052 KB Output is correct
13 Correct 8 ms 4308 KB Output is correct
14 Correct 5 ms 4308 KB Output is correct
15 Correct 5 ms 4308 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 5628 KB Output is correct
2 Correct 49 ms 5644 KB Output is correct
3 Correct 47 ms 5368 KB Output is correct
4 Correct 39 ms 5652 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 212 KB Output is correct
9 Correct 1 ms 260 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 7 ms 4308 KB Output is correct
12 Correct 6 ms 4308 KB Output is correct
13 Correct 5 ms 4308 KB Output is correct
14 Correct 5 ms 4052 KB Output is correct
15 Correct 6 ms 4352 KB Output is correct
16 Correct 5 ms 4308 KB Output is correct
17 Correct 57 ms 5716 KB Output is correct
18 Correct 36 ms 5720 KB Output is correct
19 Correct 41 ms 5640 KB Output is correct
20 Correct 44 ms 5888 KB Output is correct
21 Correct 39 ms 6032 KB Output is correct
22 Correct 34 ms 5896 KB Output is correct
23 Correct 35 ms 5748 KB Output is correct
24 Correct 48 ms 5888 KB Output is correct
25 Correct 35 ms 6048 KB Output is correct
26 Correct 30 ms 5756 KB Output is correct
27 Correct 33 ms 5892 KB Output is correct
28 Correct 49 ms 6020 KB Output is correct
29 Correct 6 ms 4052 KB Output is correct
30 Correct 6 ms 4308 KB Output is correct
31 Correct 9 ms 4052 KB Output is correct
32 Correct 8 ms 4308 KB Output is correct
33 Correct 5 ms 4308 KB Output is correct
34 Correct 5 ms 4308 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 67 ms 5284 KB Output is correct
37 Correct 38 ms 5644 KB Output is correct
38 Correct 63 ms 5748 KB Output is correct
39 Correct 37 ms 6028 KB Output is correct
40 Correct 52 ms 6016 KB Output is correct
41 Correct 5 ms 4308 KB Output is correct
42 Correct 42 ms 5756 KB Output is correct
43 Correct 41 ms 6028 KB Output is correct
44 Correct 52 ms 6008 KB Output is correct
45 Correct 35 ms 5808 KB Output is correct
46 Correct 50 ms 6024 KB Output is correct
47 Correct 34 ms 6032 KB Output is correct