oj.uz

Submission #728015

# Submission time Handle Problem Language Result Execution time Memory
728015 2023-04-21T19:27:27 Z shadow_sami Mutating DNA (IOI21_dna) C++17
100 / 100
 56 ms 13508 KB 
#include<bits/stdc++.h>
#include "dna.h"
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef pair<ll,ll> pi;
typedef map<ll,ll> mi;
typedef long double ld;
typedef vector<ld> vd;
typedef vector<vector<ld>> vvd;
typedef pair<ld,ld> pd;
#define ff first
#define ss second
#define srt(a) sort(a.begin(),a.end());
#define fip(k, n) for (ll i = k; i < n; i++)
#define fjp(k, n) for (ll j = k; j < n; j++)
#define fin(k, n) for (ll i = k; i >= n; i--)
#define fjn(k, n) for (ll j = k; j >= n; j--)
#define fp(k, n, m) for (ll k = n; k < m; k++)
#define fn(k, n, m) for (ll k = n; k >= m; k--)
#define ordered_set tree<pi, null_type,less< pi >, rb_tree_tag,tree_order_statistics_node_update>
#define totalOne(n) __builtin_popcount(n)
#define backZero(n) __builtin_ctzll(n)
#define frontZero(n) __builtin_clzll(n)
#define fx(k) for ( auto x : k )
#define test ll t;cin >> t;while (t--)
#define nli "\n"

// ==========================(debug)============================================================================================== //

#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x <<" "; _printn(x); cerr << nli;
#else
#define debug(x)
#endif

