답안 #821779

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
821779	2023-08-11T16:19:48 Z	HorizonWest	DNA 돌연변이 (IOI21_dna)	C++17	100 / 100	84 ms	29076 KB

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

#define endl '\n'
#define db double
#define ll __int128
#define pb push_back
#define fs first
#define sd second
#define Mod long(1e9 + 7)
#define all(x) x.begin(), x.end()
#define unvisited long(-1)
#define Eps double(1e-9)
#define _for(i, n) for(int i = 0; i < (n); i++)
#define dbg(x) cout << #x ": " << x << endl;

const int Max = 5e3 + 7, Inf = 2e8 + 7;

void print(bool x) { cout << (x ? "YES" : "NO") << endl; }

string tostring (__int128 x)
{
    string ans = "";
    while(x > 0)
    {
        ans += (x % 10 + '0');
        x /= 10;
    }
    reverse(all(ans));
    return ans;
}

vector <vector <int>> s;
vector <vector <vector<int>>> f;

void init(string a, string b)
{
    int n = (int) a.size(); string ref = "ATC";

    map <char, int> mp;

    for(int i = 0; i < (int) ref.size(); i++)
        mp[ref[i]] = i;

    s.assign(n + 1, vector <int> ((int) ref.size() + 1, 0));

    for(int i = 0; i < n; i++)
    {
        s[i][mp[a[i]]]++; s[i][mp[b[i]]]--;
        for(int j = 0; j < (int) ref.size(); j++)
            s[i][j] += (i > 0 ? s[i-1][j] : 0);
    }

    f.assign(n + 1, vector <vector<int>> (3, vector <int> (3, 0)));
    for(int i = 0; i < n; i++)
    {
        int _a = mp[a[i]], _b = mp[b[i]];
        f[i][_a][_b]++;
        for(int j = 0; j < 3; j++) if(i > 0)
            for(int k = 0; k < 3; k++)
                f[i][j][k] += f[i-1][j][k];
    }
}

int get_distance(int x, int y)
{
    bool can = true;
    for(int i = 0; i < 3; i++)
    {
        int t = s[y][i];
        if(x != 0) t -= s[x-1][i];
        if(t != 0) can = false;
    }

    int ans = 0, cont = 0;

    for(int i = 0; i < 3; i++)
    {
        for(int j = i + 1; j < 3; j++)
        {
            int t1 = 0, t2 = 0;
            if(x > 0)
            {
                t1 = f[x-1][i][j];
                t2 = f[x-1][j][i];
            }
            ans += min(f[y][i][j] - t1, f[y][j][i] - t2);
            cont += abs((f[y][i][j] - t1) - (f[y][j][i] - t2));
        }
    }

    cont /= 3; ans += cont * 2;

    return (can ? ans : -1);
}

Subtask #1
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	63 ms	28236 KB	Output is correct
2	Correct	64 ms	28580 KB	Output is correct
3	Correct	59 ms	26316 KB	Output is correct
4	Correct	64 ms	28640 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	300 KB	Output is correct

Subtask #2
22.0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	31 ms	25808 KB	Output is correct
5	Correct	27 ms	26080 KB	Output is correct
6	Correct	27 ms	25940 KB	Output is correct
7	Correct	29 ms	24376 KB	Output is correct
8	Correct	27 ms	26076 KB	Output is correct
9	Correct	25 ms	26132 KB	Output is correct

Subtask #3
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	31 ms	25808 KB	Output is correct
5	Correct	27 ms	26080 KB	Output is correct
6	Correct	27 ms	25940 KB	Output is correct
7	Correct	29 ms	24376 KB	Output is correct
8	Correct	27 ms	26076 KB	Output is correct
9	Correct	25 ms	26132 KB	Output is correct
10	Correct	67 ms	28256 KB	Output is correct
11	Correct	65 ms	28604 KB	Output is correct
12	Correct	67 ms	27164 KB	Output is correct
13	Correct	70 ms	27800 KB	Output is correct
14	Correct	71 ms	29076 KB	Output is correct
15	Correct	81 ms	28936 KB	Output is correct
16	Correct	62 ms	27072 KB	Output is correct
17	Correct	69 ms	27724 KB	Output is correct
18	Correct	64 ms	28868 KB	Output is correct
19	Correct	57 ms	27012 KB	Output is correct
20	Correct	50 ms	27776 KB	Output is correct
21	Correct	51 ms	28852 KB	Output is correct

