제출 #691581

#제출 시각아이디문제언어결과실행 시간메모리
691581vjudge1Mutating DNA (IOI21_dna)C++17
0 / 100
31 ms5188 KiB
#pragma GCC optimize("O3,unroll-loops") #pragma GCC target("avx,avx2,fma") #include <bits/stdc++.h> #include<ext/pb_ds/assoc_container.hpp> #include<ext/pb_ds/tree_policy.hpp> /* DEFINES */ #define F first #define S second #define ll long long #define ull unsigned long long #define ld long double #define npos ULLONG_MAX #define INF LLONG_MAX #define vv(a) vector<a> #define pp(a, b) pair<a, b> #define pq(a) priority_queue<a> #define qq(a) queue<a> #define ss(a) set<a> #define mm(a, b) map<a, b> #define ump(a, b) unordered_map<a, b> #define sync \ ios_base::sync_with_stdio(0); \ cin.tie(0); \ cout.tie(0); #define elif else if #define endl "\n" #define allc(a) begin(a), end(a) #define all(a) a, a + sizeof(a) / sizeof(a[0]) #define pb push_back #define logi(a) __lg(a) #define sqrt(a) sqrtl(a) #define mpr make_pair #define ins insert using namespace std; using namespace __gnu_pbds; using namespace __cxx11; typedef char chr; typedef basic_string<chr> str; template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()); const ll sz = 1e5 + 5; ll pref[sz], cnt[128][sz]; void init(str a, str b) { a = ' ' + a; b = ' ' + b; for (ll i = 1; i < b.size(); i++) pref[i] = pref[i - 1] + (a[i] != b[i]), cnt[a[i] - 'A'][i]++, cnt[b[i] - 'A'][i]++; } int get_distance(int x, int y) { x++, y++; for (ll c : {3, 0, 'T' - 'A'}) if (cnt[c][y] - cnt[c][x - 1]) return -1; return (pref[y] - pref[x - 1] + 1) >> 1; } void solve() { } /* */ // int main() // { // sync // // precomp(); // ll t = 1; // // cin >> t; // for (ll i = 1; i <= t; i++) // // cout << "Case #" << i << ": ", // solve(); // cerr << "\nTime elapsed : " << clock() * 1000.0 / CLOCKS_PER_SEC << " ms\n"; // }

컴파일 시 표준 에러 (stderr) 메시지

dna.cpp: In function 'void init(str, str)':
dna.cpp:50:22: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   50 |     for (ll i = 1; i < b.size(); i++)
      |                    ~~^~~~~~~~~~
#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...