oj.uz

답안 #896072

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
896072 2023-12-31T16:42:02 Z nifeshe Genetics (BOI18_genetics) C++17
27 / 100
 144 ms 12884 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 = 70;
    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 856 KB Output is correct
2 Correct 1 ms 860 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 888 KB Output is correct
7 Correct 1 ms 860 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 860 KB Output is correct
11 Correct 1 ms 856 KB Output is correct
12 Correct 1 ms 856 KB Output is correct
13 Correct 1 ms 860 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 1 ms 860 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 860 KB Output is correct

Subtask #2
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 87 ms 11880 KB Output is correct
2 Correct 64 ms 12884 KB Output is correct
3 Correct 75 ms 12528 KB Output is correct
4 Correct 32 ms 3932 KB Output is correct
5 Correct 119 ms 12724 KB Output is correct
6 Correct 144 ms 12880 KB Output is correct
7 Correct 58 ms 10948 KB Output is correct
8 Correct 81 ms 10948 KB Output is correct
9 Incorrect 55 ms 12292 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 87 ms 11880 KB Output is correct
2 Correct 64 ms 12884 KB Output is correct
3 Correct 75 ms 12528 KB Output is correct
4 Correct 32 ms 3932 KB Output is correct
5 Correct 119 ms 12724 KB Output is correct
6 Correct 144 ms 12880 KB Output is correct
7 Correct 58 ms 10948 KB Output is correct
8 Correct 81 ms 10948 KB Output is correct
9 Incorrect 55 ms 12292 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #4
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 856 KB Output is correct
2 Correct 1 ms 860 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 888 KB Output is correct
7 Correct 1 ms 860 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 860 KB Output is correct
11 Correct 1 ms 856 KB Output is correct
12 Correct 1 ms 856 KB Output is correct
13 Correct 1 ms 860 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 1 ms 860 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 860 KB Output is correct
18 Correct 87 ms 11880 KB Output is correct
19 Correct 64 ms 12884 KB Output is correct
20 Correct 75 ms 12528 KB Output is correct
21 Correct 32 ms 3932 KB Output is correct
22 Correct 119 ms 12724 KB Output is correct
23 Correct 144 ms 12880 KB Output is correct
24 Correct 58 ms 10948 KB Output is correct
25 Correct 81 ms 10948 KB Output is correct
26 Incorrect 55 ms 12292 KB Output isn't correct
27 Halted 0 ms 0 KB -