# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
952333 |
2024-03-23T14:31:22 Z |
wood |
Mutating DNA (IOI21_dna) |
C++17 |
|
26 ms |
5980 KB |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p32;
typedef pair<ll, ll> p64;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define fast_cin() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define MOD %1000000007
vector<ll> pref_b;
vector<ll> pref_a;
vector<ll> matchpref;
void init(string a, string b) {
ll n = a.size();
pref_a.resize(n+1);
pref_b.resize(n+1);
matchpref.resize(n+1);
for (size_t i = 0; i < a.size(); i++) {
pref_a[i + 1] = pref_a[i] + (a[i] == 'A');
pref_b[i + 1] = pref_b[i] + (b[i] == 'A');
matchpref[i + 1] = matchpref[i]+((a[i] == 'A') && (b[i] == 'T'));
}
}
ll get_distance(int x, int y) {
if (pref_a[y + 1] - pref_a[x] != pref_b[y + 1] - pref_b[x]) {
return -1;
}
else return (matchpref[y + 1] - matchpref[x]);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
23 ms |
4632 KB |
Output is correct |
2 |
Correct |
24 ms |
5316 KB |
Output is correct |
3 |
Incorrect |
24 ms |
4900 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
600 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
2 ms |
3164 KB |
Output is correct |
5 |
Correct |
3 ms |
3420 KB |
Output is correct |
6 |
Correct |
2 ms |
3264 KB |
Output is correct |
7 |
Correct |
3 ms |
3420 KB |
Output is correct |
8 |
Correct |
3 ms |
3420 KB |
Output is correct |
9 |
Correct |
2 ms |
3420 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
600 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
2 ms |
3164 KB |
Output is correct |
5 |
Correct |
3 ms |
3420 KB |
Output is correct |
6 |
Correct |
2 ms |
3264 KB |
Output is correct |
7 |
Correct |
3 ms |
3420 KB |
Output is correct |
8 |
Correct |
3 ms |
3420 KB |
Output is correct |
9 |
Correct |
2 ms |
3420 KB |
Output is correct |
10 |
Correct |
23 ms |
5204 KB |
Output is correct |
11 |
Correct |
23 ms |
5424 KB |
Output is correct |
12 |
Correct |
24 ms |
5516 KB |
Output is correct |
13 |
Correct |
24 ms |
5656 KB |
Output is correct |
14 |
Correct |
25 ms |
5908 KB |
Output is correct |
15 |
Correct |
24 ms |
4944 KB |
Output is correct |
16 |
Correct |
23 ms |
5660 KB |
Output is correct |
17 |
Correct |
23 ms |
5228 KB |
Output is correct |
18 |
Correct |
26 ms |
5716 KB |
Output is correct |
19 |
Correct |
23 ms |
5980 KB |
Output is correct |
20 |
Correct |
23 ms |
5428 KB |
Output is correct |
21 |
Correct |
23 ms |
5896 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
600 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
2 ms |
3164 KB |
Output is correct |
5 |
Correct |
3 ms |
3420 KB |
Output is correct |
6 |
Correct |
2 ms |
3264 KB |
Output is correct |
7 |
Correct |
3 ms |
3420 KB |
Output is correct |
8 |
Correct |
3 ms |
3420 KB |
Output is correct |
9 |
Correct |
2 ms |
3420 KB |
Output is correct |
10 |
Incorrect |
3 ms |
3164 KB |
Output isn't correct |
11 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
23 ms |
4632 KB |
Output is correct |
2 |
Correct |
24 ms |
5316 KB |
Output is correct |
3 |
Incorrect |
24 ms |
4900 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |