제출 #1218690

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1218690		Malix	Genetics (BOI18_genetics)	C++20	27 / 100	2096 ms	3932 KiB

genetics

#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<int,int> pi;
typedef vector<pi> pii;
typedef tuple<int,int,int> ti;
typedef vector<ll> li;
typedef vector<li> lii;
 
#define REP(i,a,b) for(int i=a;i<b;i++)
#define F first
#define S second
#define PB push_back
#define LSOne(s) ((s)&(-s))
#define all(x) x.begin(),x.end()
 
ll INF=1000000000000000010;
int inf=1e9+10;
ll M=1e9+7;

int n,m,k;
vector<pair<string,int>> a;

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin>>n>>m>>k;
    a.resize(n);
    REP(i,0,n)cin>>a[i].F;
    REP(i,0,n)a[i].S=i;
    sort(all(a));
    REP(i,0,n){
        bool flag=1;
        REP(j,0,n)if(i!=j){
            int cnt=0;
            REP(x,0,m)if(a[i].F[x]!=a[j].F[x])cnt++;
            if(cnt!=k){
                flag=0;
                break;
            }
        }
        if(flag){
            cout<<a[i].S+1;
            return 0;
        }
    }
}

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