oj.uz

Submission #484584

# Submission time Handle Problem Language Result Execution time Memory
484584 2021-11-04T13:55:16 Z maroonrk Mutating DNA (IOI21_dna) C++17
100 / 100
 39 ms 10908 KB 
#include "dna.h"

#ifndef LOCAL
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#endif

#include <bits/stdc++.h>
using namespace std;

using ll=long long;
#define int ll

#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)
#define pb push_back
#define eb emplace_back
#define a first
#define b second
#define bg begin()
#define ed end()
#define all(x) x.bg,x.ed
#define si(x) int(x.size())
#ifdef LOCAL
#define dmp(x) cerr<<__LINE__<<" "<<#x<<" "<<x<<endl
#else
#define dmp(x) void(0)
#endif

template<class t,class u> bool chmax(t&a,u b){if(a<b){a=b;return true;}else return false;}
template<class t,class u> bool chmin(t&a,u b){if(b<a){a=b;return true;}else return false;}

template<class t> using vc=vector<t>;
template<class t> using vvc=vc<vc<t>>;

using pi=pair<int,int>;
using vi=vc<int>;

template<class t,class u>
ostream& operator<<(ostream& os,const pair<t,u>& p){
	return os<<"{"<<p.a<<","<<p.b<<"}";
}

template<class t> ostream& operator<<(ostream& os,const vc<t>& v){
	os<<"{";
	for(auto e:v)os<<e<<",";
	return os<<"}";
}

#define mp make_pair
#define mt make_tuple
#define one(x) memset(x,-1,sizeof(x))
#define zero(x) memset(x,0,sizeof(x))
#ifdef LOCAL
void dmpr(ostream&os){os<<endl;}
template<class T,class... Args>
void dmpr(ostream&os,const T&t,const Args&... args){
	os<<t<<" ";
	dmpr(os,args...);
}
#define dmp2(...) dmpr(cerr,__LINE__,##__VA_ARGS__)
#else
#define dmp2(...) void(0)
#endif

using uint=unsigned;
using ull=unsigned long long;

template<class t,size_t n>
ostream& operator<<(ostream&os,const array<t,n>&a){
	return os<<vc<t>(all(a));
}

template<int i,class T>
void print_tuple(ostream&,const T&){
}

template<int i,class T,class H,class ...Args>
void print_tuple(ostream&os,const T&t){
	if(i)os<<",";
	os<<get<i>(t);
	print_tuple<i+1,T,Args...>(os,t);
}

template<class ...Args>
ostream& operator<<(ostream&os,const tuple<Args...>&t){
	os<<"{";
	print_tuple<0,tuple<Args...>,Args...>(os,t);
	return os<<"}";
}

template<class t>
void print(t x,int suc=1){
	cout<<x;
	if(suc==1)
		cout<<"\n";
	if(suc==2)
		cout<<" ";
}

ll read(){
	ll i;
	cin>>i;
	return i;
}

vi readvi(int n,int off=0){
	vi v(n);
	rep(i,n)v[i]=read()+off;
	return v;
}

pi readpi(int off=0){
	int a,b;cin>>a>>b;
	return pi(a+off,b+off);
}

template<class t,class u>
void print(const pair<t,u>&p,int suc=1){
	print(p.a,2);
	print(p.b,suc);
}

template<class T>
void print(const vector<T>&v,int suc=1){
	rep(i,v.size())
		print(v[i],i==int(v.size())-1?suc:2);
}

template<class T>
void print_offset(const vector<T>&v,ll off,int suc=1){
	rep(i,v.size())
		print(v[i]+off,i==int(v.size())-1?suc:2);
}

template<class T,size_t N>
void print(const array<T,N>&v,int suc=1){
	rep(i,N)
		print(v[i],i==int(N)-1?suc:2);
}

string readString(){
	string s;
	cin>>s;
	return s;
}

template<class T>
T sq(const T& t){
	return t*t;
}