Subtask #4
28.0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	31 ms	25808 KB	Output is correct
5	Correct	27 ms	26080 KB	Output is correct
6	Correct	27 ms	25940 KB	Output is correct
7	Correct	29 ms	24376 KB	Output is correct
8	Correct	27 ms	26076 KB	Output is correct
9	Correct	25 ms	26132 KB	Output is correct
10	Correct	25 ms	23756 KB	Output is correct
11	Correct	27 ms	26012 KB	Output is correct
12	Correct	26 ms	24396 KB	Output is correct
13	Correct	27 ms	25860 KB	Output is correct
14	Correct	29 ms	26060 KB	Output is correct
15	Correct	31 ms	26064 KB	Output is correct

Subtask #5
16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	63 ms	28236 KB	Output is correct
2	Correct	64 ms	28580 KB	Output is correct
3	Correct	59 ms	26316 KB	Output is correct
4	Correct	64 ms	28640 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	300 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	31 ms	25808 KB	Output is correct
12	Correct	27 ms	26080 KB	Output is correct
13	Correct	27 ms	25940 KB	Output is correct
14	Correct	29 ms	24376 KB	Output is correct
15	Correct	27 ms	26076 KB	Output is correct
16	Correct	25 ms	26132 KB	Output is correct
17	Correct	67 ms	28256 KB	Output is correct
18	Correct	65 ms	28604 KB	Output is correct
19	Correct	67 ms	27164 KB	Output is correct
20	Correct	70 ms	27800 KB	Output is correct
21	Correct	71 ms	29076 KB	Output is correct
22	Correct	81 ms	28936 KB	Output is correct
23	Correct	62 ms	27072 KB	Output is correct
24	Correct	69 ms	27724 KB	Output is correct
25	Correct	64 ms	28868 KB	Output is correct
26	Correct	57 ms	27012 KB	Output is correct
27	Correct	50 ms	27776 KB	Output is correct
28	Correct	51 ms	28852 KB	Output is correct
29	Correct	25 ms	23756 KB	Output is correct
30	Correct	27 ms	26012 KB	Output is correct
31	Correct	26 ms	24396 KB	Output is correct
32	Correct	27 ms	25860 KB	Output is correct
33	Correct	29 ms	26060 KB	Output is correct
34	Correct	31 ms	26064 KB	Output is correct
35	Correct	1 ms	212 KB	Output is correct
36	Correct	62 ms	26304 KB	Output is correct
37	Correct	72 ms	28592 KB	Output is correct
38	Correct	74 ms	27420 KB	Output is correct
39	Correct	84 ms	28972 KB	Output is correct
40	Correct	79 ms	28952 KB	Output is correct
41	Correct	25 ms	26088 KB	Output is correct
42	Correct	60 ms	27340 KB	Output is correct
43	Correct	83 ms	28892 KB	Output is correct
44	Correct	73 ms	28836 KB	Output is correct
45	Correct	50 ms	27344 KB	Output is correct
46	Correct	64 ms	28876 KB	Output is correct
47	Correct	58 ms	28860 KB	Output is correct

답안 #821779

Compilation message

Subtask #1 21.0 / 21.0

Subtask #2 22.0 / 22.0

Subtask #3 13.0 / 13.0

Subtask #4 28.0 / 28.0

Subtask #5 16.0 / 16.0

Subtask #1
21.0 / 21.0

Subtask #2
22.0 / 22.0

Subtask #3
13.0 / 13.0

Subtask #4
28.0 / 28.0

Subtask #5
16.0 / 16.0