oj.uz

답안 #566333

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
566333 2022-05-22T08:52:44 Z hoanghq2004 Genetics (BOI18_genetics) C++14
100 / 100
 475 ms 19796 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
using namespace std;

template <typename T>
using ordered_set = tree <T, null_type, less <T>, rb_tree_tag, tree_order_statistics_node_update>;

const int N = 5010;
const int mod = 1e9 + 7;
const int base = 9450;

int n, m, k;
string s[N];
int code[256];
int power[N];
int H[N][4];

int main() {
    ios :: sync_with_stdio(0); cin.tie(0);
    code['A'] = 0, code['C'] = 1, code['G'] = 2, code['T'] = 3;

    cin >> n >> m >> k;
    for (int i = 0; i < n; ++i) cin >> s[i];
    power[0] = 1;
    for (int i = 1; i < n; ++i) power[i] = 1LL * power[i - 1] * base % mod;
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            H[j][code[s[i][j]]] += power[i];
            if (H[j][code[s[i][j]]] >= mod) H[j][code[s[i][j]]] -= mod;
        }
    }
    int tot = 0;
    for (int i = 0; i < n; ++i) tot = (tot + power[i]) % mod;
    for (int i = 0; i < n; ++i) {
        int T = 1LL * ((tot - power[i] + mod) % mod) * k % mod;
        int cur = 0;
        for (int j = 0; j < m; ++j) {
            for (int c = 0; c < 4; ++c)
                if (code[s[i][j]] != c) {
                    cur += H[j][c];
                    if (cur >= mod) cur -= mod;
                }
        }
        if (cur == T) {
            cout << i + 1;
            exit(0);
        }
    }
}

Compilation message

genetics.cpp: In function 'int main()':
genetics.cpp:33:30: warning: array subscript has type 'char' [-Wchar-subscripts]
   33 |             H[j][code[s[i][j]]] += power[i];
      |                              ^
genetics.cpp:34:34: warning: array subscript has type 'char' [-Wchar-subscripts]
   34 |             if (H[j][code[s[i][j]]] >= mod) H[j][code[s[i][j]]] -= mod;
      |                                  ^
genetics.cpp:34:62: warning: array subscript has type 'char' [-Wchar-subscripts]
   34 |             if (H[j][code[s[i][j]]] >= mod) H[j][code[s[i][j]]] -= mod;
      |                                                              ^
genetics.cpp:44:33: warning: array subscript has type 'char' [-Wchar-subscripts]
   44 |                 if (code[s[i][j]] != c) {
      |                                 ^

Subtask #1
27.0 / 27.0

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

Subtask #2
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 55 ms 3156 KB Output is correct
2 Correct 43 ms 3924 KB Output is correct
3 Correct 67 ms 3772 KB Output is correct
4 Correct 15 ms 1108 KB Output is correct
5 Correct 38 ms 3936 KB Output is correct
6 Correct 46 ms 3932 KB Output is correct
7 Correct 29 ms 1876 KB Output is correct
8 Correct 24 ms 2004 KB Output is correct
9 Correct 37 ms 3668 KB Output is correct
10 Correct 58 ms 3668 KB Output is correct
11 Correct 44 ms 3284 KB Output is correct
12 Correct 32 ms 3284 KB Output is correct
13 Correct 40 ms 3156 KB Output is correct
14 Correct 50 ms 2772 KB Output is correct
15 Correct 31 ms 2900 KB Output is correct
16 Correct 34 ms 2900 KB Output is correct
17 Correct 64 ms 3796 KB Output is correct
18 Correct 38 ms 3668 KB Output is correct
19 Correct 56 ms 3796 KB Output is correct
20 Correct 47 ms 3756 KB Output is correct
21 Correct 58 ms 3796 KB Output is correct
22 Correct 65 ms 3736 KB Output is correct
23 Correct 68 ms 3772 KB Output is correct
24 Correct 65 ms 3668 KB Output is correct
25 Correct 47 ms 3668 KB Output is correct
26 Correct 47 ms 3744 KB Output is correct
27 Correct 49 ms 3756 KB Output is correct
28 Correct 47 ms 3668 KB Output is correct
29 Correct 60 ms 3668 KB Output is correct
30 Correct 37 ms 3924 KB Output is correct
31 Correct 54 ms 3796 KB Output is correct
32 Correct 49 ms 3924 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 1 ms 468 KB Output is correct
35 Correct 0 ms 468 KB Output is correct

Subtask #3
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 55 ms 3156 KB Output is correct
2 Correct 43 ms 3924 KB Output is correct
3 Correct 67 ms 3772 KB Output is correct
4 Correct 15 ms 1108 KB Output is correct
5 Correct 38 ms 3936 KB Output is correct
6 Correct 46 ms 3932 KB Output is correct
7 Correct 29 ms 1876 KB Output is correct
8 Correct 24 ms 2004 KB Output is correct
9 Correct 37 ms 3668 KB Output is correct
10 Correct 58 ms 3668 KB Output is correct
11 Correct 44 ms 3284 KB Output is correct
12 Correct 32 ms 3284 KB Output is correct
13 Correct 40 ms 3156 KB Output is correct
14 Correct 50 ms 2772 KB Output is correct
15 Correct 31 ms 2900 KB Output is correct
16 Correct 34 ms 2900 KB Output is correct
17 Correct 64 ms 3796 KB Output is correct
18 Correct 38 ms 3668 KB Output is correct
19 Correct 56 ms 3796 KB Output is correct
20 Correct 47 ms 3756 KB Output is correct
21 Correct 58 ms 3796 KB Output is correct
22 Correct 65 ms 3736 KB Output is correct
23 Correct 68 ms 3772 KB Output is correct
24 Correct 65 ms 3668 KB Output is correct
25 Correct 47 ms 3668 KB Output is correct
26 Correct 47 ms 3744 KB Output is correct
27 Correct 49 ms 3756 KB Output is correct
28 Correct 47 ms 3668 KB Output is correct
29 Correct 60 ms 3668 KB Output is correct
30 Correct 37 ms 3924 KB Output is correct
31 Correct 54 ms 3796 KB Output is correct
32 Correct 49 ms 3924 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 1 ms 468 KB Output is correct
35 Correct 0 ms 468 KB Output is correct
36 Correct 240 ms 17456 KB Output is correct
37 Correct 176 ms 19324 KB Output is correct
38 Correct 354 ms 19412 KB Output is correct
39 Correct 92 ms 6760 KB Output is correct
40 Correct 267 ms 19404 KB Output is correct
41 Correct 154 ms 9940 KB Output is correct
42 Correct 122 ms 9936 KB Output is correct
43 Correct 174 ms 13504 KB Output is correct
44 Correct 218 ms 19784 KB Output is correct
45 Correct 283 ms 19784 KB Output is correct
46 Correct 217 ms 19796 KB Output is correct
47 Correct 258 ms 17452 KB Output is correct
48 Correct 286 ms 17492 KB Output is correct
49 Correct 178 ms 14804 KB Output is correct
50 Correct 242 ms 14924 KB Output is correct
51 Correct 277 ms 16360 KB Output is correct
52 Correct 322 ms 19404 KB Output is correct
53 Correct 339 ms 19364 KB Output is correct
54 Correct 189 ms 18132 KB Output is correct
55 Correct 283 ms 18228 KB Output is correct
56 Correct 226 ms 18212 KB Output is correct
57 Correct 350 ms 19416 KB Output is correct
58 Correct 272 ms 19420 KB Output is correct
59 Correct 235 ms 19280 KB Output is correct
60 Correct 237 ms 19532 KB Output is correct
61 Correct 236 ms 19404 KB Output is correct
62 Correct 216 ms 19156 KB Output is correct
63 Correct 212 ms 19432 KB Output is correct
64 Correct 237 ms 19412 KB Output is correct
65 Correct 312 ms 19444 KB Output is correct
66 Correct 311 ms 19368 KB Output is correct
67 Correct 337 ms 19428 KB Output is correct
68 Correct 265 ms 19532 KB Output is correct
69 Correct 218 ms 19340 KB Output is correct
70 Correct 319 ms 19404 KB Output is correct
71 Correct 268 ms 19332 KB Output is correct
72 Correct 290 ms 19468 KB Output is correct
73 Correct 318 ms 19308 KB Output is correct
74 Correct 0 ms 468 KB Output is correct
75 Correct 1 ms 468 KB Output is correct
76 Correct 0 ms 468 KB Output is correct

Subtask #4
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 0 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 0 ms 480 KB Output is correct
8 Correct 0 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 0 ms 468 KB Output is correct
18 Correct 55 ms 3156 KB Output is correct
19 Correct 43 ms 3924 KB Output is correct
20 Correct 67 ms 3772 KB Output is correct
21 Correct 15 ms 1108 KB Output is correct
22 Correct 38 ms 3936 KB Output is correct
23 Correct 46 ms 3932 KB Output is correct
24 Correct 29 ms 1876 KB Output is correct
25 Correct 24 ms 2004 KB Output is correct
26 Correct 37 ms 3668 KB Output is correct
27 Correct 58 ms 3668 KB Output is correct
28 Correct 44 ms 3284 KB Output is correct
29 Correct 32 ms 3284 KB Output is correct
30 Correct 40 ms 3156 KB Output is correct
31 Correct 50 ms 2772 KB Output is correct
32 Correct 31 ms 2900 KB Output is correct
33 Correct 34 ms 2900 KB Output is correct
34 Correct 64 ms 3796 KB Output is correct
35 Correct 38 ms 3668 KB Output is correct
36 Correct 56 ms 3796 KB Output is correct
37 Correct 47 ms 3756 KB Output is correct
38 Correct 58 ms 3796 KB Output is correct
39 Correct 65 ms 3736 KB Output is correct
40 Correct 68 ms 3772 KB Output is correct
41 Correct 65 ms 3668 KB Output is correct
42 Correct 47 ms 3668 KB Output is correct
43 Correct 47 ms 3744 KB Output is correct
44 Correct 49 ms 3756 KB Output is correct
45 Correct 47 ms 3668 KB Output is correct
46 Correct 60 ms 3668 KB Output is correct
47 Correct 37 ms 3924 KB Output is correct
48 Correct 54 ms 3796 KB Output is correct
49 Correct 49 ms 3924 KB Output is correct
50 Correct 1 ms 468 KB Output is correct
51 Correct 1 ms 468 KB Output is correct
52 Correct 0 ms 468 KB Output is correct
53 Correct 240 ms 17456 KB Output is correct
54 Correct 176 ms 19324 KB Output is correct
55 Correct 354 ms 19412 KB Output is correct
56 Correct 92 ms 6760 KB Output is correct
57 Correct 267 ms 19404 KB Output is correct
58 Correct 154 ms 9940 KB Output is correct
59 Correct 122 ms 9936 KB Output is correct
60 Correct 174 ms 13504 KB Output is correct
61 Correct 218 ms 19784 KB Output is correct
62 Correct 283 ms 19784 KB Output is correct
63 Correct 217 ms 19796 KB Output is correct
64 Correct 258 ms 17452 KB Output is correct
65 Correct 286 ms 17492 KB Output is correct
66 Correct 178 ms 14804 KB Output is correct
67 Correct 242 ms 14924 KB Output is correct
68 Correct 277 ms 16360 KB Output is correct
69 Correct 322 ms 19404 KB Output is correct
70 Correct 339 ms 19364 KB Output is correct
71 Correct 189 ms 18132 KB Output is correct
72 Correct 283 ms 18228 KB Output is correct
73 Correct 226 ms 18212 KB Output is correct
74 Correct 350 ms 19416 KB Output is correct
75 Correct 272 ms 19420 KB Output is correct
76 Correct 235 ms 19280 KB Output is correct
77 Correct 237 ms 19532 KB Output is correct
78 Correct 236 ms 19404 KB Output is correct
79 Correct 216 ms 19156 KB Output is correct
80 Correct 212 ms 19432 KB Output is correct
81 Correct 237 ms 19412 KB Output is correct
82 Correct 312 ms 19444 KB Output is correct
83 Correct 311 ms 19368 KB Output is correct
84 Correct 337 ms 19428 KB Output is correct
85 Correct 265 ms 19532 KB Output is correct
86 Correct 218 ms 19340 KB Output is correct
87 Correct 319 ms 19404 KB Output is correct
88 Correct 268 ms 19332 KB Output is correct
89 Correct 290 ms 19468 KB Output is correct
90 Correct 318 ms 19308 KB Output is correct
91 Correct 0 ms 468 KB Output is correct
92 Correct 1 ms 468 KB Output is correct
93 Correct 0 ms 468 KB Output is correct
94 Correct 216 ms 18872 KB Output is correct
95 Correct 252 ms 19276 KB Output is correct
96 Correct 475 ms 19508 KB Output is correct
97 Correct 219 ms 10504 KB Output is correct
98 Correct 123 ms 6768 KB Output is correct
99 Correct 301 ms 19304 KB Output is correct
100 Correct 167 ms 9948 KB Output is correct
101 Correct 135 ms 9940 KB Output is correct
102 Correct 178 ms 13564 KB Output is correct
103 Correct 257 ms 19796 KB Output is correct
104 Correct 386 ms 19788 KB Output is correct
105 Correct 457 ms 19796 KB Output is correct
106 Correct 400 ms 18936 KB Output is correct
107 Correct 206 ms 17492 KB Output is correct
108 Correct 223 ms 14876 KB Output is correct
109 Correct 298 ms 17236 KB Output is correct
110 Correct 316 ms 15832 KB Output is correct
111 Correct 244 ms 19796 KB Output is correct
112 Correct 362 ms 19572 KB Output is correct
113 Correct 281 ms 18212 KB Output is correct
114 Correct 204 ms 18220 KB Output is correct
115 Correct 387 ms 18256 KB Output is correct
116 Correct 400 ms 19540 KB Output is correct
117 Correct 380 ms 19540 KB Output is correct
118 Correct 354 ms 19580 KB Output is correct
119 Correct 301 ms 19584 KB Output is correct
120 Correct 391 ms 19660 KB Output is correct
121 Correct 244 ms 17484 KB Output is correct
122 Correct 207 ms 19324 KB Output is correct
123 Correct 343 ms 19412 KB Output is correct
124 Correct 0 ms 468 KB Output is correct
125 Correct 1 ms 468 KB Output is correct
126 Correct 1 ms 468 KB Output is correct