oj.uz

답안 #62716

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
62716 2018-07-29T21:40:50 Z eriksuenderhauf Genetics (BOI18_genetics) C++11
74 / 100
 2000 ms 70904 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 6 ms 1272 KB Output is correct
2 Correct 5 ms 1400 KB Output is correct
3 Correct 5 ms 376 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 6 ms 1400 KB Output is correct
11 Correct 5 ms 1272 KB Output is correct
12 Correct 5 ms 1404 KB Output is correct
13 Correct 5 ms 1400 KB Output is correct
14 Correct 5 ms 1400 KB Output is correct
15 Correct 6 ms 1400 KB Output is correct
16 Correct 5 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 22648 KB Output is correct
2 Correct 54 ms 27132 KB Output is correct
3 Correct 73 ms 25976 KB Output is correct
4 Correct 25 ms 15608 KB Output is correct
5 Correct 55 ms 27128 KB Output is correct
6 Correct 61 ms 27132 KB Output is correct
7 Correct 35 ms 11768 KB Output is correct
8 Correct 31 ms 11768 KB Output is correct
9 Correct 57 ms 25848 KB Output is correct
10 Correct 113 ms 25976 KB Output is correct
11 Correct 323 ms 22776 KB Output is correct
12 Correct 70 ms 22776 KB Output is correct
13 Correct 90 ms 22648 KB Output is correct
14 Correct 99 ms 19576 KB Output is correct
15 Correct 56 ms 19704 KB Output is correct
16 Correct 46 ms 21496 KB Output is correct
17 Correct 67 ms 26104 KB Output is correct
18 Correct 52 ms 25848 KB Output is correct
19 Correct 67 ms 26104 KB Output is correct
20 Correct 55 ms 25720 KB Output is correct
21 Correct 67 ms 25976 KB Output is correct
22 Correct 71 ms 25720 KB Output is correct
23 Correct 72 ms 25848 KB Output is correct
24 Correct 72 ms 25976 KB Output is correct
25 Correct 56 ms 25848 KB Output is correct
26 Correct 61 ms 25976 KB Output is correct
27 Correct 60 ms 25720 KB Output is correct
28 Correct 58 ms 25720 KB Output is correct
29 Correct 66 ms 25848 KB Output is correct
30 Correct 48 ms 27260 KB Output is correct
31 Correct 57 ms 27256 KB Output is correct
32 Correct 60 ms 27128 KB Output is correct
33 Correct 5 ms 376 KB Output is correct
34 Correct 5 ms 1404 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 22648 KB Output is correct
2 Correct 54 ms 27132 KB Output is correct
3 Correct 73 ms 25976 KB Output is correct
4 Correct 25 ms 15608 KB Output is correct
5 Correct 55 ms 27128 KB Output is correct
6 Correct 61 ms 27132 KB Output is correct
7 Correct 35 ms 11768 KB Output is correct
8 Correct 31 ms 11768 KB Output is correct
9 Correct 57 ms 25848 KB Output is correct
10 Correct 113 ms 25976 KB Output is correct
11 Correct 323 ms 22776 KB Output is correct
12 Correct 70 ms 22776 KB Output is correct
13 Correct 90 ms 22648 KB Output is correct
14 Correct 99 ms 19576 KB Output is correct
15 Correct 56 ms 19704 KB Output is correct
16 Correct 46 ms 21496 KB Output is correct
17 Correct 67 ms 26104 KB Output is correct
18 Correct 52 ms 25848 KB Output is correct
19 Correct 67 ms 26104 KB Output is correct
20 Correct 55 ms 25720 KB Output is correct
21 Correct 67 ms 25976 KB Output is correct
22 Correct 71 ms 25720 KB Output is correct
23 Correct 72 ms 25848 KB Output is correct
24 Correct 72 ms 25976 KB Output is correct
25 Correct 56 ms 25848 KB Output is correct
26 Correct 61 ms 25976 KB Output is correct
27 Correct 60 ms 25720 KB Output is correct
28 Correct 58 ms 25720 KB Output is correct
29 Correct 66 ms 25848 KB Output is correct
30 Correct 48 ms 27260 KB Output is correct
31 Correct 57 ms 27256 KB Output is correct
32 Correct 60 ms 27128 KB Output is correct
33 Correct 5 ms 376 KB Output is correct
34 Correct 5 ms 1404 KB Output is correct
35 Correct 5 ms 376 KB Output is correct
36 Correct 288 ms 61944 KB Output is correct
37 Correct 221 ms 70776 KB Output is correct
38 Correct 322 ms 69116 KB Output is correct
39 Correct 118 ms 59768 KB Output is correct
40 Correct 284 ms 70776 KB Output is correct
41 Correct 147 ms 35576 KB Output is correct
42 Correct 131 ms 35576 KB Output is correct
43 Correct 272 ms 59768 KB Output is correct
44 Correct 272 ms 70648 KB Output is correct
45 Correct 541 ms 70904 KB Output is correct
46 Correct 244 ms 70740 KB Output is correct
47 Correct 552 ms 62008 KB Output is correct
48 Correct 1940 ms 62072 KB Output is correct
49 Correct 296 ms 53112 KB Output is correct
50 Correct 242 ms 53140 KB Output is correct
51 Correct 249 ms 59768 KB Output is correct
52 Correct 309 ms 68984 KB Output is correct
53 Correct 305 ms 68984 KB Output is correct
54 Correct 191 ms 69112 KB Output is correct
55 Correct 240 ms 69260 KB Output is correct
56 Correct 228 ms 69112 KB Output is correct
57 Correct 317 ms 69240 KB Output is correct
58 Correct 267 ms 69240 KB Output is correct
59 Correct 248 ms 68860 KB Output is correct
60 Correct 247 ms 69432 KB Output is correct
61 Correct 242 ms 68856 KB Output is correct
62 Correct 238 ms 68476 KB Output is correct
63 Correct 238 ms 69240 KB Output is correct
64 Correct 243 ms 69112 KB Output is correct
65 Correct 298 ms 68984 KB Output is correct
66 Correct 299 ms 69112 KB Output is correct
67 Correct 291 ms 69240 KB Output is correct
68 Correct 271 ms 69352 KB Output is correct
69 Correct 226 ms 68856 KB Output is correct
70 Correct 295 ms 69240 KB Output is correct
71 Correct 258 ms 68984 KB Output is correct
72 Correct 267 ms 69368 KB Output is correct
73 Correct 286 ms 69064 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 376 KB Output is correct

