Submission #609822

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
609822	2022-07-28T00:16:16 Z	duality	Mutating DNA (IOI21_dna)	C++17	100 / 100	43 ms	7428 KB

#define DEBUG 0

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

#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}

// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
    public:
        template<typename T>
        _Debug& operator,(T val) {
            cout << val << endl;
            return *this;
        }
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif

// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back

// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;

// ---------- END OF TEMPLATE ----------
#include "dna.h"

int pre[100001][3][3],num[3][3];
int pos(char c) {
    if (c == 'A') return 0;
    else if (c == 'C') return 1;
    else return 2;
}
void init(string a,string b) {
    int i,n = a.size();
    for (i = 0; i < n; i++) {
        memcpy(pre[i+1],pre[i],sizeof(pre[i]));
        pre[i+1][pos(a[i])][pos(b[i])]++;
    }
}
int get_distance(int x,int y) {
    int i,j;
    for (i = 0; i < 3; i++) {
        for (j = 0; j < 3; j++) num[i][j] = pre[y+1][i][j]-pre[x][i][j];
    }
    int ans = 0;
    for (i = 0; i < 3; i++) {
        j = (i+1) % 3;
        int m = min(num[i][j],num[j][i]);
        ans += m,num[i][j] -= m,num[j][i] -= m;
    }
    if ((num[0][1] != num[1][2]) || (num[1][2] != num[2][0])) return -1;
    else ans += 2*num[0][1];
    if ((num[1][0] != num[2][1]) || (num[2][1] != num[0][2])) return -1;
    else ans += 2*num[1][0];
    return ans;
}

Subtask #1
21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	33 ms	5644 KB	Output is correct
2	Correct	33 ms	6992 KB	Output is correct
3	Correct	32 ms	6628 KB	Output is correct
4	Correct	34 ms	7036 KB	Output is correct
5	Correct	1 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	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	5 ms	4436 KB	Output is correct
5	Correct	4 ms	4564 KB	Output is correct
6	Correct	5 ms	4508 KB	Output is correct
7	Correct	4 ms	4248 KB	Output is correct
8	Correct	4 ms	4548 KB	Output is correct
9	Correct	4 ms	4544 KB	Output is correct

Subtask #3
13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	5 ms	4436 KB	Output is correct
5	Correct	4 ms	4564 KB	Output is correct
6	Correct	5 ms	4508 KB	Output is correct
7	Correct	4 ms	4248 KB	Output is correct
8	Correct	4 ms	4548 KB	Output is correct
9	Correct	4 ms	4544 KB	Output is correct
10	Correct	32 ms	6968 KB	Output is correct
11	Correct	43 ms	7036 KB	Output is correct
12	Correct	36 ms	7104 KB	Output is correct
13	Correct	32 ms	7200 KB	Output is correct
14	Correct	33 ms	7284 KB	Output is correct
15	Correct	33 ms	7288 KB	Output is correct
16	Correct	30 ms	6964 KB	Output is correct
17	Correct	30 ms	7060 KB	Output is correct
18	Correct	31 ms	7288 KB	Output is correct
19	Correct	40 ms	7012 KB	Output is correct
20	Correct	30 ms	7060 KB	Output is correct
21	Correct	30 ms	7252 KB	Output is correct

Subtask #4
28.0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	5 ms	4436 KB	Output is correct
5	Correct	4 ms	4564 KB	Output is correct
6	Correct	5 ms	4508 KB	Output is correct
7	Correct	4 ms	4248 KB	Output is correct
8	Correct	4 ms	4548 KB	Output is correct
9	Correct	4 ms	4544 KB	Output is correct
10	Correct	4 ms	4180 KB	Output is correct
11	Correct	4 ms	4540 KB	Output is correct
12	Correct	4 ms	4312 KB	Output is correct
13	Correct	4 ms	4564 KB	Output is correct
14	Correct	4 ms	4564 KB	Output is correct
15	Correct	4 ms	4540 KB	Output is correct

Subtask #5
16.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	33 ms	5644 KB	Output is correct
2	Correct	33 ms	6992 KB	Output is correct
3	Correct	32 ms	6628 KB	Output is correct
4	Correct	34 ms	7036 KB	Output is correct
5	Correct	1 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	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	5 ms	4436 KB	Output is correct
12	Correct	4 ms	4564 KB	Output is correct
13	Correct	5 ms	4508 KB	Output is correct
14	Correct	4 ms	4248 KB	Output is correct
15	Correct	4 ms	4548 KB	Output is correct
16	Correct	4 ms	4544 KB	Output is correct
17	Correct	32 ms	6968 KB	Output is correct
18	Correct	43 ms	7036 KB	Output is correct
19	Correct	36 ms	7104 KB	Output is correct
20	Correct	32 ms	7200 KB	Output is correct
21	Correct	33 ms	7284 KB	Output is correct
22	Correct	33 ms	7288 KB	Output is correct
23	Correct	30 ms	6964 KB	Output is correct
24	Correct	30 ms	7060 KB	Output is correct
25	Correct	31 ms	7288 KB	Output is correct
26	Correct	40 ms	7012 KB	Output is correct
27	Correct	30 ms	7060 KB	Output is correct
28	Correct	30 ms	7252 KB	Output is correct
29	Correct	4 ms	4180 KB	Output is correct
30	Correct	4 ms	4540 KB	Output is correct
31	Correct	4 ms	4312 KB	Output is correct
32	Correct	4 ms	4564 KB	Output is correct
33	Correct	4 ms	4564 KB	Output is correct
34	Correct	4 ms	4540 KB	Output is correct
35	Correct	1 ms	212 KB	Output is correct
36	Correct	32 ms	6624 KB	Output is correct
37	Correct	32 ms	7032 KB	Output is correct
38	Correct	32 ms	7060 KB	Output is correct
39	Correct	32 ms	7308 KB	Output is correct
40	Correct	32 ms	7428 KB	Output is correct
41	Correct	4 ms	4612 KB	Output is correct
42	Correct	32 ms	7060 KB	Output is correct
43	Correct	34 ms	7292 KB	Output is correct
44	Correct	30 ms	7292 KB	Output is correct
45	Correct	31 ms	7060 KB	Output is correct
46	Correct	29 ms	7240 KB	Output is correct
47	Correct	32 ms	7304 KB	Output is correct

Submission #609822

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