oj.uz

Submission #964652

# Submission time Handle Problem Language Result Execution time Memory
964652 2024-04-17T09:25:00 Z KasymK Mutating DNA (IOI21_dna) C++17
21 / 100
 29 ms 3260 KB 
#include "dna.h"
#include "bits/stdc++.h"

using namespace std;

string s, s2;
int n;

void init(string a, string b){
    s = a;
    s2 = b;
    n = (int)s.size();
}

int get_distance(int x, int y){
    int s_a = 0, s_c = 0, s_t = 0;
    int s2_a = 0, s2_c = 0, s2_t = 0;
    for(int i = x; i <= y; ++i){
        s_a += (s[i] == 'A');
        s_c += (s[i] == 'C');
        s_t += (s[i] == 'T');
        s2_a += (s2[i] == 'A');
        s2_c += (s2[i] == 'C');
        s2_t += (s2[i] == 'T');
    }
    if(s_a != s2_a or s_c != s2_c or s_t != s2_t)
        return -1;
    int ok = 1;
    for(int i = x; i <= y; ++i)
        ok &= (s[i] == s2[i]);
    if(ok)
        return 0;
    int ans = 0;
    for(int i = x; i <= y; ++i)
        ans += (s[i] != s2[i]);
    ans--;
    return ans;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 2392 KB Output is correct
2 Correct 29 ms 3260 KB Output is correct
3 Correct 23 ms 2908 KB Output is correct
4 Correct 26 ms 3144 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct

Subtask #2
0.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 1112 KB Output is correct
5 Correct 2 ms 1200 KB Output is correct
6 Incorrect 1 ms 1116 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 1112 KB Output is correct
5 Correct 2 ms 1200 KB Output is correct
6 Incorrect 1 ms 1116 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 1112 KB Output is correct
5 Correct 2 ms 1200 KB Output is correct
6 Incorrect 1 ms 1116 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #5
0.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 2392 KB Output is correct
2 Correct 29 ms 3260 KB Output is correct
3 Correct 23 ms 2908 KB Output is correct
4 Correct 26 ms 3144 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 2 ms 1112 KB Output is correct
12 Correct 2 ms 1200 KB Output is correct
13 Incorrect 1 ms 1116 KB Output isn't correct
14 Halted 0 ms 0 KB -