제출 #1312353

#제출 시각아이디문제언어결과실행 시간메모리
1312353repmannBliskost (COI23_bliskost)C++20
100 / 100
104 ms6672 KiB
#include <bits/stdc++.h> using namespace std; int N, Q; string A, B; int main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); cin >> N >> Q >> A >> B; int sum[2]; sum[0] = sum[1] = 0; for(int i = 0; i < (N - 1); i++) sum[i & 1] += B[i] - A[i]; if(((B[N - 1] - A[N - 1] + 26) % 26) == (((sum[N & 1] - sum[!(N & 1)]) % 26 + 26) % 26)) cout << "da\n"; else cout << "ne\n"; int i; char c; while(Q--) { cin >> i >> c; i--; if(i < (N - 1)) sum[i & 1] -= B[i] - A[i]; A[i] = c; if(i < (N - 1)) sum[i & 1] += B[i] - A[i]; if(((B[N - 1] - A[N - 1] + 26) % 26) == (((sum[N & 1] - sum[!(N & 1)]) % 26 + 26) % 26)) cout << "da\n"; else cout << "ne\n"; } return 0; }
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...