QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#537037 | #7789. Outro: True Love Waits | Repeater | WA | 0ms | 3868kb | C++20 | 2.5kb | 2024-08-29 18:54:15 | 2024-08-29 18:54:21 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using i64 = long long;
using pii = pair<int, int>;
using db = double;
#define cY cout << "YES\n"
#define cN cout << "NO\n"
#define cA cout << ans << "\n"
#define pb push_back
const ll mod = 998244353;
const ll MOD = 1e9 + 7;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
int mp[4][4];
void init() {
mp[0][0] = 4;
mp[0][1] = 1;
mp[0][2] = 3;
mp[0][3] = 2;
mp[1][1] = 4;
mp[1][0] = 1;
mp[1][2] = 2;
mp[1][3] = 3;
mp[2][2] = 4;
mp[2][3] = 1;
mp[2][1] = 2;
mp[2][0] = 3;
mp[3][3] = 4;
mp[3][2] = 1;
mp[3][0] = 2;
mp[3][1] = 3;
}
ll power(ll a, ll b) {
ll res = 1;
while (b) {
if (b & 1)
res = res * a % MOD;
b >>= 1;
a = a * a % MOD;
}
return res;
}
void crossparallel() {
string s, t;
cin >> s >> t;
int k;
cin >> k;
if (s == t) {
ll ans = (power(4, k) - 1) * power(3, MOD - 2) - 1;
ans = ans % MOD;
cout << ans << "\n";
return;
}
int len = std::max(s.size(), t.size());
len += len & 1;
std::string tmp = std::string(len - (int)s.size(), '0');
s = tmp + s;
tmp = std::string(len - (int)t.size(), '0');
t = tmp + t;
std::ranges::reverse(s), std::ranges::reverse(t);
int pos = -1;
for (int i = 1; i < min(s.size(), t.size()); i += 2) {
if (s[i] != t[i] || s[i - 1] != t[i - 1])
pos = i;
}
int cnt = 0;
for (int i = 1; i <= pos; i += 2) {
if (s[i] != t[i] || s[i - 1] != t[i - 1])
i = i;
else
cnt++;
}
if (cnt < k - 1 || k > (pos + 1) / 2) {
cout << -1 << "\n";
return;
}
ll ans = (power(4, k) - 1) * power(3, MOD - 2) - 1;
ll cur = 1;
for (int i = 1; i <= pos; i += 2) {
if (s[i] != t[i] || s[i - 1] != t[i - 1]) {
int x = (s[i] - '0') * 2 + (s[i - 1] - '0');
int y = (t[i] - '0') * 2 + (t[i - 1] - '0');
ans += cur * mp[x][y];
ans %= MOD;
}
cur = (cur << 2) + 1;
cur %= MOD;
}
cout << ans << "\n";
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
init();
int t = 1;
cin >> t;
while (t--) {
crossparallel();
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3868kb
input:
4 1 10 1 1 10 2 100 0 2 11 11 3
output:
2 -1 9 20
result:
ok 4 number(s): "2 -1 9 20"
Test #2:
score: 0
Accepted
time: 0ms
memory: 3868kb
input:
1 0 0 1
output:
0
result:
ok 1 number(s): "0"
Test #3:
score: 0
Accepted
time: 0ms
memory: 3856kb
input:
100 110111 11111 1 10110 101101 1 11010 111111 1 100110 1 1 10010 11010 1 1100 10111 1 100100 111110 1 101110 101100 1 1011 10110 1 110100 1110 1 11010 11000 1 11110 1000 1 111000 11101 1 110 1001 1 101010 11000 1 10 111110 1 110001 101000 1 1010 1000 1 10101 11 1 111011 11010 1 110001 100000 1 1100...
output:
78 59 69 70 15 38 39 3 32 60 3 29 69 12 45 52 37 3 29 64 22 39 54 69 65 27 33 76 34 18 57 13 81 15 23 70 69 36 18 23 29 42 69 54 6 0 63 3 29 15 10 16 80 24 37 59 71 13 23 31 21 34 23 48 21 47 7 44 42 3 37 75 59 29 55 39 29 28 29 70 55 16 54 47 24 18 79 60 8 26 64 58 32 6 8 37 2 68 42 44
result:
ok 100 numbers
Test #4:
score: -100
Wrong Answer
time: 0ms
memory: 3564kb
input:
100 10011111 111 2 1011101100 1000000100 1 100011111 1001001111 1 1001100101 1100100001 1 10101000 10000100 1 1011110101 100011101 1 110100001 111011010 1 1101001100 1111101101 1 1001101 11011010 1 1101110110 1101011000 1 110011001 1100001111 2 1001111001 1011001111 1 1001110 1101110100 2 1110110100...
output:
295 248 788 431 73 930 144 319 283 76 -1 305 746 899 86 -1 312 293 1293 433 1179 0 884 963 1215 576 473 1132 499 811 864 949 1322 406 526 862 -1 447 1203 1238 873 -1 -1 1131 1108 438 134 359 80 740 1057 752 31 950 1093 1261 650 235 996 876 504 925 1344 450 1010 273 411 1144 1041 717 949 164 -1 11 79...
result:
wrong answer 13th numbers differ - expected: '-1', found: '746'