답안 #437133

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
437133	2021-06-25T22:16:52 Z	DespicableMonkey	DNA 돌연변이 (IOI21_dna)	C++17	56 / 100	61 ms	5364 KB

dna

/**
 * author: DespicableMonkey
 * created: 06.25.2021 16:56:34
 * Potatoes FTW!
 **/ 

#include<bits/stdc++.h>

using namespace std;

int cnt[2][3][100005];
int differs[100005];
int N;
void init(string a, string b) {
    N = (a).size();
    for(int i = 0; i < N; ++i)
        ++cnt[0][a[i] == 'A'? 0 : a[i] == 'T' ? 1 : 2][i],
        ++cnt[1][b[i] == 'A'? 0 : b[i] == 'T' ? 1 : 2][i],
        differs[i] = a[i] != b[i];
    for(int i = 0; i < 2; ++i)
        for(int j = 0; j < 3; ++j)
            partial_sum(cnt[i][j], cnt[i][j] + N, cnt[i][j]);
    partial_sum(differs, differs + N, differs);
}
 
int get_distance(int x, int y) {
    vector<vector<int>> cnts(2, vector<int>(3));
    for(int i = 0; i < 2; ++i) {
        for(int j = 0; j < 3; ++j) {
            cnts[i][j] = cnt[i][j][y] - (x == 0 ? 0 : cnt[i][j][x-1]);
        }
    }

    for(int i = 0; i < 3; ++i)
        if(cnts[0][i] != cnts[1][i])
            return -1;

    long long need = differs[y] - (x == 0 ? 0 : differs[x - 1]);

    return (need / 2 + !!(need&1));
}
 
// int main() {
//     init("ATACAT", "ACTATA");
//     cout << get_distance(3, 5);
//     return 0;
// }

Subtask #1

21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	51 ms	4864 KB	Output is correct
2	Correct	50 ms	4860 KB	Output is correct
3	Correct	49 ms	4616 KB	Output is correct
4	Correct	61 ms	4864 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct

Subtask #2

22.0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	5 ms	3532 KB	Output is correct
5	Correct	6 ms	3532 KB	Output is correct
6	Correct	6 ms	3532 KB	Output is correct
7	Correct	5 ms	3404 KB	Output is correct
8	Correct	6 ms	3532 KB	Output is correct
9	Correct	5 ms	3616 KB	Output is correct

Subtask #3

13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	5 ms	3532 KB	Output is correct
5	Correct	6 ms	3532 KB	Output is correct
6	Correct	6 ms	3532 KB	Output is correct
7	Correct	5 ms	3404 KB	Output is correct
8	Correct	6 ms	3532 KB	Output is correct
9	Correct	5 ms	3616 KB	Output is correct
10	Correct	50 ms	4828 KB	Output is correct
11	Correct	50 ms	4872 KB	Output is correct
12	Correct	52 ms	5008 KB	Output is correct
13	Correct	52 ms	5124 KB	Output is correct
14	Correct	51 ms	5252 KB	Output is correct
15	Correct	52 ms	5120 KB	Output is correct
16	Correct	47 ms	4996 KB	Output is correct
17	Correct	48 ms	5132 KB	Output is correct
18	Correct	52 ms	5364 KB	Output is correct
19	Correct	45 ms	5008 KB	Output is correct
20	Correct	59 ms	5088 KB	Output is correct
21	Correct	48 ms	5244 KB	Output is correct

Subtask #4

0.0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	5 ms	3532 KB	Output is correct
5	Correct	6 ms	3532 KB	Output is correct
6	Correct	6 ms	3532 KB	Output is correct
7	Correct	5 ms	3404 KB	Output is correct
8	Correct	6 ms	3532 KB	Output is correct
9	Correct	5 ms	3616 KB	Output is correct
10	Correct	5 ms	3336 KB	Output is correct
11	Correct	5 ms	3532 KB	Output is correct
12	Incorrect	5 ms	3404 KB	Output isn't correct
13	Halted	0 ms	0 KB	-

Subtask #5

0.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	51 ms	4864 KB	Output is correct
2	Correct	50 ms	4860 KB	Output is correct
3	Correct	49 ms	4616 KB	Output is correct
4	Correct	61 ms	4864 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	5 ms	3532 KB	Output is correct
12	Correct	6 ms	3532 KB	Output is correct
13	Correct	6 ms	3532 KB	Output is correct
14	Correct	5 ms	3404 KB	Output is correct
15	Correct	6 ms	3532 KB	Output is correct
16	Correct	5 ms	3616 KB	Output is correct
17	Correct	50 ms	4828 KB	Output is correct
18	Correct	50 ms	4872 KB	Output is correct
19	Correct	52 ms	5008 KB	Output is correct
20	Correct	52 ms	5124 KB	Output is correct
21	Correct	51 ms	5252 KB	Output is correct
22	Correct	52 ms	5120 KB	Output is correct
23	Correct	47 ms	4996 KB	Output is correct
24	Correct	48 ms	5132 KB	Output is correct
25	Correct	52 ms	5364 KB	Output is correct
26	Correct	45 ms	5008 KB	Output is correct
27	Correct	59 ms	5088 KB	Output is correct
28	Correct	48 ms	5244 KB	Output is correct
29	Correct	5 ms	3336 KB	Output is correct
30	Correct	5 ms	3532 KB	Output is correct
31	Incorrect	5 ms	3404 KB	Output isn't correct
32	Halted	0 ms	0 KB	-