| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 953064 |
2024-03-25T11:43:17 Z |
KasymK |
Mutating DNA (IOI21_dna) |
C++17 |
|
33 ms |
3876 KB |
#include "dna.h"
#include "bits/stdc++.h"
using namespace std;
const int N = 1e5 + 5;
int p_a[N] = {0}, p_b[N] = {0}, p_bile[N] = {0};
// hemmesinin icini basda nollayas
void init(string a, string b){
int n = a.size();
for(int i = 0; i < n; ++i){
p_a[i + 1] = p_a[i];
p_b[i + 1] = p_b[i];
p_bile[i + 1] = p_bile[i];
if(a[i] == 'A')
p_a[i + 1]++;
if(b[i] == 'A')
p_b[i + 1]++;
if(a[i] == b[i])
p_bile[i + 1]++;
}
}
int get_distance(int x, int y){
int uz_a = p_a[y + 1] - p_a[x], uz_b = p_b[y + 1] - p_b[x];
int uz_bile = p_bile[y + 1] - p_bile[x];
if(uz_a != uz_b)
return -1;
else{
int ret = (y - x + 1 - uz_bile) >> 1;
return ret;
}
}
// int main(){
// cin >> n;
// string a, b;
// cin >> a >> b;
// init(a, b);
// int q;
// cin >> q;
// while(q--){
// int x, y;
// cin >> x >> y;
// int ans = get_distance(x, y);
// cout << ans << "\n";
// }
// return 0;
// }
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
24 ms |
3460 KB |
Output is correct |
| 2 |
Correct |
24 ms |
3348 KB |
Output is correct |
| 3 |
Incorrect |
25 ms |
3368 KB |
Output isn't correct |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
1 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
344 KB |
Output is correct |
| 4 |
Correct |
2 ms |
2140 KB |
Output is correct |
| 5 |
Correct |
2 ms |
2140 KB |
Output is correct |
| 6 |
Correct |
3 ms |
2140 KB |
Output is correct |
| 7 |
Correct |
3 ms |
1884 KB |
Output is correct |
| 8 |
Correct |
2 ms |
2140 KB |
Output is correct |
| 9 |
Correct |
2 ms |
2168 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
1 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
344 KB |
Output is correct |
| 4 |
Correct |
2 ms |
2140 KB |
Output is correct |
| 5 |
Correct |
2 ms |
2140 KB |
Output is correct |
| 6 |
Correct |
3 ms |
2140 KB |
Output is correct |
| 7 |
Correct |
3 ms |
1884 KB |
Output is correct |
| 8 |
Correct |
2 ms |
2140 KB |
Output is correct |
| 9 |
Correct |
2 ms |
2168 KB |
Output is correct |
| 10 |
Correct |
24 ms |
3356 KB |
Output is correct |
| 11 |
Correct |
24 ms |
3348 KB |
Output is correct |
| 12 |
Correct |
25 ms |
3624 KB |
Output is correct |
| 13 |
Correct |
33 ms |
3608 KB |
Output is correct |
| 14 |
Correct |
25 ms |
3876 KB |
Output is correct |
| 15 |
Correct |
33 ms |
3604 KB |
Output is correct |
| 16 |
Correct |
25 ms |
3612 KB |
Output is correct |
| 17 |
Correct |
25 ms |
3616 KB |
Output is correct |
| 18 |
Correct |
28 ms |
3860 KB |
Output is correct |
| 19 |
Correct |
24 ms |
3616 KB |
Output is correct |
| 20 |
Correct |
25 ms |
3604 KB |
Output is correct |
| 21 |
Correct |
29 ms |
3848 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
1 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
344 KB |
Output is correct |
| 4 |
Correct |
2 ms |
2140 KB |
Output is correct |
| 5 |
Correct |
2 ms |
2140 KB |
Output is correct |
| 6 |
Correct |
3 ms |
2140 KB |
Output is correct |
| 7 |
Correct |
3 ms |
1884 KB |
Output is correct |
| 8 |
Correct |
2 ms |
2140 KB |
Output is correct |
| 9 |
Correct |
2 ms |
2168 KB |
Output is correct |
| 10 |
Incorrect |
2 ms |
1884 KB |
Output isn't correct |
| 11 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
24 ms |
3460 KB |
Output is correct |
| 2 |
Correct |
24 ms |
3348 KB |
Output is correct |
| 3 |
Incorrect |
25 ms |
3368 KB |
Output isn't correct |
| 4 |
Halted |
0 ms |
0 KB |
- |
