제출 #631871

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
631871		zaneyu	Genetics (BOI18_genetics)	C++14	100 / 100	491 ms	97340 KiB

genetics

/*input
4 3 1
ACC
CCA
ACA
AAA
*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
//order_of_key #of elements less than x
// find_by_order kth element
typedef unsigned long long int ll;
#define ld long double
#define pii pair<int,int>
typedef tree<pii, null_type, less<pii>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
const ll maxn=5e3+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const ll MOD=998244353;
const ld PI=acos(-1);
const ld eps=1e-9;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
template<typename T1,typename T2>
ostream& operator<<(ostream& out,pair<T1,T2> P){
    out<<P.f+1<<' '<<P.s+1;
    return out;
}
template<typename T>
ostream& operator<<(ostream& out,vector<T> V){
    REP(i,sz(V)) out<<V[i]<<((i!=sz(V)-1)?"\n":"");
    return out;
}
int mult(ll a,ll b){
    if(a<0) a+=MOD;
    return (a*b)%MOD;
}
ll mypow(ll a,ll b){
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=mult(res,a);
        a=mult(a,a);
        b>>=1;
    }
    return res;
}
int arr[maxn][maxn];
bool vis[maxn];
int k;
mt19937_64 rng(69);
bool ok[maxn];
ll val[maxn];
ll tot[4][maxn];
int32_t main(){
    ios::sync_with_stdio(false),cin.tie(0);
    int n,m;
    cin>>n>>m>>k;
    REP(i,n){
        REP(j,m){
            char c;
            cin>>c;
            int v=0;
            if(c=='C') v=1;
            if(c=='G') v=2;
            if(c=='T') v=3;
            arr[i][j]=v; 
        }
        ok[i]=1;
    }
    int cnt=n;
    while(cnt>1){
        REP(i,n) val[i]=rng();
        REP(a,4) REP(i,m) tot[a][i]=0;
        ll ts=0;
        REP(i,n){
            ts+=val[i];
            REP(j,m){
                tot[arr[i][j]][j]+=val[i];
            }
        }
        REP(i,n){
            if(!ok[i]) continue;
            ll tmp=ts*m;
            REP(j,m) tmp-=tot[arr[i][j]][j];
            if((ts-val[i])*k!=tmp) ok[i]=0,--cnt;
        }
    }
    REP(i,n){
        if(ok[i]){
            cout<<i+1;
            return 0;
        }
    }
}

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