oj.uz

Submission #559603

# Submission time Handle Problem Language Result Execution time Memory
559603 2022-05-10T09:11:10 Z nghiass001 Mutating DNA (IOI21_dna) C++17
100 / 100
 53 ms 7412 KB 
#include <bits/stdc++.h>
#define FOR(i,l,r) for(int i=(l); i<=(r); ++i)
#define REP(i,l,r) for(int i=(l); i<(r); ++i)
#define FORD(i,r,l) for(int i=(r); i>=(l); --i)
#define REPD(i,r,l) for(int i=(r)-1; i>=(l); --i)
using namespace std;
const int N = 1e5 + 5;
int M[256];
int pre[N][3][3];

void init(string a, string b) {
    M['A'] = 0; M['T'] = 1; M['C'] = 2;
    REP(i, 0, a.length()) {
        REP(j, 0, 3) REP(w, 0, 3) pre[i + 1][j][w] = pre[i][j][w];
        if (a[i] != b[i]) ++pre[i + 1][M[a[i]]][M[b[i]]];
    }
}

int choice[3][3];
int num[3];

int get_distance(int x, int y) {
    ++y;
    REP(i, 0, 3) num[i] = 0;
    REP(i, 0, 3) REP(j, 0, 3) {
        choice[i][j] = pre[y][i][j] - pre[x][i][j];
        num[i] += choice[i][j];
        num[j] -= choice[i][j];
    }
    REP(i, 0, 3) if (num[i]) return -1;
    int res = 0, m1 = 1e5, m2 = 1e5;
    REP(i, 0, 3) REP(j, i + 1, 3) {
        int tmp = min(choice[i][j], choice[j][i]);
        res += tmp;
        m2 = min(m2, max(choice[i][j], choice[j][i]) - tmp);
        if (m2 < m1) swap(m1, m2);
    }
    return res + m1 + m2;
}

Compilation message

dna.cpp: In function 'void init(std::string, std::string)':
dna.cpp:3:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    3 | #define REP(i,l,r) for(int i=(l); i<(r); ++i)
      |                                    ^
dna.cpp:13:5: note: in expansion of macro 'REP'
   13 |     REP(i, 0, a.length()) {
      |     ^~~
dna.cpp:15:46: warning: array subscript has type 'char' [-Wchar-subscripts]
   15 |         if (a[i] != b[i]) ++pre[i + 1][M[a[i]]][M[b[i]]];
      |                                              ^
dna.cpp:15:55: warning: array subscript has type 'char' [-Wchar-subscripts]
   15 |         if (a[i] != b[i]) ++pre[i + 1][M[a[i]]][M[b[i]]];
      |                                                       ^

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 6924 KB Output is correct
2 Correct 33 ms 7020 KB Output is correct
3 Correct 34 ms 6628 KB Output is correct
4 Correct 39 ms 7032 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 308 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 304 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 4 ms 4544 KB Output is correct
5 Correct 5 ms 4540 KB Output is correct
6 Correct 5 ms 4564 KB Output is correct
7 Correct 5 ms 4308 KB Output is correct
8 Correct 4 ms 4544 KB Output is correct
9 Correct 4 ms 4520 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 304 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 4 ms 4544 KB Output is correct
5 Correct 5 ms 4540 KB Output is correct
6 Correct 5 ms 4564 KB Output is correct
7 Correct 5 ms 4308 KB Output is correct
8 Correct 4 ms 4544 KB Output is correct
9 Correct 4 ms 4520 KB Output is correct
10 Correct 39 ms 6888 KB Output is correct
11 Correct 52 ms 7048 KB Output is correct
12 Correct 40 ms 7016 KB Output is correct
13 Correct 38 ms 7188 KB Output is correct
14 Correct 41 ms 7292 KB Output is correct
15 Correct 52 ms 7264 KB Output is correct
16 Correct 53 ms 6988 KB Output is correct
17 Correct 44 ms 7116 KB Output is correct
18 Correct 35 ms 7288 KB Output is correct
19 Correct 30 ms 6960 KB Output is correct
20 Correct 41 ms 7156 KB Output is correct
21 Correct 35 ms 7280 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 304 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 4 ms 4544 KB Output is correct
5 Correct 5 ms 4540 KB Output is correct
6 Correct 5 ms 4564 KB Output is correct
7 Correct 5 ms 4308 KB Output is correct
8 Correct 4 ms 4544 KB Output is correct
9 Correct 4 ms 4520 KB Output is correct
10 Correct 4 ms 4180 KB Output is correct
11 Correct 5 ms 4520 KB Output is correct
12 Correct 4 ms 4288 KB Output is correct
13 Correct 4 ms 4564 KB Output is correct
14 Correct 4 ms 4564 KB Output is correct
15 Correct 4 ms 4576 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 6924 KB Output is correct
2 Correct 33 ms 7020 KB Output is correct
3 Correct 34 ms 6628 KB Output is correct
4 Correct 39 ms 7032 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 308 KB Output is correct
8 Correct 1 ms 304 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 4 ms 4544 KB Output is correct
12 Correct 5 ms 4540 KB Output is correct
13 Correct 5 ms 4564 KB Output is correct
14 Correct 5 ms 4308 KB Output is correct
15 Correct 4 ms 4544 KB Output is correct
16 Correct 4 ms 4520 KB Output is correct
17 Correct 39 ms 6888 KB Output is correct
18 Correct 52 ms 7048 KB Output is correct
19 Correct 40 ms 7016 KB Output is correct
20 Correct 38 ms 7188 KB Output is correct
21 Correct 41 ms 7292 KB Output is correct
22 Correct 52 ms 7264 KB Output is correct
23 Correct 53 ms 6988 KB Output is correct
24 Correct 44 ms 7116 KB Output is correct
25 Correct 35 ms 7288 KB Output is correct
26 Correct 30 ms 6960 KB Output is correct
27 Correct 41 ms 7156 KB Output is correct
28 Correct 35 ms 7280 KB Output is correct
29 Correct 4 ms 4180 KB Output is correct
30 Correct 5 ms 4520 KB Output is correct
31 Correct 4 ms 4288 KB Output is correct
32 Correct 4 ms 4564 KB Output is correct
33 Correct 4 ms 4564 KB Output is correct
34 Correct 4 ms 4576 KB Output is correct
35 Correct 1 ms 308 KB Output is correct
36 Correct 41 ms 6672 KB Output is correct
37 Correct 45 ms 7020 KB Output is correct
38 Correct 48 ms 7148 KB Output is correct
39 Correct 41 ms 7412 KB Output is correct
40 Correct 39 ms 7408 KB Output is correct
41 Correct 4 ms 4608 KB Output is correct
42 Correct 39 ms 7004 KB Output is correct
43 Correct 35 ms 7292 KB Output is correct
44 Correct 36 ms 7288 KB Output is correct
45 Correct 47 ms 7012 KB Output is correct
46 Correct 34 ms 7288 KB Output is correct
47 Correct 31 ms 7288 KB Output is correct