Submission #952340

#TimeUsernameProblemLanguageResultExecution timeMemory
952340woodMutating DNA (IOI21_dna)C++17
35 / 100
28 ms6424 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<ll, ll> p32; typedef pair<ll, ll> p64; #define pb push_back #define eb emplace_back #define fi first #define se second #define fast_cin() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL) #define MOD %1000000007 vector<ll> pref_b; vector<ll> pref_a; vector<ll> pref_b2; vector<ll> pref_a2; vector<ll> matchpref; void init(string a, string b) { ll n = a.size(); pref_a.resize(n+1); pref_b.resize(n+1); pref_a2.resize(n+1); pref_b2.resize(n+1); matchpref.resize(n+1); for (size_t i = 0; i < a.size(); i++) { pref_a[i + 1] = pref_a[i] + (a[i] == 'A'); pref_b[i + 1] = pref_b[i] + (b[i] == 'A'); pref_a2[i + 1] = pref_a2[i] + (a[i] == 'T'); pref_b2[i + 1] = pref_b2[i] + (b[i] == 'T'); matchpref[i + 1] = matchpref[i]+((a[i] == 'A') && (b[i] != 'A')||((a[i]=='T')&&(b[i]=='C'))); } } ll get_distance(int x, int y) { if ((pref_a[y + 1] - pref_a[x] != pref_b[y + 1] - pref_b[x])||(pref_a2[y+1]-pref_a2[x]!= pref_b2[y+1]-pref_b2[x])) { return -1; } else return (matchpref[y + 1] - matchpref[x]); }

Compilation message (stderr)

dna.cpp: In function 'void init(std::string, std::string)':
dna.cpp:31:56: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   31 |         matchpref[i + 1] = matchpref[i]+((a[i] == 'A') && (b[i] != 'A')||((a[i]=='T')&&(b[i]=='C')));
      |                                          ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
#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...