oj.uz

Submission #720864

# Submission time Handle Problem Language Result Execution time Memory
720864 2023-04-09T15:20:22 Z spike1236 Mutating DNA (IOI21_dna) C++17
100 / 100
 45 ms 7376 KB 
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
using namespace std;
// using namespace __gnu_pbds;
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define ll long long
#define ld long double
#define all(_v) _v.begin(), _v.end()
#define sz(_v) (int)_v.size()
#define pii pair <int, int>
#define pll pair <ll, ll>
#define veci vector <int>
#define vecll vector <ll>

// template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
// mt19937_64 rnd64(chrono::steady_clock::now().time_since_epoch().count());

const int dx[4] = {1, -1, 0, 0};
const int dy[4] = {0, 0, -1, 1};
const double PI = 3.141592653589793;
const double eps = 1e-9;
const int MOD1 = 1e9 + 7;
const int MOD2 = 998244353;

const int MAXN = 1e5 + 10;
int cnt[MAXN][3][3];

void init(string a, string b) {
    for(int i = 0; i < a.size(); ++i) {
        int x = 0 ,y = 0;
        if(a[i] == 'A') x = 0;
        if(a[i] == 'C') x = 1;
        if(a[i] == 'T') x = 2;
        if(b[i] == 'A') y = 0;
        if(b[i] == 'C') y = 1;
        if(b[i] == 'T') y = 2;
        cnt[i + 1][x][y]++;
        for(int j = 0; j < 3; ++j) for(int k = 0; k < 3; ++k) cnt[i + 1][j][k] += cnt[i][j][k];
    }
}

int get_distance(int x, int y) {
    ++x;
    ++y;
    int a[3][3];
    for(int i = 0; i < 3; ++i) for(int j = 0; j < 3; ++j) a[i][j] = cnt[y][i][j] - cnt[x - 1][i][j];
    for(int i = 0; i < 3; ++i) {
        if(a[i][0] + a[i][1] + a[i][2] != a[0][i] + a[1][i] + a[2][i]) return -1;
    }
    int res = 0;
    // cout << x << ' ' << y << ":\n";
    // for(int i = 0; i < 3; ++i) {
    //     for(int j = 0; j < 3; ++j) {
    //         cout << a[i][j] << ' ';
    //     }
    //     cout << '\n';
    // }
    for(int i = 0; i < 3; ++i) {
        for(int j = 0; j < 3; ++j) {
            if(i == j) continue;
            int x = min(a[i][j], a[j][i]);
            a[i][j] -= x;
            a[j][i] -= x;
            res += x;
        }
    }
    int cn = 0;
    for(int i = 0; i < 3; ++i) {
        for(int j = 0; j < 3; ++j) {
            if(i == j) continue;
            cn += a[i][j];
        }
    }
    // cout << "-----\n";
    // for(int i = 0; i < 3; ++i) {
    //     for(int j = 0; j < 3; ++j) {
    //         cout << a[i][j] << ' ';
    //     }
    //     cout << '\n';
    // }
    return res + 2 * cn / 3;
}

// void solve() {
//     init("ATACAT", "ACTATA");
//     cout << get_distance(1, 3) << '\n';
//     cout << get_distance(4, 5) << '\n';
//     cout << get_distance(3, 5) << '\n';
//     cout << get_distance(1, 5) << '\n';
// }

// int main() {
//     ios_base::sync_with_stdio(0);
//     cin.tie(0);
//     cout.tie(0);
//     int CNT_TESTS = 1;
//     // cin >> CNT_TESTS;
//     for(int NUMCASE = 1; NUMCASE <= CNT_TESTS; ++NUMCASE) {
//         solve();
//         if(NUMCASE != CNT_TESTS) cout << '\n';
//     }
//     return 0;
// }

Compilation message

