답안 #549078

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
549078	2022-04-15T05:41:05 Z	SlyGaleeb	DNA 돌연변이 (IOI21_dna)	C++17	56 / 100	40 ms	6556 KB

dna

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ld long double
#define vf v[i].first
#define vs v[i].second
const ll MOD = 1e9 + 7;

void print(vector<int> &v) {
	for (auto c:v)
		cout << c << " ";
	cout << "\n";
}

vector<int>pref = {0};
vector<int>prefA1 = {0};
vector<int>prefT1 = {0}; 
vector<int>prefA2 = {0};
vector<int>prefT2 = {0};

int n;
string c,d;

void init(string a, string b) {
	n = a.size();
	c = a;
	d = b;
	int a1=0,a2=0,b1=0,b2=0,ans=0;
	for (int i = 0; i < n; ++i) {
		if (a[i]!=b[i])
			++ans;
		pref.push_back(ans);
		if (a[i]=='A') 
			a1++;
		prefA1.push_back(a1);
		if (a[i]=='T') 
			b1++;
		prefT1.push_back(b1);
		if (b[i]=='A') 
			a2++;
		prefA2.push_back(a2);
		if (b[i]=='T') 
			b2++;
		prefT2.push_back(b2);
	}
}

int get_distance(int x, int y) {
	int ans = 0;
	if (prefA1[y+1]-prefA1[x]!=prefA2[y+1]-prefA2[x] || prefT1[y+1]-prefT1[x]!=prefT2[y+1]-prefT2[x])
		return -1;
	return (pref[y+1]-pref[x]+1)/2;

}

/*int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	string a,b;
	cin >> a >> b;
	init(a,b);
	cout << get_distance(0,0);
	cout << "\n";
	print(pref);
	print(prefA1);
	print(prefA2);
	print(prefT1);
	print(prefT2);
}*/

Compilation message

dna.cpp: In function 'int get_distance(int, int)':
dna.cpp:49:6: warning: unused variable 'ans' [-Wunused-variable]
   49 |  int ans = 0;
      |      ^~~

Subtask #1

21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	33 ms	4796 KB	Output is correct
2	Correct	31 ms	4856 KB	Output is correct
3	Correct	34 ms	4208 KB	Output is correct
4	Correct	40 ms	4776 KB	Output is correct
5	Correct	1 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	0 ms	212 KB	Output is correct
4	Correct	5 ms	3388 KB	Output is correct
5	Correct	5 ms	3516 KB	Output is correct
6	Correct	5 ms	3388 KB	Output is correct
7	Correct	5 ms	2996 KB	Output is correct
8	Correct	5 ms	3508 KB	Output is correct
9	Correct	4 ms	3516 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	0 ms	212 KB	Output is correct
4	Correct	5 ms	3388 KB	Output is correct
5	Correct	5 ms	3516 KB	Output is correct
6	Correct	5 ms	3388 KB	Output is correct
7	Correct	5 ms	2996 KB	Output is correct
8	Correct	5 ms	3508 KB	Output is correct
9	Correct	4 ms	3516 KB	Output is correct
10	Correct	40 ms	4772 KB	Output is correct
11	Correct	33 ms	4836 KB	Output is correct
12	Correct	33 ms	4684 KB	Output is correct
13	Correct	33 ms	6056 KB	Output is correct
14	Correct	32 ms	6556 KB	Output is correct
15	Correct	33 ms	6492 KB	Output is correct
16	Correct	32 ms	5868 KB	Output is correct
17	Correct	32 ms	5988 KB	Output is correct
18	Correct	30 ms	6452 KB	Output is correct
19	Correct	31 ms	5928 KB	Output is correct
20	Correct	30 ms	5976 KB	Output is correct
21	Correct	33 ms	6416 KB	Output is correct

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	5 ms	3388 KB	Output is correct
5	Correct	5 ms	3516 KB	Output is correct
6	Correct	5 ms	3388 KB	Output is correct
7	Correct	5 ms	2996 KB	Output is correct
8	Correct	5 ms	3508 KB	Output is correct
9	Correct	4 ms	3516 KB	Output is correct
10	Correct	5 ms	2992 KB	Output is correct
11	Correct	6 ms	3516 KB	Output is correct
12	Incorrect	6 ms	3228 KB	Output isn't correct
13	Halted	0 ms	0 KB	-

Subtask #5

0.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	33 ms	4796 KB	Output is correct
2	Correct	31 ms	4856 KB	Output is correct
3	Correct	34 ms	4208 KB	Output is correct
4	Correct	40 ms	4776 KB	Output is correct
5	Correct	1 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	0 ms	212 KB	Output is correct
11	Correct	5 ms	3388 KB	Output is correct
12	Correct	5 ms	3516 KB	Output is correct
13	Correct	5 ms	3388 KB	Output is correct
14	Correct	5 ms	2996 KB	Output is correct
15	Correct	5 ms	3508 KB	Output is correct
16	Correct	4 ms	3516 KB	Output is correct
17	Correct	40 ms	4772 KB	Output is correct
18	Correct	33 ms	4836 KB	Output is correct
19	Correct	33 ms	4684 KB	Output is correct
20	Correct	33 ms	6056 KB	Output is correct
21	Correct	32 ms	6556 KB	Output is correct
22	Correct	33 ms	6492 KB	Output is correct
23	Correct	32 ms	5868 KB	Output is correct
24	Correct	32 ms	5988 KB	Output is correct
25	Correct	30 ms	6452 KB	Output is correct
26	Correct	31 ms	5928 KB	Output is correct
27	Correct	30 ms	5976 KB	Output is correct
28	Correct	33 ms	6416 KB	Output is correct
29	Correct	5 ms	2992 KB	Output is correct
30	Correct	6 ms	3516 KB	Output is correct
31	Incorrect	6 ms	3228 KB	Output isn't correct
32	Halted	0 ms	0 KB	-