답안 #497363

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
497363	2021-12-23T03:46:18 Z	Maqsut_03	DNA 돌연변이 (IOI21_dna)	C++17	43 / 100	1500 ms	3204 KB

dna

#include<bits/stdc++.h>
#include "dna.h"
using namespace std;

string a, b, a1, b1;
int n;
map <char, int> arr;
void init(string a0, string b0) {
    a = a0;
    b = b0;
    a1 = a;
    b1 = b;
    n = a.length();
}

int get_distance(int x, int y) {
    int ans = 0;
    a = a1;
    b = b1;
    arr.clear();
    for (int i = x; i <= y; i++)
            arr[a[i]]++, arr[b[i]]--;

    for (char i = 'A'; i <= 'Z'; i++)
        if (arr[i] != 0) return -1;
    string a2, b2;
    for (int i=x;i<=y;i++) a2=a2+a[i], b2=b2+b[i];
    a=a2; b=b2;
 //  cout << a <<" " << b << " ";
    for (int i=0;i<=y-x;i++){
        bool ok=0;
        for (int j=i+1;j<=y-x;j++){
            if (a[i] == b[j] and b[i] != a[i] and a[j] == b[i]){
            ok=1;
            ans++;
            swap(b[i], b[j]);
//            cout << 1;
            }
        }
        if (!ok){
            for (int j=i+1;j<=y-x;j++){
                if (a[i] == b[j] and b[i] != a[i]){
                    ans++;
                    swap(b[i], b[j]);
//                  cout << b <<" ";
                }
            }
        }
    }
    return ans;
}

Subtask #1

21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	928 ms	3156 KB	Output is correct
2	Correct	801 ms	3180 KB	Output is correct
3	Correct	731 ms	3084 KB	Output is correct
4	Correct	761 ms	3176 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 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	0 ms	292 KB	Output is correct
2	Correct	0 ms	292 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	6 ms	1452 KB	Output is correct
5	Correct	5 ms	1360 KB	Output is correct
6	Correct	6 ms	1460 KB	Output is correct
7	Correct	765 ms	1384 KB	Output is correct
8	Correct	778 ms	1444 KB	Output is correct
9	Correct	577 ms	1356 KB	Output is correct

Subtask #3

0.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	292 KB	Output is correct
2	Correct	0 ms	292 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	6 ms	1452 KB	Output is correct
5	Correct	5 ms	1360 KB	Output is correct
6	Correct	6 ms	1460 KB	Output is correct
7	Correct	765 ms	1384 KB	Output is correct
8	Correct	778 ms	1444 KB	Output is correct
9	Correct	577 ms	1356 KB	Output is correct
10	Correct	753 ms	2852 KB	Output is correct
11	Correct	745 ms	2944 KB	Output is correct
12	Execution timed out	1549 ms	3204 KB	Time limit exceeded
13	Halted	0 ms	0 KB	-

Subtask #4

0.0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	292 KB	Output is correct
2	Correct	0 ms	292 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	6 ms	1452 KB	Output is correct
5	Correct	5 ms	1360 KB	Output is correct
6	Correct	6 ms	1460 KB	Output is correct
7	Correct	765 ms	1384 KB	Output is correct
8	Correct	778 ms	1444 KB	Output is correct
9	Correct	577 ms	1356 KB	Output is correct
10	Correct	6 ms	1308 KB	Output is correct
11	Correct	7 ms	1336 KB	Output is correct
12	Incorrect	6 ms	1292 KB	Output isn't correct
13	Halted	0 ms	0 KB	-

Subtask #5

0.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	928 ms	3156 KB	Output is correct
2	Correct	801 ms	3180 KB	Output is correct
3	Correct	731 ms	3084 KB	Output is correct
4	Correct	761 ms	3176 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	0 ms	292 KB	Output is correct
9	Correct	0 ms	292 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	6 ms	1452 KB	Output is correct
12	Correct	5 ms	1360 KB	Output is correct
13	Correct	6 ms	1460 KB	Output is correct
14	Correct	765 ms	1384 KB	Output is correct
15	Correct	778 ms	1444 KB	Output is correct
16	Correct	577 ms	1356 KB	Output is correct
17	Correct	753 ms	2852 KB	Output is correct
18	Correct	745 ms	2944 KB	Output is correct
19	Execution timed out	1549 ms	3204 KB	Time limit exceeded
20	Halted	0 ms	0 KB	-