Submission #550783

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
550783	2022-04-19T08:10:53 Z	topovik	Mutating DNA (IOI21_dna)	C++17	100 / 100	94 ms	8184 KB

#include <bits/stdc++.h>
#include "dna.h"
#define pb push_back
#define f first
#define s second

using namespace std;

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;

const ll oo = 1e9 + 7;

const ll N = 1e6;
const ll M = 21;
const ll M1 = 1e6;

int pref[N][3][3];
int A[N];
int B[N];

void init(string a, string b)
{
    int n = a.size();
    for (int i = 0; i < n; i++)
    {
        if (a[i] == 'T') A[i] = 1;
        if (a[i] == 'C') A[i] = 2;
        if (b[i] == 'T') B[i] = 1;
        if (b[i] == 'C') B[i] = 2;
    }
    pref[0][A[0]][B[0]]++;
    for (int i = 1; i < n; i++)
    {
        for (int j = 0; j < 3; j++)
            for (int j1 = 0; j1 < 3; j1++) pref[i][j][j1] = pref[i - 1][j][j1];
        pref[i][A[i]][B[i]]++;
    }
}

int get_distance(int x, int y)
{
    vector <vector <int> > vc(3);
    for (int i = 0; i < 3; i++) vc[i].resize(3);
    for (int i = 0; i < 3; i++)
        for (int j = 0; j < 3; j++)
            if (x > 0) vc[i][j] = pref[y][i][j] - pref[x - 1][i][j];
            else       vc[i][j] = pref[y][i][j];
    int ans = 0;
    for (int i = 0; i < 3; i++)
        for (int j = 0; j < 3; j++)
            if (i != j)
    {
        int c = min(vc[i][j], vc[j][i]);
        ans += c;
        vc[i][j] -= c;
        vc[j][i] -= c;
    }
    for (int i = 0; i < 3; i++)
    {
        ll kol1 = 0;
        for (int j = 0; j < 3; j++)
            if (i != j) kol1 += vc[i][j];
        for (int j = 0; j < 3; j++)
            if (i != j) kol1 -= vc[j][i];
        if (kol1 != 0) return -1;
    }
    for (int o = 0; o < 10; o++)
    {
        bool g = 1;
        for (int i = 0; i < 3 && g; i++)
            for (int j = 0; j < 3 && g; j++)
                if (i != j && vc[i][j] > 0)
                    for (int j1 = 0; j1 < 3 && g; j1++)
                        if (j1 != j && vc[j][j1] > 0)
                        {
                            int c = min(vc[i][j], vc[j][j1]);
                            vc[i][j1] += c;
                            vc[j][j1] -= c;
                            vc[i][j] -= c;
                            ans += c;
                            g = 0;
                        }
        for (int i = 0; i < 3; i++)
            for (int j = 0; j < 3; j++)
                if (i != j)
        {
            int c = min(vc[i][j], vc[j][i]);
            ans += c;
            vc[i][j] -= c;
            vc[j][i] -= c;
        }
    }
    return ans;
}

//int main()
//{
//    ios_base::sync_with_stdio(0);
//    iostream::sync_with_stdio(0);
//    cin.tie(0);
//    cout.tie(0);
//    int n, q;
//    cin >> n >> q;
//    string a, b;
//    cin >> a >> b;
//    init(a, b);
//    while (q--)
//    {
//        int x, y;
//        cin >> x >> y;
//        cout << get_distance(x, y) << endl;
//    }
//}
/*
5 3
2 1 1 2 2 3
2 3 3 4 4 5
4 1 1 2 2 3 3 4 4 5
*/

Subtask #1
21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	74 ms	6396 KB	Output is correct
2	Correct	72 ms	6456 KB	Output is correct
3	Correct	75 ms	6000 KB	Output is correct
4	Correct	83 ms	6444 KB	Output is correct
5	Correct	0 ms	212 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

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 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	5076 KB	Output is correct
5	Correct	5 ms	5204 KB	Output is correct
6	Correct	5 ms	5076 KB	Output is correct
7	Correct	4 ms	4820 KB	Output is correct
8	Correct	7 ms	5204 KB	Output is correct
9	Correct	5 ms	5204 KB	Output is correct

