oj.uz

Submission #896071

# Submission time Handle Problem Language Result Execution time Memory
896071 2023-12-31T16:41:26 Z nifeshe Genetics (BOI18_genetics) C++17
46 / 100
 474 ms 47812 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#pragma GCC target ("avx2")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")

#define f first
#define s second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((int) (x).size())
#define pb push_back
#define mp make_pair
#define int long long

using namespace std;
using namespace __gnu_pbds;

template <typename T> using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template <typename T> inline bool umin(T &a, const T &b) { if(a > b) { a = b; return 1; } return 0; }
template <typename T> inline bool umax(T &a, const T &b) { if(a < b) { a = b; return 1; } return 0; }

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const ll mod = 998244353;
const ll base = 1e6 + 9;
const ll inf = 1e18;
const int MAX = 3e5 + 42;
const int LG = 20;

random_device rd;
mt19937 gen(rd());
uniform_int_distribution<ll> dis(1, inf);

void solve() {
    int n, m, k;
    cin >> n >> m >> k;
    map<char, int> go;
    go['A'] = 'A'; go['C'] = 'B'; go['G'] = 'C'; go['T'] = 'D';
    vector<string> a(n);
    for(auto &i : a) {
        cin >> i;
        for(auto &j : i) j = go[j] - 'A';
    }
    const int BUBEN = 40;
    vector<vector<vector<int>>> have(BUBEN, vector<vector<int>>(m, vector<int>(4)));
    vector<int> cnt(BUBEN);
    vector<int> idx(n);
    for(int i = 0; i < n; i++) {
        idx[i] = dis(gen) % BUBEN;
        cnt[idx[i]]++;
        for(int j = 0; j < m; j++) {
            for(int c = 0; c < 4; c++) {
                have[idx[i]][j][c]++;
            }
        }
    }
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < m; j++) {
            have[idx[i]][j][a[i][j]]--;
        }
    }
    vector<int> p(n); iota(all(p), 0); shuffle(all(p), gen);
    for(auto i : p) {
        int need = (cnt[idx[i]] - 1) * k;
        for(int j = 0; j < m && need >= 0; j++) {
            need -= have[idx[i]][j][a[i][j]];
        }
        if(need != 0) continue;
        int ok = 1;
        for(int x = 0; x < BUBEN; x++) {
            if(cnt[x] == 0 || idx[i] == x) continue;
            need = cnt[x] * k;
            for(int j = 0; j < m && need >= 0; j++) {
                need -= have[x][j][a[i][j]];
            }
            if(need != 0) {
                ok = 0;
                break;
            }
        }
        if(ok) {
            cout << i + 1 << '\n';
            return;
        }
    }
    assert(0);
}

signed main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int ttt = 1;
//    cin >> ttt;
    while(ttt--) {
        solve();
    }
}

