제출 #441473

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
441473		abc864197532	Genetics (BOI18_genetics)	C++17	19 / 100	2043 ms	2388 KiB

genetics

#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define X first
#define Y second
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define pii pair<int, int>
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define test(args...) abc("[" + string(#args) + "]", args)
void abc() {cerr << endl;}
template <typename T, typename ...U> void abc(T a, U ...b) {
    cerr << a << ' ', abc(b...);
}
template <typename T> void printv(T l, T r) {
    while (l != r) cout << *l << " \n"[++l == r];
}
const int mod = 1e9 + 7, N = 200000;

bitset <4100> A[4100];

int main () {
    srand(time(NULL));
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, m, k;
    cin >> n >> m >> k;
    for (int i = 0; i < n; ++i) {
        string s;
        cin >> s;
        for (int j = 0; j < m; ++j) {
            if (s[j] == 'A') A[i][j].flip();
        }
    }
    vector <bool> possible(n, true);
    int t = 10000;
    while (t--) {
        int i = rand() % n, j = rand() % n;
        if (i == j) continue;
        if ((A[i] ^ A[j]).count() != k) possible[i] = false, possible[j] = false;
    }
    for (int ans = 0; ans < n; ++ans) if (possible[ans]) {
        bool is = true;
        for (int i = 0; i < n; ++i) if (ans != i) {
            is &= (A[i] ^ A[ans]).count() == k;
        }
        if (is) return cout << ans + 1 << endl, 0;
    }
}

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

genetics.cpp: In function 'int main()':
genetics.cpp:42:35: warning: comparison of integer expressions of different signedness: 'std::size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   42 |         if ((A[i] ^ A[j]).count() != k) possible[i] = false, possible[j] = false;
      |             ~~~~~~~~~~~~~~~~~~~~~~^~~~
genetics.cpp:47:43: warning: comparison of integer expressions of different signedness: 'std::size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   47 |             is &= (A[i] ^ A[ans]).count() == k;
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~

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