oj.uz

답안 #62718

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
62718 2018-07-29T21:42:16 Z eriksuenderhauf Genetics (BOI18_genetics) C++11
74 / 100
 2000 ms 71676 KB 
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define enl printf("\n")
#define case(t) printf("Case #%d: ", (t))
#define ni(n) scanf("%d", &(n))
#define nl(n) scanf("%I64d", &(n))
#define nai(a, n) for (int i = 0; i < (n); i++) ni(a[i])
#define nal(a, n) for (int i = 0; i < (n); i++) nl(a[i])
#define pri(n) printf("%d\n", (n))
#define prl(n) printf("%I64d\n", (n))
#define pii pair<int, int>
#define vii vector<pii>
#define vi vector<int>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
typedef long long ll;
const double pi = acos(-1);
const int MOD = 1e9 + 7;
const int INF = 1e9 + 7;
const int MAXN = 5e3 + 5;
const double eps = 1e-9;
using namespace std;
char str[MAXN][MAXN];
bitset<MAXN> a[MAXN][4];
int cnt[MAXN][4];
short vis[MAXN][MAXN];
short ind[MAXN];

int go(char c)
{
    if (c == 'A') return 0;
    else if (c == 'C') return 1;
    else if (c == 'G') return 2;
    else if (c == 'T') return 3;
}

int main()
{
    int n, m, k;
    ni(n), ni(m), ni(k);
    for (int i = 0; i < n; i++)
    {
        scanf("%s", str[i]);
        for (int j = 0; j < m; j++)
        {
            int cur = go(str[i][j]);
            a[i][cur][j] = 1;
            cnt[j][cur]++;
            vis[i][j] = -1;
        }
        for (int j = m; j < n; j++)
            vis[i][j] = -1;
        ind[i] = i;
    }
    random_shuffle(ind, ind + n);
    for (int yl = 0; yl < n; yl++)
    {
        int i = yl;
        int tmp = 0;
        for (short j = 0; j < m; j++)
            tmp += n - cnt[j][go(str[i][j])];
        if (tmp != k * (n - 1))
            continue;
        bool fl = 0;
        for (short j = n - 1; j >= 0; j--)
        {
            if (i == j)
                continue;
            short val = 0;
            if (vis[i][j] != -1)
                val = vis[i][j];
            else
            {
                for (short b = 0; b < 4; b++)
                {
                    val += (a[i][b] ^ a[j][b]).count();
                    if (val > 2 * k)
                        break;
                }
                vis[i][j] = val;
                vis[j][i] = val;
            }
            if (val != 2 * k)
            {
                fl = 1;
                break;
            }
        }
        if (fl)
            continue;
        return !pri(i + 1);
    }
    return 0;
}

Compilation message

genetics.cpp: In function 'int go(char)':
genetics.cpp:37:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
genetics.cpp: In function 'int main()':
genetics.cpp:42:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     ni(n), ni(m), ni(k);
                 ^
genetics.cpp:42:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
genetics.cpp:42:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
genetics.cpp:45:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%s", str[i]);
         ~~~~~^~~~~~~~~~~~~~

Subtask #1
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 1272 KB Output is correct
2 Correct 6 ms 1400 KB Output is correct
3 Correct 5 ms 504 KB Output is correct
4 Correct 5 ms 1144 KB Output is correct
5 Correct 5 ms 1400 KB Output is correct
6 Correct 5 ms 1400 KB Output is correct
7 Correct 5 ms 888 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 1016 KB Output is correct
10 Correct 5 ms 1400 KB Output is correct
11 Correct 5 ms 1272 KB Output is correct
12 Correct 5 ms 1400 KB Output is correct
13 Correct 5 ms 1376 KB Output is correct
14 Correct 5 ms 1400 KB Output is correct
15 Correct 6 ms 1400 KB Output is correct
16 Correct 6 ms 1400 KB Output is correct
17 Correct 5 ms 376 KB Output is correct

Subtask #2
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 111 ms 23264 KB Output is correct
2 Correct 55 ms 27768 KB Output is correct
3 Correct 73 ms 26632 KB Output is correct
4 Correct 25 ms 15864 KB Output is correct
5 Correct 58 ms 27768 KB Output is correct
6 Correct 63 ms 27768 KB Output is correct
7 Correct 34 ms 12028 KB Output is correct
8 Correct 33 ms 12156 KB Output is correct
9 Correct 59 ms 26488 KB Output is correct
10 Correct 120 ms 26488 KB Output is correct
11 Correct 337 ms 23160 KB Output is correct
12 Correct 72 ms 23392 KB Output is correct
13 Correct 93 ms 23288 KB Output is correct
14 Correct 99 ms 19964 KB Output is correct
15 Correct 57 ms 20344 KB Output is correct
16 Correct 47 ms 22008 KB Output is correct
17 Correct 70 ms 26616 KB Output is correct
18 Correct 56 ms 26360 KB Output is correct
19 Correct 70 ms 26744 KB Output is correct
20 Correct 57 ms 26360 KB Output is correct
21 Correct 70 ms 26616 KB Output is correct
22 Correct 73 ms 26360 KB Output is correct
23 Correct 73 ms 26488 KB Output is correct
24 Correct 76 ms 26500 KB Output is correct
25 Correct 59 ms 26360 KB Output is correct
26 Correct 62 ms 26488 KB Output is correct
27 Correct 61 ms 26360 KB Output is correct
28 Correct 61 ms 26360 KB Output is correct
29 Correct 74 ms 26488 KB Output is correct
30 Correct 54 ms 27768 KB Output is correct
31 Correct 55 ms 27768 KB Output is correct
32 Correct 63 ms 27768 KB Output is correct
33 Correct 5 ms 376 KB Output is correct
34 Correct 5 ms 1400 KB Output is correct
35 Correct 5 ms 376 KB Output is correct

Subtask #3
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 111 ms 23264 KB Output is correct
2 Correct 55 ms 27768 KB Output is correct
3 Correct 73 ms 26632 KB Output is correct
4 Correct 25 ms 15864 KB Output is correct
5 Correct 58 ms 27768 KB Output is correct
6 Correct 63 ms 27768 KB Output is correct
7 Correct 34 ms 12028 KB Output is correct
8 Correct 33 ms 12156 KB Output is correct
9 Correct 59 ms 26488 KB Output is correct
10 Correct 120 ms 26488 KB Output is correct
11 Correct 337 ms 23160 KB Output is correct
12 Correct 72 ms 23392 KB Output is correct
13 Correct 93 ms 23288 KB Output is correct
14 Correct 99 ms 19964 KB Output is correct
15 Correct 57 ms 20344 KB Output is correct
16 Correct 47 ms 22008 KB Output is correct
17 Correct 70 ms 26616 KB Output is correct
18 Correct 56 ms 26360 KB Output is correct
19 Correct 70 ms 26744 KB Output is correct
20 Correct 57 ms 26360 KB Output is correct
21 Correct 70 ms 26616 KB Output is correct
22 Correct 73 ms 26360 KB Output is correct
23 Correct 73 ms 26488 KB Output is correct
24 Correct 76 ms 26500 KB Output is correct
25 Correct 59 ms 26360 KB Output is correct
26 Correct 62 ms 26488 KB Output is correct
27 Correct 61 ms 26360 KB Output is correct
28 Correct 61 ms 26360 KB Output is correct
29 Correct 74 ms 26488 KB Output is correct
30 Correct 54 ms 27768 KB Output is correct
31 Correct 55 ms 27768 KB Output is correct
32 Correct 63 ms 27768 KB Output is correct
33 Correct 5 ms 376 KB Output is correct
34 Correct 5 ms 1400 KB Output is correct
35 Correct 5 ms 376 KB Output is correct
36 Correct 292 ms 62840 KB Output is correct
37 Correct 218 ms 71544 KB Output is correct
38 Correct 321 ms 70008 KB Output is correct
39 Correct 119 ms 60284 KB Output is correct
40 Correct 303 ms 71416 KB Output is correct
41 Correct 151 ms 36216 KB Output is correct
42 Correct 137 ms 36216 KB Output is correct
43 Correct 264 ms 60536 KB Output is correct
44 Correct 276 ms 71544 KB Output is correct
45 Correct 541 ms 71544 KB Output is correct
46 Correct 242 ms 71544 KB Output is correct
47 Correct 562 ms 62968 KB Output is correct
48 Correct 1919 ms 62712 KB Output is correct
49 Correct 292 ms 53880 KB Output is correct
50 Correct 239 ms 54008 KB Output is correct
51 Correct 258 ms 60408 KB Output is correct
52 Correct 300 ms 69752 KB Output is correct
53 Correct 306 ms 69752 KB Output is correct
54 Correct 192 ms 69752 KB Output is correct
55 Correct 244 ms 69880 KB Output is correct
56 Correct 226 ms 69752 KB Output is correct
57 Correct 337 ms 69880 KB Output is correct
58 Correct 273 ms 69880 KB Output is correct
59 Correct 247 ms 69624 KB Output is correct
60 Correct 241 ms 70008 KB Output is correct
61 Correct 244 ms 69624 KB Output is correct
62 Correct 239 ms 69804 KB Output is correct
63 Correct 228 ms 70008 KB Output is correct
64 Correct 244 ms 69880 KB Output is correct
65 Correct 308 ms 69756 KB Output is correct
66 Correct 294 ms 69752 KB Output is correct
67 Correct 300 ms 70136 KB Output is correct
68 Correct 264 ms 70008 KB Output is correct
69 Correct 230 ms 69624 KB Output is correct
70 Correct 288 ms 70008 KB Output is correct
71 Correct 265 ms 69752 KB Output is correct
72 Correct 269 ms 70268 KB Output is correct
73 Correct 284 ms 69880 KB Output is correct
74 Correct 5 ms 376 KB Output is correct
75 Correct 5 ms 1400 KB Output is correct
76 Correct 5 ms 504 KB Output is correct

Subtask #4
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 1272 KB Output is correct
2 Correct 6 ms 1400 KB Output is correct
3 Correct 5 ms 504 KB Output is correct
4 Correct 5 ms 1144 KB Output is correct
5 Correct 5 ms 1400 KB Output is correct
6 Correct 5 ms 1400 KB Output is correct
7 Correct 5 ms 888 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 1016 KB Output is correct
10 Correct 5 ms 1400 KB Output is correct
11 Correct 5 ms 1272 KB Output is correct
12 Correct 5 ms 1400 KB Output is correct
13 Correct 5 ms 1376 KB Output is correct
14 Correct 5 ms 1400 KB Output is correct
15 Correct 6 ms 1400 KB Output is correct
16 Correct 6 ms 1400 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 111 ms 23264 KB Output is correct
19 Correct 55 ms 27768 KB Output is correct
20 Correct 73 ms 26632 KB Output is correct
21 Correct 25 ms 15864 KB Output is correct
22 Correct 58 ms 27768 KB Output is correct
23 Correct 63 ms 27768 KB Output is correct
24 Correct 34 ms 12028 KB Output is correct
25 Correct 33 ms 12156 KB Output is correct
26 Correct 59 ms 26488 KB Output is correct
27 Correct 120 ms 26488 KB Output is correct
28 Correct 337 ms 23160 KB Output is correct
29 Correct 72 ms 23392 KB Output is correct
30 Correct 93 ms 23288 KB Output is correct
31 Correct 99 ms 19964 KB Output is correct
32 Correct 57 ms 20344 KB Output is correct
33 Correct 47 ms 22008 KB Output is correct
34 Correct 70 ms 26616 KB Output is correct
35 Correct 56 ms 26360 KB Output is correct
36 Correct 70 ms 26744 KB Output is correct
37 Correct 57 ms 26360 KB Output is correct
38 Correct 70 ms 26616 KB Output is correct
39 Correct 73 ms 26360 KB Output is correct
40 Correct 73 ms 26488 KB Output is correct
41 Correct 76 ms 26500 KB Output is correct
42 Correct 59 ms 26360 KB Output is correct
43 Correct 62 ms 26488 KB Output is correct
44 Correct 61 ms 26360 KB Output is correct
45 Correct 61 ms 26360 KB Output is correct
46 Correct 74 ms 26488 KB Output is correct
47 Correct 54 ms 27768 KB Output is correct
48 Correct 55 ms 27768 KB Output is correct
49 Correct 63 ms 27768 KB Output is correct
50 Correct 5 ms 376 KB Output is correct
51 Correct 5 ms 1400 KB Output is correct
52 Correct 5 ms 376 KB Output is correct
53 Correct 292 ms 62840 KB Output is correct
54 Correct 218 ms 71544 KB Output is correct
55 Correct 321 ms 70008 KB Output is correct
56 Correct 119 ms 60284 KB Output is correct
57 Correct 303 ms 71416 KB Output is correct
58 Correct 151 ms 36216 KB Output is correct
59 Correct 137 ms 36216 KB Output is correct
60 Correct 264 ms 60536 KB Output is correct
61 Correct 276 ms 71544 KB Output is correct
62 Correct 541 ms 71544 KB Output is correct
63 Correct 242 ms 71544 KB Output is correct
64 Correct 562 ms 62968 KB Output is correct
65 Correct 1919 ms 62712 KB Output is correct
66 Correct 292 ms 53880 KB Output is correct
67 Correct 239 ms 54008 KB Output is correct
68 Correct 258 ms 60408 KB Output is correct
69 Correct 300 ms 69752 KB Output is correct
70 Correct 306 ms 69752 KB Output is correct
71 Correct 192 ms 69752 KB Output is correct
72 Correct 244 ms 69880 KB Output is correct
73 Correct 226 ms 69752 KB Output is correct
74 Correct 337 ms 69880 KB Output is correct
75 Correct 273 ms 69880 KB Output is correct
76 Correct 247 ms 69624 KB Output is correct
77 Correct 241 ms 70008 KB Output is correct
78 Correct 244 ms 69624 KB Output is correct
79 Correct 239 ms 69804 KB Output is correct
80 Correct 228 ms 70008 KB Output is correct
81 Correct 244 ms 69880 KB Output is correct
82 Correct 308 ms 69756 KB Output is correct
83 Correct 294 ms 69752 KB Output is correct
84 Correct 300 ms 70136 KB Output is correct
85 Correct 264 ms 70008 KB Output is correct
86 Correct 230 ms 69624 KB Output is correct
87 Correct 288 ms 70008 KB Output is correct
88 Correct 265 ms 69752 KB Output is correct
89 Correct 269 ms 70268 KB Output is correct
90 Correct 284 ms 69880 KB Output is correct
91 Correct 5 ms 376 KB Output is correct
92 Correct 5 ms 1400 KB Output is correct
93 Correct 5 ms 504 KB Output is correct
94 Correct 265 ms 67768 KB Output is correct
95 Correct 243 ms 71544 KB Output is correct
96 Correct 414 ms 70520 KB Output is correct
97 Correct 224 ms 38776 KB Output is correct
98 Correct 143 ms 60380 KB Output is correct
99 Correct 304 ms 71676 KB Output is correct
100 Correct 183 ms 36344 KB Output is correct
101 Correct 172 ms 36344 KB Output is correct
102 Correct 233 ms 60536 KB Output is correct
103 Correct 437 ms 71544 KB Output is correct
104 Correct 782 ms 71612 KB Output is correct
105 Correct 510 ms 71544 KB Output is correct
106 Execution timed out 2058 ms 68088 KB Time limit exceeded
107 Halted 0 ms 0 KB -