Submission #598665

# Submission time Handle Problem Language Result Execution time Memory
598665 2022-07-18T16:57:46 Z MKopchev Mutating DNA (IOI21_dna) C++17
100 / 100
88 ms 7432 KB
#include "dna.h"
#include<bits/stdc++.h>
using namespace std;

const int nmax=1e6+42;

int pref[nmax][3][3];

int id(char c)
{
    if(c=='A')return 0;
    if(c=='T')return 1;
    return 2;
}

void init(std::string a, std::string b)
{
    int n=a.size();

    for(int i=0;i<n;i++)
    {
        if(i)
        {
            for(int j=0;j<3;j++)
                for(int k=0;k<3;k++)
                    pref[i][j][k]=pref[i-1][j][k];
        }

        pref[i][id(a[i])][id(b[i])]++;
    }

}

int cur[3][3];

int sum(vector<int> order)
{
    order.push_back(order[0]);

    int mini=1e9;

    for(int i=1;i<order.size();i++)
        mini=min(mini,cur[order[i-1]][order[i]]);

    //cout<<mini<<" -> ";for(auto w:order)cout<<w<<" ";cout<<endl;

    for(int i=1;i<order.size();i++)
        cur[order[i-1]][order[i]]-=mini;

    return mini*(order.size()-2);
}

int get_distance(int x, int y)
{
    for(int j=0;j<3;j++)
        for(int k=0;k<3;k++)
        {
            cur[j][k]=pref[y][j][k];

            if(x)cur[j][k]-=pref[x-1][j][k];
        }

    cur[0][0]=0;
    cur[1][1]=0;
    cur[2][2]=0;

    /*
    for(int j=0;j<3;j++)
    {
        for(int k=0;k<3;k++)cout<<cur[j][k]<<" ";
        cout<<endl;
    }
    */

    int output=0;

    output+=sum({0,1});
    output+=sum({0,2});
    output+=sum({1,2});

    output+=sum({0,1,2});
    output+=sum({0,2,1});

    for(int j=0;j<3;j++)
        for(int k=0;k<3;k++)
            if(cur[j][k])return -1;

    return output;
}

/*
int main() {
	int n, q;
	assert(scanf("%d %d", &n, &q) == 2);
	char A[n+1], B[n+1];
	assert(scanf("%s", A) == 1);
	assert(scanf("%s", B) == 1);
	std::string a = std::string(A);
	std::string b = std::string(B);
	std::vector<int> x(q), y(q);
	for (int i = 0; i < q; i++) {
		assert(scanf("%d %d", &x[i], &y[i]) == 2);
	}
	fclose(stdin);
	std::vector<int> results(q);
	init(a, b);
	for (int i = 0; i < q; i++) {
		results[i] = get_distance(x[i], y[i]);
	}
	for (int i = 0; i < q; i++) {
		printf("%d\n", results[i]);
	}
	fclose(stdout);
	return 0;
}
*/

Compilation message

dna.cpp: In function 'int sum(std::vector<int>)':
dna.cpp:42:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |     for(int i=1;i<order.size();i++)
      |                 ~^~~~~~~~~~~~~
dna.cpp:47:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   47 |     for(int i=1;i<order.size();i++)
      |                 ~^~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 84 ms 6924 KB Output is correct
2 Correct 58 ms 7000 KB Output is correct
3 Correct 59 ms 6672 KB Output is correct
4 Correct 68 ms 7000 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 4 ms 4564 KB Output is correct
5 Correct 5 ms 4548 KB Output is correct
6 Correct 5 ms 4564 KB Output is correct
7 Correct 4 ms 4308 KB Output is correct
8 Correct 5 ms 4564 KB Output is correct
9 Correct 4 ms 4544 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 4 ms 4564 KB Output is correct
5 Correct 5 ms 4548 KB Output is correct
6 Correct 5 ms 4564 KB Output is correct
7 Correct 4 ms 4308 KB Output is correct
8 Correct 5 ms 4564 KB Output is correct
9 Correct 4 ms 4544 KB Output is correct
10 Correct 70 ms 6908 KB Output is correct
11 Correct 88 ms 7048 KB Output is correct
12 Correct 66 ms 7072 KB Output is correct
13 Correct 59 ms 7216 KB Output is correct
14 Correct 61 ms 7352 KB Output is correct
15 Correct 69 ms 7296 KB Output is correct
16 Correct 62 ms 6992 KB Output is correct
17 Correct 68 ms 7164 KB Output is correct
18 Correct 71 ms 7300 KB Output is correct
19 Correct 75 ms 7028 KB Output is correct
20 Correct 67 ms 7136 KB Output is correct
21 Correct 58 ms 7272 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 4 ms 4564 KB Output is correct
5 Correct 5 ms 4548 KB Output is correct
6 Correct 5 ms 4564 KB Output is correct
7 Correct 4 ms 4308 KB Output is correct
8 Correct 5 ms 4564 KB Output is correct
9 Correct 4 ms 4544 KB Output is correct
10 Correct 4 ms 4172 KB Output is correct
11 Correct 4 ms 4564 KB Output is correct
12 Correct 5 ms 4292 KB Output is correct
13 Correct 5 ms 4564 KB Output is correct
14 Correct 7 ms 4580 KB Output is correct
15 Correct 5 ms 4584 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 84 ms 6924 KB Output is correct
2 Correct 58 ms 7000 KB Output is correct
3 Correct 59 ms 6672 KB Output is correct
4 Correct 68 ms 7000 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 4 ms 4564 KB Output is correct
12 Correct 5 ms 4548 KB Output is correct
13 Correct 5 ms 4564 KB Output is correct
14 Correct 4 ms 4308 KB Output is correct
15 Correct 5 ms 4564 KB Output is correct
16 Correct 4 ms 4544 KB Output is correct
17 Correct 70 ms 6908 KB Output is correct
18 Correct 88 ms 7048 KB Output is correct
19 Correct 66 ms 7072 KB Output is correct
20 Correct 59 ms 7216 KB Output is correct
21 Correct 61 ms 7352 KB Output is correct
22 Correct 69 ms 7296 KB Output is correct
23 Correct 62 ms 6992 KB Output is correct
24 Correct 68 ms 7164 KB Output is correct
25 Correct 71 ms 7300 KB Output is correct
26 Correct 75 ms 7028 KB Output is correct
27 Correct 67 ms 7136 KB Output is correct
28 Correct 58 ms 7272 KB Output is correct
29 Correct 4 ms 4172 KB Output is correct
30 Correct 4 ms 4564 KB Output is correct
31 Correct 5 ms 4292 KB Output is correct
32 Correct 5 ms 4564 KB Output is correct
33 Correct 7 ms 4580 KB Output is correct
34 Correct 5 ms 4584 KB Output is correct
35 Correct 1 ms 316 KB Output is correct
36 Correct 65 ms 6684 KB Output is correct
37 Correct 68 ms 7048 KB Output is correct
38 Correct 72 ms 7224 KB Output is correct
39 Correct 74 ms 7384 KB Output is correct
40 Correct 70 ms 7432 KB Output is correct
41 Correct 4 ms 4556 KB Output is correct
42 Correct 68 ms 7016 KB Output is correct
43 Correct 61 ms 7296 KB Output is correct
44 Correct 65 ms 7352 KB Output is correct
45 Correct 60 ms 7056 KB Output is correct
46 Correct 57 ms 7288 KB Output is correct
47 Correct 58 ms 7304 KB Output is correct