oj.uz

답안 #437056

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
437056 2021-06-25T17:23:32 Z awuawuawu DNA 돌연변이 (IOI21_dna) C++17
56 / 100
 60 ms 5248 KB 
#include <bits/stdc++.h>

using namespace std;

using tint = long long;
using ld = long double;
 
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)	
 
using pi = pair<int,int>;
using pl = pair<tint,tint>;
using vi = vector<int>;
using vpi = vector<pi>;
using vpl = vector<pl>;
using vvi = vector<vi>;
using vl = vector<tint>;
using vb = vector<bool>;
 
#define pb push_back
#define pf push_front
#define rsz resize
#define all(x) begin(x), end(x)
#define rall(x) x.rbegin(), x.rend() 
#define sz(x) (int)(x).size()
#define ins insert
 
#define f first
#define s second
#define mp make_pair
 
#define DBG(x) cerr << #x << " = " << x << endl;
 
const int MOD = 1e9+7; 
const int mod = 998244353;
const int MX = 1e5+5;
const tint INF = 1e18; 
const int inf = 2e8;
const ld PI = acos(ld(-1)); 
const ld eps = 1e-5;

#include "dna.h"

int AA[MX], AC[MX], AT[MX], BA[MX], BC[MX], BT[MX];
int eq[MX];

void init(std::string a, std::string b) {
	FOR(i, 1, sz(a)+1){
		eq[i] = eq[i-1]+(a[i-1] == b[i-1]);
		AA[i] = AA[i-1]+(a[i-1] == 'A');
		AC[i] = AC[i-1]+(a[i-1] == 'C');
		AT[i] = AT[i-1]+(a[i-1] == 'T');
	}
	FOR(i, 1, sz(b)+1){
		BA[i] = BA[i-1]+(b[i-1] == 'A');
		BC[i] = BC[i-1]+(b[i-1] == 'C');
		BT[i] = BT[i-1]+(b[i-1] == 'T');
	}
}

int get_distance(int x, int y) {
	++x; ++y;
	if(AA[y]-AA[x-1] != BA[y]-BA[x-1] || AC[y]-AC[x-1] != BC[y]-BC[x-1] || AT[y]-AT[x-1] != BT[y]-BT[x-1]) return -1;
	//cout << "DEBUG:" << endl;
	//cout << AA[y] << " " << AA[x-1] << " " << BA[y] << " " << BA[x-1] << endl;
	return ((y-x+1)-(eq[y]-eq[x-1]))/2+(((y-x+1)-(eq[y]-eq[x-1])) % 2);
}

Subtask #1
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 4880 KB Output is correct
2 Correct 54 ms 4872 KB Output is correct
3 Correct 38 ms 4580 KB Output is correct
4 Correct 38 ms 4860 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 4 ms 3564 KB Output is correct
5 Correct 4 ms 3532 KB Output is correct
6 Correct 4 ms 3532 KB Output is correct
7 Correct 4 ms 3404 KB Output is correct
8 Correct 4 ms 3532 KB Output is correct
9 Correct 4 ms 3532 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 4 ms 3564 KB Output is correct
5 Correct 4 ms 3532 KB Output is correct
6 Correct 4 ms 3532 KB Output is correct
7 Correct 4 ms 3404 KB Output is correct
8 Correct 4 ms 3532 KB Output is correct
9 Correct 4 ms 3532 KB Output is correct
10 Correct 37 ms 4860 KB Output is correct
11 Correct 37 ms 4864 KB Output is correct
12 Correct 52 ms 5016 KB Output is correct
13 Correct 60 ms 5112 KB Output is correct
14 Correct 47 ms 5248 KB Output is correct
15 Correct 38 ms 5128 KB Output is correct
16 Correct 36 ms 4964 KB Output is correct
17 Correct 44 ms 5132 KB Output is correct
18 Correct 37 ms 5244 KB Output is correct
19 Correct 36 ms 5100 KB Output is correct
20 Correct 36 ms 5124 KB Output is correct
21 Correct 36 ms 5248 KB Output is correct

Subtask #4
0.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 4 ms 3564 KB Output is correct
5 Correct 4 ms 3532 KB Output is correct
6 Correct 4 ms 3532 KB Output is correct
7 Correct 4 ms 3404 KB Output is correct
8 Correct 4 ms 3532 KB Output is correct
9 Correct 4 ms 3532 KB Output is correct
10 Correct 4 ms 3276 KB Output is correct
11 Correct 5 ms 3584 KB Output is correct
12 Incorrect 4 ms 3404 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #5
0.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 4880 KB Output is correct
2 Correct 54 ms 4872 KB Output is correct
3 Correct 38 ms 4580 KB Output is correct
4 Correct 38 ms 4860 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 4 ms 3564 KB Output is correct
12 Correct 4 ms 3532 KB Output is correct
13 Correct 4 ms 3532 KB Output is correct
14 Correct 4 ms 3404 KB Output is correct
15 Correct 4 ms 3532 KB Output is correct
16 Correct 4 ms 3532 KB Output is correct
17 Correct 37 ms 4860 KB Output is correct
18 Correct 37 ms 4864 KB Output is correct
19 Correct 52 ms 5016 KB Output is correct
20 Correct 60 ms 5112 KB Output is correct
21 Correct 47 ms 5248 KB Output is correct
22 Correct 38 ms 5128 KB Output is correct
23 Correct 36 ms 4964 KB Output is correct
24 Correct 44 ms 5132 KB Output is correct
25 Correct 37 ms 5244 KB Output is correct
26 Correct 36 ms 5100 KB Output is correct
27 Correct 36 ms 5124 KB Output is correct
28 Correct 36 ms 5248 KB Output is correct
29 Correct 4 ms 3276 KB Output is correct
30 Correct 5 ms 3584 KB Output is correct
31 Incorrect 4 ms 3404 KB Output isn't correct
32 Halted 0 ms 0 KB -