| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1208538 | Bilolbek11 | Mutating DNA (IOI21_dna) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
#include "dna.h"
using namespace std;
#define int long long
#define str string
#define db long double
#define ll long long
#define all(s) s.begin(),s.end()
#define endl '\n'
#define ln '\n'
#define ld long double
#define ull unsigned long long
#define uppercase(a) transform(a.begin(),a.end(),a.begin(),::toupper)
#define lowercase(a) transform(a.begin(),a.end(),a.begin(),::tolower)
#define vi vector<int>
#define vii vector<vector<int>>
#define vll vector<ll>
#define vch vector<char>
#define ss second
#define ff first
#define vld vector<long double>
#define vs vector<string>
#define sub(a,i) substr(a,i)
#define pb(x) push_back(x)
#define pp(x) pop_back(x)
#define pii pair<int,int>
#define vpp vector<pair<int,int>>
#define mp make_pair
#define var auto
#define sz(x) (int) x.size()
string yes = "YES";
string no = "NO";
const ll mod = 1e9 + 7;
const ll mxN = 1e5 + 1;
#define pi 3.14159265358979323846
void init(std::string a, std::string b) {
}
int get_distance(int x, int y) {
str sa="",sb="";
for(int i=x;i<=y;i++){
sa+=a[i];
}
for(int i=x;i<=y;i++){
sb+=b[i];
}
str ga=sa,gb=sb;
sort(all(sa));
sort(all(sb));
if(sa!=sb){
return -1;
}else{
return 1;
}
sa = ga;
sb = gb;
}
/*
██████╗░██╗██╗░░░░░░█████╗░██╗░░░░░██████╗░███████╗██╗░░██╗
██╔══██╗██║██║░░░░░██╔══██╗██║░░░░░██╔══██╗██╔════╝██║░██╔╝
██████╦╝██║██║░░░░░██║░░██║██║░░░░░██████╦╝█████╗░░█████═╝░
██╔══██╗██║██║░░░░░██║░░██║██║░░░░░██╔══██╗██╔══╝░░██╔═██╗░
██████╦╝██║███████╗╚█████╔╝███████╗██████╦╝███████╗██║░╚██╗
╚═════╝░╚═╝╚══════╝░╚════╝░╚══════╝╚═════╝░╚══════╝╚═╝░░╚═╝*/