oj.uz

Submission #62720

# Submission time Handle Problem Language Result Execution time Memory
62720 2018-07-29T21:53:49 Z eriksuenderhauf Genetics (BOI18_genetics) C++11
100 / 100
 706 ms 21752 KB 
#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 pll pair<long long,long long>
#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];
int vis[MAXN][MAXN];
pll hsh[MAXN], ans[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);
    pll sm;
    for (int i = 0; i < n; i++)
    {
        scanf("%s", str[i]);
        hsh[i] = {rand() % MOD, rand() % MOD};
        sm = {(sm.fi+hsh[i].fi)%MOD,(sm.se+hsh[i].se)%MOD};
        /*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;*/
    }
    /*for (int i = n - 1; i >= 0; i--)
    {
        int tmp = 0;
        for (int j = 0; j < m; j++)
            tmp += n - cnt[j][go(str[i][j])];
        if (tmp != k * (n - 1))
            continue;
        int fl = 0;
        for (int j = n - 1; j >= 0; j--)
        {
            if (i == j)
                continue;
            int val = 0;
            if (vis[i][j] != -1)
                val = vis[i][j];
            else
            {
                for (int 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);
    }*/
    for (int i = 0; i < m; i++)
    {
        pll tmp[4];
        for (int j = 0; j < n; j++)
            tmp[go(str[j][i])] = {(tmp[go(str[j][i])].fi+hsh[j].fi)%MOD,(tmp[go(str[j][i])].se+hsh[j].se)%MOD};
        for (int j = 0; j < n; j++)
            ans[j] = {(ans[j].fi+sm.fi-tmp[go(str[j][i])].fi+MOD)%MOD,(ans[j].se+sm.se-tmp[go(str[j][i])].se+MOD)%MOD};
    }
    for (int i = 0; i < n; i++)
        if (ans[i] == mp(k*((sm.fi-hsh[i].fi+MOD)%MOD)%MOD,k*((sm.se-hsh[i].se+MOD)%MOD)%MOD))
            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:46: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

