Submission #1282615

#	Time	Username	Problem	Language	Result	Execution time	Memory
1282615		ender_shayan	Genetics (BOI18_genetics)	C++20	100 / 100	451 ms	54104 KiB

genetics

#include <bits/stdc++.h>

using namespace std;

// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;

typedef long long ll;
typedef long double	ld;
typedef pair<int, int>	pii  ;
typedef pair<ll, ll>	pll  ;
typedef vector<pii>     vii  ;
typedef vector<int>     veci ;
typedef vector<pll>     vll  ;
typedef vector<ll>      vecll;

// find_by_order             order_of_key

//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define F		        first
#define S		        second
#define pb		        push_back
#define endl            '\n'
#define Mp		        make_pair
#define all(x)          x.begin(), x.end()
#define debug(x)        cerr << #x << " = " << x << endl
#define set_dec(x)	    cout << fixed << setprecision(x);
#define fast_io         ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file_io         freopen("in.txt" , "r" , stdin) ; freopen("out.txt" , "w" , stdout);
#define lb              lower_bound
#define ub              upper_bound
#define for1(n)         for(int i=1;i<=n;i++)
#define for0(n)         for(int i=0;i<n;i++)
#define forn(n)         for(int i=n;i>0;i--)
#define pq              priority_queue <pii, vector<pii>, greater<pii>>


const ll mod = 1e9+7 ;// 998244353 ;// 1e9+9;

ll inf=1e18;
const int N=1e6+100,L=21,bs=701;
int A[N],B[N],C[N],D[N],E[N],n,m,k,q,dp[N],pre[N],dist[N],vis[N];
vector<int>g[N];

string s[N];
ll pw[N],ans[N];
int main(){
    fast_io
    cin>>n>>m>>k;
    for1(n){
        cin>>s[i];
        s[i]='-'+s[i];
    }
    pw[0]=1;
    for1(n)pw[i]=pw[i-1]*bs%mod;
    for(int j=1;j<=m;j++){
        ll a=0,t=0,g=0,c=0,sum=0;
        for1(n){
            sum+=pw[i];
            if(s[i][j]=='A')a+=pw[i];
            else if(s[i][j]=='T')t+=pw[i];
            else if(s[i][j]=='G')g+=pw[i];
            else c+=pw[i];
        }
        a=(sum-a)%mod;
        t=(sum-t)%mod;
        c=(sum-c)%mod;
        g=(sum-g)%mod;
        for1(n){
            if(s[i][j]=='A')ans[i]+=a;
            else if(s[i][j]=='T')ans[i]+=t;
            else if(s[i][j]=='G')ans[i]+=g;
            else ans[i]+=c;
        }
    }
    ll sum=0;
    for1(n)sum+=pw[i]*k;
    sum%=mod;
    for1(n)if((sum-pw[i]*k%mod+mod)%mod==ans[i]%mod)return cout<<i<<endl,0;
    cout<<"-1\n";





}

• Subtask 1: 27 / 27
• Subtask 2: 19 / 19
• Subtask 3: 28 / 28
• Subtask 4: 26 / 26