답안 #676215

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
676215	2022-12-29T21:15:15 Z	mseebacher	DNA 돌연변이 (IOI21_dna)	C++17	43 / 100	1500 ms	3724 KB

dna

#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef vector<int> vi;
#define MAXI (int)1e5
#define pb(x) push_back(x)
string s1;
string s2;

void init(string x,string y){
	s1 = x;
	s2 = y;
}

 
int get_distance(int x,int y){
	map<char,int> m1,m2;
	m1.insert({'A',0});
	m2.insert({'A',0});
	m1.insert({'T',0});
	m2.insert({'T',0});
	m1.insert({'C',0});
	m2.insert({'C',0});
	for(int i =x;i<=y;i++){
		m1[s1[i]]++;
		m2[s2[i]]++;
	}
	if(m1['A'] != m2['A'] || m1['T'] != m2['T'] || m1['C'] != m2['C']) return -1;
	int cntr = 0;
	for(int i = x;i<=y;i++){
		if(s1[i] != s2[i]) cntr++;
	}
	return (cntr+1)/2;
}

Subtask #1

21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	50 ms	2360 KB	Output is correct
2	Correct	51 ms	2376 KB	Output is correct
3	Correct	49 ms	2312 KB	Output is correct
4	Correct	50 ms	2380 KB	Output is correct
5	Correct	1 ms	224 KB	Output is correct
6	Correct	0 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	0 ms	212 KB	Output is correct
4	Correct	2 ms	980 KB	Output is correct
5	Correct	2 ms	980 KB	Output is correct
6	Correct	2 ms	980 KB	Output is correct
7	Correct	9 ms	1220 KB	Output is correct
8	Correct	9 ms	1288 KB	Output is correct
9	Correct	6 ms	1236 KB	Output is correct

Subtask #3

0.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	0 ms	212 KB	Output is correct
4	Correct	2 ms	980 KB	Output is correct
5	Correct	2 ms	980 KB	Output is correct
6	Correct	2 ms	980 KB	Output is correct
7	Correct	9 ms	1220 KB	Output is correct
8	Correct	9 ms	1288 KB	Output is correct
9	Correct	6 ms	1236 KB	Output is correct
10	Correct	52 ms	3696 KB	Output is correct
11	Correct	55 ms	3724 KB	Output is correct
12	Execution timed out	1577 ms	3480 KB	Time limit exceeded
13	Halted	0 ms	0 KB	-

Subtask #4

0.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	0 ms	212 KB	Output is correct
4	Correct	2 ms	980 KB	Output is correct
5	Correct	2 ms	980 KB	Output is correct
6	Correct	2 ms	980 KB	Output is correct
7	Correct	9 ms	1220 KB	Output is correct
8	Correct	9 ms	1288 KB	Output is correct
9	Correct	6 ms	1236 KB	Output is correct
10	Correct	2 ms	1100 KB	Output is correct
11	Correct	2 ms	1208 KB	Output is correct
12	Incorrect	2 ms	1184 KB	Output isn't correct
13	Halted	0 ms	0 KB	-

Subtask #5

0.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	50 ms	2360 KB	Output is correct
2	Correct	51 ms	2376 KB	Output is correct
3	Correct	49 ms	2312 KB	Output is correct
4	Correct	50 ms	2380 KB	Output is correct
5	Correct	1 ms	224 KB	Output is correct
6	Correct	0 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	0 ms	212 KB	Output is correct
11	Correct	2 ms	980 KB	Output is correct
12	Correct	2 ms	980 KB	Output is correct
13	Correct	2 ms	980 KB	Output is correct
14	Correct	9 ms	1220 KB	Output is correct
15	Correct	9 ms	1288 KB	Output is correct
16	Correct	6 ms	1236 KB	Output is correct
17	Correct	52 ms	3696 KB	Output is correct
18	Correct	55 ms	3724 KB	Output is correct
19	Execution timed out	1577 ms	3480 KB	Time limit exceeded
20	Halted	0 ms	0 KB	-