oj.uz

답안 #828356

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
828356 2023-08-17T08:51:13 Z kamelfanger83 DNA 돌연변이 (IOI21_dna) C++17
100 / 100
 38 ms 9152 KB 
#include <iostream>
#include <vector>
#include <string>

using namespace std;

vector<int> as[6], bs[6];

void init(string a, string b){
    for (int i = 0; i < 6; ++i) {
        as[i].assign(a.size(), 0);
        bs[i].assign(1, 0);
    }
    for (int i = 0; i < a.size(); ++i) {
        if (a[i] == b[i]) continue;
        int f = 0, t = 0;
        if (a[i] == 'C') f = 1;
        if (b[i] == 'C') t = 1;
        if (a[i] == 'T') f = 2;
        if (b[i] == 'T') t = 2;
        if (f < t) t--;
        as[f * 2 + t][i] = 1;
    }
    for (int i = 0; i < a.size(); ++i) {
        for (int j = 0; j < 6; ++j) {
            bs[j].push_back(bs[j].back() + as[j][i]);
        }
    }
}

int get_distance(int x, int y){
    int graph [6];
    for (int i = 0; i < 6; ++i) {
        graph[i] = bs[i][y + 1] - bs[i][x];
    }
    if (graph[0] + graph[1] != graph[2] + graph[4]) return -1;
    if (graph[2] + graph[3] != graph[0] + graph[5]) return -1;
    if (graph[4] + graph[5] != graph[1] + graph[3]) return -1;
    int ans = 0;
    int AC = min(graph[0], graph[2]);
    ans += AC;
    graph[0] -= AC; graph[2] -= AC;
    int CT = min(graph[3], graph[5]);
    ans += CT;
    graph [3] -= CT; graph[5] -= CT;
    int TA = min(graph[4], graph[1]);
    ans += TA;
    graph[4] -= TA; graph[1] -= TA;
    if (graph[0]){
        int val = graph[0];
        ans += 2 * val;
    }
    else if (graph[1]){
        int val = graph[1];
        ans += 2 * val;
    }
    return ans;
}

Compilation message

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

Subtask #1
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 7348 KB Output is correct
2 Correct 29 ms 7464 KB Output is correct
3 Correct 28 ms 6920 KB Output is correct
4 Correct 33 ms 8740 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 212 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 7 ms 6060 KB Output is correct
5 Correct 7 ms 6016 KB Output is correct
6 Correct 7 ms 6040 KB Output is correct
7 Correct 6 ms 5684 KB Output is correct
8 Correct 7 ms 6068 KB Output is correct
9 Correct 7 ms 6032 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 7 ms 6060 KB Output is correct
5 Correct 7 ms 6016 KB Output is correct
6 Correct 7 ms 6040 KB Output is correct
7 Correct 6 ms 5684 KB Output is correct
8 Correct 7 ms 6068 KB Output is correct
9 Correct 7 ms 6032 KB Output is correct
10 Correct 30 ms 7308 KB Output is correct
11 Correct 30 ms 7428 KB Output is correct
12 Correct 30 ms 7300 KB Output is correct
13 Correct 35 ms 7508 KB Output is correct
14 Correct 33 ms 7820 KB Output is correct
15 Correct 31 ms 7716 KB Output is correct
16 Correct 30 ms 7428 KB Output is correct
17 Correct 30 ms 7576 KB Output is correct
18 Correct 34 ms 7700 KB Output is correct
19 Correct 30 ms 7480 KB Output is correct
20 Correct 30 ms 7556 KB Output is correct
21 Correct 29 ms 7852 KB Output is correct

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 7 ms 6060 KB Output is correct
5 Correct 7 ms 6016 KB Output is correct
6 Correct 7 ms 6040 KB Output is correct
7 Correct 6 ms 5684 KB Output is correct
8 Correct 7 ms 6068 KB Output is correct
9 Correct 7 ms 6032 KB Output is correct
10 Correct 7 ms 5556 KB Output is correct
11 Correct 8 ms 6292 KB Output is correct
12 Correct 7 ms 5940 KB Output is correct
13 Correct 7 ms 6260 KB Output is correct
14 Correct 7 ms 6196 KB Output is correct
15 Correct 8 ms 6296 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 7348 KB Output is correct
2 Correct 29 ms 7464 KB Output is correct
3 Correct 28 ms 6920 KB Output is correct
4 Correct 33 ms 8740 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 212 KB Output is correct
8 Correct 1 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 7 ms 6060 KB Output is correct
12 Correct 7 ms 6016 KB Output is correct
13 Correct 7 ms 6040 KB Output is correct
14 Correct 6 ms 5684 KB Output is correct
15 Correct 7 ms 6068 KB Output is correct
16 Correct 7 ms 6032 KB Output is correct
17 Correct 30 ms 7308 KB Output is correct
18 Correct 30 ms 7428 KB Output is correct
19 Correct 30 ms 7300 KB Output is correct
20 Correct 35 ms 7508 KB Output is correct
21 Correct 33 ms 7820 KB Output is correct
22 Correct 31 ms 7716 KB Output is correct
23 Correct 30 ms 7428 KB Output is correct
24 Correct 30 ms 7576 KB Output is correct
25 Correct 34 ms 7700 KB Output is correct
26 Correct 30 ms 7480 KB Output is correct
27 Correct 30 ms 7556 KB Output is correct
28 Correct 29 ms 7852 KB Output is correct
29 Correct 7 ms 5556 KB Output is correct
30 Correct 8 ms 6292 KB Output is correct
31 Correct 7 ms 5940 KB Output is correct
32 Correct 7 ms 6260 KB Output is correct
33 Correct 7 ms 6196 KB Output is correct
34 Correct 8 ms 6296 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 34 ms 8284 KB Output is correct
37 Correct 30 ms 8724 KB Output is correct
38 Correct 31 ms 8828 KB Output is correct
39 Correct 32 ms 9132 KB Output is correct
40 Correct 31 ms 9152 KB Output is correct
41 Correct 8 ms 6380 KB Output is correct
42 Correct 31 ms 8656 KB Output is correct
43 Correct 34 ms 9028 KB Output is correct
44 Correct 31 ms 9092 KB Output is correct
45 Correct 38 ms 8700 KB Output is correct
46 Correct 30 ms 9004 KB Output is correct
47 Correct 30 ms 9004 KB Output is correct