# Verdict Execution time Memory Grader output
1 Correct 5 ms 632 KB Output is correct
2 Correct 5 ms 760 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 632 KB Output is correct
5 Correct 5 ms 760 KB Output is correct
6 Correct 5 ms 760 KB Output is correct
7 Correct 5 ms 504 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 632 KB Output is correct
10 Correct 5 ms 760 KB Output is correct
11 Correct 5 ms 632 KB Output is correct
12 Correct 5 ms 760 KB Output is correct
13 Correct 5 ms 760 KB Output is correct
14 Correct 5 ms 760 KB Output is correct
15 Correct 5 ms 760 KB Output is correct
16 Correct 5 ms 760 KB Output is correct
17 Correct 5 ms 376 KB Output is correct

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 97 ms 8312 KB Output is correct
2 Correct 105 ms 9848 KB Output is correct
3 Correct 111 ms 9336 KB Output is correct
4 Correct 23 ms 5880 KB Output is correct
5 Correct 112 ms 9720 KB Output is correct
6 Correct 115 ms 9724 KB Output is correct
7 Correct 37 ms 4600 KB Output is correct
8 Correct 32 ms 4472 KB Output is correct
9 Correct 112 ms 9336 KB Output is correct
10 Correct 108 ms 9444 KB Output is correct
11 Correct 100 ms 8568 KB Output is correct
12 Correct 98 ms 8312 KB Output is correct
13 Correct 97 ms 8396 KB Output is correct
14 Correct 78 ms 7288 KB Output is correct
15 Correct 80 ms 7288 KB Output is correct
16 Correct 87 ms 8184 KB Output is correct
17 Correct 114 ms 9336 KB Output is correct
18 Correct 111 ms 9336 KB Output is correct
19 Correct 111 ms 9336 KB Output is correct
20 Correct 123 ms 9336 KB Output is correct
21 Correct 119 ms 9336 KB Output is correct
22 Correct 113 ms 9336 KB Output is correct
23 Correct 118 ms 9464 KB Output is correct
24 Correct 114 ms 9336 KB Output is correct
25 Correct 112 ms 9464 KB Output is correct
26 Correct 115 ms 9336 KB Output is correct
27 Correct 118 ms 9336 KB Output is correct
28 Correct 119 ms 9340 KB Output is correct
29 Correct 113 ms 9336 KB Output is correct
30 Correct 104 ms 9720 KB Output is correct
31 Correct 107 ms 9824 KB Output is correct
32 Correct 122 ms 9848 KB Output is correct
33 Correct 5 ms 376 KB Output is correct
34 Correct 5 ms 760 KB Output is correct
35 Correct 5 ms 376 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 97 ms 8312 KB Output is correct
2 Correct 105 ms 9848 KB Output is correct
3 Correct 111 ms 9336 KB Output is correct
4 Correct 23 ms 5880 KB Output is correct
5 Correct 112 ms 9720 KB Output is correct
6 Correct 115 ms 9724 KB Output is correct
7 Correct 37 ms 4600 KB Output is correct
8 Correct 32 ms 4472 KB Output is correct
9 Correct 112 ms 9336 KB Output is correct
10 Correct 108 ms 9444 KB Output is correct
11 Correct 100 ms 8568 KB Output is correct
12 Correct 98 ms 8312 KB Output is correct
13 Correct 97 ms 8396 KB Output is correct
14 Correct 78 ms 7288 KB Output is correct
15 Correct 80 ms 7288 KB Output is correct
16 Correct 87 ms 8184 KB Output is correct
17 Correct 114 ms 9336 KB Output is correct
18 Correct 111 ms 9336 KB Output is correct
19 Correct 111 ms 9336 KB Output is correct
20 Correct 123 ms 9336 KB Output is correct
21 Correct 119 ms 9336 KB Output is correct
22 Correct 113 ms 9336 KB Output is correct
23 Correct 118 ms 9464 KB Output is correct
24 Correct 114 ms 9336 KB Output is correct
25 Correct 112 ms 9464 KB Output is correct
26 Correct 115 ms 9336 KB Output is correct
27 Correct 118 ms 9336 KB Output is correct
28 Correct 119 ms 9340 KB Output is correct
29 Correct 113 ms 9336 KB Output is correct
30 Correct 104 ms 9720 KB Output is correct
31 Correct 107 ms 9824 KB Output is correct
32 Correct 122 ms 9848 KB Output is correct
33 Correct 5 ms 376 KB Output is correct
34 Correct 5 ms 760 KB Output is correct
35 Correct 5 ms 376 KB Output is correct
36 Correct 559 ms 19168 KB Output is correct
37 Correct 594 ms 21496 KB Output is correct
38 Correct 619 ms 20856 KB Output is correct
39 Correct 236 ms 18168 KB Output is correct
40 Correct 619 ms 21496 KB Output is correct
41 Correct 293 ms 11128 KB Output is correct
42 Correct 278 ms 11256 KB Output is correct
43 Correct 455 ms 18168 KB Output is correct
44 Correct 654 ms 21496 KB Output is correct
45 Correct 670 ms 21396 KB Output is correct
46 Correct 655 ms 21496 KB Output is correct
47 Correct 556 ms 18808 KB Output is correct
48 Correct 572 ms 18936 KB Output is correct
49 Correct 465 ms 16380 KB Output is correct
50 Correct 482 ms 16248 KB Output is correct
51 Correct 512 ms 18368 KB Output is correct
52 Correct 627 ms 20984 KB Output is correct
53 Correct 639 ms 20984 KB Output is correct
54 Correct 554 ms 20856 KB Output is correct
55 Correct 545 ms 20856 KB Output is correct
56 Correct 585 ms 20988 KB Output is correct
57 Correct 645 ms 20984 KB Output is correct
58 Correct 635 ms 20984 KB Output is correct
59 Correct 616 ms 20728 KB Output is correct
60 Correct 626 ms 21112 KB Output is correct
61 Correct 639 ms 20856 KB Output is correct
62 Correct 626 ms 21492 KB Output is correct
63 Correct 615 ms 21112 KB Output is correct
64 Correct 614 ms 20936 KB Output is correct
65 Correct 627 ms 21112 KB Output is correct
66 Correct 613 ms 20984 KB Output is correct
67 Correct 617 ms 20984 KB Output is correct
68 Correct 621 ms 21064 KB Output is correct
69 Correct 627 ms 20988 KB Output is correct
70 Correct 628 ms 21040 KB Output is correct
71 Correct 593 ms 20860 KB Output is correct
72 Correct 619 ms 21112 KB Output is correct
73 Correct 619 ms 21112 KB Output is correct
74 Correct 5 ms 380 KB Output is correct
75 Correct 5 ms 760 KB Output is correct
76 Correct 4 ms 376 KB Output is correct

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 632 KB Output is correct
2 Correct 5 ms 760 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 632 KB Output is correct
5 Correct 5 ms 760 KB Output is correct
6 Correct 5 ms 760 KB Output is correct
7 Correct 5 ms 504 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 632 KB Output is correct
10 Correct 5 ms 760 KB Output is correct
11 Correct 5 ms 632 KB Output is correct
12 Correct 5 ms 760 KB Output is correct
13 Correct 5 ms 760 KB Output is correct
14 Correct 5 ms 760 KB Output is correct
15 Correct 5 ms 760 KB Output is correct
16 Correct 5 ms 760 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 97 ms 8312 KB Output is correct
19 Correct 105 ms 9848 KB Output is correct
20 Correct 111 ms 9336 KB Output is correct
21 Correct 23 ms 5880 KB Output is correct
22 Correct 112 ms 9720 KB Output is correct
23 Correct 115 ms 9724 KB Output is correct
24 Correct 37 ms 4600 KB Output is correct
25 Correct 32 ms 4472 KB Output is correct
26 Correct 112 ms 9336 KB Output is correct
27 Correct 108 ms 9444 KB Output is correct
28 Correct 100 ms 8568 KB Output is correct
29 Correct 98 ms 8312 KB Output is correct
30 Correct 97 ms 8396 KB Output is correct
31 Correct 78 ms 7288 KB Output is correct
32 Correct 80 ms 7288 KB Output is correct
33 Correct 87 ms 8184 KB Output is correct
34 Correct 114 ms 9336 KB Output is correct
35 Correct 111 ms 9336 KB Output is correct
36 Correct 111 ms 9336 KB Output is correct
37 Correct 123 ms 9336 KB Output is correct
38 Correct 119 ms 9336 KB Output is correct
39 Correct 113 ms 9336 KB Output is correct
40 Correct 118 ms 9464 KB Output is correct
41 Correct 114 ms 9336 KB Output is correct
42 Correct 112 ms 9464 KB Output is correct
43 Correct 115 ms 9336 KB Output is correct
44 Correct 118 ms 9336 KB Output is correct
45 Correct 119 ms 9340 KB Output is correct
46 Correct 113 ms 9336 KB Output is correct
47 Correct 104 ms 9720 KB Output is correct
48 Correct 107 ms 9824 KB Output is correct
49 Correct 122 ms 9848 KB Output is correct
50 Correct 5 ms 376 KB Output is correct
51 Correct 5 ms 760 KB Output is correct
52 Correct 5 ms 376 KB Output is correct
53 Correct 559 ms 19168 KB Output is correct
54 Correct 594 ms 21496 KB Output is correct
55 Correct 619 ms 20856 KB Output is correct
56 Correct 236 ms 18168 KB Output is correct
57 Correct 619 ms 21496 KB Output is correct
58 Correct 293 ms 11128 KB Output is correct
59 Correct 278 ms 11256 KB Output is correct
60 Correct 455 ms 18168 KB Output is correct
61 Correct 654 ms 21496 KB Output is correct
62 Correct 670 ms 21396 KB Output is correct
63 Correct 655 ms 21496 KB Output is correct
64 Correct 556 ms 18808 KB Output is correct
65 Correct 572 ms 18936 KB Output is correct
66 Correct 465 ms 16380 KB Output is correct
67 Correct 482 ms 16248 KB Output is correct
68 Correct 512 ms 18368 KB Output is correct
69 Correct 627 ms 20984 KB Output is correct
70 Correct 639 ms 20984 KB Output is correct
71 Correct 554 ms 20856 KB Output is correct
72 Correct 545 ms 20856 KB Output is correct
73 Correct 585 ms 20988 KB Output is correct
74 Correct 645 ms 20984 KB Output is correct
75 Correct 635 ms 20984 KB Output is correct
76 Correct 616 ms 20728 KB Output is correct
77 Correct 626 ms 21112 KB Output is correct
78 Correct 639 ms 20856 KB Output is correct
79 Correct 626 ms 21492 KB Output is correct
80 Correct 615 ms 21112 KB Output is correct
81 Correct 614 ms 20936 KB Output is correct
82 Correct 627 ms 21112 KB Output is correct
83 Correct 613 ms 20984 KB Output is correct
84 Correct 617 ms 20984 KB Output is correct
85 Correct 621 ms 21064 KB Output is correct
86 Correct 627 ms 20988 KB Output is correct
87 Correct 628 ms 21040 KB Output is correct
88 Correct 593 ms 20860 KB Output is correct
89 Correct 619 ms 21112 KB Output is correct
90 Correct 619 ms 21112 KB Output is correct
91 Correct 5 ms 380 KB Output is correct
92 Correct 5 ms 760 KB Output is correct
93 Correct 4 ms 376 KB Output is correct
94 Correct 638 ms 20472 KB Output is correct
95 Correct 564 ms 21496 KB Output is correct
96 Correct 706 ms 21244 KB Output is correct
97 Correct 326 ms 12152 KB Output is correct
98 Correct 224 ms 18040 KB Output is correct
99 Correct 587 ms 21496 KB Output is correct
100 Correct 290 ms 11384 KB Output is correct
101 Correct 275 ms 11384 KB Output is correct
102 Correct 431 ms 18296 KB Output is correct
103 Correct 623 ms 21496 KB Output is correct
104 Correct 677 ms 21488 KB Output is correct
105 Correct 688 ms 21496 KB Output is correct
106 Correct 644 ms 20624 KB Output is correct
107 Correct 515 ms 19064 KB Output is correct
108 Correct 445 ms 16760 KB Output is correct
109 Correct 559 ms 18808 KB Output is correct
110 Correct 492 ms 18420 KB Output is correct
111 Correct 625 ms 21752 KB Output is correct
112 Correct 658 ms 21496 KB Output is correct
113 Correct 518 ms 21240 KB Output is correct
114 Correct 504 ms 21112 KB Output is correct
115 Correct 562 ms 21240 KB Output is correct
116 Correct 668 ms 21496 KB Output is correct
117 Correct 664 ms 21496 KB Output is correct
118 Correct 658 ms 21240 KB Output is correct
119 Correct 642 ms 21268 KB Output is correct
120 Correct 677 ms 21496 KB Output is correct
121 Correct 517 ms 19064 KB Output is correct
122 Correct 540 ms 21496 KB Output is correct
123 Correct 577 ms 20984 KB Output is correct
124 Correct 5 ms 376 KB Output is correct
125 Correct 5 ms 760 KB Output is correct
126 Correct 5 ms 376 KB Output is correct