oj.uz

Submission #979902

# Submission time Handle Problem Language Result Execution time Memory
979902 2024-05-11T15:25:40 Z vjudge1 Genetics (BOI18_genetics) C++17
47 / 100
 805 ms 25584 KB 
#include <bits/stdc++.h>
using namespace std;

using ll = long long;

const int maxN  = 4'123;

const ll Mod    = 1'696'969'997;
const ll maxW   = 1'234'567;

mt19937_64 rng(Mod);
uniform_int_distribution<ll> uid(1, maxW);

ll madd(ll x, ll y) { return (x + y) % Mod; }
ll msub(ll x, ll y) { return (x - y + Mod) % Mod; }
ll mmul(ll x, ll y) { return (x * y) % Mod; }

int N, M, K;
bool A[maxN][maxN];
ll sum_w, row_w[maxN];
ll col_sum[maxN];

int main() {
    scanf("%d %d %d", &N, &M, &K);
    char buf;
    for (int i = 1; i <= N; i++) {
        row_w[i] = uid(rng);
        sum_w = madd(sum_w, row_w[i]);

        for (int j = 1; j <= M; j++) {
            scanf(" %c", &buf);
            if (buf == 'A') A[i][j] = true;
        }
    }

    for (int i = 1; i <= N; i++) {
        for (int j = 1; j <= M; j++) {
            if (A[i][j]) col_sum[j] = madd(col_sum[j], row_w[i]);
        }
    }

    for (int r = 1; r <= N; r++) {
        ll target = mmul(M - K, msub(sum_w, row_w[r])); // must match at M - K positions

        ll cur = 0;
        for (int c = 1; c <= M; c++) {
            if (A[r][c]) {
                cur = madd(cur, msub(col_sum[c], row_w[r]));
            } else {
                cur = madd(cur, msub(msub(sum_w, col_sum[c]), row_w[r]));
            }
        }

        if (target == cur) {
            printf("%d\n", r);
            exit(0);
        }
    }
}

Compilation message

genetics.cpp: In function 'int main()':
genetics.cpp:24:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   24 |     scanf("%d %d %d", &N, &M, &K);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
genetics.cpp:31:18: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   31 |             scanf(" %c", &buf);
      |             ~~~~~^~~~~~~~~~~~~

