Submission #495652

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
495652	2021-12-19T19:14:11 Z	PedroBigMan	Mutating DNA (IOI21_dna)	C++17	100 / 100	60 ms	11180 KB

dna

/*
Author of all code: Pedro BIGMAN Dias
Last edit: 15/02/2021
*/
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#pragma GCC optimize("Ofast")
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <string>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <queue>
#include <deque>
#include <list>
#include <iomanip>
#include <stdlib.h>
#include <time.h>
#include <cstring>
#include "dna.h"
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
#define REP(i,a,b) for(ll i=(ll) a; i<(ll) b; i++)
#define pb push_back
#define mp make_pair
#define pl pair<ll,ll>
#define ff first
#define ss second
#define whole(x) x.begin(),x.end()
#define DEBUG(i) cout<<"Pedro Is The Master "<<i<<endl
#define INF 500000000LL
#define EPS 0.00000001
#define pi 3.14159
#define VV(vvvv,NNNN,xxxx); REP(i,0,NNNN) {vvvv.pb(xxxx);}
ll mod=1000000007LL;

template<class A=ll> 
void Out(vector<A> a) {REP(i,0,a.size()) {cout<<a[i]<<" ";} cout<<endl;}

template<class A=ll>
void In(vector<A> &a, ll N) {A cur; REP(i,0,N) {cin>>cur; a.pb(cur);}} 

vector<ll> ZAB, ZBA, ZAC, ZCA, ZBC, ZCB; ll N;
vector<ll> A,B,C;

void init(string a, string b) 
{
	N=a.size();
	ll curZAB=0LL,curZBA=0LL,curZAC=0LL,curZCA=0LL,curZBC=0LL,curZCB=0LL,difA=0LL, difB=0LL, difC=0LL;
	REP(i,0,N)
	{
		if(a[i]=='A' && b[i]=='T') {curZAB++;}
		else if(a[i]=='T' && b[i]=='A') {curZBA++;}
		else if(a[i]=='A' && b[i]=='C') {curZAC++;}
		else if(a[i]=='C' && b[i]=='A') {curZCA++;}
		else if(a[i]=='T' && b[i]=='C') {curZBC++;}
		else if(a[i]=='C' && b[i]=='T') {curZCB++;}
		if(a[i]=='A') {difA++;} else if(a[i]=='T') {difB++;} else {difC++;}
		if(b[i]=='A') {difA--;} else if(b[i]=='T') {difB--;} else {difC--;}
		ZAB.pb(curZAB); ZBA.pb(curZBA); ZAC.pb(curZAC); ZCA.pb(curZCA); ZBC.pb(curZBC); ZCB.pb(curZCB);
		A.pb(difA); B.pb(difB); C.pb(difC);
	}
}

ll psAB(ll l, ll r) {if(l==0) {return ZAB[r];} else {return (ZAB[r]-ZAB[l-1]);}}
ll psBA(ll l, ll r) {if(l==0) {return ZBA[r];} else {return (ZBA[r]-ZBA[l-1]);}}
ll psAC(ll l, ll r) {if(l==0) {return ZAC[r];} else {return (ZAC[r]-ZAC[l-1]);}}
ll psCA(ll l, ll r) {if(l==0) {return ZCA[r];} else {return (ZCA[r]-ZCA[l-1]);}}
ll psBC(ll l, ll r) {if(l==0) {return ZBC[r];} else {return (ZBC[r]-ZBC[l-1]);}}
ll psCB(ll l, ll r) {if(l==0) {return ZCB[r];} else {return (ZCB[r]-ZCB[l-1]);}}
ll psA(ll l, ll r) {if(l==0) {return A[r];} else {return (A[r]-A[l-1]);}}
ll psB(ll l, ll r) {if(l==0) {return B[r];} else {return (B[r]-B[l-1]);}}
ll psC(ll l, ll r) {if(l==0) {return C[r];} else {return (C[r]-C[l-1]);}}

int get_distance(int x, int y) 
{
	if(psA(x,y)!=0 || psB(x,y)!=0 || psC(x,y)!=0) {return -1;}
	return (2*max(psAB(x,y),psBA(x,y))-min(psAB(x,y),psBA(x,y))+min(psAC(x,y),psCA(x,y))+min(psBC(x,y),psCB(x,y)));
}

Compilation message

dna.cpp:5: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    5 | #pragma GCC optimization ("O3")
      | 
dna.cpp:6: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    6 | #pragma GCC optimization ("unroll-loops")
      |

Subtask #1

21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	45 ms	10624 KB	Output is correct
2	Correct	40 ms	10720 KB	Output is correct
3	Correct	39 ms	10068 KB	Output is correct
4	Correct	40 ms	10712 KB	Output is correct
5	Correct	0 ms	288 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	0 ms	288 KB	Output is correct

