oj.uz

Submission #966781

# Submission time Handle Problem Language Result Execution time Memory
966781 2024-04-20T10:45:36 Z SuPythony Mutating DNA (IOI21_dna) C++17
56 / 100
 28 ms 5584 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') pf2[0][i]=pf2[0][i-1]+1;
        else pf2[0][i]=pf2[0][i-1];
        if (a[i-1]=='C') pf2[1][i]=pf2[1][i-1]+1;
        else pf2[1][i]=pf2[1][i-1];
        if (a[i-1]=='T') 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') pf3[0][i]=pf3[0][i-1]+1;
        else pf3[0][i]=pf3[0][i-1];
        if (b[i-1]=='C') pf3[1][i]=pf3[1][i-1]+1;
        else pf3[1][i]=pf3[1][i-1];
        if (b[i-1]=='T') 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++) {
      |                   ~^~~~~~~~~~

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 5076 KB Output is correct
2 Correct 25 ms 5064 KB Output is correct
3 Correct 27 ms 5040 KB Output is correct
4 Correct 25 ms 5064 KB Output is correct
5 Correct 2 ms 3540 KB Output is correct
6 Correct 2 ms 3540 KB Output is correct
7 Correct 2 ms 3440 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3536 KB Output is correct
2 Correct 2 ms 3540 KB Output is correct
3 Correct 2 ms 3536 KB Output is correct
4 Correct 5 ms 3796 KB Output is correct
5 Correct 4 ms 3796 KB Output is correct
6 Correct 4 ms 3796 KB Output is correct
7 Correct 4 ms 3796 KB Output is correct
8 Correct 4 ms 3796 KB Output is correct
9 Correct 3 ms 3796 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3536 KB Output is correct
2 Correct 2 ms 3540 KB Output is correct
3 Correct 2 ms 3536 KB Output is correct
4 Correct 5 ms 3796 KB Output is correct
5 Correct 4 ms 3796 KB Output is correct
6 Correct 4 ms 3796 KB Output is correct
7 Correct 4 ms 3796 KB Output is correct
8 Correct 4 ms 3796 KB Output is correct
9 Correct 3 ms 3796 KB Output is correct
10 Correct 25 ms 5072 KB Output is correct
11 Correct 24 ms 5076 KB Output is correct
12 Correct 26 ms 5340 KB Output is correct
13 Correct 27 ms 5324 KB Output is correct
14 Correct 27 ms 5320 KB Output is correct
15 Correct 25 ms 5320 KB Output is correct
16 Correct 25 ms 5324 KB Output is correct
17 Correct 28 ms 5328 KB Output is correct
18 Correct 26 ms 5584 KB Output is correct
19 Correct 26 ms 5584 KB Output is correct
20 Correct 24 ms 5580 KB Output is correct
21 Correct 24 ms 5576 KB Output is correct

Subtask #4
0.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3536 KB Output is correct
2 Correct 2 ms 3540 KB Output is correct
3 Correct 2 ms 3536 KB Output is correct
4 Correct 5 ms 3796 KB Output is correct
5 Correct 4 ms 3796 KB Output is correct
6 Correct 4 ms 3796 KB Output is correct
7 Correct 4 ms 3796 KB Output is correct
8 Correct 4 ms 3796 KB Output is correct
9 Correct 3 ms 3796 KB Output is correct
10 Correct 4 ms 3796 KB Output is correct
11 Correct 4 ms 3616 KB Output is correct
12 Incorrect 4 ms 3796 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #5
0.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 5076 KB Output is correct
2 Correct 25 ms 5064 KB Output is correct
3 Correct 27 ms 5040 KB Output is correct
4 Correct 25 ms 5064 KB Output is correct
5 Correct 2 ms 3540 KB Output is correct
6 Correct 2 ms 3540 KB Output is correct
7 Correct 2 ms 3440 KB Output is correct
8 Correct 2 ms 3536 KB Output is correct
9 Correct 2 ms 3540 KB Output is correct
10 Correct 2 ms 3536 KB Output is correct
11 Correct 5 ms 3796 KB Output is correct
12 Correct 4 ms 3796 KB Output is correct
13 Correct 4 ms 3796 KB Output is correct
14 Correct 4 ms 3796 KB Output is correct
15 Correct 4 ms 3796 KB Output is correct
16 Correct 3 ms 3796 KB Output is correct
17 Correct 25 ms 5072 KB Output is correct
18 Correct 24 ms 5076 KB Output is correct
19 Correct 26 ms 5340 KB Output is correct
20 Correct 27 ms 5324 KB Output is correct
21 Correct 27 ms 5320 KB Output is correct
22 Correct 25 ms 5320 KB Output is correct
23 Correct 25 ms 5324 KB Output is correct
24 Correct 28 ms 5328 KB Output is correct
25 Correct 26 ms 5584 KB Output is correct
26 Correct 26 ms 5584 KB Output is correct
27 Correct 24 ms 5580 KB Output is correct
28 Correct 24 ms 5576 KB Output is correct
29 Correct 4 ms 3796 KB Output is correct
30 Correct 4 ms 3616 KB Output is correct
31 Incorrect 4 ms 3796 KB Output isn't correct
32 Halted 0 ms 0 KB -