oj.uz

답안 #694845

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
694845 2023-02-04T10:23:25 Z Nelt DNA 돌연변이 (IOI21_dna) C++17
100 / 100
 55 ms 13332 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,fma")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

/* DEFINES */
#define F first
#define S second
#define ll long long
#define ull unsigned long long
#define ld long double
#define npos ULLONG_MAX
#define INF LLONG_MAX
#define vv(a) vector<a>
#define pp(a, b) pair<a, b>
#define pq(a) priority_queue<a>
#define qq(a) queue<a>
#define ss(a) set<a>
#define mm(a, b) map<a, b>
#define ump(a, b) unordered_map<a, b>
#define sync                      \
    ios_base::sync_with_stdio(0); \
    cin.tie(0);                   \
    cout.tie(0);
#define elif else if
#define endl "\n"
#define allc(a) begin(a), end(a)
#define all(a) a, a + sizeof(a) / sizeof(a[0])
#define pb push_back
#define logi(a) __lg(a)
#define sqrt(a) sqrtl(a)
#define mpr make_pair
#define ins insert
using namespace std;
using namespace __gnu_pbds;
using namespace __cxx11;
typedef char chr;
typedef basic_string<chr> str;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
const ll sz = 1e5 + 5;
ll cnt[3][sz], tbl[3][3][sz], hsh[128];

void init(str a, str b)
{
    a = ' ' + a;
    b = ' ' + b;
    hsh['A'] = 0;
    hsh['C'] = 1;
    hsh['T'] = 2;
    for (ll i = 1; i < a.size(); i++)
    {
        cnt[hsh[a[i]]][i]++, cnt[hsh[b[i]]][i]--;
        for (ll j = 0; j < 3; j++)
            cnt[j][i] += cnt[j][i - 1];
        for (ll j = 0; j < 3; j++)
            for (ll k = 0; k < 3; k++)
                tbl[j][k][i] = tbl[j][k][i - 1];
        tbl[hsh[a[i]]][hsh[b[i]]][i]++;
    }
}
int get_distance(int x, int y)
{
    x++, y++;
    ll t[3][3];
    for (ll i = 0; i < 3; i++)
        if (cnt[i][y] ^ cnt[i][x - 1])
            return -1;
    for (ll i = 0; i < 3; i++)
        for (ll j = 0; j < 3; j++)
            t[i][j] = tbl[i][j][y] - tbl[i][j][x - 1];
    ll ans = 0, tmp = 0;
    tmp = min(t[0][1], t[1][0]);
    ans += tmp, t[0][1] -= tmp, t[1][0] -= tmp;
    tmp = min(t[0][2], t[2][0]);
    ans += tmp, t[0][2] -= tmp, t[2][0] -= tmp;
    tmp = min(t[1][2], t[2][1]);
    ans += tmp, t[1][2] -= tmp, t[2][1] -= tmp;
    return ans + (max(t[0][1], t[1][0]) << 1);
}
void solve()
{
}
/*

*/
// int main()
// {
//     sync
//         // precomp();
//         ll t = 1;
//     // cin >> t;
//     for (ll i = 1; i <= t; i++)
//         // cout << "Case #" << i << ": ",
//         solve();
//     cerr << "\nTime elapsed : " << clock() * 1000.0 / CLOCKS_PER_SEC << " ms\n";
// }

Compilation message

dna.cpp: In function 'void init(str, str)':
dna.cpp:54:22: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |     for (ll i = 1; i < a.size(); i++)
      |                    ~~^~~~~~~~~~
dna.cpp:56:21: warning: array subscript has type 'char' [-Wchar-subscripts]
   56 |         cnt[hsh[a[i]]][i]++, cnt[hsh[b[i]]][i]--;
      |                     ^
dna.cpp:56:42: warning: array subscript has type 'char' [-Wchar-subscripts]
   56 |         cnt[hsh[a[i]]][i]++, cnt[hsh[b[i]]][i]--;
      |                                          ^
dna.cpp:62:21: warning: array subscript has type 'char' [-Wchar-subscripts]
   62 |         tbl[hsh[a[i]]][hsh[b[i]]][i]++;
      |                     ^
dna.cpp:62:32: warning: array subscript has type 'char' [-Wchar-subscripts]
   62 |         tbl[hsh[a[i]]][hsh[b[i]]][i]++;
      |                                ^