void _printn(ll x){ cerr<<x<<" "; }
void _printn(int x){ cerr<<x<<" "; }
void _printn(ld x){ cerr<<x<<" "; }
void _printn(double x){ cerr<<x<<" "; }
void _printn(string x){ cerr<<x<<" "; }
void _printn(char x){ cerr<<x<<" "; }
void _printn(bool x){ cerr<<x<<" "; }
template<class T,class V>void _printn(pair<T,V> vv);
template<class T> void _printn(vector<T> vv);
template<class T> void _printn(set<T> vv);
template<class T,class V> void _printn(map<T,V> vv);
template<class T> void _printn(multiset<T> vv);
template<class T,class V>void _printn(pair<T,V> vv){ cerr<<"( ";_printn(vv.ff);cerr<<",";_printn(vv.ss);cerr<<")";}
template<class T> void _printn(vector<T> vv){ cerr<<"[ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"]"; };
template<class T> void _printn(set<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T> void _printn(multiset<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T,class V> void _printn(map<T,V> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };

// ==========================(debug)============================================================================================== //

ll n,m,tp,tp2,res,sum,tptp;
const ll mx = 1e5+5;
const ll mod = 1e9+7;

// ==========================(MOD)=============================================================================================== //

ll mod_add(ll aa,ll bb){ return ((aa%mod)+(bb%mod))%mod; }
ll mod_minus(ll aa,ll bb){ return (((aa%mod)-(bb%mod))+10*mod)%mod; }
ll mod_mul(ll aa,ll bb){ return ((aa%mod)*(bb%mod))%mod; }
ll mod_power(ll aa,ll bb){ aa%=mod; ll empowered = 1; bb%=mod-1; while(bb > 0){ if(bb & 1) empowered = mod_mul(empowered,aa); bb = bb >> 1; aa = mod_mul(aa,aa); } return empowered; }
ll mod_divi(ll aa,ll bb){ aa=mod_mul(aa,mod_power(bb,mod-2)); return aa; }

// ==========================(MOD)=============================================================================================== //

bool f = false;
string k1,k2;
ll cnt[2][mx][3];
ll fun[mx][6];
unordered_map<char,ll> hashe;

void init(string a, string b){
	hashe['T'] = 0;
	hashe['A'] = 1;
	hashe['C'] = 2;
	k1 = a;
	k2 = b;
	memset(cnt,0ll,sizeof(cnt));
	memset(fun,0ll,sizeof(fun));
	n = k1.size();
	fip(0,n){
		fjp(0,3){
			cnt[0][i+1][j] = cnt[0][i][j] + (hashe[k1[i]]==j);
			cnt[1][i+1][j] = cnt[1][i][j] + (hashe[k2[i]]==j);
		}
		fjp(0,6){
			fun[i+1][j] = fun[i][j];
		}
		if(k1[i]=='T' && k2[i]=='A')
			fun[i+1][0]++;
		else if(k1[i]=='A' && k2[i]=='T')
			fun[i+1][3]++;
		else if(k1[i]=='T' && k2[i]=='C')
			fun[i+1][1]++;
		else if(k1[i]=='C' && k2[i]=='T')
			fun[i+1][4]++;
		else if(k1[i]=='C' && k2[i]=='A')
			fun[i+1][2]++;
		else if(k1[i]=='A' && k2[i]=='C')
			fun[i+1][5]++;
	}
	return;
}

int get_distance(int xx,int yy){
	xx++,yy++;
	fip(0,3){
		ll tp1 = cnt[0][yy][i] - cnt[0][xx-1][i];
		ll tp2 = cnt[1][yy][i] - cnt[1][xx-1][i];
		// debug(tp1);
		// debug(tp2);
		if(tp1 != tp2)
			return -1;
	}
	int ans = 0;
	int tn=0,kc;
	fip(0,3){
		ll tp1 = fun[yy][i] - fun[xx-1][i];
		ll tp2 = fun[yy][i+3] - fun[xx-1][3+i];
		ans += min(tp1,tp2);
		kc = max(tp1,tp2) - min(tp1,tp2);
		tn += kc;
	}
	ans += (tn / 3) * 2;
	return ans;
}

// int main(){
//     ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
//     #ifndef ONLINE_JUDGE
//         freopen("input1.txt", "r", stdin);
//         freopen("output1.txt", "w", stdout);
//         freopen("error1.txt", "w", stderr);
//     #endif // ONLINE_JUDGE

//         cin>>n>>m;
//         cin>>k1>>k2;
//         ll sr,de;
//         init(k1,k2);
//         while(m--){
//         	cin>>sr>>de;
//         	cout<<get_distance(sr,de)<<nli;
//         }
        
//     cerr << "Time elapsed: " << setprecision(6) << 1000.0 * clock() / CLOCKS_PER_SEC << "ms\n";
//     return 0;
// }

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 11724 KB Output is correct
2 Correct 46 ms 13192 KB Output is correct
3 Correct 41 ms 13016 KB Output is correct
4 Correct 44 ms 13120 KB Output is correct
5 Correct 5 ms 9652 KB Output is correct
6 Correct 4 ms 9684 KB Output is correct
7 Correct 4 ms 9648 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 9684 KB Output is correct
2 Correct 4 ms 9684 KB Output is correct
3 Correct 4 ms 9684 KB Output is correct
4 Correct 10 ms 10452 KB Output is correct
5 Correct 13 ms 10392 KB Output is correct
6 Correct 12 ms 10472 KB Output is correct
7 Correct 10 ms 10324 KB Output is correct
8 Correct 11 ms 10480 KB Output is correct
9 Correct 10 ms 10480 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 9684 KB Output is correct
2 Correct 4 ms 9684 KB Output is correct
3 Correct 4 ms 9684 KB Output is correct
4 Correct 10 ms 10452 KB Output is correct
5 Correct 13 ms 10392 KB Output is correct
6 Correct 12 ms 10472 KB Output is correct
7 Correct 10 ms 10324 KB Output is correct
8 Correct 11 ms 10480 KB Output is correct
9 Correct 10 ms 10480 KB Output is correct
10 Correct 46 ms 11720 KB Output is correct
11 Correct 56 ms 13124 KB Output is correct
12 Correct 42 ms 13396 KB Output is correct
13 Correct 43 ms 13444 KB Output is correct
14 Correct 55 ms 13492 KB Output is correct
15 Correct 47 ms 13368 KB Output is correct
16 Correct 38 ms 13336 KB Output is correct
17 Correct 39 ms 13416 KB Output is correct
18 Correct 41 ms 13340 KB Output is correct
19 Correct 36 ms 13280 KB Output is correct
20 Correct 35 ms 13356 KB Output is correct
21 Correct 36 ms 13388 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 9684 KB Output is correct
2 Correct 4 ms 9684 KB Output is correct
3 Correct 4 ms 9684 KB Output is correct
4 Correct 10 ms 10452 KB Output is correct
5 Correct 13 ms 10392 KB Output is correct
6 Correct 12 ms 10472 KB Output is correct
7 Correct 10 ms 10324 KB Output is correct
8 Correct 11 ms 10480 KB Output is correct
9 Correct 10 ms 10480 KB Output is correct
10 Correct 10 ms 10324 KB Output is correct
11 Correct 12 ms 10452 KB Output is correct
12 Correct 11 ms 10408 KB Output is correct
13 Correct 11 ms 10356 KB Output is correct
14 Correct 10 ms 10480 KB Output is correct
15 Correct 10 ms 10452 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 11724 KB Output is correct
2 Correct 46 ms 13192 KB Output is correct
3 Correct 41 ms 13016 KB Output is correct
4 Correct 44 ms 13120 KB Output is correct
5 Correct 5 ms 9652 KB Output is correct
6 Correct 4 ms 9684 KB Output is correct
7 Correct 4 ms 9648 KB Output is correct
8 Correct 4 ms 9684 KB Output is correct
9 Correct 4 ms 9684 KB Output is correct
10 Correct 4 ms 9684 KB Output is correct
11 Correct 10 ms 10452 KB Output is correct
12 Correct 13 ms 10392 KB Output is correct
13 Correct 12 ms 10472 KB Output is correct
14 Correct 10 ms 10324 KB Output is correct
15 Correct 11 ms 10480 KB Output is correct
16 Correct 10 ms 10480 KB Output is correct
17 Correct 46 ms 11720 KB Output is correct
18 Correct 56 ms 13124 KB Output is correct
19 Correct 42 ms 13396 KB Output is correct
20 Correct 43 ms 13444 KB Output is correct
21 Correct 55 ms 13492 KB Output is correct
22 Correct 47 ms 13368 KB Output is correct
23 Correct 38 ms 13336 KB Output is correct
24 Correct 39 ms 13416 KB Output is correct
25 Correct 41 ms 13340 KB Output is correct
26 Correct 36 ms 13280 KB Output is correct
27 Correct 35 ms 13356 KB Output is correct
28 Correct 36 ms 13388 KB Output is correct
29 Correct 10 ms 10324 KB Output is correct
30 Correct 12 ms 10452 KB Output is correct
31 Correct 11 ms 10408 KB Output is correct
32 Correct 11 ms 10356 KB Output is correct
33 Correct 10 ms 10480 KB Output is correct
34 Correct 10 ms 10452 KB Output is correct
35 Correct 4 ms 9684 KB Output is correct
36 Correct 42 ms 13004 KB Output is correct
37 Correct 48 ms 13136 KB Output is correct
38 Correct 50 ms 13448 KB Output is correct
39 Correct 44 ms 13460 KB Output is correct
40 Correct 47 ms 13508 KB Output is correct
41 Correct 10 ms 10592 KB Output is correct
42 Correct 50 ms 13312 KB Output is correct
43 Correct 41 ms 13428 KB Output is correct
44 Correct 42 ms 13384 KB Output is correct
45 Correct 36 ms 13428 KB Output is correct
46 Correct 39 ms 13408 KB Output is correct
47 Correct 39 ms 13492 KB Output is correct