제출 #1001499

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1001499		Whisper	Genetics (BOI18_genetics)	C++17	19 / 100	2098 ms	37396 KiB

genetics

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define int long long
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (b); i >= (a); i --)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPD(i, n) for (int i = (n) - 1; i >= 0; --i)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)


constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

/*
    Phu Trong from Nguyen Tat Thanh High School for gifted student
*/

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
int numPeople, l, dif;
#define N   4100

void process(void){
    cin >> numPeople >> l >> dif;
    vector<string> s(numPeople);
    for (string& v : s) cin >> v;
    vector<bitset<N>> A(numPeople);
    for (int i = 0; i < numPeople; ++i){
        for (int j = 0; j < l; ++j){
            A[i][j] = (s[i][j] == 'A');
        }
    }
    for (int i = 0; i < numPeople; ++i){
        bool ok = 1;
        for (int j = 0; j < numPeople; ++j) if(i != j){
            bitset<N> cur = (A[i] ^ A[j]);
            if (cur.count() != dif) ok = 0;
        }
        if (ok) return void(cout << i + 1);
    }
}

signed main(){
    #define name "Whisper"
    cin.tie(nullptr) -> sync_with_stdio(false);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);

    process();
}

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

genetics.cpp: In function 'void process()':
genetics.cpp:55:29: warning: comparison of integer expressions of different signedness: 'std::size_t' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   55 |             if (cur.count() != dif) ok = 0;
      |                 ~~~~~~~~~~~~^~~~~~

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