oj.uz

Submission #924290

# Submission time Handle Problem Language Result Execution time Memory
924290 2024-02-08T19:30:31 Z tosivanmak Mutating DNA (IOI21_dna) C++17
100 / 100
 34 ms 11152 KB 
#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll psum[100005][7];
// 1 at 2 ac 3 ta 4 tc 5 ca 6 ct
ll acnt[100005],tcnt[100005],ccnt[100005];
void init(std::string a, std::string b) {
   for(int i=1;i<=6;i++){
       psum[0][i]=0;
   }
   acnt[0]=tcnt[0]=ccnt[0]=0;
   for(int i=0;i<a.length();i++){
       acnt[i+1]=acnt[i],tcnt[i+1]=tcnt[i],ccnt[i+1]=ccnt[i];
       acnt[i+1]+=(a[i]=='A');
       acnt[i+1]-=(b[i]=='A');
       tcnt[i+1]+=(a[i]=='T');
       tcnt[i+1]-=(b[i]=='T');
       ccnt[i+1]+=(a[i]=='C');
       ccnt[i+1]-=(b[i]=='C');
   }
   for(int i=0;i<a.length();i++){
    //    cout<<i<<'\n';
    // cout<<a[i]<<" "<<b[i]<<'\n';
       for(int j=1;j<=6;j++){
           psum[i+1][j]=psum[i][j];
       }
       if(a[i]=='A'&&b[i]=='T'){
           psum[i+1][1]++;
       }
       if(a[i]=='A'&&b[i]=='C'){
           psum[i+1][2]++;
       }
       if(a[i]=='T'&&b[i]=='A'){
           psum[i+1][3]++;
       }
       if(a[i]=='T'&&b[i]=='C'){
           psum[i+1][4]++;
        //    cout<<"fuck\n";
       }
       if(a[i]=='C'&&b[i]=='A'){
           psum[i+1][5]++;
       }
       if(a[i]=='C'&&b[i]=='T'){
           psum[i+1][6]++;
       }
   }
}

int get_distance(int x, int y) {
    x++,y++;
    if(acnt[y]-acnt[x-1]!=0 || tcnt[y]-tcnt[x-1]!=0 || ccnt[y]-ccnt[x-1]!=0){
        return -1;
    }
    ll one=psum[y][1]-psum[x-1][1];
    ll two=psum[y][2]-psum[x-1][2];
    ll three=psum[y][3]-psum[x-1][3];
    ll four=psum[y][4]-psum[x-1][4];
    ll five=psum[y][5]-psum[x-1][5];
    ll six=psum[y][6]-psum[x-1][6];
    // cout<<one<<" "<<two<<" "<<three<<" "<<four<<" "<<five<<" "<<six<<'\n';
    ll lol=min(one,three);
    ll lol2=min(two,five);
    ll lol3=min(four,six);
    // cout<<lol<<" "<<lol2<<" "<<lol3<<'\n';
    one-=lol,three-=lol;
    return lol+lol2+lol3+2*max(one,three);
}

// int main() {
// 	int n, q;
// 	assert(scanf("%d %d", &n, &q) == 2);
// 	char A[n+1], B[n+1];
// 	assert(scanf("%s", A) == 1);
// 	assert(scanf("%s", B) == 1);
// 	std::string a = std::string(A);
// 	std::string b = std::string(B);
// 	std::vector<int> x(q), y(q);
// 	for (int i = 0; i < q; i++) {
// 		assert(scanf("%d %d", &x[i], &y[i]) == 2);
// 	}
// 	fclose(stdin);
// 	std::vector<int> results(q);
// 	init(a, b);
// 	for (int i = 0; i < q; i++) {
// 		results[i] = get_distance(x[i], y[i]);
// 	}
// 	for (int i = 0; i < q; i++) {
// 		printf("%d\n", results[i]);
// 	}
// 	fclose(stdout);
// 	return 0;
// }

Compilation message

