Submission #911166

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
911166	2024-01-18T14:09:45 Z	oblantis	Mutating DNA (IOI21_dna)	C++17	100 / 100	35 ms	6324 KB

#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#pragma GCC optimize("O3,unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define all(v) v.begin(), v.end()
#define pb push_back
#define ss second
#define ff first
#define vt vector
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int, int> pii;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
const int inf = 1e9;
const int mod = 1e9+7;
const int maxn = 1e5 + 1;
#include "dna.h"
int n;
int p[6][maxn];
void init(string a, string b) {
	n = a.size();
	for(int i = 0; i < n; i++){
		if(a[i] == b[i]){
			if(i)for(int j = 0; j < 6; j++)p[j][i] += p[j][i - 1];
			continue;
		}
		int ok = (a[i] > b[i]), x = 0;
		if(ok)swap(a[i], b[i]);
		if(b[i] == 'T' && a[i] == 'A')swap(a[i], b[i]);
		if(a[i] == 'C')x = 2;
		if(a[i] == 'T')x = 4;
		x += ok;
		p[x][i]++;
		if(i)for(int j = 0; j < 6; j++)p[j][i] += p[j][i - 1];
	}
}

int get_distance(int x, int y) {
	int ret = 0;
	int a[6], b[6];
	for(int j = 0; j < 6; j++)a[j] = p[j][y];
	if(x)for(int j = 0; j < 6; j++)a[j] -= p[j][x - 1];
	for(int j = 0; j < 6; j++){
		if(j % 2)b[j] = max(a[j] - a[j - 1], 0);
		else b[j] = max(a[j] - a[j + 1], 0);
	}
	ret += min(a[0], a[1]) + min(a[2], a[3]) + min(a[4], a[5]);
	swap(b[5], b[4]);
	if(b[0] == b[2] && b[2] == b[4])ret += b[0] * 2;
	else return -1;
	if(b[1] == b[3] && b[3] == b[5])ret += b[1] * 2;
	else return -1;
	return ret;
}

//void solve() {
	//int n, q;
	//string a, b;
	//cin >> n >> q >> a >> b;
	//init(a, b);
	//while(q--){
		//int l, r;
		//cin >> l >> r;
		//cout << get_distance(l, r) << '\n';
	//}
//}
//int main() {
	//ios_base::sync_with_stdio(0);
	//cin.tie(0);
	//int times = 1;
	////cin >> times;
	//for(int i = 1; i <= times; i++) {
		//solve();
	//}
	//return 0;
//}

Subtask #1
21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	26 ms	5908 KB	Output is correct
2	Correct	28 ms	5904 KB	Output is correct
3	Correct	26 ms	5676 KB	Output is correct
4	Correct	29 ms	5900 KB	Output is correct
5	Correct	1 ms	2648 KB	Output is correct
6	Correct	1 ms	2396 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct

Subtask #2
22.0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	3 ms	3420 KB	Output is correct
5	Correct	3 ms	3416 KB	Output is correct
6	Correct	3 ms	3420 KB	Output is correct
7	Correct	3 ms	3420 KB	Output is correct
8	Correct	2 ms	3420 KB	Output is correct
9	Correct	3 ms	3420 KB	Output is correct

Subtask #3
13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	3 ms	3420 KB	Output is correct
5	Correct	3 ms	3416 KB	Output is correct
6	Correct	3 ms	3420 KB	Output is correct
7	Correct	3 ms	3420 KB	Output is correct
8	Correct	2 ms	3420 KB	Output is correct
9	Correct	3 ms	3420 KB	Output is correct
10	Correct	26 ms	5972 KB	Output is correct
11	Correct	27 ms	6088 KB	Output is correct
12	Correct	29 ms	6056 KB	Output is correct
13	Correct	27 ms	6324 KB	Output is correct
14	Correct	27 ms	6168 KB	Output is correct
15	Correct	26 ms	6168 KB	Output is correct
16	Correct	26 ms	6100 KB	Output is correct
17	Correct	26 ms	6172 KB	Output is correct
18	Correct	27 ms	6168 KB	Output is correct
19	Correct	35 ms	6060 KB	Output is correct
20	Correct	26 ms	6172 KB	Output is correct
21	Correct	26 ms	6156 KB	Output is correct

Subtask #4
28.0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	3 ms	3420 KB	Output is correct
5	Correct	3 ms	3416 KB	Output is correct
6	Correct	3 ms	3420 KB	Output is correct
7	Correct	3 ms	3420 KB	Output is correct
8	Correct	2 ms	3420 KB	Output is correct
9	Correct	3 ms	3420 KB	Output is correct
10	Correct	3 ms	3416 KB	Output is correct
11	Correct	3 ms	3524 KB	Output is correct
12	Correct	3 ms	3420 KB	Output is correct
13	Correct	3 ms	3420 KB	Output is correct
14	Correct	3 ms	3564 KB	Output is correct
15	Correct	3 ms	3420 KB	Output is correct

Subtask #5
16.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	26 ms	5908 KB	Output is correct
2	Correct	28 ms	5904 KB	Output is correct
3	Correct	26 ms	5676 KB	Output is correct
4	Correct	29 ms	5900 KB	Output is correct
5	Correct	1 ms	2648 KB	Output is correct
6	Correct	1 ms	2396 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	1 ms	2396 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	3 ms	3420 KB	Output is correct
12	Correct	3 ms	3416 KB	Output is correct
13	Correct	3 ms	3420 KB	Output is correct
14	Correct	3 ms	3420 KB	Output is correct
15	Correct	2 ms	3420 KB	Output is correct
16	Correct	3 ms	3420 KB	Output is correct
17	Correct	26 ms	5972 KB	Output is correct
18	Correct	27 ms	6088 KB	Output is correct
19	Correct	29 ms	6056 KB	Output is correct
20	Correct	27 ms	6324 KB	Output is correct
21	Correct	27 ms	6168 KB	Output is correct
22	Correct	26 ms	6168 KB	Output is correct
23	Correct	26 ms	6100 KB	Output is correct
24	Correct	26 ms	6172 KB	Output is correct
25	Correct	27 ms	6168 KB	Output is correct
26	Correct	35 ms	6060 KB	Output is correct
27	Correct	26 ms	6172 KB	Output is correct
28	Correct	26 ms	6156 KB	Output is correct
29	Correct	3 ms	3416 KB	Output is correct
30	Correct	3 ms	3524 KB	Output is correct
31	Correct	3 ms	3420 KB	Output is correct
32	Correct	3 ms	3420 KB	Output is correct
33	Correct	3 ms	3564 KB	Output is correct
34	Correct	3 ms	3420 KB	Output is correct
35	Correct	1 ms	2392 KB	Output is correct
36	Correct	26 ms	5676 KB	Output is correct
37	Correct	26 ms	5904 KB	Output is correct
38	Correct	27 ms	6112 KB	Output is correct
39	Correct	28 ms	6308 KB	Output is correct
40	Correct	33 ms	6140 KB	Output is correct
41	Correct	3 ms	3420 KB	Output is correct
42	Correct	27 ms	6196 KB	Output is correct
43	Correct	27 ms	6252 KB	Output is correct
44	Correct	31 ms	6140 KB	Output is correct
45	Correct	26 ms	6168 KB	Output is correct
46	Correct	26 ms	6168 KB	Output is correct
47	Correct	26 ms	6228 KB	Output is correct

Submission #911166

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