oj.uz

답안 #707923

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
707923 2023-03-10T13:49:42 Z Alihan_8 DNA 돌연변이 (IOI21_dna) C++17
100 / 100
 47 ms 7652 KB 
#include <bits/stdc++.h>
#include "dna.h"
#define Flag false
// include <ext/pb_ds/assoc_container.hpp>
// include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define all(x) x.begin(), x.end()
#define pb push_back
// define ordered_set tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>
#define mpr make_pair
#define ln '\n'
void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
//#define int long long
string l, r;
vector <array<array<int,3>,3>> pref;
map <char,int> id;
int n;
void init(string a, string b) {
    l = a, r = b;
    n = (int)a.size();
    pref.resize(n);
    id['A'] = 0, id['T'] = 1, id['C'] = 2;
    for ( int i = 0; i < n; i++ ){
        for ( int j = 0; j < 3; j++ ){
            for ( int k = 0; k < 3; k++ ){
                if ( i ) pref[i][j][k] = pref[i-1][j][k];
            }
        }
        pref[i][id[l[i]]][id[r[i]]]++;
    }
}
int get(int l, int r, int x, int y){
    int val = pref[r][x][y];
    if ( l ) val -= pref[l-1][x][y];
    return val;
}
int get_distance(int x, int y){
    array <array<int,3>,3> p;
    for ( int i = 0; i < 3; i++ ){
        for ( int j = 0; j < 3; j++ ){
            p[i][j] = get(x, y, i, j);
        }
    }
    auto f = [&](int &a, int &b){
        int Mn = min(a, b);
        a -= Mn, b -= Mn;
        return Mn;
    };
    int cnt = 0;
    for ( int i = 0; i < 3; i++ ){
        for ( int j = i+1; j < 3; j++ ){
            cnt += f(p[i][j], p[j][i]);
        }
    }
    if ( p[0][1] > p[1][2] ) return -1;
    p[0][2] += p[0][1];  p[1][2] -= p[0][1];
    cnt += p[0][1]; p[0][1] = 0;
    if ( p[1][0] > p[2][1] ) return -1;
    p[2][0] += p[1][0];  p[2][1] -= p[1][0];
    cnt += p[1][0]; p[1][0] = 0;
    for ( int i = 0; i < 3; i++ ){
        for ( int j = i+1; j < 3; j++ ){
            if ( p[i][j] != p[j][i] ) return -1;
            cnt += p[i][j];
        }
    }
    return cnt;
}
#if Flag
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int _n, q; cin >> _n >> q;
    string a, b; cin >> a >> b;
    init(a, b);
    while ( q-- ){
        int x, y; cin >> x >> y;
        cout << get_distance(x, y) << ln;
    }

    cout << '\n';
/*
6 3
ATACAT ACTATA
1 3
4 5
3 5
answer: {2, 1, -1}
*/
}
#endif

Compilation message

dna.cpp: In function 'void IO(std::string)':
dna.cpp:13:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 | void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dna.cpp:13:70: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 | void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                                                               ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 7244 KB Output is correct
2 Correct 35 ms 7324 KB Output is correct
3 Correct 37 ms 6780 KB Output is correct
4 Correct 47 ms 7220 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 296 KB Output is correct
7 Correct 1 ms 212 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 296 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 5 ms 4724 KB Output is correct
5 Correct 5 ms 4784 KB Output is correct
6 Correct 5 ms 4696 KB Output is correct
7 Correct 5 ms 4504 KB Output is correct
8 Correct 6 ms 4820 KB Output is correct
9 Correct 5 ms 4692 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 296 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 5 ms 4724 KB Output is correct
5 Correct 5 ms 4784 KB Output is correct
6 Correct 5 ms 4696 KB Output is correct
7 Correct 5 ms 4504 KB Output is correct
8 Correct 6 ms 4820 KB Output is correct
9 Correct 5 ms 4692 KB Output is correct
10 Correct 35 ms 7212 KB Output is correct
11 Correct 42 ms 7216 KB Output is correct
12 Correct 44 ms 7284 KB Output is correct
13 Correct 36 ms 7344 KB Output is correct
14 Correct 36 ms 7652 KB Output is correct
15 Correct 34 ms 7548 KB Output is correct
16 Correct 35 ms 7144 KB Output is correct
17 Correct 33 ms 7332 KB Output is correct
18 Correct 34 ms 7476 KB Output is correct
19 Correct 34 ms 7180 KB Output is correct
20 Correct 32 ms 7332 KB Output is correct
21 Correct 32 ms 7500 KB Output is correct

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 296 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 5 ms 4724 KB Output is correct
5 Correct 5 ms 4784 KB Output is correct
6 Correct 5 ms 4696 KB Output is correct
7 Correct 5 ms 4504 KB Output is correct
8 Correct 6 ms 4820 KB Output is correct
9 Correct 5 ms 4692 KB Output is correct
10 Correct 5 ms 4308 KB Output is correct
11 Correct 6 ms 4792 KB Output is correct
12 Correct 6 ms 4412 KB Output is correct
13 Correct 6 ms 4792 KB Output is correct
14 Correct 7 ms 4792 KB Output is correct
15 Correct 6 ms 4820 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 7244 KB Output is correct
2 Correct 35 ms 7324 KB Output is correct
3 Correct 37 ms 6780 KB Output is correct
4 Correct 47 ms 7220 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 296 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 296 KB Output is correct
9 Correct 1 ms 300 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 5 ms 4724 KB Output is correct
12 Correct 5 ms 4784 KB Output is correct
13 Correct 5 ms 4696 KB Output is correct
14 Correct 5 ms 4504 KB Output is correct
15 Correct 6 ms 4820 KB Output is correct
16 Correct 5 ms 4692 KB Output is correct
17 Correct 35 ms 7212 KB Output is correct
18 Correct 42 ms 7216 KB Output is correct
19 Correct 44 ms 7284 KB Output is correct
20 Correct 36 ms 7344 KB Output is correct
21 Correct 36 ms 7652 KB Output is correct
22 Correct 34 ms 7548 KB Output is correct
23 Correct 35 ms 7144 KB Output is correct
24 Correct 33 ms 7332 KB Output is correct
25 Correct 34 ms 7476 KB Output is correct
26 Correct 34 ms 7180 KB Output is correct
27 Correct 32 ms 7332 KB Output is correct
28 Correct 32 ms 7500 KB Output is correct
29 Correct 5 ms 4308 KB Output is correct
30 Correct 6 ms 4792 KB Output is correct
31 Correct 6 ms 4412 KB Output is correct
32 Correct 6 ms 4792 KB Output is correct
33 Correct 7 ms 4792 KB Output is correct
34 Correct 6 ms 4820 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 35 ms 6780 KB Output is correct
37 Correct 35 ms 7300 KB Output is correct
38 Correct 36 ms 7500 KB Output is correct
39 Correct 42 ms 7624 KB Output is correct
40 Correct 36 ms 7608 KB Output is correct
41 Correct 5 ms 4820 KB Output is correct
42 Correct 34 ms 7316 KB Output is correct
43 Correct 34 ms 7600 KB Output is correct
44 Correct 35 ms 7500 KB Output is correct
45 Correct 33 ms 7344 KB Output is correct
46 Correct 33 ms 7596 KB Output is correct
47 Correct 35 ms 7568 KB Output is correct