oj.uz

Submission #621508

# Submission time Handle Problem Language Result Execution time Memory
621508 2022-08-03T23:19:12 Z MtSaka Mutating DNA (IOI21_dna) C++17
100 / 100
 42 ms 8584 KB 
#line 2 "library/template/template.hpp"
//#pragma GCC target("avx")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#define overload4(a,b,c,d,e,...) e
#define overload3(a,b,c,d,...) d
#define rep1(a) for(ll i=0;i<(ll)(a);i++)
#define rep2(i,a) for(ll i=0;i<(ll)(a);i++)
#define rep3(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define rep4(i,a,b,c) for(ll i=(ll)(a);i<(ll)(b);i+=(ll)(c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep1(a) for(ll i=(ll)(a)-1;i>=0;i--)
#define rrep2(i,a) for(ll i=(ll)(a)-1;i>=0;i--)
#define rrep3(i,a,b) for(ll i=(ll)(b)-1;i>=(ll)(a);i--)
#define rrep(...) overload3(__VA_ARGS__,rrep3,rrep2,rrep1)(__VA_ARGS__)
#define fore(...) for (auto&& __VA_ARGS__)
#define all1(i) begin(i),end(i)
#define all2(i,a) begin(i),begin(i)+a
#define all3(i,a,b) begin(i)+a,begin(i)+b
#define all(...) overload3(__VA_ARGS__,all3,all2,all1)(__VA_ARGS__)
#define rall(n) (n).rbegin(),(n).rend()
#define INT(...) int __VA_ARGS__;scan(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;scan(__VA_ARGS__)
#define STR(...) string __VA_ARGS__;scan(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__;scan(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__;scan(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__;scan(__VA_ARGS__)
#define pb push_back
#define eb emplace_back
#define END(...) {print(__VA_ARGS__);return;}
using namespace std;
using ll=long long;
using ull=unsigned long long;
using ld=long double;
using vl=vector<ll>;
using vi=vector<int>;
using vs=vector<string>;
using vc=vector<char>;
using vvl=vector<vl>;
using pi=pair<int,int>;
using pl=pair<ll,ll>;
using vvc=vector<vc>;
using vd=vector<double>;
using vp=vector<pl>;
using vb=vector<bool>;
constexpr int dx[8]={1,0,-1,0,1,-1,-1,1};
constexpr int dy[8]={0,1,0,-1,1,1,-1,-1};
constexpr ll MOD=1000000007;
constexpr ll mod=998244353;
constexpr ld EPS=1e-8;
constexpr ld PI=3.1415926535897932384626;
template<typename T,typename U>
ostream &operator<<(ostream&os,const pair<T,U>&p){os<<p.first<<" "<<p.second;return os;}
template<typename T,typename U>
istream &operator>>(istream&is,pair<T,U>&p){is>>p.first>>p.second;return is;}
template<typename T>
ostream &operator<<(ostream&os,const vector<T>&v){for(auto it=v.begin();it!=v.end();){os<<*it<<((++it)!=v.end()?" ":"");}return os;}
template<typename T>
istream &operator>>(istream&is,vector<T>&v){for(T &in:v){is>>in;}return is;}
void scan(){}
template<class Head,class... Tail>
void scan(Head&head,Tail&... tail){cin>>head;scan(tail...);}
template<class T>
void print(const T &t){cout<<t<<'\n';}
template<class Head, class... Tail>
void print(const Head &head, const Tail &... tail){cout<<head<<' ';print(tail...);}
template<class... T>
void fin(const T &... a){print(a...);exit(0);}
template<typename T,typename U>
inline bool chmax(T&a,U b){return a<b&&(a=b,true);}
template<typename T,typename U>
inline bool chmin(T&a,U b){return a>b&&(a=b,true);}
template<typename T>
class infinity{
  public:
  static constexpr T MAX=numeric_limits<T>::max();
  static constexpr T MIN=numeric_limits<T>::min();
  static constexpr T value=numeric_limits<T>::max()/2;
  static constexpr T mvalue=numeric_limits<T>::min()/2;
};
#if __cplusplus <= 201402L
template<class T>constexpr T infinity<T>::value;
template<class T>constexpr T infinity<T>::mvalue;
template<class T>constexpr T infinity<T>::MAX;
template<class T>constexpr T infinity<T>::MIN;
#endif
template<typename T>constexpr T INF=infinity<T>::value;
constexpr long long inf=INF<ll>;
inline int popcnt(ull x){
#if __cplusplus>=202002L
return popcount(x);
#endif
x=(x&0x5555555555555555)+((x>>1)&0x5555555555555555);x=(x&0x3333333333333333)+((x>>2)&0x3333333333333333);x=(x&0x0f0f0f0f0f0f0f0f)+((x>>4)&0x0f0f0f0f0f0f0f0f);x=(x&0x00ff00ff00ff00ff)+((x>>8)&0x00ff00ff00ff00ff);x=(x&0x0000ffff0000ffff)+((x>>16)&0x0000ffff0000ffff);return (x&0x00000000ffffffff)+((x>>32)&0x00000000ffffffff);
}
template<typename T,typename=void>
struct is_specialize:false_type{};
template<typename T>
struct is_specialize<T,typename conditional<false,typename T::iterator, void>::type>:true_type{};
template<typename T>
struct is_specialize<T,typename conditional<false,decltype(T::first),void>::type>:true_type{};
template<typename T>
struct is_specialize<T,enable_if_t<is_integral<T>::value,void>>:true_type{};
void dump(const char&t){cerr<<t;}
void dump(const string&t){cerr<<t;}
void dump(const bool&t){cerr<<(t?"true":"false");}
template <typename T,enable_if_t<!is_specialize<T>::value,nullptr_t> =nullptr>
void dump(const T&t){cerr<<t;}
template<typename T>
void dump(const T&t,enable_if_t<is_integral<T>::value>* =nullptr){string tmp;if(t==infinity<T>::value||t==infinity<T>::MAX)tmp="inf";if(is_signed<T>::value&&(t==infinity<T>::mvalue||t==infinity<T>::MIN))tmp="-inf";if(tmp.empty())tmp=to_string(t);cerr<<tmp;}
template<typename T,typename U>
void dump(const pair<T,U>&);
template<typename T>
void dump(const T&t,enable_if_t<!is_void<typename T::iterator>::value>* =nullptr){cerr<<"{";for(auto it=t.begin();it!=t.end();){dump(*it);cerr<<(++it==t.end()?"":",");}cerr<<"}";}
template<typename T,typename U>
void dump(const pair<T,U>&t){cerr<<"(";dump(t.first);cerr<<",";dump(t.second);cerr<<")";}
void trace(){cerr<<endl;}
template<typename Head,typename... Tail>
void trace(Head&&head,Tail&&... tail){dump(head);if(sizeof...(tail))cerr<<",";trace(forward<Tail>(tail)...);}
#ifdef ONLINE_JUDGE
#define debug(...) (void(0))
#else
#define debug(...) do{cerr<<#__VA_ARGS__<<"=";trace(__VA_ARGS__);}while(0)
#endif
struct IOSetup{IOSetup(){cin.tie(nullptr);ios::sync_with_stdio(false);cout.tie(0);cout<<fixed<<setprecision(12);cerr<<fixed<<setprecision(12);}};
template<class F>struct REC{F f;REC(F&&f_):f(std::forward<F>(f_)){}template<class...Args>auto operator()(Args&&...args)const{return f(*this, std::forward<Args>(args)...);}};
/**
 * @brief Template(テンプレート)
*/
#line 2 "code.cpp"
constexpr int N=100005;
int cnta[N][3],cntb[N][3];
int ac[N],ca[N],at[N],ta[N],ct[N],tc[N];
void init(string a,string b){
  int n=a.size();
  rep(i,n){
    cnta[i+1][0]=cnta[i][0]+(a[i]=='A');
    cnta[i+1][1]=cnta[i][1]+(a[i]=='C');
    cnta[i+1][2]=cnta[i][2]+(a[i]=='T');
    cntb[i+1][0]=cntb[i][0]+(b[i]=='A');
    cntb[i+1][1]=cntb[i][1]+(b[i]=='C');
    cntb[i+1][2]=cntb[i][2]+(b[i]=='T');
    ca[i+1]=ca[i],ac[i+1]=ac[i],at[i+1]=at[i],ta[i+1]=ta[i],ct[i+1]=ct[i],tc[i+1]=tc[i];
    if(a[i]=='A'&&b[i]=='C')ac[i+1]++;
    if(a[i]=='A'&&b[i]=='T')at[i+1]++;
    if(a[i]=='C'&&b[i]=='A')ca[i+1]++;
    if(a[i]=='C'&&b[i]=='T')ct[i+1]++;
    if(a[i]=='T'&&b[i]=='A')ta[i+1]++;
    if(a[i]=='T'&&b[i]=='C')tc[i+1]++;
  }
}
int get_distance(int x,int y){
  y++;
  int a1=cnta[y][0]-cnta[x][0],c1=cnta[y][1]-cnta[x][1],t1=cnta[y][2]-cnta[x][2];
  int a2=cntb[y][0]-cntb[x][0],c2=cntb[y][1]-cntb[x][1],t2=cntb[y][2]-cntb[x][2];
  if(a1!=a2||c1!=c2||t1!=t2)return -1;
  int ans=0;
  int ac1=ac[y]-ac[x],ca1=ca[y]-ca[x],at1=at[y]-at[x],ta1=ta[y]-ta[x],ct1=ct[y]-ct[x],tc1=tc[y]-tc[x];
  int tmp=min(ac1,ca1);
  ans+=tmp;
  ac1-=tmp,ca1-=tmp;
  tmp=min(at1,ta1);
  ans+=tmp;
  at1-=tmp,ta1-=tmp;
  tmp=min(ct1,tc1);
  ans+=tmp;
  ct1-=tmp,tc1-=tmp;
  return ans+2*(ac1+ca1+at1+ta1+ct1+tc1)/3;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 6784 KB Output is correct
2 Correct 36 ms 8184 KB Output is correct
3 Correct 32 ms 7772 KB Output is correct
4 Correct 36 ms 8204 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 5 ms 5484 KB Output is correct
5 Correct 5 ms 5716 KB Output is correct
6 Correct 7 ms 5716 KB Output is correct
7 Correct 5 ms 5404 KB Output is correct
8 Correct 6 ms 5728 KB Output is correct
9 Correct 5 ms 5716 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 5 ms 5484 KB Output is correct
5 Correct 5 ms 5716 KB Output is correct
6 Correct 7 ms 5716 KB Output is correct
7 Correct 5 ms 5404 KB Output is correct
8 Correct 6 ms 5728 KB Output is correct
9 Correct 5 ms 5716 KB Output is correct
10 Correct 42 ms 8136 KB Output is correct
11 Correct 32 ms 8148 KB Output is correct
12 Correct 40 ms 8160 KB Output is correct
13 Correct 33 ms 8304 KB Output is correct
14 Correct 36 ms 8572 KB Output is correct
15 Correct 38 ms 8456 KB Output is correct
16 Correct 31 ms 8040 KB Output is correct
17 Correct 32 ms 8184 KB Output is correct
18 Correct 32 ms 8444 KB Output is correct
19 Correct 30 ms 8164 KB Output is correct
20 Correct 29 ms 8276 KB Output is correct
21 Correct 30 ms 8440 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 5 ms 5484 KB Output is correct
5 Correct 5 ms 5716 KB Output is correct
6 Correct 7 ms 5716 KB Output is correct
7 Correct 5 ms 5404 KB Output is correct
8 Correct 6 ms 5728 KB Output is correct
9 Correct 5 ms 5716 KB Output is correct
10 Correct 5 ms 5276 KB Output is correct
11 Correct 5 ms 5716 KB Output is correct
12 Correct 5 ms 5412 KB Output is correct
13 Correct 5 ms 5716 KB Output is correct
14 Correct 6 ms 5756 KB Output is correct
15 Correct 4 ms 5692 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 6784 KB Output is correct
2 Correct 36 ms 8184 KB Output is correct
3 Correct 32 ms 7772 KB Output is correct
4 Correct 36 ms 8204 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 5 ms 5484 KB Output is correct
12 Correct 5 ms 5716 KB Output is correct
13 Correct 7 ms 5716 KB Output is correct
14 Correct 5 ms 5404 KB Output is correct
15 Correct 6 ms 5728 KB Output is correct
16 Correct 5 ms 5716 KB Output is correct
17 Correct 42 ms 8136 KB Output is correct
18 Correct 32 ms 8148 KB Output is correct
19 Correct 40 ms 8160 KB Output is correct
20 Correct 33 ms 8304 KB Output is correct
21 Correct 36 ms 8572 KB Output is correct
22 Correct 38 ms 8456 KB Output is correct
23 Correct 31 ms 8040 KB Output is correct
24 Correct 32 ms 8184 KB Output is correct
25 Correct 32 ms 8444 KB Output is correct
26 Correct 30 ms 8164 KB Output is correct
27 Correct 29 ms 8276 KB Output is correct
28 Correct 30 ms 8440 KB Output is correct
29 Correct 5 ms 5276 KB Output is correct
30 Correct 5 ms 5716 KB Output is correct
31 Correct 5 ms 5412 KB Output is correct
32 Correct 5 ms 5716 KB Output is correct
33 Correct 6 ms 5756 KB Output is correct
34 Correct 4 ms 5692 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 37 ms 7648 KB Output is correct
37 Correct 35 ms 8188 KB Output is correct
38 Correct 32 ms 8300 KB Output is correct
39 Correct 33 ms 8568 KB Output is correct
40 Correct 34 ms 8584 KB Output is correct
41 Correct 5 ms 5716 KB Output is correct
42 Correct 40 ms 8160 KB Output is correct
43 Correct 35 ms 8428 KB Output is correct
44 Correct 33 ms 8480 KB Output is correct
45 Correct 30 ms 8172 KB Output is correct
46 Correct 31 ms 8404 KB Output is correct
47 Correct 32 ms 8484 KB Output is correct