oj.uz

Submission #602426

# Submission time Handle Problem Language Result Execution time Memory
602426 2022-07-23T05:48:48 Z rrrr10000 Mutating DNA (IOI21_dna) C++17
100 / 100
 48 ms 8888 KB 
#include "dna.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef pair<ll,ll> P;
typedef vector<P> vp;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define REP(i,k,n) for(ll i=(ll)(k);i<(ll)(n);i++)

vvi rui;
void init(std::string a, std::string b) {
	ll n=a.size();
	rui=vvi(6,vi(n+1));
	rep(i,n)if(a[i]!=b[i]){
		ll t;
		if(a[i]=='A'&&b[i]=='C')t=0;
		if(a[i]=='C'&&b[i]=='A')t=1;
		if(a[i]=='C'&&b[i]=='T')t=2;
		if(a[i]=='T'&&b[i]=='C')t=3;
		if(a[i]=='T'&&b[i]=='A')t=4;
		if(a[i]=='A'&&b[i]=='T')t=5;
		rui[t][i+1]++;
	}
	rep(i,6)rep(j,n)rui[i][j+1]+=rui[i][j];
}

int get_distance(int x, int y) {
	y++;
	vi cnt(6);
	rep(i,6)cnt[i]=rui[i][y]-rui[i][x];
	ll ans=0;
	rep(i,3){
		ll t=min(cnt[i*2],cnt[i*2+1]);
		ans+=t;
		cnt[i*2]-=t;
		cnt[i*2+1]-=t;
	}
	if(cnt[0]+cnt[2]+cnt[4]==0&&cnt[1]==cnt[3]&&cnt[3]==cnt[5])ans+=cnt[1]*2;
	else if(cnt[1]+cnt[3]+cnt[5]==0&&cnt[0]==cnt[2]&&cnt[2]==cnt[4])ans+=cnt[0]*2;
	else return -1;
	return ans;
}

Compilation message

dna.cpp: In function 'void init(std::string, std::string)':
dna.cpp:24:8: warning: 't' may be used uninitialized in this function [-Wmaybe-uninitialized]
   24 |   rui[t][i+1]++;
      |        ^

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 8696 KB Output is correct
2 Correct 36 ms 8780 KB Output is correct
3 Correct 35 ms 8268 KB Output is correct
4 Correct 44 ms 8788 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 300 KB Output is correct
4 Correct 5 ms 6452 KB Output is correct
5 Correct 5 ms 6584 KB Output is correct
6 Correct 5 ms 6484 KB Output is correct
7 Correct 5 ms 6100 KB Output is correct
8 Correct 7 ms 6484 KB Output is correct
9 Correct 5 ms 6484 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 300 KB Output is correct
4 Correct 5 ms 6452 KB Output is correct
5 Correct 5 ms 6584 KB Output is correct
6 Correct 5 ms 6484 KB Output is correct
7 Correct 5 ms 6100 KB Output is correct
8 Correct 7 ms 6484 KB Output is correct
9 Correct 5 ms 6484 KB Output is correct
10 Correct 45 ms 8692 KB Output is correct
11 Correct 39 ms 8888 KB Output is correct
12 Correct 36 ms 8388 KB Output is correct
13 Correct 40 ms 8476 KB Output is correct
14 Correct 37 ms 8884 KB Output is correct
15 Correct 36 ms 8884 KB Output is correct
16 Correct 38 ms 8300 KB Output is correct
17 Correct 33 ms 8484 KB Output is correct
18 Correct 36 ms 8780 KB Output is correct
19 Correct 35 ms 8268 KB Output is correct
20 Correct 32 ms 8484 KB Output is correct
21 Correct 36 ms 8752 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 300 KB Output is correct
4 Correct 5 ms 6452 KB Output is correct
5 Correct 5 ms 6584 KB Output is correct
6 Correct 5 ms 6484 KB Output is correct
7 Correct 5 ms 6100 KB Output is correct
8 Correct 7 ms 6484 KB Output is correct
9 Correct 5 ms 6484 KB Output is correct
10 Correct 5 ms 6068 KB Output is correct
11 Correct 5 ms 6488 KB Output is correct
12 Correct 6 ms 6100 KB Output is correct
13 Correct 6 ms 6484 KB Output is correct
14 Correct 6 ms 6580 KB Output is correct
15 Correct 6 ms 6484 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 8696 KB Output is correct
2 Correct 36 ms 8780 KB Output is correct
3 Correct 35 ms 8268 KB Output is correct
4 Correct 44 ms 8788 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 300 KB Output is correct
11 Correct 5 ms 6452 KB Output is correct
12 Correct 5 ms 6584 KB Output is correct
13 Correct 5 ms 6484 KB Output is correct
14 Correct 5 ms 6100 KB Output is correct
15 Correct 7 ms 6484 KB Output is correct
16 Correct 5 ms 6484 KB Output is correct
17 Correct 45 ms 8692 KB Output is correct
18 Correct 39 ms 8888 KB Output is correct
19 Correct 36 ms 8388 KB Output is correct
20 Correct 40 ms 8476 KB Output is correct
21 Correct 37 ms 8884 KB Output is correct
22 Correct 36 ms 8884 KB Output is correct
23 Correct 38 ms 8300 KB Output is correct
24 Correct 33 ms 8484 KB Output is correct
25 Correct 36 ms 8780 KB Output is correct
26 Correct 35 ms 8268 KB Output is correct
27 Correct 32 ms 8484 KB Output is correct
28 Correct 36 ms 8752 KB Output is correct
29 Correct 5 ms 6068 KB Output is correct
30 Correct 5 ms 6488 KB Output is correct
31 Correct 6 ms 6100 KB Output is correct
32 Correct 6 ms 6484 KB Output is correct
33 Correct 6 ms 6580 KB Output is correct
34 Correct 6 ms 6484 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 48 ms 8312 KB Output is correct
37 Correct 37 ms 8868 KB Output is correct
38 Correct 42 ms 8524 KB Output is correct
39 Correct 46 ms 8880 KB Output is correct
40 Correct 37 ms 8872 KB Output is correct
41 Correct 4 ms 6484 KB Output is correct
42 Correct 36 ms 8336 KB Output is correct
43 Correct 34 ms 8752 KB Output is correct
44 Correct 35 ms 8796 KB Output is correct
45 Correct 34 ms 8308 KB Output is correct
46 Correct 33 ms 8788 KB Output is correct
47 Correct 35 ms 8780 KB Output is correct