Subtask #3
13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 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	5076 KB	Output is correct
5	Correct	5 ms	5204 KB	Output is correct
6	Correct	5 ms	5076 KB	Output is correct
7	Correct	4 ms	4820 KB	Output is correct
8	Correct	7 ms	5204 KB	Output is correct
9	Correct	5 ms	5204 KB	Output is correct
10	Correct	94 ms	6388 KB	Output is correct
11	Correct	92 ms	6448 KB	Output is correct
12	Correct	71 ms	6492 KB	Output is correct
13	Correct	70 ms	6628 KB	Output is correct
14	Correct	87 ms	6852 KB	Output is correct
15	Correct	90 ms	6708 KB	Output is correct
16	Correct	77 ms	6500 KB	Output is correct
17	Correct	74 ms	6660 KB	Output is correct
18	Correct	70 ms	6792 KB	Output is correct
19	Correct	69 ms	6500 KB	Output is correct
20	Correct	71 ms	6624 KB	Output is correct
21	Correct	70 ms	6852 KB	Output is correct

Subtask #4
28.0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 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	5076 KB	Output is correct
5	Correct	5 ms	5204 KB	Output is correct
6	Correct	5 ms	5076 KB	Output is correct
7	Correct	4 ms	4820 KB	Output is correct
8	Correct	7 ms	5204 KB	Output is correct
9	Correct	5 ms	5204 KB	Output is correct
10	Correct	5 ms	4692 KB	Output is correct
11	Correct	5 ms	5204 KB	Output is correct
12	Correct	5 ms	4820 KB	Output is correct
13	Correct	6 ms	5340 KB	Output is correct
14	Correct	6 ms	5332 KB	Output is correct
15	Correct	5 ms	5332 KB	Output is correct

Subtask #5
16.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	74 ms	6396 KB	Output is correct
2	Correct	72 ms	6456 KB	Output is correct
3	Correct	75 ms	6000 KB	Output is correct
4	Correct	83 ms	6444 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 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	5076 KB	Output is correct
12	Correct	5 ms	5204 KB	Output is correct
13	Correct	5 ms	5076 KB	Output is correct
14	Correct	4 ms	4820 KB	Output is correct
15	Correct	7 ms	5204 KB	Output is correct
16	Correct	5 ms	5204 KB	Output is correct
17	Correct	94 ms	6388 KB	Output is correct
18	Correct	92 ms	6448 KB	Output is correct
19	Correct	71 ms	6492 KB	Output is correct
20	Correct	70 ms	6628 KB	Output is correct
21	Correct	87 ms	6852 KB	Output is correct
22	Correct	90 ms	6708 KB	Output is correct
23	Correct	77 ms	6500 KB	Output is correct
24	Correct	74 ms	6660 KB	Output is correct
25	Correct	70 ms	6792 KB	Output is correct
26	Correct	69 ms	6500 KB	Output is correct
27	Correct	71 ms	6624 KB	Output is correct
28	Correct	70 ms	6852 KB	Output is correct
29	Correct	5 ms	4692 KB	Output is correct
30	Correct	5 ms	5204 KB	Output is correct
31	Correct	5 ms	4820 KB	Output is correct
32	Correct	6 ms	5340 KB	Output is correct
33	Correct	6 ms	5332 KB	Output is correct
34	Correct	5 ms	5332 KB	Output is correct
35	Correct	1 ms	212 KB	Output is correct
36	Correct	82 ms	7456 KB	Output is correct
37	Correct	79 ms	7756 KB	Output is correct
38	Correct	87 ms	7880 KB	Output is correct
39	Correct	79 ms	8140 KB	Output is correct
40	Correct	88 ms	8184 KB	Output is correct
41	Correct	5 ms	5312 KB	Output is correct
42	Correct	75 ms	7764 KB	Output is correct
43	Correct	69 ms	8100 KB	Output is correct
44	Correct	72 ms	8100 KB	Output is correct
45	Correct	81 ms	7776 KB	Output is correct
46	Correct	75 ms	8124 KB	Output is correct
47	Correct	76 ms	8088 KB	Output is correct

Submission #550783

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