//#define CAPITAL
void yes(bool ex=true){
	#ifdef CAPITAL
	cout<<"YES"<<"\n";
	#else
	cout<<"Yes"<<"\n";
	#endif
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}
void no(bool ex=true){
	#ifdef CAPITAL
	cout<<"NO"<<"\n";
	#else
	cout<<"No"<<"\n";
	#endif
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}
void possible(bool ex=true){
	#ifdef CAPITAL
	cout<<"POSSIBLE"<<"\n";
	#else
	cout<<"Possible"<<"\n";
	#endif
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}
void impossible(bool ex=true){
	#ifdef CAPITAL
	cout<<"IMPOSSIBLE"<<"\n";
	#else
	cout<<"Impossible"<<"\n";
	#endif
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}

constexpr ll ten(int n){
	return n==0?1:ten(n-1)*10;
}

const ll infLL=LLONG_MAX/3;

#ifdef int
const int inf=infLL;
#else
const int inf=INT_MAX/2-100;
#endif

int topbit(signed t){
	return t==0?-1:31-__builtin_clz(t);
}
int topbit(ll t){
	return t==0?-1:63-__builtin_clzll(t);
}
int botbit(signed a){
	return a==0?32:__builtin_ctz(a);
}
int botbit(ll a){
	return a==0?64:__builtin_ctzll(a);
}
int popcount(signed t){
	return __builtin_popcount(t);
}
int popcount(ll t){
	return __builtin_popcountll(t);
}
bool ispow2(int i){
	return i&&(i&-i)==i;
}
ll mask(int i){
	return (ll(1)<<i)-1;
}

bool inc(int a,int b,int c){
	return a<=b&&b<=c;
}

template<class t> void mkuni(vc<t>&v){
	sort(all(v));
	v.erase(unique(all(v)),v.ed);
}

ll rand_int(ll l, ll r) { //[l, r]
	#ifdef LOCAL
	static mt19937_64 gen;
	#else
	static mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());
	#endif
	return uniform_int_distribution<ll>(l, r)(gen);
}

template<class t>
void myshuffle(vc<t>&a){
	rep(i,si(a))swap(a[i],a[rand_int(0,i)]);
}

template<class t>
int lwb(const vc<t>&v,const t&a){
	return lower_bound(all(v),a)-v.bg;
}

vvc<int> readGraph(int n,int m){
	vvc<int> g(n);
	rep(i,m){
		int a,b;
		cin>>a>>b;
		//sc.read(a,b);
		a--;b--;
		g[a].pb(b);
		g[b].pb(a);
	}
	return g;
}

vvc<int> readTree(int n){
	return readGraph(n,n-1);
}

const int nmax=100010;
int sum[nmax][3][3];

int getidx(char c){
	if(c=='A')return 0;
	else if(c=='T')return 1;
	else if(c=='C')return 2;
	else assert(false);
}

void init(std::string a, std::string b){
	int n=si(a);
	rep(i,n){
		rep(x,3)rep(y,3){
			sum[i+1][x][y]=sum[i][x][y];
		}
		sum[i+1][getidx(a[i])][getidx(b[i])]++;
	}
}

