# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1112543 | 2024-11-14T09:48:37 Z | vjudge1 | Bliskost (COI23_bliskost) | C++17 | 1 ms | 336 KB |
#include <bits/stdc++.h> #define int long long #define pb push_back #define a2b(a, b) (a << b) // a*2^b #define bit(a, b) ((a >> b) & 1) // bth bit from the right, starts at zero #define n1p(x) (x%2==1?-1:1) // (-1)^x using namespace std; template<class T> using vec = vector<T>; const int INFTY = (1LL << 63) - 1; const int NNFTY = 1LL << 63; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n, q; cin >> n >> q; string s1, s2; cin >> s1 >> s2; int mod11 = 0; for (int i = 0; i < n; i++) { mod11 += n1p(i)*(s1[i] - s2[i]); } cout << "ne\n\0da\n" + 4*(mod11%11==0); while (q--) { int i; char c; cin >> i >> c; i--; mod11 += n1p(i)*(c-s1[i]); s1[i] = c; cout << "ne\n\0da\n" + 4*(mod11%11==0); } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 336 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 336 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 336 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 336 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 336 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 336 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |