oj.uz

답안 #639765

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
639765 2022-09-11T15:03:33 Z study DNA 돌연변이 (IOI21_dna) C++17
100 / 100
 44 ms 6112 KB 
#include <bits/stdc++.h>
using namespace std;

const int N = 1e5+1;

int psum[3][3][N];

char c(char a){
	if (a == 'A') return 0;
	if (a == 'C') return 1;
	return 2;
}

void init(string a, string b){
	for (int i=0; i<a.size(); ++i){
		int idx = i+1;
		for (int A=0; A<3; ++A){
			for (int B=0; B<3; ++B){
				psum[A][B][idx] += psum[A][B][idx-1];
			}
		}
		psum[c(a[i])][c(b[i])][idx]++;
	}
}

int get_distance(int x, int y){
	x++; y++;
	vector<int> check(3);
	int ans = 0, crt = 0;
	for (int A=0; A<3; ++A){
		for (int B=A+1; B<3; ++B){
			int val1 = psum[A][B][y]-psum[A][B][x-1], val2 = psum[B][A][y]-psum[B][A][x-1];
			check[A] += val1;
			check[B] -= val1;
			check[B] += val2;
			check[A] -= val2;
			ans += min(val1,val2);
			crt += abs(val1-val2);
		}
	}
	if (check[0] or check[1] or check[2]) return -1;
	return ans+2*crt/3;
}

Compilation message

dna.cpp: In function 'void init(std::string, std::string)':
dna.cpp:15:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   15 |  for (int i=0; i<a.size(); ++i){
      |                ~^~~~~~~~~
dna.cpp:22:9: warning: array subscript has type 'char' [-Wchar-subscripts]
   22 |   psum[c(a[i])][c(b[i])][idx]++;
      |        ~^~~~~~
dna.cpp:22:18: warning: array subscript has type 'char' [-Wchar-subscripts]
   22 |   psum[c(a[i])][c(b[i])][idx]++;
      |                 ~^~~~~~

Subtask #1
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 5620 KB Output is correct
2 Correct 32 ms 5640 KB Output is correct
3 Correct 30 ms 5368 KB Output is correct
4 Correct 33 ms 5648 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 5 ms 4308 KB Output is correct
5 Correct 5 ms 4308 KB Output is correct
6 Correct 4 ms 4308 KB Output is correct
7 Correct 4 ms 4052 KB Output is correct
8 Correct 5 ms 4308 KB Output is correct
9 Correct 4 ms 4308 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 5 ms 4308 KB Output is correct
5 Correct 5 ms 4308 KB Output is correct
6 Correct 4 ms 4308 KB Output is correct
7 Correct 4 ms 4052 KB Output is correct
8 Correct 5 ms 4308 KB Output is correct
9 Correct 4 ms 4308 KB Output is correct
10 Correct 33 ms 5616 KB Output is correct
11 Correct 33 ms 5640 KB Output is correct
12 Correct 33 ms 5792 KB Output is correct
13 Correct 33 ms 5856 KB Output is correct
14 Correct 35 ms 6036 KB Output is correct
15 Correct 33 ms 5900 KB Output is correct
16 Correct 32 ms 5780 KB Output is correct
17 Correct 42 ms 5848 KB Output is correct
18 Correct 31 ms 6024 KB Output is correct
19 Correct 29 ms 5804 KB Output is correct
20 Correct 33 ms 5888 KB Output is correct
21 Correct 32 ms 6072 KB Output is correct

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 5 ms 4308 KB Output is correct
5 Correct 5 ms 4308 KB Output is correct
6 Correct 4 ms 4308 KB Output is correct
7 Correct 4 ms 4052 KB Output is correct
8 Correct 5 ms 4308 KB Output is correct
9 Correct 4 ms 4308 KB Output is correct
10 Correct 4 ms 4052 KB Output is correct
11 Correct 5 ms 4308 KB Output is correct
12 Correct 3 ms 4052 KB Output is correct
13 Correct 5 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

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 5620 KB Output is correct
2 Correct 32 ms 5640 KB Output is correct
3 Correct 30 ms 5368 KB Output is correct
4 Correct 33 ms 5648 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 5 ms 4308 KB Output is correct
12 Correct 5 ms 4308 KB Output is correct
13 Correct 4 ms 4308 KB Output is correct
14 Correct 4 ms 4052 KB Output is correct
15 Correct 5 ms 4308 KB Output is correct
16 Correct 4 ms 4308 KB Output is correct
17 Correct 33 ms 5616 KB Output is correct
18 Correct 33 ms 5640 KB Output is correct
19 Correct 33 ms 5792 KB Output is correct
20 Correct 33 ms 5856 KB Output is correct
21 Correct 35 ms 6036 KB Output is correct
22 Correct 33 ms 5900 KB Output is correct
23 Correct 32 ms 5780 KB Output is correct
24 Correct 42 ms 5848 KB Output is correct
25 Correct 31 ms 6024 KB Output is correct
26 Correct 29 ms 5804 KB Output is correct
27 Correct 33 ms 5888 KB Output is correct
28 Correct 32 ms 6072 KB Output is correct
29 Correct 4 ms 4052 KB Output is correct
30 Correct 5 ms 4308 KB Output is correct
31 Correct 3 ms 4052 KB Output is correct
32 Correct 5 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 0 ms 340 KB Output is correct
36 Correct 32 ms 5380 KB Output is correct
37 Correct 39 ms 5640 KB Output is correct
38 Correct 36 ms 5808 KB Output is correct
39 Correct 44 ms 5972 KB Output is correct
40 Correct 34 ms 6020 KB Output is correct
41 Correct 3 ms 4308 KB Output is correct
42 Correct 34 ms 5808 KB Output is correct
43 Correct 31 ms 6000 KB Output is correct
44 Correct 43 ms 6012 KB Output is correct
45 Correct 32 ms 5908 KB Output is correct
46 Correct 30 ms 6112 KB Output is correct
47 Correct 29 ms 6024 KB Output is correct