Subtask #4
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 1272 KB Output is correct
2 Correct 5 ms 1400 KB Output is correct
3 Correct 5 ms 376 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 6 ms 1400 KB Output is correct
11 Correct 5 ms 1272 KB Output is correct
12 Correct 5 ms 1404 KB Output is correct
13 Correct 5 ms 1400 KB Output is correct
14 Correct 5 ms 1400 KB Output is correct
15 Correct 6 ms 1400 KB Output is correct
16 Correct 5 ms 1400 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 111 ms 22648 KB Output is correct
19 Correct 54 ms 27132 KB Output is correct
20 Correct 73 ms 25976 KB Output is correct
21 Correct 25 ms 15608 KB Output is correct
22 Correct 55 ms 27128 KB Output is correct
23 Correct 61 ms 27132 KB Output is correct
24 Correct 35 ms 11768 KB Output is correct
25 Correct 31 ms 11768 KB Output is correct
26 Correct 57 ms 25848 KB Output is correct
27 Correct 113 ms 25976 KB Output is correct
28 Correct 323 ms 22776 KB Output is correct
29 Correct 70 ms 22776 KB Output is correct
30 Correct 90 ms 22648 KB Output is correct
31 Correct 99 ms 19576 KB Output is correct
32 Correct 56 ms 19704 KB Output is correct
33 Correct 46 ms 21496 KB Output is correct
34 Correct 67 ms 26104 KB Output is correct
35 Correct 52 ms 25848 KB Output is correct
36 Correct 67 ms 26104 KB Output is correct
37 Correct 55 ms 25720 KB Output is correct
38 Correct 67 ms 25976 KB Output is correct
39 Correct 71 ms 25720 KB Output is correct
40 Correct 72 ms 25848 KB Output is correct
41 Correct 72 ms 25976 KB Output is correct
42 Correct 56 ms 25848 KB Output is correct
43 Correct 61 ms 25976 KB Output is correct
44 Correct 60 ms 25720 KB Output is correct
45 Correct 58 ms 25720 KB Output is correct
46 Correct 66 ms 25848 KB Output is correct
47 Correct 48 ms 27260 KB Output is correct
48 Correct 57 ms 27256 KB Output is correct
49 Correct 60 ms 27128 KB Output is correct
50 Correct 5 ms 376 KB Output is correct
51 Correct 5 ms 1404 KB Output is correct
52 Correct 5 ms 376 KB Output is correct
53 Correct 288 ms 61944 KB Output is correct
54 Correct 221 ms 70776 KB Output is correct
55 Correct 322 ms 69116 KB Output is correct
56 Correct 118 ms 59768 KB Output is correct
57 Correct 284 ms 70776 KB Output is correct
58 Correct 147 ms 35576 KB Output is correct
59 Correct 131 ms 35576 KB Output is correct
60 Correct 272 ms 59768 KB Output is correct
61 Correct 272 ms 70648 KB Output is correct
62 Correct 541 ms 70904 KB Output is correct
63 Correct 244 ms 70740 KB Output is correct
64 Correct 552 ms 62008 KB Output is correct
65 Correct 1940 ms 62072 KB Output is correct
66 Correct 296 ms 53112 KB Output is correct
67 Correct 242 ms 53140 KB Output is correct
68 Correct 249 ms 59768 KB Output is correct
69 Correct 309 ms 68984 KB Output is correct
70 Correct 305 ms 68984 KB Output is correct
71 Correct 191 ms 69112 KB Output is correct
72 Correct 240 ms 69260 KB Output is correct
73 Correct 228 ms 69112 KB Output is correct
74 Correct 317 ms 69240 KB Output is correct
75 Correct 267 ms 69240 KB Output is correct
76 Correct 248 ms 68860 KB Output is correct
77 Correct 247 ms 69432 KB Output is correct
78 Correct 242 ms 68856 KB Output is correct
79 Correct 238 ms 68476 KB Output is correct
80 Correct 238 ms 69240 KB Output is correct
81 Correct 243 ms 69112 KB Output is correct
82 Correct 298 ms 68984 KB Output is correct
83 Correct 299 ms 69112 KB Output is correct
84 Correct 291 ms 69240 KB Output is correct
85 Correct 271 ms 69352 KB Output is correct
86 Correct 226 ms 68856 KB Output is correct
87 Correct 295 ms 69240 KB Output is correct
88 Correct 258 ms 68984 KB Output is correct
89 Correct 267 ms 69368 KB Output is correct
90 Correct 286 ms 69064 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 376 KB Output is correct
94 Correct 257 ms 67040 KB Output is correct
95 Correct 243 ms 70904 KB Output is correct
96 Correct 402 ms 69496 KB Output is correct
97 Correct 220 ms 38116 KB Output is correct
98 Correct 142 ms 59640 KB Output is correct
99 Correct 298 ms 70776 KB Output is correct
100 Correct 182 ms 35576 KB Output is correct
101 Correct 158 ms 35704 KB Output is correct
102 Correct 235 ms 59768 KB Output is correct
103 Correct 440 ms 70748 KB Output is correct
104 Correct 787 ms 70776 KB Output is correct
105 Correct 517 ms 70780 KB Output is correct
106 Execution timed out 2080 ms 67320 KB Time limit exceeded
107 Halted 0 ms 0 KB -