dna.cpp: In function 'void init(std::string, std::string)':
dna.cpp:34:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |     for(int i = 0; i < a.size(); ++i) {
      |                    ~~^~~~~~~~~~

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 5600 KB Output is correct
2 Correct 34 ms 5644 KB Output is correct
3 Correct 36 ms 5276 KB Output is correct
4 Correct 35 ms 5644 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 3 ms 4308 KB Output is correct
5 Correct 4 ms 4308 KB Output is correct
6 Correct 4 ms 4308 KB Output is correct
7 Correct 3 ms 4052 KB Output is correct
8 Correct 3 ms 4308 KB Output is correct
9 Correct 3 ms 4308 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 3 ms 4308 KB Output is correct
5 Correct 4 ms 4308 KB Output is correct
6 Correct 4 ms 4308 KB Output is correct
7 Correct 3 ms 4052 KB Output is correct
8 Correct 3 ms 4308 KB Output is correct
9 Correct 3 ms 4308 KB Output is correct
10 Correct 34 ms 5632 KB Output is correct
11 Correct 35 ms 5636 KB Output is correct
12 Correct 35 ms 5748 KB Output is correct
13 Correct 42 ms 7012 KB Output is correct
14 Correct 37 ms 7212 KB Output is correct
15 Correct 33 ms 7160 KB Output is correct
16 Correct 34 ms 6828 KB Output is correct
17 Correct 45 ms 6932 KB Output is correct
18 Correct 35 ms 7056 KB Output is correct
19 Correct 33 ms 6800 KB Output is correct
20 Correct 33 ms 6872 KB Output is correct
21 Correct 35 ms 7148 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 3 ms 4308 KB Output is correct
5 Correct 4 ms 4308 KB Output is correct
6 Correct 4 ms 4308 KB Output is correct
7 Correct 3 ms 4052 KB Output is correct
8 Correct 3 ms 4308 KB Output is correct
9 Correct 3 ms 4308 KB Output is correct
10 Correct 4 ms 4052 KB Output is correct
11 Correct 4 ms 4308 KB Output is correct
12 Correct 4 ms 4124 KB Output is correct
13 Correct 4 ms 4308 KB Output is correct
14 Correct 4 ms 4308 KB Output is correct
15 Correct 4 ms 4308 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 5600 KB Output is correct
2 Correct 34 ms 5644 KB Output is correct
3 Correct 36 ms 5276 KB Output is correct
4 Correct 35 ms 5644 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 3 ms 4308 KB Output is correct
12 Correct 4 ms 4308 KB Output is correct
13 Correct 4 ms 4308 KB Output is correct
14 Correct 3 ms 4052 KB Output is correct
15 Correct 3 ms 4308 KB Output is correct
16 Correct 3 ms 4308 KB Output is correct
17 Correct 34 ms 5632 KB Output is correct
18 Correct 35 ms 5636 KB Output is correct
19 Correct 35 ms 5748 KB Output is correct
20 Correct 42 ms 7012 KB Output is correct
21 Correct 37 ms 7212 KB Output is correct
22 Correct 33 ms 7160 KB Output is correct
23 Correct 34 ms 6828 KB Output is correct
24 Correct 45 ms 6932 KB Output is correct
25 Correct 35 ms 7056 KB Output is correct
26 Correct 33 ms 6800 KB Output is correct
27 Correct 33 ms 6872 KB Output is correct
28 Correct 35 ms 7148 KB Output is correct
29 Correct 4 ms 4052 KB Output is correct
30 Correct 4 ms 4308 KB Output is correct
31 Correct 4 ms 4124 KB Output is correct
32 Correct 4 ms 4308 KB Output is correct
33 Correct 4 ms 4308 KB Output is correct
34 Correct 4 ms 4308 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 33 ms 6624 KB Output is correct
37 Correct 35 ms 7028 KB Output is correct
38 Correct 43 ms 7060 KB Output is correct
39 Correct 37 ms 7376 KB Output is correct
40 Correct 36 ms 7376 KB Output is correct
41 Correct 4 ms 4564 KB Output is correct
42 Correct 35 ms 7040 KB Output is correct
43 Correct 34 ms 7284 KB Output is correct
44 Correct 33 ms 7280 KB Output is correct
45 Correct 32 ms 7064 KB Output is correct
46 Correct 33 ms 7304 KB Output is correct
47 Correct 37 ms 7304 KB Output is correct