oj.uz

답안 #896073

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
896073 2023-12-31T16:42:45 Z nifeshe Genetics (BOI18_genetics) C++17
46 / 100
 2000 ms 48488 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 = 100;
    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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 860 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 1116 KB Output is correct
7 Correct 1 ms 1116 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 860 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 1 ms 1116 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 1 ms 1116 KB Output is correct
15 Correct 1 ms 1116 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 1116 KB Output is correct

Subtask #2
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 58 ms 15544 KB Output is correct
2 Correct 202 ms 16732 KB Output is correct
3 Correct 328 ms 16724 KB Output is correct
4 Correct 40 ms 5212 KB Output is correct
5 Correct 144 ms 16720 KB Output is correct
6 Correct 212 ms 16608 KB Output is correct
7 Correct 57 ms 14752 KB Output is correct
8 Correct 35 ms 14680 KB Output is correct
9 Correct 74 ms 15932 KB Output is correct
10 Correct 65 ms 15704 KB Output is correct
11 Correct 82 ms 15452 KB Output is correct
12 Correct 65 ms 15452 KB Output is correct
13 Correct 102 ms 15444 KB Output is correct
14 Correct 65 ms 14960 KB Output is correct
15 Correct 71 ms 14932 KB Output is correct
16 Correct 94 ms 13660 KB Output is correct
17 Correct 300 ms 16584 KB Output is correct
18 Correct 77 ms 16464 KB Output is correct
19 Correct 67 ms 16464 KB Output is correct
20 Correct 174 ms 16720 KB Output is correct
21 Correct 82 ms 16524 KB Output is correct
22 Correct 98 ms 16312 KB Output is correct
23 Correct 68 ms 16560 KB Output is correct
24 Correct 152 ms 16500 KB Output is correct
25 Correct 255 ms 16464 KB Output is correct
26 Correct 69 ms 16820 KB Output is correct
27 Correct 112 ms 16472 KB Output is correct
28 Correct 65 ms 16664 KB Output is correct
29 Correct 355 ms 16564 KB Output is correct
30 Correct 58 ms 16732 KB Output is correct
31 Correct 57 ms 16580 KB Output is correct
32 Correct 71 ms 16704 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 1 ms 1112 KB Output is correct
35 Correct 1 ms 1116 KB Output is correct

Subtask #3
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 58 ms 15544 KB Output is correct
2 Correct 202 ms 16732 KB Output is correct
3 Correct 328 ms 16724 KB Output is correct
4 Correct 40 ms 5212 KB Output is correct
5 Correct 144 ms 16720 KB Output is correct
6 Correct 212 ms 16608 KB Output is correct
7 Correct 57 ms 14752 KB Output is correct
8 Correct 35 ms 14680 KB Output is correct
9 Correct 74 ms 15932 KB Output is correct
10 Correct 65 ms 15704 KB Output is correct
11 Correct 82 ms 15452 KB Output is correct
12 Correct 65 ms 15452 KB Output is correct
13 Correct 102 ms 15444 KB Output is correct
14 Correct 65 ms 14960 KB Output is correct
15 Correct 71 ms 14932 KB Output is correct
16 Correct 94 ms 13660 KB Output is correct
17 Correct 300 ms 16584 KB Output is correct
18 Correct 77 ms 16464 KB Output is correct
19 Correct 67 ms 16464 KB Output is correct
20 Correct 174 ms 16720 KB Output is correct
21 Correct 82 ms 16524 KB Output is correct
22 Correct 98 ms 16312 KB Output is correct
23 Correct 68 ms 16560 KB Output is correct
24 Correct 152 ms 16500 KB Output is correct
25 Correct 255 ms 16464 KB Output is correct
26 Correct 69 ms 16820 KB Output is correct
27 Correct 112 ms 16472 KB Output is correct
28 Correct 65 ms 16664 KB Output is correct
29 Correct 355 ms 16564 KB Output is correct
30 Correct 58 ms 16732 KB Output is correct
31 Correct 57 ms 16580 KB Output is correct
32 Correct 71 ms 16704 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 1 ms 1112 KB Output is correct
35 Correct 1 ms 1116 KB Output is correct
36 Correct 1075 ms 46912 KB Output is correct
37 Execution timed out 2071 ms 48488 KB Time limit exceeded
38 Halted 0 ms 0 KB -

Subtask #4
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 860 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 1116 KB Output is correct
7 Correct 1 ms 1116 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 860 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 1 ms 1116 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 1 ms 1116 KB Output is correct
15 Correct 1 ms 1116 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 1116 KB Output is correct
18 Correct 58 ms 15544 KB Output is correct
19 Correct 202 ms 16732 KB Output is correct
20 Correct 328 ms 16724 KB Output is correct
21 Correct 40 ms 5212 KB Output is correct
22 Correct 144 ms 16720 KB Output is correct
23 Correct 212 ms 16608 KB Output is correct
24 Correct 57 ms 14752 KB Output is correct
25 Correct 35 ms 14680 KB Output is correct
26 Correct 74 ms 15932 KB Output is correct
27 Correct 65 ms 15704 KB Output is correct
28 Correct 82 ms 15452 KB Output is correct
29 Correct 65 ms 15452 KB Output is correct
30 Correct 102 ms 15444 KB Output is correct
31 Correct 65 ms 14960 KB Output is correct
32 Correct 71 ms 14932 KB Output is correct
33 Correct 94 ms 13660 KB Output is correct
34 Correct 300 ms 16584 KB Output is correct
35 Correct 77 ms 16464 KB Output is correct
36 Correct 67 ms 16464 KB Output is correct
37 Correct 174 ms 16720 KB Output is correct
38 Correct 82 ms 16524 KB Output is correct
39 Correct 98 ms 16312 KB Output is correct
40 Correct 68 ms 16560 KB Output is correct
41 Correct 152 ms 16500 KB Output is correct
42 Correct 255 ms 16464 KB Output is correct
43 Correct 69 ms 16820 KB Output is correct
44 Correct 112 ms 16472 KB Output is correct
45 Correct 65 ms 16664 KB Output is correct
46 Correct 355 ms 16564 KB Output is correct
47 Correct 58 ms 16732 KB Output is correct
48 Correct 57 ms 16580 KB Output is correct
49 Correct 71 ms 16704 KB Output is correct
50 Correct 0 ms 344 KB Output is correct
51 Correct 1 ms 1112 KB Output is correct
52 Correct 1 ms 1116 KB Output is correct
53 Correct 1075 ms 46912 KB Output is correct
54 Execution timed out 2071 ms 48488 KB Time limit exceeded
55 Halted 0 ms 0 KB -