signed get_distance(signed l, signed r){
	r++;
	int cnt[3][3]{};
	int dif[3]{};
	int ans=0;
	rep(i,3)rep(j,3)if(i!=j){
		int v=sum[r][i][j]-sum[l][i][j];
		cnt[i][j]=v;
		dif[i]+=v;
		dif[j]-=v;
	}
	rep(i,3)if(dif[i])return -1;
	rep(i,3)rng(j,i+1,3){
		int v=min(cnt[i][j],cnt[j][i]);
		ans+=v;
		cnt[i][j]-=v;
		cnt[j][i]-=v;
	}
	assert(cnt[0][1]==cnt[1][2]&&cnt[1][2]==cnt[2][0]);
	ans+=cnt[0][1]*2;
	assert(cnt[0][2]==cnt[2][1]&&cnt[2][1]==cnt[1][0]);
	ans+=cnt[0][2]*2;
	return ans;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 10416 KB Output is correct
2 Correct 36 ms 10564 KB Output is correct
3 Correct 36 ms 9936 KB Output is correct
4 Correct 36 ms 10560 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 5 ms 8012 KB Output is correct
5 Correct 6 ms 8012 KB Output is correct
6 Correct 5 ms 8012 KB Output is correct
7 Correct 5 ms 7500 KB Output is correct
8 Correct 6 ms 8012 KB Output is correct
9 Correct 6 ms 8024 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 5 ms 8012 KB Output is correct
5 Correct 6 ms 8012 KB Output is correct
6 Correct 5 ms 8012 KB Output is correct
7 Correct 5 ms 7500 KB Output is correct
8 Correct 6 ms 8012 KB Output is correct
9 Correct 6 ms 8024 KB Output is correct
10 Correct 35 ms 10400 KB Output is correct
11 Correct 35 ms 10508 KB Output is correct
12 Correct 35 ms 10292 KB Output is correct
13 Correct 36 ms 10496 KB Output is correct
14 Correct 37 ms 10884 KB Output is correct
15 Correct 36 ms 10812 KB Output is correct
16 Correct 33 ms 10260 KB Output is correct
17 Correct 38 ms 10468 KB Output is correct
18 Correct 34 ms 10752 KB Output is correct
19 Correct 31 ms 10256 KB Output is correct
20 Correct 31 ms 10508 KB Output is correct
21 Correct 31 ms 10796 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 5 ms 8012 KB Output is correct
5 Correct 6 ms 8012 KB Output is correct
6 Correct 5 ms 8012 KB Output is correct
7 Correct 5 ms 7500 KB Output is correct
8 Correct 6 ms 8012 KB Output is correct
9 Correct 6 ms 8024 KB Output is correct
10 Correct 5 ms 7372 KB Output is correct
11 Correct 5 ms 8012 KB Output is correct
12 Correct 6 ms 7500 KB Output is correct
13 Correct 7 ms 8012 KB Output is correct
14 Correct 6 ms 8120 KB Output is correct
15 Correct 5 ms 8012 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 10416 KB Output is correct
2 Correct 36 ms 10564 KB Output is correct
3 Correct 36 ms 9936 KB Output is correct
4 Correct 36 ms 10560 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 5 ms 8012 KB Output is correct
12 Correct 6 ms 8012 KB Output is correct
13 Correct 5 ms 8012 KB Output is correct
14 Correct 5 ms 7500 KB Output is correct
15 Correct 6 ms 8012 KB Output is correct
16 Correct 6 ms 8024 KB Output is correct
17 Correct 35 ms 10400 KB Output is correct
18 Correct 35 ms 10508 KB Output is correct
19 Correct 35 ms 10292 KB Output is correct
20 Correct 36 ms 10496 KB Output is correct
21 Correct 37 ms 10884 KB Output is correct
22 Correct 36 ms 10812 KB Output is correct
23 Correct 33 ms 10260 KB Output is correct
24 Correct 38 ms 10468 KB Output is correct
25 Correct 34 ms 10752 KB Output is correct
26 Correct 31 ms 10256 KB Output is correct
27 Correct 31 ms 10508 KB Output is correct
28 Correct 31 ms 10796 KB Output is correct
29 Correct 5 ms 7372 KB Output is correct
30 Correct 5 ms 8012 KB Output is correct
31 Correct 6 ms 7500 KB Output is correct
32 Correct 7 ms 8012 KB Output is correct
33 Correct 6 ms 8120 KB Output is correct
34 Correct 5 ms 8012 KB Output is correct
35 Correct 0 ms 204 KB Output is correct
36 Correct 35 ms 9876 KB Output is correct
37 Correct 36 ms 10508 KB Output is correct
38 Correct 36 ms 10380 KB Output is correct
39 Correct 36 ms 10908 KB Output is correct
40 Correct 39 ms 10864 KB Output is correct
41 Correct 5 ms 8012 KB Output is correct
42 Correct 33 ms 10380 KB Output is correct
43 Correct 33 ms 10752 KB Output is correct
44 Correct 34 ms 10752 KB Output is correct
45 Correct 31 ms 10340 KB Output is correct
46 Correct 31 ms 10868 KB Output is correct
47 Correct 33 ms 10880 KB Output is correct