oj.uz

답안 #916603

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
916603 2024-01-26T06:56:51 Z 406 Genetics (BOI18_genetics) C++17
27 / 100
 2000 ms 5724 KB 
#include <bits/stdc++.h>
#define int int64_t
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)

using namespace std;
using ar = array<int, 2>;

const int64_t INF = 1ll << 60;
const int N = 4200;
int n, m, k;
vector<pair<string, int>> a, tmp;

bool get(const string &s1, const string &s2) {
        int x = 0;
        FOR(i, 0, m) {
                x += s1[i] != s2[i];
                if (x > k) return false;
        }
        return x == k;
}

signed main() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr); 
        cin >> n >> m >> k;
        a.resize(n);
        FOR (i, 0, n) {
                string s;
                cin >> s;
                a[i] = {s, i};
        }
        mt19937 rng((int64_t) new char);
        tmp = a;
        //shuffle(a.begin(), a.end(), rng);

        int cnt = 0;
        while (a.size() >= 2 && cnt <= 10) {
                int i = rng() % a.size(), j;
                do {
                        j = rng() % a.size();
                } while (j == i);
                if (!get(a[i].first, a[j].first)) {
                        if (i > j) swap(i, j);
                        a.erase(a.begin() + j);
                        a.erase(a.begin() + i);
                        cnt = 0;
                }
                ++cnt;
        }

        FOR(i, 0, a.size()) {
                bool f = true;
                for (auto &[s, x]: tmp) if (x != a[i].second)
                        f &= get(a[i].first, s);
                if (f) {
                        cout << a[i].second + 1;
                        return 0;
                }
        }
        return 0;
}

Compilation message

genetics.cpp: In function 'int main()':
genetics.cpp:3:42: warning: comparison of integer expressions of different signedness: 'int64_t' {aka 'long int'} and 'std::vector<std::pair<std::__cxx11::basic_string<char>, long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    3 | #define FOR(i, a, b) for (int i = (a); i < (b); ++i)
      |                                          ^
genetics.cpp:51:9: note: in expansion of macro 'FOR'
   51 |         FOR(i, 0, a.size()) {
      |         ^~~

Subtask #1
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 0 ms 344 KB Output is correct

Subtask #2
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2068 ms 5724 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2068 ms 5724 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Execution timed out 2068 ms 5724 KB Time limit exceeded
19 Halted 0 ms 0 KB -