#include <bits/stdc++.h>
#include <fstream>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
struct custom_hash {static uint64_t splitmix64(uint64_t x) {x += 0x9e3779b97f4a7c15;x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;x = (x ^ (x >> 27)) * 0x94d049bb133111eb;return x ^ (x >> 31);}size_t operator()(uint64_t x) const {static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();return splitmix64(x + FIXED_RANDOM);}};
// string __fname = ""; ifstream in (__fname + ".in"); ofstream out (__fname + ".out");
// #define cin in
// #define cout out
#define int64 long long
#define uint64 unsigned long long
#define x first
#define y second
#define pb push_back
#define pii pair <int, int>
#define pii64 pair <int64, int64>
#define db(x) cout << "> " << #x << ": " << (x) << "\n"
#define qr queries()
#define yn(x) if (x) {ctn("Yes");}else {ctn("No");}
void solve(int);
void queries(){int n;cin >> n;for (int i = 1; i <= n; i++) solve(i);}
template<class T>T ceildiv(T a, T b) {return a / b + !!(a % b);}
template<class T>T gcd (T a, T b){return (b ? gcd(b, a % b): a);}
template<class T>T lcm (T a, T b){return a * b / gcd(a, b);}
// // // // // // // // // // // // // // // // // // // // // //
/* TEMPLATE - VANILLA */
// // // // // // // // // // // // // // // // // // // // // //
const int ddx[] = {-1, -1, 0, 1, 1, 1, 0, -1};
const int ddy[] = {0, 1, 1, 1, 0, -1, -1, -1};
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
const double pi = 3.14159265359;
const double eps = 1e-6;
const int64 hash_inv = 940594066;
const int64 hash_p = 101;
const int64 mod = 1e9 + 7;
const int maxn = 2e5 + 2;
string base = "ACT";
int pref_a [maxn][3];
int pref_b [maxn][3];
int pref [maxn][3][3];
int diff [maxn];
int n;
void solve(int id){
return;
}
void init (string a, string b) {
n = a.size();
for (int i = 1; i <= n; i++){
for (int j = 0; j < 3; j++){
pref_a[i][j] = pref_a[i-1][j] + (a[i-1] == base[j]);
pref_b[i][j] = pref_b[i-1][j] + (b[i-1] == base[j]);
for (int k = 0; k < 3; k++){
pref[i][j][k] = pref[i-1][j][k] + (a[i-1] == base[j] && b[i-1] == base[k]);
}
}
}
}
int get_distance(int x, int y) {
x++;
y++;
for (int i = 0; i < 3; i++){
if (pref_a[y][i] - pref_a[x-1][i] != pref_b[y][i] - pref_b[x-1][i])
return -1;
}
int rs = 0, oth = 0;
for (int i = 0; i < 3; i++){
for (int j = i + 1; j < 3; j++){
int n1 = pref[y][i][j] - pref[x-1][i][j];
int n2 = pref[y][j][i] - pref[x-1][j][i];
if (n1 < n2) swap(n1, n2);
rs+=n2;
oth+= n1 - n2;
}
}
return rs + oth / 3 * 2;
}
// int main(){
// ios_base::sync_with_stdio(0); cin.tie(0); cout << fixed; cout << setprecision(10);
// init("ACATACAT", "CAACTATA");
// cout << get_distance(1, 6);
// // init("ACTC", "CACT");
// // cout << get_distance(1, 4);
// return 0;
// }
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
41 ms |
7948 KB |
Output is correct |
2 |
Correct |
43 ms |
9184 KB |
Output is correct |
3 |
Correct |
35 ms |
8580 KB |
Output is correct |
4 |
Correct |
37 ms |
9196 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
6 ms |
6868 KB |
Output is correct |
5 |
Correct |
6 ms |
6972 KB |
Output is correct |
6 |
Correct |
7 ms |
6868 KB |
Output is correct |
7 |
Correct |
7 ms |
6468 KB |
Output is correct |
8 |
Correct |
6 ms |
6868 KB |
Output is correct |
9 |
Correct |
6 ms |
6960 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
6 ms |
6868 KB |
Output is correct |
5 |
Correct |
6 ms |
6972 KB |
Output is correct |
6 |
Correct |
7 ms |
6868 KB |
Output is correct |
7 |
Correct |
7 ms |
6468 KB |
Output is correct |
8 |
Correct |
6 ms |
6868 KB |
Output is correct |
9 |
Correct |
6 ms |
6960 KB |
Output is correct |
10 |
Correct |
40 ms |
9092 KB |
Output is correct |
11 |
Correct |
35 ms |
9268 KB |
Output is correct |
12 |
Correct |
38 ms |
9128 KB |
Output is correct |
13 |
Correct |
40 ms |
9276 KB |
Output is correct |
14 |
Correct |
38 ms |
9548 KB |
Output is correct |
15 |
Correct |
38 ms |
9480 KB |
Output is correct |
16 |
Correct |
33 ms |
9124 KB |
Output is correct |
17 |
Correct |
39 ms |
9256 KB |
Output is correct |
18 |
Correct |
34 ms |
9580 KB |
Output is correct |
19 |
Correct |
40 ms |
9080 KB |
Output is correct |
20 |
Correct |
34 ms |
9244 KB |
Output is correct |
21 |
Correct |
34 ms |
9596 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
6 ms |
6868 KB |
Output is correct |
5 |
Correct |
6 ms |
6972 KB |
Output is correct |
6 |
Correct |
7 ms |
6868 KB |
Output is correct |
7 |
Correct |
7 ms |
6468 KB |
Output is correct |
8 |
Correct |
6 ms |
6868 KB |
Output is correct |
9 |
Correct |
6 ms |
6960 KB |
Output is correct |
10 |
Correct |
7 ms |
6356 KB |
Output is correct |
11 |
Correct |
7 ms |
6928 KB |
Output is correct |
12 |
Correct |
6 ms |
6484 KB |
Output is correct |
13 |
Correct |
7 ms |
6928 KB |
Output is correct |
14 |
Correct |
7 ms |
6928 KB |
Output is correct |
15 |
Correct |
9 ms |
6876 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
41 ms |
7948 KB |
Output is correct |
2 |
Correct |
43 ms |
9184 KB |
Output is correct |
3 |
Correct |
35 ms |
8580 KB |
Output is correct |
4 |
Correct |
37 ms |
9196 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
1 ms |
212 KB |
Output is correct |
9 |
Correct |
1 ms |
212 KB |
Output is correct |
10 |
Correct |
1 ms |
212 KB |
Output is correct |
11 |
Correct |
6 ms |
6868 KB |
Output is correct |
12 |
Correct |
6 ms |
6972 KB |
Output is correct |
13 |
Correct |
7 ms |
6868 KB |
Output is correct |
14 |
Correct |
7 ms |
6468 KB |
Output is correct |
15 |
Correct |
6 ms |
6868 KB |
Output is correct |
16 |
Correct |
6 ms |
6960 KB |
Output is correct |
17 |
Correct |
40 ms |
9092 KB |
Output is correct |
18 |
Correct |
35 ms |
9268 KB |
Output is correct |
19 |
Correct |
38 ms |
9128 KB |
Output is correct |
20 |
Correct |
40 ms |
9276 KB |
Output is correct |
21 |
Correct |
38 ms |
9548 KB |
Output is correct |
22 |
Correct |
38 ms |
9480 KB |
Output is correct |
23 |
Correct |
33 ms |
9124 KB |
Output is correct |
24 |
Correct |
39 ms |
9256 KB |
Output is correct |
25 |
Correct |
34 ms |
9580 KB |
Output is correct |
26 |
Correct |
40 ms |
9080 KB |
Output is correct |
27 |
Correct |
34 ms |
9244 KB |
Output is correct |
28 |
Correct |
34 ms |
9596 KB |
Output is correct |
29 |
Correct |
7 ms |
6356 KB |
Output is correct |
30 |
Correct |
7 ms |
6928 KB |
Output is correct |
31 |
Correct |
6 ms |
6484 KB |
Output is correct |
32 |
Correct |
7 ms |
6928 KB |
Output is correct |
33 |
Correct |
7 ms |
6928 KB |
Output is correct |
34 |
Correct |
9 ms |
6876 KB |
Output is correct |
35 |
Correct |
1 ms |
308 KB |
Output is correct |
36 |
Correct |
36 ms |
8592 KB |
Output is correct |
37 |
Correct |
37 ms |
9220 KB |
Output is correct |
38 |
Correct |
38 ms |
9128 KB |
Output is correct |
39 |
Correct |
52 ms |
9512 KB |
Output is correct |
40 |
Correct |
38 ms |
9512 KB |
Output is correct |
41 |
Correct |
6 ms |
6868 KB |
Output is correct |
42 |
Correct |
48 ms |
9188 KB |
Output is correct |
43 |
Correct |
35 ms |
9552 KB |
Output is correct |
44 |
Correct |
38 ms |
9524 KB |
Output is correct |
45 |
Correct |
35 ms |
9140 KB |
Output is correct |
46 |
Correct |
35 ms |
9644 KB |
Output is correct |
47 |
Correct |
34 ms |
9520 KB |
Output is correct |