oj.uz

Submission #691007

# Submission time Handle Problem Language Result Execution time Memory
691007 2023-01-30T20:42:58 Z Elvin_Fritl Mutating DNA (IOI21_dna) C++17
100 / 100
 53 ms 15888 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define PI acos(-1)
#define LSB(i) ((i) & -(i))
#define ll long long
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define sc second
#define th third
#define fo fourth
#define pii pair<int,int>
#define pll pair<ll,ll>
#define ldb double
#define MOD 1000000007
#define endl "\n"
 
#define all(data)       data.begin(),data.end()
#define TYPEMAX(type)   std::numeric_limits<type>::max()
#define TYPEMIN(type)   std::numeric_limits<type>::min()
#define ima_li_te(D,d)  find(all(D),d)
#define mx 100007
ll psum[3][3][mx],a[mx],b[mx],cnt1[3][mx],cnt2[3][mx];
ll f(char x)
{
    if(x=='A') return 0;
    else if(x=='C') return 1;
    else return 2;
}
void init(string s1, string s2)
{
    ll n=s1.size();
    for(int i=1;i<=n;i++) a[i]=f(s1[i-1]);
    for(int i=1;i<=n;i++) b[i]=f(s2[i-1]);
    for(int i=1;i<=n;i++) psum[a[i]][b[i]][i]++;
    for(int i=0;i<3;i++)
    {
        for(int j=0;j<3;j++)
        {
            for(int k=1;k<=n;k++) psum[i][j][k]+=psum[i][j][k-1];
        }
    }
    for(int i=1;i<=n;i++) cnt1[a[i]][i]++;
    for(int i=1;i<=n;i++) cnt2[b[i]][i]++;
    for(int i=0;i<3;i++)
    {
        for(int j=1;j<=n;j++)
        {
            cnt1[i][j]+=cnt1[i][j-1];
            cnt2[i][j]+=cnt2[i][j-1];
        }
    }
}
int get_distance(int x, int y)
{
    x++; y++;
    ll rez1=0,rez2=0;
    if(!(cnt1[0][y]-cnt1[0][x-1]==cnt2[0][y]-cnt2[0][x-1] && cnt1[1][y]-cnt1[1][x-1]==cnt2[1][y]-cnt2[1][x-1] && cnt1[2][y]-cnt1[2][x-1]==cnt2[2][y]-cnt2[2][x-1])) return -1;
    else
    {
        for(int i=0;i<3;i++)
        {
            for(int j=i+1;j<3;j++)
            {
                rez1+=min(psum[i][j][y]-psum[i][j][x-1],psum[j][i][y]-psum[j][i][x-1]);
                rez2+=abs((psum[i][j][y]-psum[i][j][x-1])-(psum[j][i][y]-psum[j][i][x-1]));
            }
        }
        return rez1+2*rez2/3;
    }
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 15372 KB Output is correct
2 Correct 48 ms 15504 KB Output is correct
3 Correct 42 ms 14240 KB Output is correct
4 Correct 45 ms 15424 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory 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 12 ms 14036 KB Output is correct
5 Correct 12 ms 14164 KB Output is correct
6 Correct 12 ms 14164 KB Output is correct
7 Correct 11 ms 13300 KB Output is correct
8 Correct 12 ms 14164 KB Output is correct
9 Correct 11 ms 14164 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory 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 12 ms 14036 KB Output is correct
5 Correct 12 ms 14164 KB Output is correct
6 Correct 12 ms 14164 KB Output is correct
7 Correct 11 ms 13300 KB Output is correct
8 Correct 12 ms 14164 KB Output is correct
9 Correct 11 ms 14164 KB Output is correct
10 Correct 44 ms 15372 KB Output is correct
11 Correct 51 ms 15432 KB Output is correct
12 Correct 48 ms 14928 KB Output is correct
13 Correct 48 ms 15200 KB Output is correct
14 Correct 52 ms 15756 KB Output is correct
15 Correct 46 ms 15680 KB Output is correct
16 Correct 41 ms 14968 KB Output is correct
17 Correct 42 ms 15240 KB Output is correct
18 Correct 41 ms 15812 KB Output is correct
19 Correct 37 ms 14944 KB Output is correct
20 Correct 37 ms 15252 KB Output is correct
21 Correct 38 ms 15832 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory 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 12 ms 14036 KB Output is correct
5 Correct 12 ms 14164 KB Output is correct
6 Correct 12 ms 14164 KB Output is correct
7 Correct 11 ms 13300 KB Output is correct
8 Correct 12 ms 14164 KB Output is correct
9 Correct 11 ms 14164 KB Output is correct
10 Correct 11 ms 13044 KB Output is correct
11 Correct 11 ms 14164 KB Output is correct
12 Correct 10 ms 13268 KB Output is correct
13 Correct 11 ms 14164 KB Output is correct
14 Correct 11 ms 14164 KB Output is correct
15 Correct 11 ms 14164 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 15372 KB Output is correct
2 Correct 48 ms 15504 KB Output is correct
3 Correct 42 ms 14240 KB Output is correct
4 Correct 45 ms 15424 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 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 12 ms 14036 KB Output is correct
12 Correct 12 ms 14164 KB Output is correct
13 Correct 12 ms 14164 KB Output is correct
14 Correct 11 ms 13300 KB Output is correct
15 Correct 12 ms 14164 KB Output is correct
16 Correct 11 ms 14164 KB Output is correct
17 Correct 44 ms 15372 KB Output is correct
18 Correct 51 ms 15432 KB Output is correct
19 Correct 48 ms 14928 KB Output is correct
20 Correct 48 ms 15200 KB Output is correct
21 Correct 52 ms 15756 KB Output is correct
22 Correct 46 ms 15680 KB Output is correct
23 Correct 41 ms 14968 KB Output is correct
24 Correct 42 ms 15240 KB Output is correct
25 Correct 41 ms 15812 KB Output is correct
26 Correct 37 ms 14944 KB Output is correct
27 Correct 37 ms 15252 KB Output is correct
28 Correct 38 ms 15832 KB Output is correct
29 Correct 11 ms 13044 KB Output is correct
30 Correct 11 ms 14164 KB Output is correct
31 Correct 10 ms 13268 KB Output is correct
32 Correct 11 ms 14164 KB Output is correct
33 Correct 11 ms 14164 KB Output is correct
34 Correct 11 ms 14164 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 44 ms 14328 KB Output is correct
37 Correct 45 ms 15444 KB Output is correct
38 Correct 48 ms 15068 KB Output is correct
39 Correct 51 ms 15756 KB Output is correct
40 Correct 51 ms 15828 KB Output is correct
41 Correct 11 ms 14292 KB Output is correct
42 Correct 44 ms 15116 KB Output is correct
43 Correct 42 ms 15812 KB Output is correct
44 Correct 42 ms 15768 KB Output is correct
45 Correct 38 ms 15056 KB Output is correct
46 Correct 37 ms 15888 KB Output is correct
47 Correct 37 ms 15888 KB Output is correct