Submission #999578

# Submission time Handle Problem Language Result Execution time Memory
999578 2024-06-15T20:28:35 Z KasymK Mutating DNA (IOI21_dna) C++17
43 / 100
1500 ms 2412 KB
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
string s3, s4;

void init(string s, string s2){
    s3 = s, s4 = s2;
}

int get_distance(int x, int y){
    string a = "", b = "";
    for(int i = x; i <= y; ++i)
        a += s3[i], b += s4[i];
    // cout << a << " " << b << "\n";
    int n = (int)a.size();
    int sm = 0, sm2 = 0, sm3 = 0;
    for(int i = 0; i < n; ++i){
        if(a[i] == 'A')
            sm++;
        if(b[i] == 'A')
            sm--;
        if(a[i] == 'C')
            sm2++;
        if(b[i] == 'C')
            sm2--;
        if(a[i] == 'T')
            sm3++;
        if(b[i] == 'T')
            sm3--;
    }
    if(sm or sm2 or sm3)
        return -1;
    int answer = 0;
    for(int i = 0; i < n; ++i){
        if(a[i] == b[i])
            continue;
        for(int j = i+1; j < n; ++j)
            if(a[j] == b[i] and a[i] == b[j] and a[i] != a[j]){
                answer++;
                swap(a[i], a[j]);
            }
    }
    for(int i = 0; i < n; ++i){
        if(a[i] == b[i])
            continue;
        for(int j = i+1; j < n; ++j)
            if(a[j] == b[i] and a[i] != a[j]){
                answer++;
                swap(a[i], a[j]);
            }
    }
    return answer;
}
# Verdict Execution time Memory Grader output
1 Correct 21 ms 2396 KB Output is correct
2 Correct 20 ms 2396 KB Output is correct
3 Correct 21 ms 2392 KB Output is correct
4 Correct 21 ms 2392 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 344 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 1 ms 1116 KB Output is correct
5 Correct 1 ms 1116 KB Output is correct
6 Correct 1 ms 1136 KB Output is correct
7 Correct 58 ms 1116 KB Output is correct
8 Correct 55 ms 1112 KB Output is correct
9 Correct 13 ms 1116 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 1 ms 1116 KB Output is correct
5 Correct 1 ms 1116 KB Output is correct
6 Correct 1 ms 1136 KB Output is correct
7 Correct 58 ms 1116 KB Output is correct
8 Correct 55 ms 1112 KB Output is correct
9 Correct 13 ms 1116 KB Output is correct
10 Correct 22 ms 2396 KB Output is correct
11 Correct 22 ms 2412 KB Output is correct
12 Execution timed out 1559 ms 2360 KB Time limit exceeded
13 Halted 0 ms 0 KB -
# 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 1 ms 1116 KB Output is correct
5 Correct 1 ms 1116 KB Output is correct
6 Correct 1 ms 1136 KB Output is correct
7 Correct 58 ms 1116 KB Output is correct
8 Correct 55 ms 1112 KB Output is correct
9 Correct 13 ms 1116 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 1 ms 1116 KB Output is correct
12 Incorrect 1 ms 1116 KB Output isn't correct
13 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 21 ms 2396 KB Output is correct
2 Correct 20 ms 2396 KB Output is correct
3 Correct 21 ms 2392 KB Output is correct
4 Correct 21 ms 2392 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 344 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 1 ms 1116 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 1 ms 1136 KB Output is correct
14 Correct 58 ms 1116 KB Output is correct
15 Correct 55 ms 1112 KB Output is correct
16 Correct 13 ms 1116 KB Output is correct
17 Correct 22 ms 2396 KB Output is correct
18 Correct 22 ms 2412 KB Output is correct
19 Execution timed out 1559 ms 2360 KB Time limit exceeded
20 Halted 0 ms 0 KB -