dna.cpp: In function 'void init(std::string, std::string)':
dna.cpp:12:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   12 |    for(int i=0;i<a.length();i++){
      |                ~^~~~~~~~~~~
dna.cpp:21:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   21 |    for(int i=0;i<a.length();i++){
      |                ~^~~~~~~~~~~

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 10012 KB Output is correct
2 Correct 27 ms 10512 KB Output is correct
3 Correct 25 ms 10028 KB Output is correct
4 Correct 26 ms 10508 KB Output is correct
5 Correct 1 ms 4440 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 4 ms 8660 KB Output is correct
5 Correct 5 ms 8796 KB Output is correct
6 Correct 4 ms 8796 KB Output is correct
7 Correct 4 ms 8424 KB Output is correct
8 Correct 4 ms 8796 KB Output is correct
9 Correct 3 ms 8840 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 4 ms 8660 KB Output is correct
5 Correct 5 ms 8796 KB Output is correct
6 Correct 4 ms 8796 KB Output is correct
7 Correct 4 ms 8424 KB Output is correct
8 Correct 4 ms 8796 KB Output is correct
9 Correct 3 ms 8840 KB Output is correct
10 Correct 25 ms 10388 KB Output is correct
11 Correct 26 ms 10768 KB Output is correct
12 Correct 25 ms 10020 KB Output is correct
13 Correct 34 ms 10524 KB Output is correct
14 Correct 26 ms 11028 KB Output is correct
15 Correct 25 ms 10508 KB Output is correct
16 Correct 27 ms 10296 KB Output is correct
17 Correct 25 ms 10268 KB Output is correct
18 Correct 26 ms 10872 KB Output is correct
19 Correct 24 ms 10328 KB Output is correct
20 Correct 27 ms 10712 KB Output is correct
21 Correct 25 ms 11020 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 4 ms 8660 KB Output is correct
5 Correct 5 ms 8796 KB Output is correct
6 Correct 4 ms 8796 KB Output is correct
7 Correct 4 ms 8424 KB Output is correct
8 Correct 4 ms 8796 KB Output is correct
9 Correct 3 ms 8840 KB Output is correct
10 Correct 4 ms 8280 KB Output is correct
11 Correct 6 ms 8792 KB Output is correct
12 Correct 4 ms 8284 KB Output is correct
13 Correct 5 ms 8796 KB Output is correct
14 Correct 5 ms 8796 KB Output is correct
15 Correct 3 ms 8924 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 10012 KB Output is correct
2 Correct 27 ms 10512 KB Output is correct
3 Correct 25 ms 10028 KB Output is correct
4 Correct 26 ms 10508 KB Output is correct
5 Correct 1 ms 4440 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 4 ms 8660 KB Output is correct
12 Correct 5 ms 8796 KB Output is correct
13 Correct 4 ms 8796 KB Output is correct
14 Correct 4 ms 8424 KB Output is correct
15 Correct 4 ms 8796 KB Output is correct
16 Correct 3 ms 8840 KB Output is correct
17 Correct 25 ms 10388 KB Output is correct
18 Correct 26 ms 10768 KB Output is correct
19 Correct 25 ms 10020 KB Output is correct
20 Correct 34 ms 10524 KB Output is correct
21 Correct 26 ms 11028 KB Output is correct
22 Correct 25 ms 10508 KB Output is correct
23 Correct 27 ms 10296 KB Output is correct
24 Correct 25 ms 10268 KB Output is correct
25 Correct 26 ms 10872 KB Output is correct
26 Correct 24 ms 10328 KB Output is correct
27 Correct 27 ms 10712 KB Output is correct
28 Correct 25 ms 11020 KB Output is correct
29 Correct 4 ms 8280 KB Output is correct
30 Correct 6 ms 8792 KB Output is correct
31 Correct 4 ms 8284 KB Output is correct
32 Correct 5 ms 8796 KB Output is correct
33 Correct 5 ms 8796 KB Output is correct
34 Correct 3 ms 8924 KB Output is correct
35 Correct 1 ms 4444 KB Output is correct
36 Correct 24 ms 10028 KB Output is correct
37 Correct 26 ms 10472 KB Output is correct
38 Correct 33 ms 10008 KB Output is correct
39 Correct 26 ms 10768 KB Output is correct
40 Correct 31 ms 10980 KB Output is correct
41 Correct 3 ms 9048 KB Output is correct
42 Correct 25 ms 10196 KB Output is correct
43 Correct 26 ms 10768 KB Output is correct
44 Correct 26 ms 11032 KB Output is correct
45 Correct 25 ms 10640 KB Output is correct
46 Correct 24 ms 11152 KB Output is correct
47 Correct 27 ms 10768 KB Output is correct