oj.uz

답안 #705505

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
705505 2023-03-04T14:27:02 Z jakobrs DNA 돌연변이 (IOI21_dna) C++17
100 / 100
 37 ms 4668 KB 
#include <iostream>
#include <vector>

struct Count {
  int at, ca, tc;
  int qw;

  Count() : at(0), ca(0), tc(0), qw(0) {}

  inline Count operator-(Count rhs) const {
    Count result = *this;
    result.at -= rhs.at;
    result.ca -= rhs.ca;
    result.tc -= rhs.tc;
    result.qw -= rhs.qw;
    return result;
  }
};

std::vector<Count> prefixes;

void init(std::string a, std::string b) {
  prefixes.reserve(a.size() + 1);
  Count count;
  prefixes.push_back(count);
  for (int i = 0; i < a.size(); i++) {
    if (a[i] == 'A' && b[i] == 'T') count.at += 1;
    if (a[i] == 'T' && b[i] == 'A') count.at -= 1;
    if (a[i] == 'C' && b[i] == 'A') count.ca += 1;
    if (a[i] == 'A' && b[i] == 'C') count.ca -= 1;
    if (a[i] == 'T' && b[i] == 'C') count.tc += 1;
    if (a[i] == 'C' && b[i] == 'T') count.tc -= 1;
    if (a[i] != b[i]) count.qw += 1;
    prefixes.push_back(count);
  }
}

int get_distance(int x, int y) {
  y += 1;

  Count count = prefixes[y] - prefixes[x];

  if (!(count.at == count.ca && count.ca == count.tc)) return -1;

  return (count.qw + std::abs(count.at)) / 2;
}

Compilation message

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

Subtask #1
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 4236 KB Output is correct
2 Correct 30 ms 4260 KB Output is correct
3 Correct 33 ms 4124 KB Output is correct
4 Correct 33 ms 4260 KB Output is correct
5 Correct 1 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 4 ms 2576 KB Output is correct
5 Correct 4 ms 2584 KB Output is correct
6 Correct 4 ms 2564 KB Output is correct
7 Correct 4 ms 2356 KB Output is correct
8 Correct 3 ms 2616 KB Output is correct
9 Correct 3 ms 2580 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 4 ms 2576 KB Output is correct
5 Correct 4 ms 2584 KB Output is correct
6 Correct 4 ms 2564 KB Output is correct
7 Correct 4 ms 2356 KB Output is correct
8 Correct 3 ms 2616 KB Output is correct
9 Correct 3 ms 2580 KB Output is correct
10 Correct 33 ms 4236 KB Output is correct
11 Correct 32 ms 4188 KB Output is correct
12 Correct 29 ms 4476 KB Output is correct
13 Correct 31 ms 4528 KB Output is correct
14 Correct 31 ms 4608 KB Output is correct
15 Correct 31 ms 4536 KB Output is correct
16 Correct 29 ms 4492 KB Output is correct
17 Correct 28 ms 4500 KB Output is correct
18 Correct 29 ms 4568 KB Output is correct
19 Correct 37 ms 4324 KB Output is correct
20 Correct 32 ms 4400 KB Output is correct
21 Correct 27 ms 4488 KB Output is correct

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 4 ms 2576 KB Output is correct
5 Correct 4 ms 2584 KB Output is correct
6 Correct 4 ms 2564 KB Output is correct
7 Correct 4 ms 2356 KB Output is correct
8 Correct 3 ms 2616 KB Output is correct
9 Correct 3 ms 2580 KB Output is correct
10 Correct 4 ms 2388 KB Output is correct
11 Correct 4 ms 2612 KB Output is correct
12 Correct 4 ms 2388 KB Output is correct
13 Correct 4 ms 2516 KB Output is correct
14 Correct 4 ms 2520 KB Output is correct
15 Correct 3 ms 2516 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 4236 KB Output is correct
2 Correct 30 ms 4260 KB Output is correct
3 Correct 33 ms 4124 KB Output is correct
4 Correct 33 ms 4260 KB Output is correct
5 Correct 1 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 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 4 ms 2576 KB Output is correct
12 Correct 4 ms 2584 KB Output is correct
13 Correct 4 ms 2564 KB Output is correct
14 Correct 4 ms 2356 KB Output is correct
15 Correct 3 ms 2616 KB Output is correct
16 Correct 3 ms 2580 KB Output is correct
17 Correct 33 ms 4236 KB Output is correct
18 Correct 32 ms 4188 KB Output is correct
19 Correct 29 ms 4476 KB Output is correct
20 Correct 31 ms 4528 KB Output is correct
21 Correct 31 ms 4608 KB Output is correct
22 Correct 31 ms 4536 KB Output is correct
23 Correct 29 ms 4492 KB Output is correct
24 Correct 28 ms 4500 KB Output is correct
25 Correct 29 ms 4568 KB Output is correct
26 Correct 37 ms 4324 KB Output is correct
27 Correct 32 ms 4400 KB Output is correct
28 Correct 27 ms 4488 KB Output is correct
29 Correct 4 ms 2388 KB Output is correct
30 Correct 4 ms 2612 KB Output is correct
31 Correct 4 ms 2388 KB Output is correct
32 Correct 4 ms 2516 KB Output is correct
33 Correct 4 ms 2520 KB Output is correct
34 Correct 3 ms 2516 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 30 ms 3944 KB Output is correct
37 Correct 33 ms 4124 KB Output is correct
38 Correct 32 ms 4388 KB Output is correct
39 Correct 36 ms 4448 KB Output is correct
40 Correct 34 ms 4628 KB Output is correct
41 Correct 2 ms 2612 KB Output is correct
42 Correct 29 ms 4292 KB Output is correct
43 Correct 28 ms 4428 KB Output is correct
44 Correct 31 ms 4524 KB Output is correct
45 Correct 29 ms 4520 KB Output is correct
46 Correct 28 ms 4616 KB Output is correct
47 Correct 28 ms 4668 KB Output is correct