This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
/*
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
*/
#include "dna.h"
#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int>vi;
typedef vector<vector<int>>vvi;
typedef vector<ll>vl;
typedef vector<vl> vvl;
typedef pair<int,int>pi;
typedef pair<ll,ll> pl;
typedef vector<pl> vpl;
typedef vector<ld> vld;
typedef pair<ld,ld> pld;
typedef vector<pi> vpi;
//typedef tree<ll, null_type, less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
template<typename T> ostream& operator<<(ostream& os, vector<T>& a){os<<"[";for(int i=0; i<ll(a.size()); i++){os << a[i] << ((i!=ll(a.size()-1)?" ":""));}os << "]\n"; return os;}
#define all(x) x.begin(),x.end()
#define YES out("YES")
#define NO out("NO")
#define out(x){cout << x << "\n"; return;}
#define outfl(x){cout << x << endl;return;}
#define GLHF ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define print(x){for(auto ait:x) cout << ait << " "; cout << "\n";}
#define pb push_back
#define umap unordered_map
template<typename T1, typename T2> istream& operator>>(istream& is, pair<T1, T2>& p){is >> p.first >> p.second;return is;}
template<typename T1, typename T2> ostream& operator<<(ostream& os, pair<T1, T2>& p){os <<"" << p.first << " " << p.second << ""; return os;}
void usaco(string taskname){
string fin = taskname + ".in";
string fout = taskname + ".out";
const char* FIN = fin.c_str();
const char* FOUT = fout.c_str();
freopen(FIN, "r", stdin);
freopen(FOUT, "w", stdout);
}
template<typename T>
void read(vector<T>& v){
int n=v.size();
for(int i=0; i<n; i++)
cin >> v[i];
}
template<typename T>
vector<T>UNQ(vector<T>a){
vector<T>ans;
for(T t:a)
if(ans.empty() || t!=ans.back())
ans.push_back(t);
return ans;
}
vector<map<string,int>>pref;
void init(string a, string b) {
int n=a.size();
pref.resize(n);
for(int i=0; i<n;i ++){
if(i)pref[i]=pref[i-1];
pref[i][string(1,a[i])+string(1,b[i])]++;
}
}
int get_distance(int x, int y) {
int AA=pref[y]["AA"]-(x?pref[x-1]["AA"]:0);
int CC=pref[y]["CC"]-(x?pref[x-1]["CC"]:0);
int TT=pref[y]["TT"]-(x?pref[x-1]["TT"]:0);
int AC=pref[y]["AC"]-(x?pref[x-1]["AC"]:0);
int CA=pref[y]["CA"]-(x?pref[x-1]["CA"]:0);
int AT=pref[y]["AT"]-(x?pref[x-1]["AT"]:0);
int TA=pref[y]["TA"]-(x?pref[x-1]["TA"]:0);
int TC=pref[y]["TC"]-(x?pref[x-1]["TC"]:0);
int CT=pref[y]["CT"]-(x?pref[x-1]["TA"]:0);
int ans=0;
int mn=min(AC,CA);
ans+=mn;
AC-=mn,CA-=mn;
mn=min(TC,CT);
ans+=mn;
TC-=mn,CT-=mn;
mn=min(TA,AT);
ans+=mn;
TA-=mn,AT-=mn;
mn=min({AC, CT, TA});
ans+=2*mn;
AC-=mn,CT-=mn,TA-=mn;
if(AC || CA || TA || AT || CT || TA)return -1;
return ans;
}
/*
6 3
ATACAT
ACTATA
1 3
4 5
3 5
*/
Compilation message (stderr)
dna.cpp: In function 'int get_distance(int, int)':
dna.cpp:81:9: warning: unused variable 'AA' [-Wunused-variable]
81 | int AA=pref[y]["AA"]-(x?pref[x-1]["AA"]:0);
| ^~
dna.cpp:82:9: warning: unused variable 'CC' [-Wunused-variable]
82 | int CC=pref[y]["CC"]-(x?pref[x-1]["CC"]:0);
| ^~
dna.cpp:83:9: warning: unused variable 'TT' [-Wunused-variable]
83 | int TT=pref[y]["TT"]-(x?pref[x-1]["TT"]:0);
| ^~
dna.cpp: In function 'void usaco(std::string)':
dna.cpp:49:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
49 | freopen(FIN, "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~
dna.cpp:50:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
50 | freopen(FOUT, "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |