Submission #1284221

#	Time	Username	Problem	Language	Result	Execution time	Memory
1284221		muhammad-mutahir	Bliskost (COI23_bliskost)	C++20	40 / 100	1054 ms	4544 KiB

Main

#include <bits/stdc++.h>
using namespace std;

#define print(l) for(auto i:l) cout<<i<<" ";cout<<endl;
#define input(t,l,n) vector<t>l(n);for(int i = 0;i<n;i++)cin>>l[i];
#define int long long
#define pb push_back
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> 
#define all(l) l.begin(),l.end()
#define pii pair<int,int>
#define fi first
#define se second

const int M = 1e9+7;
const int inf = 1e18;


int bp(int x, int y, int p){
    int res = 1;
    x = x % p;
    while (y > 0) {
 
        if (y & 1)
            res = (res * x) % p;
        y = y >> 1;
        x = (x * x) % p;
    }
    return res;
}
 
int MI(int n, int p){
    return bp(n, p - 2, p);
}
int mul(int x,int y, int p){
    return x * 1ull * y % p;
}
int di(int x,int y, int p){
    return mul(x, MI(y, p), p);
}


int n , m , k , q;

void solve(int testcase_number){
    cin>>n>>q;
    string a,b;
    cin>>a>>b;

		string oa = a; 
		string ob = b;
    // q++;
    // for(int j = 0;j<q;j++){
	    for(int i =0 ;i+1<n;i++){
	    	int di = abs(a[i]-b[i]);
	    	// di = min(di,26-di);
	    	if(26-di < di){
	    		di = 26-di;
	    		if(a[i]-'a' > b[i]-'a'){
	    			// cout<<a[i]-'a'+di<<endl;
	    			a[i] = (char)'a'+(a[i]+di-'a')%26;
	    			a[i+1] = (char)'a'+(a[i+1]+di-'a')%26;
	    			
	    		}
	    		else{
	    			b[i] = (char)'a'+(b[i]+di-'a')%26;
	    			b[i+1] = (char)'a'+(b[i+1]+di-'a')%26;
	    		}
	    	}
	    	else{
	    		if(a[i]-'a' < b[i]-'a'){
	    			a[i] = (char)'a'+(a[i]+di-'a')%26;
	    			a[i+1] = (char)'a'+(a[i+1]+di-'a')%26;
	    			
	    		}
	    		else{
	    			b[i] = (char)'a'+(b[i]+di-'a')%26;
	    			b[i+1] = (char)'a'+(b[i+1]+di-'a')%26;
	    		}	    		
	    	}
	    	// cout<<di<<endl;
	    }
	    // cout<<a<<" "<<b<<endl;
	    if(a == b){
	    	cout<<"da"<<endl;
	    }
	    else{
	    	cout<<"ne"<<endl;
	    }
	    a = oa;
	    b = ob;
	    for(int jk =0 ;jk<q;jk++){
	    	int jjk;
	    	char ff;
	    	cin>>jjk>>ff;
	    	a[jjk-1] = ff;
	    	oa = a;
	    for(int i =0 ;i+1<n;i++){
	    	int di = abs(a[i]-b[i]);
	    	// di = min(di,26-di);
	    	if(26-di < di){
	    		di = 26-di;
	    		if(a[i]-'a' > b[i]-'a'){
	    			// cout<<a[i]-'a'+di<<endl;
	    			a[i] = (char)'a'+(a[i]+di-'a')%26;
	    			a[i+1] = (char)'a'+(a[i+1]+di-'a')%26;
	    			
	    		}
	    		else{
	    			b[i] = (char)'a'+(b[i]+di-'a')%26;
	    			b[i+1] = (char)'a'+(b[i+1]+di-'a')%26;
	    		}
	    	}
	    	else{
	    		if(a[i]-'a' < b[i]-'a'){
	    			a[i] = (char)'a'+(a[i]+di-'a')%26;
	    			a[i+1] = (char)'a'+(a[i+1]+di-'a')%26;
	    			
	    		}
	    		else{
	    			b[i] = (char)'a'+(b[i]+di-'a')%26;
	    			b[i+1] = (char)'a'+(b[i+1]+di-'a')%26;
	    		}	    		
	    	}
	    	// cout<<di<<endl;
	    }
	    // cout<<a<<" "<<b<<endl;
	    if(a == b){
	    	cout<<"da"<<endl;
	    }
	    else{
	    	cout<<"ne"<<endl;
	    }
	    a = oa;
	    b = ob;
	    }
    



}


signed main(){
    // ios::sync_with_stdio(0);//DO NOT USE IN INTERACTIVE
    // cin.tie(0), cout.tie(0);
    // cout << fixed<<setprecision(9);

    int t = 1;
    // cin>>t;
    for(int i = 1;i<=t;i++){
        solve(i);
    }

}

• Subtask 1: 7 / 7
• Subtask 2: 8 / 8
• Subtask 3: 13 / 13
• Subtask 4: 12 / 12
• Subtask 5: 0 / 17
• Subtask 6: 0 / 43