Submission #1001616

#TimeUsernameProblemLanguageResultExecution timeMemory
1001616vjudge1Mutating DNA (IOI21_dna)C++17
0 / 100
32 ms3808 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long #define f first #define s second #define pb push_back #define pf push_front #define pi pair<int,int> string a,b; const int MAX = 1e5+1; int n; ll pref[MAX], wrong[MAX]; void init(string A, string B){ a = A; b = B; } int get_distance(int x, int y){ ll add = 0; ll sub = 0; map<char,int>mp; string k = a.substr(x,y-x+1); string h= b.substr(x,y-x+1); sort(k.begin(),k.end()); sort(h.begin(),h.end()); if(h!=k){ return -1; } for(int i = x; i<= y; i++){ //cout << a[i]<<" " << b[i]<<endl; if(a[i]!=b[i]){ add++; if(mp[a[i]]){ sub++; mp[a[i]]--; } mp[b[i]]++; } } //cout << add << endl; return add-sub; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...