Subtask #1
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 600 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 600 KB Output is correct

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 64 ms 8232 KB Output is correct
2 Correct 92 ms 12280 KB Output is correct
3 Correct 61 ms 11980 KB Output is correct
4 Correct 24 ms 3420 KB Output is correct
5 Correct 123 ms 12364 KB Output is correct
6 Correct 121 ms 12280 KB Output is correct
7 Correct 43 ms 8480 KB Output is correct
8 Correct 48 ms 8284 KB Output is correct
9 Correct 100 ms 11440 KB Output is correct
10 Correct 71 ms 11340 KB Output is correct
11 Correct 53 ms 10788 KB Output is correct
12 Correct 74 ms 10840 KB Output is correct
13 Correct 76 ms 10580 KB Output is correct
14 Correct 61 ms 9820 KB Output is correct
15 Correct 78 ms 10084 KB Output is correct
16 Correct 80 ms 9508 KB Output is correct
17 Correct 94 ms 12000 KB Output is correct
18 Correct 93 ms 12140 KB Output is correct
19 Correct 78 ms 11904 KB Output is correct
20 Correct 67 ms 11928 KB Output is correct
21 Correct 65 ms 11948 KB Output is correct
22 Correct 85 ms 11860 KB Output is correct
23 Correct 74 ms 11968 KB Output is correct
24 Correct 73 ms 12116 KB Output is correct
25 Correct 111 ms 11796 KB Output is correct
26 Correct 70 ms 11856 KB Output is correct
27 Correct 71 ms 11912 KB Output is correct
28 Correct 93 ms 11928 KB Output is correct
29 Correct 71 ms 11972 KB Output is correct
30 Correct 49 ms 12288 KB Output is correct
31 Correct 50 ms 12124 KB Output is correct
32 Correct 59 ms 12284 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 604 KB Output is correct
35 Correct 1 ms 604 KB Output is correct

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 64 ms 8232 KB Output is correct
2 Correct 92 ms 12280 KB Output is correct
3 Correct 61 ms 11980 KB Output is correct
4 Correct 24 ms 3420 KB Output is correct
5 Correct 123 ms 12364 KB Output is correct
6 Correct 121 ms 12280 KB Output is correct
7 Correct 43 ms 8480 KB Output is correct
8 Correct 48 ms 8284 KB Output is correct
9 Correct 100 ms 11440 KB Output is correct
10 Correct 71 ms 11340 KB Output is correct
11 Correct 53 ms 10788 KB Output is correct
12 Correct 74 ms 10840 KB Output is correct
13 Correct 76 ms 10580 KB Output is correct
14 Correct 61 ms 9820 KB Output is correct
15 Correct 78 ms 10084 KB Output is correct
16 Correct 80 ms 9508 KB Output is correct
17 Correct 94 ms 12000 KB Output is correct
18 Correct 93 ms 12140 KB Output is correct
19 Correct 78 ms 11904 KB Output is correct
20 Correct 67 ms 11928 KB Output is correct
21 Correct 65 ms 11948 KB Output is correct
22 Correct 85 ms 11860 KB Output is correct
23 Correct 74 ms 11968 KB Output is correct
24 Correct 73 ms 12116 KB Output is correct
25 Correct 111 ms 11796 KB Output is correct
26 Correct 70 ms 11856 KB Output is correct
27 Correct 71 ms 11912 KB Output is correct
28 Correct 93 ms 11928 KB Output is correct
29 Correct 71 ms 11972 KB Output is correct
30 Correct 49 ms 12288 KB Output is correct
31 Correct 50 ms 12124 KB Output is correct
32 Correct 59 ms 12284 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 604 KB Output is correct
35 Correct 1 ms 604 KB Output is correct
36 Correct 349 ms 43728 KB Output is correct
37 Correct 309 ms 47428 KB Output is correct
38 Correct 373 ms 47252 KB Output is correct
39 Correct 194 ms 17620 KB Output is correct
40 Correct 474 ms 47564 KB Output is correct
41 Correct 259 ms 29776 KB Output is correct
42 Correct 270 ms 29700 KB Output is correct
43 Correct 275 ms 35212 KB Output is correct
44 Incorrect 334 ms 47812 KB Output isn't correct
45 Halted 0 ms 0 KB -

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 600 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 600 KB Output is correct
18 Correct 64 ms 8232 KB Output is correct
19 Correct 92 ms 12280 KB Output is correct
20 Correct 61 ms 11980 KB Output is correct
21 Correct 24 ms 3420 KB Output is correct
22 Correct 123 ms 12364 KB Output is correct
23 Correct 121 ms 12280 KB Output is correct
24 Correct 43 ms 8480 KB Output is correct
25 Correct 48 ms 8284 KB Output is correct
26 Correct 100 ms 11440 KB Output is correct
27 Correct 71 ms 11340 KB Output is correct
28 Correct 53 ms 10788 KB Output is correct
29 Correct 74 ms 10840 KB Output is correct
30 Correct 76 ms 10580 KB Output is correct
31 Correct 61 ms 9820 KB Output is correct
32 Correct 78 ms 10084 KB Output is correct
33 Correct 80 ms 9508 KB Output is correct
34 Correct 94 ms 12000 KB Output is correct
35 Correct 93 ms 12140 KB Output is correct
36 Correct 78 ms 11904 KB Output is correct
37 Correct 67 ms 11928 KB Output is correct
38 Correct 65 ms 11948 KB Output is correct
39 Correct 85 ms 11860 KB Output is correct
40 Correct 74 ms 11968 KB Output is correct
41 Correct 73 ms 12116 KB Output is correct
42 Correct 111 ms 11796 KB Output is correct
43 Correct 70 ms 11856 KB Output is correct
44 Correct 71 ms 11912 KB Output is correct
45 Correct 93 ms 11928 KB Output is correct
46 Correct 71 ms 11972 KB Output is correct
47 Correct 49 ms 12288 KB Output is correct
48 Correct 50 ms 12124 KB Output is correct
49 Correct 59 ms 12284 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 1 ms 604 KB Output is correct
52 Correct 1 ms 604 KB Output is correct
53 Correct 349 ms 43728 KB Output is correct
54 Correct 309 ms 47428 KB Output is correct
55 Correct 373 ms 47252 KB Output is correct
56 Correct 194 ms 17620 KB Output is correct
57 Correct 474 ms 47564 KB Output is correct
58 Correct 259 ms 29776 KB Output is correct
59 Correct 270 ms 29700 KB Output is correct
60 Correct 275 ms 35212 KB Output is correct
61 Incorrect 334 ms 47812 KB Output isn't correct
62 Halted 0 ms 0 KB -