Submission #966782

# Submission time Handle Problem Language Result Execution time Memory
966782 2024-04-20T10:51:39 Z SuPythony Mutating DNA (IOI21_dna) C++17
56 / 100
33 ms 5588 KB
#include "dna.h"
#include <bits/stdc++.h>
using namespace std;

vector<int> pf(1e5+1,0);
vector<vector<int>> pf2(3, vector<int>(1e5+1,0));
vector<vector<int>> pf3(3, vector<int>(1e5+1,0));

void init(string a, string b) {
    for (int i=1; i<=a.size(); i++) {
        if (a[i-1]!=b[i-1]) {
            pf[i]=pf[i-1]+1;
        } else {
            pf[i]=pf[i-1];
        }
    }
    for (int i=1; i<=a.size(); i++) {
        if (a[i-1]=='A'&&a[i-1]!=b[i-1]) pf2[0][i]=pf2[0][i-1]+1;
        else pf2[0][i]=pf2[0][i-1];
        if (a[i-1]=='C'&&a[i-1]!=b[i-1]) pf2[1][i]=pf2[1][i-1]+1;
        else pf2[1][i]=pf2[1][i-1];
        if (a[i-1]=='T'&&a[i-1]!=b[i-1]) pf2[2][i]=pf2[2][i-1]+1;
        else pf2[2][i]=pf2[2][i-1];
    }
    for (int i=1; i<=a.size(); i++) {
        if (b[i-1]=='A'&&a[i-1]!=b[i-1]) pf3[0][i]=pf3[0][i-1]+1;
        else pf3[0][i]=pf3[0][i-1];
        if (b[i-1]=='C'&&a[i-1]!=b[i-1]) pf3[1][i]=pf3[1][i-1]+1;
        else pf3[1][i]=pf3[1][i-1];
        if (b[i-1]=='T'&&a[i-1]!=b[i-1]) pf3[2][i]=pf3[2][i-1]+1;
        else pf3[2][i]=pf3[2][i-1];
    }
}

int get_distance(int x, int y) {
    x++; y++;
    if ((pf2[0][y]-pf2[0][x-1])!=(pf3[0][y]-pf3[0][x-1])||(pf2[1][y]-pf2[1][x-1])!=(pf3[1][y]-pf3[1][x-1])||(pf2[2][y]-pf2[2][x-1])!=(pf3[2][y]-pf3[2][x-1])) return -1;
    int c=pf[y]-pf[x-1];
    return c/2+c%2;
}

Compilation message

dna.cpp: In function 'void init(std::string, std::string)':
dna.cpp:10:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   10 |     for (int i=1; i<=a.size(); i++) {
      |                   ~^~~~~~~~~~
dna.cpp:17:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   17 |     for (int i=1; i<=a.size(); i++) {
      |                   ~^~~~~~~~~~
dna.cpp:25:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   25 |     for (int i=1; i<=a.size(); i++) {
      |                   ~^~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 27 ms 5064 KB Output is correct
2 Correct 27 ms 5072 KB Output is correct
3 Correct 30 ms 5068 KB Output is correct
4 Correct 26 ms 5068 KB Output is correct
5 Correct 2 ms 3540 KB Output is correct
6 Correct 2 ms 3500 KB Output is correct
7 Correct 2 ms 3540 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 3540 KB Output is correct
2 Correct 2 ms 3540 KB Output is correct
3 Correct 2 ms 3540 KB Output is correct
4 Correct 5 ms 3796 KB Output is correct
5 Correct 5 ms 3868 KB Output is correct
6 Correct 5 ms 3796 KB Output is correct
7 Correct 5 ms 3796 KB Output is correct
8 Correct 5 ms 3796 KB Output is correct
9 Correct 3 ms 3796 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 3540 KB Output is correct
2 Correct 2 ms 3540 KB Output is correct
3 Correct 2 ms 3540 KB Output is correct
4 Correct 5 ms 3796 KB Output is correct
5 Correct 5 ms 3868 KB Output is correct
6 Correct 5 ms 3796 KB Output is correct
7 Correct 5 ms 3796 KB Output is correct
8 Correct 5 ms 3796 KB Output is correct
9 Correct 3 ms 3796 KB Output is correct
10 Correct 32 ms 5060 KB Output is correct
11 Correct 27 ms 5028 KB Output is correct
12 Correct 28 ms 5324 KB Output is correct
13 Correct 30 ms 5540 KB Output is correct
14 Correct 29 ms 5544 KB Output is correct
15 Correct 33 ms 5332 KB Output is correct
16 Correct 32 ms 5320 KB Output is correct
17 Correct 27 ms 5560 KB Output is correct
18 Correct 27 ms 5588 KB Output is correct
19 Correct 27 ms 5588 KB Output is correct
20 Correct 26 ms 5588 KB Output is correct
21 Correct 25 ms 5588 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 3540 KB Output is correct
2 Correct 2 ms 3540 KB Output is correct
3 Correct 2 ms 3540 KB Output is correct
4 Correct 5 ms 3796 KB Output is correct
5 Correct 5 ms 3868 KB Output is correct
6 Correct 5 ms 3796 KB Output is correct
7 Correct 5 ms 3796 KB Output is correct
8 Correct 5 ms 3796 KB Output is correct
9 Correct 3 ms 3796 KB Output is correct
10 Correct 5 ms 3792 KB Output is correct
11 Correct 5 ms 3796 KB Output is correct
12 Incorrect 5 ms 3796 KB Output isn't correct
13 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 27 ms 5064 KB Output is correct
2 Correct 27 ms 5072 KB Output is correct
3 Correct 30 ms 5068 KB Output is correct
4 Correct 26 ms 5068 KB Output is correct
5 Correct 2 ms 3540 KB Output is correct
6 Correct 2 ms 3500 KB Output is correct
7 Correct 2 ms 3540 KB Output is correct
8 Correct 2 ms 3540 KB Output is correct
9 Correct 2 ms 3540 KB Output is correct
10 Correct 2 ms 3540 KB Output is correct
11 Correct 5 ms 3796 KB Output is correct
12 Correct 5 ms 3868 KB Output is correct
13 Correct 5 ms 3796 KB Output is correct
14 Correct 5 ms 3796 KB Output is correct
15 Correct 5 ms 3796 KB Output is correct
16 Correct 3 ms 3796 KB Output is correct
17 Correct 32 ms 5060 KB Output is correct
18 Correct 27 ms 5028 KB Output is correct
19 Correct 28 ms 5324 KB Output is correct
20 Correct 30 ms 5540 KB Output is correct
21 Correct 29 ms 5544 KB Output is correct
22 Correct 33 ms 5332 KB Output is correct
23 Correct 32 ms 5320 KB Output is correct
24 Correct 27 ms 5560 KB Output is correct
25 Correct 27 ms 5588 KB Output is correct
26 Correct 27 ms 5588 KB Output is correct
27 Correct 26 ms 5588 KB Output is correct
28 Correct 25 ms 5588 KB Output is correct
29 Correct 5 ms 3792 KB Output is correct
30 Correct 5 ms 3796 KB Output is correct
31 Incorrect 5 ms 3796 KB Output isn't correct
32 Halted 0 ms 0 KB -