oj.uz

Submission #966368

# Submission time Handle Problem Language Result Execution time Memory
966368 2024-04-19T18:30:48 Z KasymK Mutating DNA (IOI21_dna) C++17
56 / 100
 27 ms 4956 KB 
// #include "dna.h"
#include "bits/stdc++.h"
 
using namespace std;
 
string s, s2;

int n;

const int N = 1e5 + 3;

int den_daller[N], A_koplulik_s[N], T_koplulik_s[N], A_koplulik_s2[N], T_koplulik_s2[N];

void init(string a, string b){
    s = a, s2 = b;
    n = (int)s.size();
    for(int i = 0; i < n; ++i){
        den_daller[i + 1] = den_daller[i] + (s[i] != s2[i]);
        A_koplulik_s[i + 1] = A_koplulik_s[i] + (s[i] == 'A');
        T_koplulik_s[i + 1] = T_koplulik_s[i] + (s[i] == 'T');
        A_koplulik_s2[i + 1] = A_koplulik_s2[i] + (s2[i] == 'A');
        T_koplulik_s2[i + 1] = T_koplulik_s2[i] + (s2[i] == 'T');
    }
}
 
int get_distance(int x, int y){
    if(y - x <= 2){
        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;
    }
    int A_diff = A_koplulik_s[y + 1] - A_koplulik_s[x], A_diff2 = A_koplulik_s2[y + 1] - A_koplulik_s2[x];
    int T_diff = T_koplulik_s[y + 1] - T_koplulik_s[x], T_diff2 = T_koplulik_s2[y + 1] - T_koplulik_s2[x];
    A_diff -= A_diff2, T_diff -= T_diff2;
    A_diff -= T_diff;
    if(A_diff != 0)
        return -1;
    int ans = (den_daller[y + 1] - den_daller[x]) >> 1;
    
    return ans;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 4444 KB Output is correct
2 Correct 24 ms 4444 KB Output is correct
3 Correct 26 ms 4216 KB Output is correct
4 Correct 24 ms 4440 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 2 ms 2908 KB Output is correct
5 Correct 2 ms 3164 KB Output is correct
6 Correct 2 ms 3164 KB Output is correct
7 Correct 2 ms 2908 KB Output is correct
8 Correct 2 ms 3164 KB Output is correct
9 Correct 2 ms 3164 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 2 ms 2908 KB Output is correct
5 Correct 2 ms 3164 KB Output is correct
6 Correct 2 ms 3164 KB Output is correct
7 Correct 2 ms 2908 KB Output is correct
8 Correct 2 ms 3164 KB Output is correct
9 Correct 2 ms 3164 KB Output is correct
10 Correct 25 ms 4436 KB Output is correct
11 Correct 26 ms 4448 KB Output is correct
12 Correct 26 ms 4688 KB Output is correct
13 Correct 25 ms 4692 KB Output is correct
14 Correct 25 ms 4696 KB Output is correct
15 Correct 27 ms 4656 KB Output is correct
16 Correct 25 ms 4856 KB Output is correct
17 Correct 24 ms 4692 KB Output is correct
18 Correct 26 ms 4700 KB Output is correct
19 Correct 23 ms 4696 KB Output is correct
20 Correct 23 ms 4700 KB Output is correct
21 Correct 24 ms 4956 KB Output is correct

Subtask #4
0.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 2 ms 2908 KB Output is correct
5 Correct 2 ms 3164 KB Output is correct
6 Correct 2 ms 3164 KB Output is correct
7 Correct 2 ms 2908 KB Output is correct
8 Correct 2 ms 3164 KB Output is correct
9 Correct 2 ms 3164 KB Output is correct
10 Correct 2 ms 2904 KB Output is correct
11 Correct 3 ms 3164 KB Output is correct
12 Incorrect 2 ms 2908 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 24 ms 4444 KB Output is correct
2 Correct 24 ms 4444 KB Output is correct
3 Correct 26 ms 4216 KB Output is correct
4 Correct 24 ms 4440 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 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 2 ms 2908 KB Output is correct
12 Correct 2 ms 3164 KB Output is correct
13 Correct 2 ms 3164 KB Output is correct
14 Correct 2 ms 2908 KB Output is correct
15 Correct 2 ms 3164 KB Output is correct
16 Correct 2 ms 3164 KB Output is correct
17 Correct 25 ms 4436 KB Output is correct
18 Correct 26 ms 4448 KB Output is correct
19 Correct 26 ms 4688 KB Output is correct
20 Correct 25 ms 4692 KB Output is correct
21 Correct 25 ms 4696 KB Output is correct
22 Correct 27 ms 4656 KB Output is correct
23 Correct 25 ms 4856 KB Output is correct
24 Correct 24 ms 4692 KB Output is correct
25 Correct 26 ms 4700 KB Output is correct
26 Correct 23 ms 4696 KB Output is correct
27 Correct 23 ms 4700 KB Output is correct
28 Correct 24 ms 4956 KB Output is correct
29 Correct 2 ms 2904 KB Output is correct
30 Correct 3 ms 3164 KB Output is correct
31 Incorrect 2 ms 2908 KB Output isn't correct
32 Halted 0 ms 0 KB -