oj.uz

Submission #95834

# Submission time Handle Problem Language Result Execution time Memory
95834 2019-02-02T19:54:22 Z caesar2001 Genetics (BOI18_genetics) C++14
46 / 100
 2000 ms 808364 KB 
#include <bits/stdc++.h>
#define ll long long
#define lsb(x) (x & -x)

using namespace std;

struct Data {
    int from, to, cost;
};

void transpune(const vector<vector<ll>> &v, vector<vector<ll>> &ans, int n, int m) {
    for(int i = 1; i <= n; i ++)
        for(int j = 1; j <= m; j ++)
            ans[j][i] = v[i][j];
}

void multiply(const vector<vector<ll>> &a, const vector<vector<ll>> &b, vector<vector<ll>> &ans, int n, int m, int p) {
    for(int i = 1; i <= n; i ++)
        for(int j = 1; j <= p; j ++)
            for(int k = 1; k <= m; k ++)
                ans[i][j] += (a[i][k] * b[k][j]);
}

void add(vector<vector<ll>> &ans, const vector<vector<ll>> &a, int n, int m) {
    for(int i = 1; i <= n; i ++)
        for(int j = 1; j <= m; j ++)
            ans[i][j] += a[i][j];
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    //freopen("a.in", "r", stdin);
    //freopen("a.out", "w", stdout);

    int n, m, k;
    cin >> n >> m >> k;
    k = m - k;

    vector<int> code(30, 0);
    code['A' - 'A'] = 1;
    code['C' - 'A'] = 2;
    code['G' - 'A'] = 3;
    code['T' - 'A'] = 4;

    vector<vector<vector<ll>>> v(5, vector<vector<ll>> (n + 1, vector<ll> (m + 1, 0)));
    for(int i = 1; i <= n; i ++) {
        string s;
        cin >> s;

        for(int j = 0; j < m; j ++)
            v[code[s[j] - 'A']][i][j + 1] = 1;
    }

    srand(time(NULL));

    vector<vector<ll>> hs(n + 1, vector<ll> (2, 0));
    for(int i = 1; i <= n; i ++)
        hs[i][1] = rand();

    vector<vector<ll>> ans(n + 1, vector<ll> (2, 0));
    for(int i = 1; i <= 4; i ++) {
        vector<vector<ll>> t(m + 1, vector<ll> (n + 1, 0));
        transpune(v[i], t, n, m);

        vector<vector<ll>> ths(m + 1, vector<ll> (2, 0));
        multiply(t, hs, ths, m, n, 1);

        vector<vector<ll>> aux(n + 1, vector<ll> (2, 0));
        multiply(v[i], ths, aux, n, m, 1);
        add(ans, aux, n, 1);
    }

    vector<vector<ll>> sol(n + 1, vector<ll> (n + 1, k));
    for(int i = 1; i <= n; i ++)
        sol[i][i] = m;
    vector<vector<ll>> solhs(n + 1, vector<ll> (2, 0));
    multiply(sol, hs, solhs, n, n, 1);

    for(int i = 1; i <= n; i ++) {
        if(solhs[i][1] == ans[i][1]) {
            cout << i;
            return 0;
        }
    }

    return 0;
}

