Submission #565498

#TimeUsernameProblemLanguageResultExecution timeMemory
565498Joshi503Mutating DNA (IOI21_dna)C++17
21 / 100
1533 ms13484 KiB
#include "dna.h" #include <bits/stdc++.h> using namespace std; using ll = long long; using db = long double; using str = string; using pi = pair<int, int>; using pl = pair<ll, ll>; using pd = pair<db, db>; #define f first #define s second #define tcT template<class T #define tcTU tcT, class U tcT> using V = vector<T>; tcT, size_t SZ > using AR = array<T, SZ>; using vi = V<int>; using vb = V<bool>; using vl = V<ll>; using vd = V<db>; using vs = V<str>; using vpi = V<pi>; using vpl = V<pl>; #define sz(x) int((x).size()) #define bg(x) begin(x) #define all(x) bg(x), end(x) #define rall(x) x.rbegin(), x.rend() #define sor(x) sort(all(x)) #define pb push_back #define FOR(i,a,b) for (int i = (a); i < (b); ++i) #define F0R(i,a) FOR(i,0,a) #define ROF(i,a,b) for (int i = ((b)-1); i >= (a); --i) #define R0F(i,a) ROF(i,0,a) #define rep(a) F0R(_,a) #define each(a,x) for (auto& a: x) const ll MOD = 1e9 + 7; const ll MX = 1e9; const ll INF = 1e18; const db PI = acos((db)-1); const int ddef[4]{ 1,0,-1,0 }, dataq[4]{ 0,1,0,-1 }; mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); template<class T> using pqg = priority_queue<T, vector<T>, greater<T>>; void setIO(string name = "") { ios_base::sync_with_stdio(0); cin.tie(0); if (sz(name)) { freopen((name + ".in").c_str(), "r", stdin); freopen((name + ".out").c_str(), "w", stdout); } } void _print(char i) { cerr << i; } void _print(string i) { cerr << i; } void _print(float i) { cerr << i; } void _print(int i) { cerr << i; } void _print(double i) { cerr << i; } void _print() { cerr << "\n"; }; template<typename x, typename y> void _print(pair<x, y>& t) { cerr << "{";_print(t.first);cerr << ", ";_print(t.second);cerr << "},"; } template<typename x> void _print(x& t) { cerr << "{"; for (int i = 0;i < (int)t.size();i++) { _print(t[i]); if (i < (int)t.size() - 1) cerr << ", "; } cerr << "}"; } template<typename x, typename... y> void _print(x a, y... b) { _print(a);if (sizeof...(b)) cerr << ", ";_print(b...); } #define dbg(x...) cerr<<"["<<#x<<"] = [";_print(x);cerr<<"]\n"; const int MXN = 1e5 + 1; str s, t; bitset<MXN> vis; vector<vi> prefS(MXN, vi(3, 0)); vector<vi> prefT(MXN, vi(3, 0)); void init(std::string a, std::string b) { F0R(i, sz(a)){ prefS[i + 1][0] = prefS[i][0] + (a[i] == 'A'); prefS[i + 1][1] = prefS[i][1] + (a[i] == 'T'); prefS[i + 1][2] = prefS[i][2] + (a[i] == 'C'); prefT[i + 1][0] = prefT[i][0] + (b[i] == 'A'); prefT[i + 1][1] = prefT[i][1] + (b[i] == 'T'); prefT[i + 1][2] = prefT[i][2] + (b[i] == 'C'); } s = a; t = b; } int get_distance(int x, int y) { if((prefS[y + 1][0] - prefS[x][0]) != (prefT[y + 1][0] - prefT[x][0]) || (prefS[y + 1][1] - prefS[x][1]) != (prefT[y + 1][1] - prefT[x][1]) || (prefS[y + 1][2] - prefS[x][2]) != (prefT[y + 1][2] - prefT[x][2]) ){ return -1; } str aux = s; int cnt = 0; str temp_s = "", temp_t = ""; FOR(i, x, y + 1){ temp_t += t[i]; if(s[i] == t[i]) vis[i] = 1; FOR(j, x, y + 1){ if(i == j) continue; if(s[i] == t[j] && s[j] == t[i] && !vis[i] && !vis[j]){ vis[i] = vis[j] = 1; swap(s[j], s[i]); cnt++; } } FOR(j, x, y + 1){ if(i == j) continue; if(s[j] == t[i] && !vis[i]){ swap(s[j], s[i]); cnt++; vis[i] = 1; } } temp_s += s[i]; } s = aux; vis.reset(); return cnt; }

Compilation message (stderr)

dna.cpp: In function 'void setIO(std::string)':
dna.cpp:51:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   51 |         freopen((name + ".in").c_str(), "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dna.cpp:52:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   52 |         freopen((name + ".out").c_str(), "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
#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...