Subtask #1
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Incorrect 1 ms 2396 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 125 ms 6712 KB Output is correct
2 Correct 134 ms 8760 KB Output is correct
3 Correct 155 ms 8772 KB Output is correct
4 Correct 49 ms 6704 KB Output is correct
5 Correct 137 ms 8532 KB Output is correct
6 Correct 147 ms 8756 KB Output is correct
7 Correct 64 ms 4436 KB Output is correct
8 Correct 63 ms 4436 KB Output is correct
9 Correct 130 ms 8760 KB Output is correct
10 Correct 137 ms 8532 KB Output is correct
11 Correct 124 ms 6712 KB Output is correct
12 Correct 115 ms 6968 KB Output is correct
13 Correct 114 ms 6704 KB Output is correct
14 Correct 108 ms 6484 KB Output is correct
15 Correct 104 ms 6480 KB Output is correct
16 Correct 98 ms 6700 KB Output is correct
17 Correct 142 ms 8532 KB Output is correct
18 Correct 136 ms 8532 KB Output is correct
19 Correct 145 ms 8744 KB Output is correct
20 Correct 140 ms 8744 KB Output is correct
21 Correct 149 ms 8532 KB Output is correct
22 Correct 155 ms 9012 KB Output is correct
23 Correct 148 ms 8532 KB Output is correct
24 Correct 153 ms 8772 KB Output is correct
25 Correct 145 ms 8752 KB Output is correct
26 Correct 134 ms 8784 KB Output is correct
27 Correct 140 ms 8528 KB Output is correct
28 Correct 140 ms 8756 KB Output is correct
29 Correct 140 ms 8764 KB Output is correct
30 Correct 156 ms 8760 KB Output is correct
31 Correct 130 ms 8532 KB Output is correct
32 Correct 145 ms 9284 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 2616 KB Output is correct
35 Correct 0 ms 344 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 125 ms 6712 KB Output is correct
2 Correct 134 ms 8760 KB Output is correct
3 Correct 155 ms 8772 KB Output is correct
4 Correct 49 ms 6704 KB Output is correct
5 Correct 137 ms 8532 KB Output is correct
6 Correct 147 ms 8756 KB Output is correct
7 Correct 64 ms 4436 KB Output is correct
8 Correct 63 ms 4436 KB Output is correct
9 Correct 130 ms 8760 KB Output is correct
10 Correct 137 ms 8532 KB Output is correct
11 Correct 124 ms 6712 KB Output is correct
12 Correct 115 ms 6968 KB Output is correct
13 Correct 114 ms 6704 KB Output is correct
14 Correct 108 ms 6484 KB Output is correct
15 Correct 104 ms 6480 KB Output is correct
16 Correct 98 ms 6700 KB Output is correct
17 Correct 142 ms 8532 KB Output is correct
18 Correct 136 ms 8532 KB Output is correct
19 Correct 145 ms 8744 KB Output is correct
20 Correct 140 ms 8744 KB Output is correct
21 Correct 149 ms 8532 KB Output is correct
22 Correct 155 ms 9012 KB Output is correct
23 Correct 148 ms 8532 KB Output is correct
24 Correct 153 ms 8772 KB Output is correct
25 Correct 145 ms 8752 KB Output is correct
26 Correct 134 ms 8784 KB Output is correct
27 Correct 140 ms 8528 KB Output is correct
28 Correct 140 ms 8756 KB Output is correct
29 Correct 140 ms 8764 KB Output is correct
30 Correct 156 ms 8760 KB Output is correct
31 Correct 130 ms 8532 KB Output is correct
32 Correct 145 ms 9284 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 2616 KB Output is correct
35 Correct 0 ms 344 KB Output is correct
36 Correct 657 ms 15192 KB Output is correct
37 Correct 666 ms 17232 KB Output is correct
38 Correct 770 ms 16956 KB Output is correct
39 Correct 269 ms 18004 KB Output is correct
40 Correct 765 ms 25468 KB Output is correct
41 Correct 383 ms 13140 KB Output is correct
42 Correct 372 ms 13108 KB Output is correct
43 Correct 517 ms 20924 KB Output is correct
44 Correct 730 ms 25360 KB Output is correct
45 Correct 770 ms 25584 KB Output is correct
46 Correct 746 ms 25360 KB Output is correct
47 Correct 658 ms 22352 KB Output is correct
48 Correct 689 ms 22352 KB Output is correct
49 Correct 534 ms 19796 KB Output is correct
50 Correct 621 ms 19280 KB Output is correct
51 Correct 672 ms 22072 KB Output is correct
52 Correct 759 ms 25020 KB Output is correct
53 Correct 786 ms 25380 KB Output is correct
54 Correct 641 ms 25236 KB Output is correct
55 Correct 680 ms 25284 KB Output is correct
56 Correct 683 ms 25424 KB Output is correct
57 Correct 786 ms 25248 KB Output is correct
58 Correct 723 ms 25212 KB Output is correct
59 Correct 698 ms 25016 KB Output is correct
60 Correct 701 ms 25140 KB Output is correct
61 Correct 700 ms 25212 KB Output is correct
62 Correct 700 ms 25212 KB Output is correct
63 Correct 698 ms 25008 KB Output is correct
64 Correct 708 ms 25552 KB Output is correct
65 Correct 788 ms 25372 KB Output is correct
66 Correct 805 ms 25308 KB Output is correct
67 Correct 788 ms 25196 KB Output is correct
68 Correct 729 ms 24996 KB Output is correct
69 Correct 678 ms 25012 KB Output is correct
70 Correct 762 ms 25124 KB Output is correct
71 Correct 743 ms 25208 KB Output is correct
72 Correct 772 ms 25332 KB Output is correct
73 Correct 754 ms 25340 KB Output is correct
74 Correct 0 ms 344 KB Output is correct
75 Correct 1 ms 2396 KB Output is correct
76 Correct 0 ms 348 KB Output is correct

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Incorrect 1 ms 2396 KB Output isn't correct
3 Halted 0 ms 0 KB -