Subtask #1
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 760 KB Output is correct
2 Correct 5 ms 888 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 632 KB Output is correct
5 Correct 6 ms 632 KB Output is correct
6 Correct 5 ms 888 KB Output is correct
7 Correct 5 ms 632 KB Output is correct
8 Correct 5 ms 380 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 764 KB Output is correct
12 Correct 6 ms 760 KB Output is correct
13 Correct 6 ms 888 KB Output is correct
14 Correct 6 ms 888 KB Output is correct
15 Correct 6 ms 892 KB Output is correct
16 Correct 5 ms 504 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 303 ms 126620 KB Output is correct
2 Correct 385 ms 156416 KB Output is correct
3 Correct 359 ms 149400 KB Output is correct
4 Correct 58 ms 37848 KB Output is correct
5 Correct 376 ms 156440 KB Output is correct
6 Correct 381 ms 156400 KB Output is correct
7 Correct 155 ms 67192 KB Output is correct
8 Correct 156 ms 67064 KB Output is correct
9 Correct 337 ms 144248 KB Output is correct
10 Correct 350 ms 144324 KB Output is correct
11 Correct 303 ms 126400 KB Output is correct
12 Correct 296 ms 127200 KB Output is correct
13 Correct 302 ms 126364 KB Output is correct
14 Correct 243 ms 108344 KB Output is correct
15 Correct 260 ms 109760 KB Output is correct
16 Correct 245 ms 109304 KB Output is correct
17 Correct 361 ms 149660 KB Output is correct
18 Correct 363 ms 148728 KB Output is correct
19 Correct 355 ms 150024 KB Output is correct
20 Correct 349 ms 147884 KB Output is correct
21 Correct 354 ms 149508 KB Output is correct
22 Correct 362 ms 148492 KB Output is correct
23 Correct 354 ms 149148 KB Output is correct
24 Correct 356 ms 149000 KB Output is correct
25 Correct 356 ms 147960 KB Output is correct
26 Correct 367 ms 149368 KB Output is correct
27 Correct 358 ms 148264 KB Output is correct
28 Correct 361 ms 148392 KB Output is correct
29 Correct 352 ms 149144 KB Output is correct
30 Correct 391 ms 156668 KB Output is correct
31 Correct 375 ms 156596 KB Output is correct
32 Correct 380 ms 156664 KB Output is correct
33 Correct 5 ms 376 KB Output is correct
34 Correct 5 ms 888 KB Output is correct
35 Correct 5 ms 376 KB Output is correct

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 303 ms 126620 KB Output is correct
2 Correct 385 ms 156416 KB Output is correct
3 Correct 359 ms 149400 KB Output is correct
4 Correct 58 ms 37848 KB Output is correct
5 Correct 376 ms 156440 KB Output is correct
6 Correct 381 ms 156400 KB Output is correct
7 Correct 155 ms 67192 KB Output is correct
8 Correct 156 ms 67064 KB Output is correct
9 Correct 337 ms 144248 KB Output is correct
10 Correct 350 ms 144324 KB Output is correct
11 Correct 303 ms 126400 KB Output is correct
12 Correct 296 ms 127200 KB Output is correct
13 Correct 302 ms 126364 KB Output is correct
14 Correct 243 ms 108344 KB Output is correct
15 Correct 260 ms 109760 KB Output is correct
16 Correct 245 ms 109304 KB Output is correct
17 Correct 361 ms 149660 KB Output is correct
18 Correct 363 ms 148728 KB Output is correct
19 Correct 355 ms 150024 KB Output is correct
20 Correct 349 ms 147884 KB Output is correct
21 Correct 354 ms 149508 KB Output is correct
22 Correct 362 ms 148492 KB Output is correct
23 Correct 354 ms 149148 KB Output is correct
24 Correct 356 ms 149000 KB Output is correct
25 Correct 356 ms 147960 KB Output is correct
26 Correct 367 ms 149368 KB Output is correct
27 Correct 358 ms 148264 KB Output is correct
28 Correct 361 ms 148392 KB Output is correct
29 Correct 352 ms 149144 KB Output is correct
30 Correct 391 ms 156668 KB Output is correct
31 Correct 375 ms 156596 KB Output is correct
32 Correct 380 ms 156664 KB Output is correct
33 Correct 5 ms 376 KB Output is correct
34 Correct 5 ms 888 KB Output is correct
35 Correct 5 ms 376 KB Output is correct
36 Correct 1998 ms 705028 KB Output is correct
37 Execution timed out 2157 ms 808364 KB Time limit exceeded
38 Halted 0 ms 0 KB -

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 760 KB Output is correct
2 Correct 5 ms 888 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 632 KB Output is correct
5 Correct 6 ms 632 KB Output is correct
6 Correct 5 ms 888 KB Output is correct
7 Correct 5 ms 632 KB Output is correct
8 Correct 5 ms 380 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 764 KB Output is correct
12 Correct 6 ms 760 KB Output is correct
13 Correct 6 ms 888 KB Output is correct
14 Correct 6 ms 888 KB Output is correct
15 Correct 6 ms 892 KB Output is correct
16 Correct 5 ms 504 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 303 ms 126620 KB Output is correct
19 Correct 385 ms 156416 KB Output is correct
20 Correct 359 ms 149400 KB Output is correct
21 Correct 58 ms 37848 KB Output is correct
22 Correct 376 ms 156440 KB Output is correct
23 Correct 381 ms 156400 KB Output is correct
24 Correct 155 ms 67192 KB Output is correct
25 Correct 156 ms 67064 KB Output is correct
26 Correct 337 ms 144248 KB Output is correct
27 Correct 350 ms 144324 KB Output is correct
28 Correct 303 ms 126400 KB Output is correct
29 Correct 296 ms 127200 KB Output is correct
30 Correct 302 ms 126364 KB Output is correct
31 Correct 243 ms 108344 KB Output is correct
32 Correct 260 ms 109760 KB Output is correct
33 Correct 245 ms 109304 KB Output is correct
34 Correct 361 ms 149660 KB Output is correct
35 Correct 363 ms 148728 KB Output is correct
36 Correct 355 ms 150024 KB Output is correct
37 Correct 349 ms 147884 KB Output is correct
38 Correct 354 ms 149508 KB Output is correct
39 Correct 362 ms 148492 KB Output is correct
40 Correct 354 ms 149148 KB Output is correct
41 Correct 356 ms 149000 KB Output is correct
42 Correct 356 ms 147960 KB Output is correct
43 Correct 367 ms 149368 KB Output is correct
44 Correct 358 ms 148264 KB Output is correct
45 Correct 361 ms 148392 KB Output is correct
46 Correct 352 ms 149144 KB Output is correct
47 Correct 391 ms 156668 KB Output is correct
48 Correct 375 ms 156596 KB Output is correct
49 Correct 380 ms 156664 KB Output is correct
50 Correct 5 ms 376 KB Output is correct
51 Correct 5 ms 888 KB Output is correct
52 Correct 5 ms 376 KB Output is correct
53 Correct 1998 ms 705028 KB Output is correct
54 Execution timed out 2157 ms 808364 KB Time limit exceeded
55 Halted 0 ms 0 KB -