제출 #997730

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
997730		MarwenElarbi	Genetics (BOI18_genetics)	C++17	27 / 100	2033 ms	3256 KiB

genetics

#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define ll long long
#define pb push_back
#define ii pair<int,int>
const int nax=5e4+5;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int main(){
    int n,m,k;
    cin>>n>>m>>k;
    string tab[n];
    vector<int> per(n);
    for (int i = 0; i < n; ++i)
    {
        per[i]=i;
        cin>>tab[i];
    }
    //shuffle(per.begin(),per.end(),rng);
    bool vis[n];
    memset(vis,0,sizeof vis);
    //int cnt=0;
    for (int i = 0; i < n; ++i)
    {
        if(vis[i]) continue;
        //if(cnt>10) break;
        //cnt++;
        for (int j = 0; j < n; ++j)
        {
            if(i==j) continue;
            int cur=0;
            for (int t = 0; t < m; ++t)
            {
                if(tab[i][t]!=tab[j][t]) cur++;
                if(cur>k) break;
            }
            if(cur!=k){
                vis[j]=1;
                vis[i]=1;
            }
        }
    }
    for (int i = 0; i < n; ++i)
    {
        if(vis[i]==0){
            cout <<i+1<<endl;
            break;
        }
    }
}

컴파일 시 표준 에러 (stderr) 메시지

In file included from /usr/include/string.h:495,
                 from /usr/include/c++/10/cstring:42,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:48,
                 from genetics.cpp:1:
In function 'void* memset(void*, int, size_t)',
    inlined from 'int main()' at genetics.cpp:22:11:
/usr/include/x86_64-linux-gnu/bits/string_fortified.h:71:33: warning: 'void* __builtin_memset(void*, int, long unsigned int)' specified size between 18446744071562067968 and 18446744073709551615 exceeds maximum object size 9223372036854775807 [-Wstringop-overflow=]
   71 |   return __builtin___memset_chk (__dest, __ch, __len, __bos0 (__dest));
      |          ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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