Subtask #2

22.0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	296 KB	Output is correct
4	Correct	12 ms	8080 KB	Output is correct
5	Correct	12 ms	8300 KB	Output is correct
6	Correct	11 ms	8240 KB	Output is correct
7	Correct	11 ms	7724 KB	Output is correct
8	Correct	10 ms	8232 KB	Output is correct
9	Correct	13 ms	8228 KB	Output is correct

Subtask #3

13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	296 KB	Output is correct
4	Correct	12 ms	8080 KB	Output is correct
5	Correct	12 ms	8300 KB	Output is correct
6	Correct	11 ms	8240 KB	Output is correct
7	Correct	11 ms	7724 KB	Output is correct
8	Correct	10 ms	8232 KB	Output is correct
9	Correct	13 ms	8228 KB	Output is correct
10	Correct	44 ms	10604 KB	Output is correct
11	Correct	43 ms	10752 KB	Output is correct
12	Correct	43 ms	10536 KB	Output is correct
13	Correct	42 ms	10792 KB	Output is correct
14	Correct	59 ms	11144 KB	Output is correct
15	Correct	40 ms	11048 KB	Output is correct
16	Correct	38 ms	10408 KB	Output is correct
17	Correct	41 ms	10664 KB	Output is correct
18	Correct	37 ms	11044 KB	Output is correct
19	Correct	39 ms	10508 KB	Output is correct
20	Correct	39 ms	10696 KB	Output is correct
21	Correct	37 ms	11080 KB	Output is correct

Subtask #4

28.0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	296 KB	Output is correct
4	Correct	12 ms	8080 KB	Output is correct
5	Correct	12 ms	8300 KB	Output is correct
6	Correct	11 ms	8240 KB	Output is correct
7	Correct	11 ms	7724 KB	Output is correct
8	Correct	10 ms	8232 KB	Output is correct
9	Correct	13 ms	8228 KB	Output is correct
10	Correct	10 ms	7588 KB	Output is correct
11	Correct	11 ms	8204 KB	Output is correct
12	Correct	12 ms	7724 KB	Output is correct
13	Correct	13 ms	8232 KB	Output is correct
14	Correct	11 ms	8220 KB	Output is correct
15	Correct	10 ms	8232 KB	Output is correct

Subtask #5

16.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	45 ms	10624 KB	Output is correct
2	Correct	40 ms	10720 KB	Output is correct
3	Correct	39 ms	10068 KB	Output is correct
4	Correct	40 ms	10712 KB	Output is correct
5	Correct	0 ms	288 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	0 ms	288 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	0 ms	296 KB	Output is correct
11	Correct	12 ms	8080 KB	Output is correct
12	Correct	12 ms	8300 KB	Output is correct
13	Correct	11 ms	8240 KB	Output is correct
14	Correct	11 ms	7724 KB	Output is correct
15	Correct	10 ms	8232 KB	Output is correct
16	Correct	13 ms	8228 KB	Output is correct
17	Correct	44 ms	10604 KB	Output is correct
18	Correct	43 ms	10752 KB	Output is correct
19	Correct	43 ms	10536 KB	Output is correct
20	Correct	42 ms	10792 KB	Output is correct
21	Correct	59 ms	11144 KB	Output is correct
22	Correct	40 ms	11048 KB	Output is correct
23	Correct	38 ms	10408 KB	Output is correct
24	Correct	41 ms	10664 KB	Output is correct
25	Correct	37 ms	11044 KB	Output is correct
26	Correct	39 ms	10508 KB	Output is correct
27	Correct	39 ms	10696 KB	Output is correct
28	Correct	37 ms	11080 KB	Output is correct
29	Correct	10 ms	7588 KB	Output is correct
30	Correct	11 ms	8204 KB	Output is correct
31	Correct	12 ms	7724 KB	Output is correct
32	Correct	13 ms	8232 KB	Output is correct
33	Correct	11 ms	8220 KB	Output is correct
34	Correct	10 ms	8232 KB	Output is correct
35	Correct	0 ms	216 KB	Output is correct
36	Correct	40 ms	10084 KB	Output is correct
37	Correct	41 ms	10764 KB	Output is correct
38	Correct	42 ms	10696 KB	Output is correct
39	Correct	52 ms	11180 KB	Output is correct
40	Correct	60 ms	11092 KB	Output is correct
41	Correct	9 ms	8192 KB	Output is correct
42	Correct	37 ms	10608 KB	Output is correct
43	Correct	38 ms	11012 KB	Output is correct
44	Correct	42 ms	11016 KB	Output is correct
45	Correct	37 ms	10528 KB	Output is correct
46	Correct	36 ms	11048 KB	Output is correct
47	Correct	37 ms	11000 KB	Output is correct