Subtask #1
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 11476 KB Output is correct
2 Correct 39 ms 11564 KB Output is correct
3 Correct 38 ms 10716 KB Output is correct
4 Correct 55 ms 11544 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 7 ms 10196 KB Output is correct
5 Correct 7 ms 10324 KB Output is correct
6 Correct 7 ms 10264 KB Output is correct
7 Correct 7 ms 9684 KB Output is correct
8 Correct 7 ms 10324 KB Output is correct
9 Correct 7 ms 10324 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 7 ms 10196 KB Output is correct
5 Correct 7 ms 10324 KB Output is correct
6 Correct 7 ms 10264 KB Output is correct
7 Correct 7 ms 9684 KB Output is correct
8 Correct 7 ms 10324 KB Output is correct
9 Correct 7 ms 10324 KB Output is correct
10 Correct 39 ms 11456 KB Output is correct
11 Correct 39 ms 11480 KB Output is correct
12 Correct 39 ms 11280 KB Output is correct
13 Correct 40 ms 11432 KB Output is correct
14 Correct 43 ms 11840 KB Output is correct
15 Correct 54 ms 11952 KB Output is correct
16 Correct 34 ms 11200 KB Output is correct
17 Correct 36 ms 11560 KB Output is correct
18 Correct 36 ms 11952 KB Output is correct
19 Correct 32 ms 11344 KB Output is correct
20 Correct 34 ms 11500 KB Output is correct
21 Correct 37 ms 11948 KB Output is correct

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 7 ms 10196 KB Output is correct
5 Correct 7 ms 10324 KB Output is correct
6 Correct 7 ms 10264 KB Output is correct
7 Correct 7 ms 9684 KB Output is correct
8 Correct 7 ms 10324 KB Output is correct
9 Correct 7 ms 10324 KB Output is correct
10 Correct 8 ms 9428 KB Output is correct
11 Correct 7 ms 10324 KB Output is correct
12 Correct 7 ms 9684 KB Output is correct
13 Correct 8 ms 10452 KB Output is correct
14 Correct 8 ms 10556 KB Output is correct
15 Correct 8 ms 10588 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 11476 KB Output is correct
2 Correct 39 ms 11564 KB Output is correct
3 Correct 38 ms 10716 KB Output is correct
4 Correct 55 ms 11544 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 7 ms 10196 KB Output is correct
12 Correct 7 ms 10324 KB Output is correct
13 Correct 7 ms 10264 KB Output is correct
14 Correct 7 ms 9684 KB Output is correct
15 Correct 7 ms 10324 KB Output is correct
16 Correct 7 ms 10324 KB Output is correct
17 Correct 39 ms 11456 KB Output is correct
18 Correct 39 ms 11480 KB Output is correct
19 Correct 39 ms 11280 KB Output is correct
20 Correct 40 ms 11432 KB Output is correct
21 Correct 43 ms 11840 KB Output is correct
22 Correct 54 ms 11952 KB Output is correct
23 Correct 34 ms 11200 KB Output is correct
24 Correct 36 ms 11560 KB Output is correct
25 Correct 36 ms 11952 KB Output is correct
26 Correct 32 ms 11344 KB Output is correct
27 Correct 34 ms 11500 KB Output is correct
28 Correct 37 ms 11948 KB Output is correct
29 Correct 8 ms 9428 KB Output is correct
30 Correct 7 ms 10324 KB Output is correct
31 Correct 7 ms 9684 KB Output is correct
32 Correct 8 ms 10452 KB Output is correct
33 Correct 8 ms 10556 KB Output is correct
34 Correct 8 ms 10588 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 51 ms 12036 KB Output is correct
37 Correct 46 ms 12852 KB Output is correct
38 Correct 45 ms 12684 KB Output is correct
39 Correct 42 ms 13332 KB Output is correct
40 Correct 41 ms 13288 KB Output is correct
41 Correct 8 ms 10580 KB Output is correct
42 Correct 38 ms 12592 KB Output is correct
43 Correct 40 ms 13216 KB Output is correct
44 Correct 37 ms 13216 KB Output is correct
45 Correct 34 ms 12644 KB Output is correct
46 Correct 33 ms 13224 KB Output is correct
47 Correct 36 ms 13160 KB Output is correct