답안 #705562

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
705562	2023-03-04T16:23:48 Z	jakobrs	DNA 돌연변이 (IOI21_dna)	C++17	100 / 100	36 ms	5384 KB

dna

#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 (size_t 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;
}

Subtask #1

21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	29 ms	4972 KB	Output is correct
2	Correct	29 ms	5100 KB	Output is correct
3	Correct	29 ms	4792 KB	Output is correct
4	Correct	29 ms	5104 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct

Subtask #2

22.0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	3 ms	2552 KB	Output is correct
5	Correct	3 ms	2612 KB	Output is correct
6	Correct	4 ms	2616 KB	Output is correct
7	Correct	3 ms	2388 KB	Output is correct
8	Correct	3 ms	2612 KB	Output is correct
9	Correct	2 ms	2644 KB	Output is correct

Subtask #3

13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	3 ms	2552 KB	Output is correct
5	Correct	3 ms	2612 KB	Output is correct
6	Correct	4 ms	2616 KB	Output is correct
7	Correct	3 ms	2388 KB	Output is correct
8	Correct	3 ms	2612 KB	Output is correct
9	Correct	2 ms	2644 KB	Output is correct
10	Correct	29 ms	4972 KB	Output is correct
11	Correct	30 ms	5104 KB	Output is correct
12	Correct	29 ms	5272 KB	Output is correct
13	Correct	29 ms	5268 KB	Output is correct
14	Correct	31 ms	5364 KB	Output is correct
15	Correct	28 ms	5360 KB	Output is correct
16	Correct	27 ms	5084 KB	Output is correct
17	Correct	28 ms	5268 KB	Output is correct
18	Correct	30 ms	5332 KB	Output is correct
19	Correct	26 ms	5212 KB	Output is correct
20	Correct	27 ms	5224 KB	Output is correct
21	Correct	28 ms	5364 KB	Output is correct

Subtask #4

28.0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	3 ms	2552 KB	Output is correct
5	Correct	3 ms	2612 KB	Output is correct
6	Correct	4 ms	2616 KB	Output is correct
7	Correct	3 ms	2388 KB	Output is correct
8	Correct	3 ms	2612 KB	Output is correct
9	Correct	2 ms	2644 KB	Output is correct
10	Correct	3 ms	2380 KB	Output is correct
11	Correct	4 ms	2644 KB	Output is correct
12	Correct	3 ms	2388 KB	Output is correct
13	Correct	4 ms	2644 KB	Output is correct
14	Correct	5 ms	2644 KB	Output is correct
15	Correct	3 ms	2644 KB	Output is correct

Subtask #5

16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	29 ms	4972 KB	Output is correct
2	Correct	29 ms	5100 KB	Output is correct
3	Correct	29 ms	4792 KB	Output is correct
4	Correct	29 ms	5104 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	0 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	1 ms	212 KB	Output is correct
11	Correct	3 ms	2552 KB	Output is correct
12	Correct	3 ms	2612 KB	Output is correct
13	Correct	4 ms	2616 KB	Output is correct
14	Correct	3 ms	2388 KB	Output is correct
15	Correct	3 ms	2612 KB	Output is correct
16	Correct	2 ms	2644 KB	Output is correct
17	Correct	29 ms	4972 KB	Output is correct
18	Correct	30 ms	5104 KB	Output is correct
19	Correct	29 ms	5272 KB	Output is correct
20	Correct	29 ms	5268 KB	Output is correct
21	Correct	31 ms	5364 KB	Output is correct
22	Correct	28 ms	5360 KB	Output is correct
23	Correct	27 ms	5084 KB	Output is correct
24	Correct	28 ms	5268 KB	Output is correct
25	Correct	30 ms	5332 KB	Output is correct
26	Correct	26 ms	5212 KB	Output is correct
27	Correct	27 ms	5224 KB	Output is correct
28	Correct	28 ms	5364 KB	Output is correct
29	Correct	3 ms	2380 KB	Output is correct
30	Correct	4 ms	2644 KB	Output is correct
31	Correct	3 ms	2388 KB	Output is correct
32	Correct	4 ms	2644 KB	Output is correct
33	Correct	5 ms	2644 KB	Output is correct
34	Correct	3 ms	2644 KB	Output is correct
35	Correct	0 ms	212 KB	Output is correct
36	Correct	30 ms	4764 KB	Output is correct
37	Correct	30 ms	5092 KB	Output is correct
38	Correct	29 ms	5216 KB	Output is correct
39	Correct	30 ms	5384 KB	Output is correct
40	Correct	29 ms	5384 KB	Output is correct
41	Correct	3 ms	2612 KB	Output is correct
42	Correct	36 ms	5240 KB	Output is correct
43	Correct	28 ms	5360 KB	Output is correct
44	Correct	28 ms	5360 KB	Output is correct
45	Correct	27 ms	5224 KB	Output is correct
46	Correct	28 ms	5352 KB	Output is correct
47	Correct	27 ms	5368 KB	Output is correct