Submission #958175

# Submission time Handle Problem Language Result Execution time Memory
958175 2024-04-05T05:24:10 Z irmuun Mutating DNA (IOI21_dna) C++17
100 / 100
30 ms 7320 KB
#include<bits/stdc++.h>
#include "dna.h"
 
using namespace std;
 
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()

const int N=1e5+5;
int sum[N][3][3];

int num(char c){
    if(c=='A') return 0;
    if(c=='T') return 1;
    return 2;
}

void init(string a,string b){
    for(int i=0;i<a.size();i++){
        int x=num(a[i]),y=num(b[i]);
        for(int j=0;j<3;j++){
            for(int k=0;k<3;k++){
                sum[i+1][j][k]=sum[i][j][k];
            }
        }
        sum[i+1][x][y]++;
    }
}

int get_distance(int x,int y){
    int a[3][3],ans=0;
    y++;
    for(int i=0;i<3;i++){
        for(int j=0;j<3;j++){
            a[i][j]=sum[y][i][j]-sum[x][i][j];
        }
    }
    for(int i=0;i<3;i++){
        for(int j=i+1;j<3;j++){
            int mn=min(a[i][j],a[j][i]);
            ans+=mn;
            a[i][j]-=mn;
            a[j][i]-=mn;
        }
    }
    if(min({a[0][1],a[1][2],a[2][0]})!=max({a[0][1],a[1][2],a[2][0]})){
        return -1;
    }
    if(min({a[0][2],a[2][1],a[1][0]})!=max({a[0][2],a[2][1],a[1][0]})){
        return -1;
    }
    ans+=min({a[0][1],a[1][2],a[2][0]})*2;
    ans+=min({a[0][2],a[2][1],a[1][0]})*2;
    return ans;
}

Compilation message

dna.cpp: In function 'void init(std::string, std::string)':
dna.cpp:23:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |     for(int i=0;i<a.size();i++){
      |                 ~^~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 26 ms 5964 KB Output is correct
2 Correct 26 ms 6556 KB Output is correct
3 Correct 25 ms 5968 KB Output is correct
4 Correct 28 ms 6320 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 3 ms 4508 KB Output is correct
5 Correct 3 ms 4444 KB Output is correct
6 Correct 3 ms 4444 KB Output is correct
7 Correct 3 ms 4188 KB Output is correct
8 Correct 3 ms 4444 KB Output is correct
9 Correct 2 ms 4484 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 3 ms 4508 KB Output is correct
5 Correct 3 ms 4444 KB Output is correct
6 Correct 3 ms 4444 KB Output is correct
7 Correct 3 ms 4188 KB Output is correct
8 Correct 3 ms 4444 KB Output is correct
9 Correct 2 ms 4484 KB Output is correct
10 Correct 27 ms 6420 KB Output is correct
11 Correct 26 ms 6512 KB Output is correct
12 Correct 27 ms 6776 KB Output is correct
13 Correct 27 ms 6792 KB Output is correct
14 Correct 27 ms 6924 KB Output is correct
15 Correct 26 ms 6040 KB Output is correct
16 Correct 27 ms 6684 KB Output is correct
17 Correct 28 ms 6332 KB Output is correct
18 Correct 27 ms 6924 KB Output is correct
19 Correct 25 ms 7056 KB Output is correct
20 Correct 26 ms 6712 KB Output is correct
21 Correct 25 ms 6936 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 3 ms 4508 KB Output is correct
5 Correct 3 ms 4444 KB Output is correct
6 Correct 3 ms 4444 KB Output is correct
7 Correct 3 ms 4188 KB Output is correct
8 Correct 3 ms 4444 KB Output is correct
9 Correct 2 ms 4484 KB Output is correct
10 Correct 3 ms 4184 KB Output is correct
11 Correct 3 ms 4444 KB Output is correct
12 Correct 3 ms 4440 KB Output is correct
13 Correct 3 ms 4444 KB Output is correct
14 Correct 3 ms 4444 KB Output is correct
15 Correct 3 ms 4700 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 26 ms 5964 KB Output is correct
2 Correct 26 ms 6556 KB Output is correct
3 Correct 25 ms 5968 KB Output is correct
4 Correct 28 ms 6320 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 3 ms 4508 KB Output is correct
12 Correct 3 ms 4444 KB Output is correct
13 Correct 3 ms 4444 KB Output is correct
14 Correct 3 ms 4188 KB Output is correct
15 Correct 3 ms 4444 KB Output is correct
16 Correct 2 ms 4484 KB Output is correct
17 Correct 27 ms 6420 KB Output is correct
18 Correct 26 ms 6512 KB Output is correct
19 Correct 27 ms 6776 KB Output is correct
20 Correct 27 ms 6792 KB Output is correct
21 Correct 27 ms 6924 KB Output is correct
22 Correct 26 ms 6040 KB Output is correct
23 Correct 27 ms 6684 KB Output is correct
24 Correct 28 ms 6332 KB Output is correct
25 Correct 27 ms 6924 KB Output is correct
26 Correct 25 ms 7056 KB Output is correct
27 Correct 26 ms 6712 KB Output is correct
28 Correct 25 ms 6936 KB Output is correct
29 Correct 3 ms 4184 KB Output is correct
30 Correct 3 ms 4444 KB Output is correct
31 Correct 3 ms 4440 KB Output is correct
32 Correct 3 ms 4444 KB Output is correct
33 Correct 3 ms 4444 KB Output is correct
34 Correct 3 ms 4700 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 25 ms 6428 KB Output is correct
37 Correct 27 ms 6824 KB Output is correct
38 Correct 27 ms 6680 KB Output is correct
39 Correct 27 ms 6672 KB Output is correct
40 Correct 26 ms 7180 KB Output is correct
41 Correct 2 ms 4700 KB Output is correct
42 Correct 29 ms 6860 KB Output is correct
43 Correct 27 ms 7008 KB Output is correct
44 Correct 27 ms 7184 KB Output is correct
45 Correct 26 ms 6772 KB Output is correct
46 Correct 30 ms 7320 KB Output is correct
47 Correct 26 ms 6924 KB Output is correct