oj.uz

답안 #639753

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
639753 2022-09-11T13:49:40 Z ghostwriter DNA 돌연변이 (IOI21_dna) C++17
100 / 100
 49 ms 7420 KB 
#include "dna.h"
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <debug.h>
#include "grader.cpp"
#endif
#define st first
#define nd second
#define pb push_back
#define pf push_front
#define _pb pop_back
#define _pf pop_front
#define lb lower_bound
#define ub upper_bound
#define mtp make_tuple
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
typedef long long ll; typedef unsigned long long ull;
typedef double db; typedef long double ldb;
typedef pair<int, int> pi; typedef pair<ll, ll> pll;
typedef vector<int> vi; typedef vector<ll> vll; typedef vector<pi> vpi; typedef vector<pll> vpll;
typedef string str;
template<typename T> T gcd(T a, T b) { return (b == 0? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
#define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
#define FOS(i, r, l) for (int (i) = (r); (i) >= (l); --(i))
#define EACH(i, x) for (auto &(i) : (x))
#define WHILE while
#define file "TEST"
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
ll rand(ll l, ll r) { return uniform_int_distribution<ll>(l, r)(rd); }
/*
    Tran The Bao
    CTL - Da Lat
    Cay ngay cay dem nhung deo duoc cong nhan
*/
const int N = 1e5 + 5;
#define getid(x) (x == 'A'? 0 : x == 'T'? 1 : 2)
int n, d[N][3][3], cnt[3][3];
void init(std::string a, std::string b) {
	n = sz(a);
	FOR(i, 0, n - 1) {
		FOR(j, 0, 2)
		FOR(z, 0, 2)
			d[i][j][z] = (i == 0? 0 : d[i - 1][j][z]);
		++d[i][getid(a[i])][getid(b[i])];
	}
}
int get_distance(int x, int y) {
	FOR(i, 0, 2)
	FOR(j, 0, 2)
		cnt[i][j] = d[y][i][j] - (x == 0? 0 : d[x - 1][i][j]);
	if (cnt[0][1] + cnt[0][2] != cnt[1][0] + cnt[2][0]) return -1;
	if (cnt[1][0] + cnt[1][2] != cnt[0][1] + cnt[2][1]) return -1;
	if (cnt[2][0] + cnt[2][1] != cnt[0][2] + cnt[1][2]) return -1;
	int total = cnt[0][1] + cnt[0][2] + cnt[1][0] + cnt[1][2] + cnt[2][0] + cnt[2][1];
	int cnt2 = 0;
	cnt2 += min(cnt[0][1], cnt[1][0]);
	cnt2 += min(cnt[0][2], cnt[2][0]);
	cnt2 += min(cnt[1][2], cnt[2][1]);
	return total - cnt2 - (total - cnt2 * 2) / 3;
}
/*
6 3
ATACAT
ACTATA
1 3
4 5
3 5
*/

Compilation message

dna.cpp: In function 'void init(std::string, std::string)':
dna.cpp:26:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   26 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
dna.cpp:43:2: note: in expansion of macro 'FOR'
   43 |  FOR(i, 0, n - 1) {
      |  ^~~
dna.cpp:26:31: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   26 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
dna.cpp:44:3: note: in expansion of macro 'FOR'
   44 |   FOR(j, 0, 2)
      |   ^~~
dna.cpp:26:31: warning: unnecessary parentheses in declaration of 'z' [-Wparentheses]
   26 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
dna.cpp:45:3: note: in expansion of macro 'FOR'
   45 |   FOR(z, 0, 2)
      |   ^~~
dna.cpp: In function 'int get_distance(int, int)':
dna.cpp:26:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   26 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
dna.cpp:51:2: note: in expansion of macro 'FOR'
   51 |  FOR(i, 0, 2)
      |  ^~~
dna.cpp:26:31: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   26 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
dna.cpp:52:2: note: in expansion of macro 'FOR'
   52 |  FOR(j, 0, 2)
      |  ^~~

Subtask #1
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 6952 KB Output is correct
2 Correct 35 ms 7036 KB Output is correct
3 Correct 32 ms 6632 KB Output is correct
4 Correct 32 ms 7036 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 312 KB Output is correct
7 Correct 1 ms 212 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 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 5 ms 4500 KB Output is correct
5 Correct 5 ms 4540 KB Output is correct
6 Correct 4 ms 4564 KB Output is correct
7 Correct 4 ms 4308 KB Output is correct
8 Correct 5 ms 4544 KB Output is correct
9 Correct 4 ms 4564 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 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 5 ms 4500 KB Output is correct
5 Correct 5 ms 4540 KB Output is correct
6 Correct 4 ms 4564 KB Output is correct
7 Correct 4 ms 4308 KB Output is correct
8 Correct 5 ms 4544 KB Output is correct
9 Correct 4 ms 4564 KB Output is correct
10 Correct 38 ms 6904 KB Output is correct
11 Correct 30 ms 6988 KB Output is correct
12 Correct 35 ms 7068 KB Output is correct
13 Correct 35 ms 7160 KB Output is correct
14 Correct 49 ms 7328 KB Output is correct
15 Correct 30 ms 7304 KB Output is correct
16 Correct 29 ms 7112 KB Output is correct
17 Correct 42 ms 7128 KB Output is correct
18 Correct 39 ms 7280 KB Output is correct
19 Correct 28 ms 6964 KB Output is correct
20 Correct 28 ms 7116 KB Output is correct
21 Correct 29 ms 7304 KB Output is correct

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 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 5 ms 4500 KB Output is correct
5 Correct 5 ms 4540 KB Output is correct
6 Correct 4 ms 4564 KB Output is correct
7 Correct 4 ms 4308 KB Output is correct
8 Correct 5 ms 4544 KB Output is correct
9 Correct 4 ms 4564 KB Output is correct
10 Correct 4 ms 4180 KB Output is correct
11 Correct 5 ms 4544 KB Output is correct
12 Correct 6 ms 4312 KB Output is correct
13 Correct 4 ms 4564 KB Output is correct
14 Correct 4 ms 4564 KB Output is correct
15 Correct 4 ms 4544 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 6952 KB Output is correct
2 Correct 35 ms 7036 KB Output is correct
3 Correct 32 ms 6632 KB Output is correct
4 Correct 32 ms 7036 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 312 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 5 ms 4500 KB Output is correct
12 Correct 5 ms 4540 KB Output is correct
13 Correct 4 ms 4564 KB Output is correct
14 Correct 4 ms 4308 KB Output is correct
15 Correct 5 ms 4544 KB Output is correct
16 Correct 4 ms 4564 KB Output is correct
17 Correct 38 ms 6904 KB Output is correct
18 Correct 30 ms 6988 KB Output is correct
19 Correct 35 ms 7068 KB Output is correct
20 Correct 35 ms 7160 KB Output is correct
21 Correct 49 ms 7328 KB Output is correct
22 Correct 30 ms 7304 KB Output is correct
23 Correct 29 ms 7112 KB Output is correct
24 Correct 42 ms 7128 KB Output is correct
25 Correct 39 ms 7280 KB Output is correct
26 Correct 28 ms 6964 KB Output is correct
27 Correct 28 ms 7116 KB Output is correct
28 Correct 29 ms 7304 KB Output is correct
29 Correct 4 ms 4180 KB Output is correct
30 Correct 5 ms 4544 KB Output is correct
31 Correct 6 ms 4312 KB Output is correct
32 Correct 4 ms 4564 KB Output is correct
33 Correct 4 ms 4564 KB Output is correct
34 Correct 4 ms 4544 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 30 ms 6624 KB Output is correct
37 Correct 29 ms 7028 KB Output is correct
38 Correct 35 ms 7152 KB Output is correct
39 Correct 32 ms 7420 KB Output is correct
40 Correct 42 ms 7416 KB Output is correct
41 Correct 4 ms 4564 KB Output is correct
42 Correct 29 ms 7060 KB Output is correct
43 Correct 37 ms 7292 KB Output is correct
44 Correct 30 ms 7292 KB Output is correct
45 Correct 29 ms 7060 KB Output is correct
46 Correct 28 ms 7288 KB Output is correct
47 Correct 29 ms 7292 KB Output is correct