# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
461065 |
2021-08-09T12:08:16 Z |
mtxas |
Mutating DNA (IOI21_dna) |
C++17 |
|
53 ms |
7232 KB |
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <string>
#include <deque>
#include <cstring>
#include <math.h>
#include <iomanip>
#include <unordered_map>
#include <map>
#include <queue>
#include <stack>
#include <climits>
#include <bitset>
#include <dna.h>
/****************************************************************************
MACROS
****************************************************************************/
#define ll long long
#define vi vector<int>
#define pb push_back
#define fi first
#define se second
#define _for(a, b, c) for(int (a) = (b); (a) < (c); ++(a))
#define _foreq(a, b, c) for(int (a) = (b); (a) <= (c); ++(a))
#define _forn(a, b, c) for(int (a) = (b); (a) > (c); (a)--)
#define _forneq(a, b, c) for(int (a) = (b); (a) >= (c); (a)--)
#define turbo() cin.tie(NULL); cout.tie(NULL); ios_base::sync_with_stdio(false)
#define _fre() freopen("input.txt", "r", stdin)
#define sz(x) ((int)x.size())
#define all(a) a.begin(), a.end()
#define PI 3.141592654
#define mem(x, val) memset(x, val, sizeof(x))
#define pii pair<int, int>
#define mii map<int, int>
using namespace std;
/****************************************************************************
STRUCTS
****************************************************************************/
/****************************************************************************
VARIABLES
****************************************************************************/
const int maxn = 1e5+1;
int sbb[maxn], sba[maxn], sbc[maxn];
int sab[maxn], saa[maxn], sac[maxn];
int ab[maxn], ba[maxn], ac[maxn], ca[maxn], bc[maxn], cb[maxn];
/****************************************************************************
FUNCTIONS
****************************************************************************/
/****************************************************************************
MAIN
****************************************************************************/
void init(string a, string b){
a = ' ' + a; b = ' ' + b; int n = sz(a) -1 ;
_foreq(i, 1, n){
if(a[i] == 'T') a[i] = 'B';
if(b[i] == 'T') b[i] = 'B';
}
_foreq(i, 1, n){
sbb[i] = sbb[i-1] + (b[i] == 'B');
sba[i] = sba[i-1] + (b[i] == 'A');
sbc[i] = sbc[i-1] + (b[i] == 'C');
sab[i] = sab[i-1] + (a[i] == 'B');
saa[i] = saa[i-1] + (a[i] == 'A');
sac[i] = sac[i-1] + (a[i] == 'C');
}
_foreq(i, 1, n){
ab[i] = ab[i-1] + (a[i] == 'A' && b[i] == 'B');
ba[i] = ba[i-1] + (a[i] == 'B' && b[i] == 'A');
ac[i] = ac[i-1] + (a[i] == 'A' && b[i] == 'C');
ca[i] = ca[i-1] + (a[i] == 'C' && b[i] == 'A');
bc[i] = bc[i-1] + (a[i] == 'B' && b[i] == 'C');
cb[i] = cb[i-1] + (a[i] == 'C' && b[i] == 'B');
}
}
int get_distance(int x, int y){
x++; y++;
int ans = 0;
bool pos = 1;
pos &= (sab[y] - sab[x-1] == sbb[y] - sbb[x-1]);
pos &= (saa[y] - saa[x-1] == sba[y] - sba[x-1]);
pos &= (sac[y] - sac[x-1] == sbc[y] - sbc[x-1]);
if(!pos) return -1;
int abps = min(ab[y] - ab[x-1], ba[y] - ba[x-1]);
int bcps = min(bc[y] - bc[x-1], cb[y] - cb[x-1]);
int acps = min(ac[y] - ac[x-1], ca[y] - ca[x-1]);
ans += abps + bcps + acps;
int ovr = max(ab[y] - ab[x-1] - abps, ba[y] - ba[x-1] - abps);
ans += (ovr<<1);
return ans;
}
Compilation message
dna.cpp: In function 'void init(std::string, std::string)':
dna.cpp:26:33: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
26 | #define _foreq(a, b, c) for(int (a) = (b); (a) <= (c); ++(a))
| ^
dna.cpp:58:5: note: in expansion of macro '_foreq'
58 | _foreq(i, 1, n){
| ^~~~~~
dna.cpp:26:33: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
26 | #define _foreq(a, b, c) for(int (a) = (b); (a) <= (c); ++(a))
| ^
dna.cpp:62:5: note: in expansion of macro '_foreq'
62 | _foreq(i, 1, n){
| ^~~~~~
dna.cpp:26:33: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
26 | #define _foreq(a, b, c) for(int (a) = (b); (a) <= (c); ++(a))
| ^
dna.cpp:70:5: note: in expansion of macro '_foreq'
70 | _foreq(i, 1, n){
| ^~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
52 ms |
6816 KB |
Output is correct |
2 |
Correct |
41 ms |
6816 KB |
Output is correct |
3 |
Correct |
41 ms |
6376 KB |
Output is correct |
4 |
Correct |
42 ms |
6816 KB |
Output is correct |
5 |
Correct |
1 ms |
332 KB |
Output is correct |
6 |
Correct |
0 ms |
332 KB |
Output is correct |
7 |
Correct |
0 ms |
332 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
332 KB |
Output is correct |
2 |
Correct |
0 ms |
332 KB |
Output is correct |
3 |
Correct |
1 ms |
332 KB |
Output is correct |
4 |
Correct |
7 ms |
5580 KB |
Output is correct |
5 |
Correct |
6 ms |
5580 KB |
Output is correct |
6 |
Correct |
7 ms |
5580 KB |
Output is correct |
7 |
Correct |
6 ms |
5324 KB |
Output is correct |
8 |
Correct |
7 ms |
5580 KB |
Output is correct |
9 |
Correct |
5 ms |
5580 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
332 KB |
Output is correct |
2 |
Correct |
0 ms |
332 KB |
Output is correct |
3 |
Correct |
1 ms |
332 KB |
Output is correct |
4 |
Correct |
7 ms |
5580 KB |
Output is correct |
5 |
Correct |
6 ms |
5580 KB |
Output is correct |
6 |
Correct |
7 ms |
5580 KB |
Output is correct |
7 |
Correct |
6 ms |
5324 KB |
Output is correct |
8 |
Correct |
7 ms |
5580 KB |
Output is correct |
9 |
Correct |
5 ms |
5580 KB |
Output is correct |
10 |
Correct |
46 ms |
6820 KB |
Output is correct |
11 |
Correct |
44 ms |
6844 KB |
Output is correct |
12 |
Correct |
53 ms |
6864 KB |
Output is correct |
13 |
Correct |
45 ms |
7052 KB |
Output is correct |
14 |
Correct |
43 ms |
7196 KB |
Output is correct |
15 |
Correct |
42 ms |
7072 KB |
Output is correct |
16 |
Correct |
39 ms |
6808 KB |
Output is correct |
17 |
Correct |
40 ms |
6956 KB |
Output is correct |
18 |
Correct |
42 ms |
7232 KB |
Output is correct |
19 |
Correct |
38 ms |
6928 KB |
Output is correct |
20 |
Correct |
43 ms |
7068 KB |
Output is correct |
21 |
Correct |
39 ms |
7188 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
332 KB |
Output is correct |
2 |
Correct |
0 ms |
332 KB |
Output is correct |
3 |
Correct |
1 ms |
332 KB |
Output is correct |
4 |
Correct |
7 ms |
5580 KB |
Output is correct |
5 |
Correct |
6 ms |
5580 KB |
Output is correct |
6 |
Correct |
7 ms |
5580 KB |
Output is correct |
7 |
Correct |
6 ms |
5324 KB |
Output is correct |
8 |
Correct |
7 ms |
5580 KB |
Output is correct |
9 |
Correct |
5 ms |
5580 KB |
Output is correct |
10 |
Correct |
6 ms |
5196 KB |
Output is correct |
11 |
Correct |
6 ms |
5580 KB |
Output is correct |
12 |
Correct |
6 ms |
5324 KB |
Output is correct |
13 |
Correct |
6 ms |
5580 KB |
Output is correct |
14 |
Correct |
6 ms |
5580 KB |
Output is correct |
15 |
Correct |
5 ms |
5580 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
52 ms |
6816 KB |
Output is correct |
2 |
Correct |
41 ms |
6816 KB |
Output is correct |
3 |
Correct |
41 ms |
6376 KB |
Output is correct |
4 |
Correct |
42 ms |
6816 KB |
Output is correct |
5 |
Correct |
1 ms |
332 KB |
Output is correct |
6 |
Correct |
0 ms |
332 KB |
Output is correct |
7 |
Correct |
0 ms |
332 KB |
Output is correct |
8 |
Correct |
1 ms |
332 KB |
Output is correct |
9 |
Correct |
0 ms |
332 KB |
Output is correct |
10 |
Correct |
1 ms |
332 KB |
Output is correct |
11 |
Correct |
7 ms |
5580 KB |
Output is correct |
12 |
Correct |
6 ms |
5580 KB |
Output is correct |
13 |
Correct |
7 ms |
5580 KB |
Output is correct |
14 |
Correct |
6 ms |
5324 KB |
Output is correct |
15 |
Correct |
7 ms |
5580 KB |
Output is correct |
16 |
Correct |
5 ms |
5580 KB |
Output is correct |
17 |
Correct |
46 ms |
6820 KB |
Output is correct |
18 |
Correct |
44 ms |
6844 KB |
Output is correct |
19 |
Correct |
53 ms |
6864 KB |
Output is correct |
20 |
Correct |
45 ms |
7052 KB |
Output is correct |
21 |
Correct |
43 ms |
7196 KB |
Output is correct |
22 |
Correct |
42 ms |
7072 KB |
Output is correct |
23 |
Correct |
39 ms |
6808 KB |
Output is correct |
24 |
Correct |
40 ms |
6956 KB |
Output is correct |
25 |
Correct |
42 ms |
7232 KB |
Output is correct |
26 |
Correct |
38 ms |
6928 KB |
Output is correct |
27 |
Correct |
43 ms |
7068 KB |
Output is correct |
28 |
Correct |
39 ms |
7188 KB |
Output is correct |
29 |
Correct |
6 ms |
5196 KB |
Output is correct |
30 |
Correct |
6 ms |
5580 KB |
Output is correct |
31 |
Correct |
6 ms |
5324 KB |
Output is correct |
32 |
Correct |
6 ms |
5580 KB |
Output is correct |
33 |
Correct |
6 ms |
5580 KB |
Output is correct |
34 |
Correct |
5 ms |
5580 KB |
Output is correct |
35 |
Correct |
0 ms |
332 KB |
Output is correct |
36 |
Correct |
42 ms |
6472 KB |
Output is correct |
37 |
Correct |
43 ms |
6972 KB |
Output is correct |
38 |
Correct |
44 ms |
6960 KB |
Output is correct |
39 |
Correct |
43 ms |
7200 KB |
Output is correct |
40 |
Correct |
44 ms |
7152 KB |
Output is correct |
41 |
Correct |
6 ms |
5580 KB |
Output is correct |
42 |
Correct |
52 ms |
6928 KB |
Output is correct |
43 |
Correct |
40 ms |
7204 KB |
Output is correct |
44 |
Correct |
39 ms |
7200 KB |
Output is correct |
45 |
Correct |
37 ms |
7012 KB |
Output is correct |
46 |
Correct |
42 ms |
7172 KB |
Output is correct |
47 |
Correct |
38 ms |
7200 KB |
Output is correct |