oj.uz

Submission #966815

# Submission time Handle Problem Language Result Execution time Memory
966815 2024-04-20T12:09:41 Z YassirSalama Mutating DNA (IOI21_dna) C++17
56 / 100
 120 ms 33624 KB 
#include <bits/stdc++.h>
using namespace std;
const int dx[4] = {1,0,-1,0}, dy[4] = {0,1,0,-1};
#define endl "\n"
using ull=unsigned long long;
using ll=long long;
using pii=pair<int,int>;
const int mod=1e9+7;
#define OVL(x,s) for(auto y:x) cout<<y<<s; cout<<"\n";
template <typename T> istream& operator>>(istream& is, vector<T> &a) {
    copy_n(istream_iterator<T>(is), a.size(), a.begin()); return is;}
#ifdef IOI
void dbg_out() { cout << endl; } template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cout << ' ' << H; dbg_out(T...); }
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__);
#else
#define dbg(...) 1337;
#endif
#define pb push_back
#define F first
#define S second
#define all(v) v.begin(),v.end()
const int mxn=1e5+100;
vector<vector<int>> freq1,freq2;
vector<int> eq;
int n;
map<char,int> mp;
vector<vector<vector<int>>> pref;
int sum(int w,int a,int b,vector<vector<int>> &pref){
	if(a==0) return pref[b][w];
	else return pref[b][w]-pref[a-1][w];
}
int sum(int l,int r,vector<int>& pref){
	if(l==0) return pref[r];
	return pref[r]-pref[l-1];
}

void init(string a,string b){
	mp['A']=0;
	mp['T']=1;
	mp['C']=2;
	n=a.length();
	freq1.resize(n+1,vector<int>(3,0));
	freq2.resize(n+1,vector<int>(3,0));
	pref.resize(n+1,vector<vector<int>>(3,vector<int>(3,0)));
	eq.resize(n+1,0);
	for(int i=0;i<n;i++){
		freq1[i][mp[a[i]]]++;
	    freq2[i][mp[b[i]]]++;
	    if(!i) continue;
	    for(int j=0;j<3;j++){
	    	freq1[i][j]+=freq1[i-1][j];
	    	freq2[i][j]+=freq2[i-1][j];
	    }
	}
	for(int i=0;i<n;i++){
	   eq[i]=(a[i]==b[i]);
	   if(i) eq[i]+=eq[i-1];
	}
	for(int i=0;i<n;i++){
	   pref[i][mp[a[i]]][mp[b[i]]]++;
	   if(!i) continue;
		for(int j=0;j<3;j++){
			for(int k=0;k<3;k++){
				pref[i][j][k]+=pref[i-1][j][k];
			}
		}
	}
}
int sum(int a,int b,int l,int r,vector<vector<vector<int>>> &pref){
	if(l==0) return pref[r][a][b];
	else return pref[r][a][b]-pref[l-1][a][b];
}
int get_distance(int x,int y){
    bool ok=true;
    for(int i=0;i<3;i++){
    	ok&=(sum(i,x,y,freq1)==sum(i,x,y,freq2));
    }
    if(!ok) return -1;
    int rest=y-x+1;
    int ans=0;
    rest-=sum(x,y,eq);
    map<int,int> mp;
    for(int i=0;i<3;i++){
    	for(int j=i+1;j<3;j++){
    		int a=sum(i,j,x,y,pref)-mp[i];
    		int b=sum(j,i,x,y,pref)-mp[j];
    		int c=min(a,b);
    		if(c<=0) continue;
    		mp[i]+=c;
    		mp[j]+=c;
    		int k=2*c;
    		ans+=c;
    		rest-=2*c;
    	}
    }
    ans+=max(0,rest-1);
    return ans;
}


#ifdef IOI
signed main(){
	int n,q;
	cin>>n>>q;
	string a;
	cin>>a;
	string b;
	cin>>b;
	init(a,b);
	while(q--){
		int a,b;
		cin>>a>>b;
		int x=get_distance(a,b);
		cout<<x<<endl;
	}
}

#endif

Compilation message

dna.cpp: In function 'int get_distance(int, int)':
dna.cpp:91:11: warning: unused variable 'k' [-Wunused-variable]
   91 |       int k=2*c;
      |           ^

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 85 ms 32724 KB Output is correct
2 Correct 98 ms 33104 KB Output is correct
3 Correct 82 ms 30544 KB Output is correct
4 Correct 96 ms 33108 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 33 ms 31544 KB Output is correct
5 Correct 33 ms 31824 KB Output is correct
6 Correct 32 ms 31776 KB Output is correct
7 Correct 31 ms 29648 KB Output is correct
8 Correct 32 ms 31836 KB Output is correct
9 Correct 31 ms 31836 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 33 ms 31544 KB Output is correct
5 Correct 33 ms 31824 KB Output is correct
6 Correct 32 ms 31776 KB Output is correct
7 Correct 31 ms 29648 KB Output is correct
8 Correct 32 ms 31836 KB Output is correct
9 Correct 31 ms 31836 KB Output is correct
10 Correct 101 ms 32880 KB Output is correct
11 Correct 103 ms 33108 KB Output is correct
12 Correct 120 ms 31316 KB Output is correct
13 Correct 102 ms 32076 KB Output is correct
14 Correct 110 ms 33624 KB Output is correct
15 Correct 96 ms 33364 KB Output is correct
16 Correct 90 ms 31312 KB Output is correct
17 Correct 86 ms 32084 KB Output is correct
18 Correct 86 ms 33624 KB Output is correct
19 Correct 70 ms 31312 KB Output is correct
20 Correct 71 ms 32224 KB Output is correct
21 Correct 71 ms 33504 KB Output is correct

Subtask #4
0.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 33 ms 31544 KB Output is correct
5 Correct 33 ms 31824 KB Output is correct
6 Correct 32 ms 31776 KB Output is correct
7 Correct 31 ms 29648 KB Output is correct
8 Correct 32 ms 31836 KB Output is correct
9 Correct 31 ms 31836 KB Output is correct
10 Correct 31 ms 29020 KB Output is correct
11 Correct 36 ms 31824 KB Output is correct
12 Incorrect 32 ms 29788 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #5
0.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 85 ms 32724 KB Output is correct
2 Correct 98 ms 33104 KB Output is correct
3 Correct 82 ms 30544 KB Output is correct
4 Correct 96 ms 33108 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 33 ms 31544 KB Output is correct
12 Correct 33 ms 31824 KB Output is correct
13 Correct 32 ms 31776 KB Output is correct
14 Correct 31 ms 29648 KB Output is correct
15 Correct 32 ms 31836 KB Output is correct
16 Correct 31 ms 31836 KB Output is correct
17 Correct 101 ms 32880 KB Output is correct
18 Correct 103 ms 33108 KB Output is correct
19 Correct 120 ms 31316 KB Output is correct
20 Correct 102 ms 32076 KB Output is correct
21 Correct 110 ms 33624 KB Output is correct
22 Correct 96 ms 33364 KB Output is correct
23 Correct 90 ms 31312 KB Output is correct
24 Correct 86 ms 32084 KB Output is correct
25 Correct 86 ms 33624 KB Output is correct
26 Correct 70 ms 31312 KB Output is correct
27 Correct 71 ms 32224 KB Output is correct
28 Correct 71 ms 33504 KB Output is correct
29 Correct 31 ms 29020 KB Output is correct
30 Correct 36 ms 31824 KB Output is correct
31 Incorrect 32 ms 29788 KB Output isn't correct
32 Halted 0 ms 0 KB -