QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#246548 | #7618. Pattern Search | DateTree | WA | 0ms | 3804kb | C++17 | 1.5kb | 2023-11-10 21:58:40 | 2023-11-10 21:58:40 |
Judging History
answer
#include <bits/stdc++.h>
int main() {
//freopen("in", "r", stdin);
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
int ttt;
std::cin >> ttt;
while (ttt--) {
std::string x, y;
std::cin >> x >> y;
std::vector<int> s(26), t(26);
for (auto &c: x)
++s[c - 'a'];
for (auto &c: y)
++t[c - 'a'];
bool flag = 0;
for (int i = 0; i < 26; ++i) {
if (s[i] < t[i]) {
puts("0");
flag = 1;
break;
}
}
if (flag)
continue;
int min = std::min(x.length(), y.length());
int ans = 1;
for (int k = 1; k <= min + 1; ++k) {
bool f = 0;
int tmp = 1e9 + 7;
for (int i = 0; i < 26; ++i) {
if (!t[i])
continue;
if (t[i] + 1 < k) {
f = 1;
break;
}
int p = t[i] / k, q = t[i] % k;
if (k - q - 1 <= p) {
++p;
} else {
tmp = -1;
break;
}
tmp = std::min(tmp, 1 + (s[i] - t[i]) / p);
//printf("tmp %d\n", tmp);
}
if (!f) {
ans = std::max(ans, tmp);
} else {
break;
}
}
printf("%d\n", ans);
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3804kb
input:
2 bajkaaall aal abca cba
output:
2 1
result:
ok 2 number(s): "2 1"
Test #2:
score: -100
Wrong Answer
time: 0ms
memory: 3796kb
input:
16 a a a b b a aa a ab aa ab b ab c aaz az abcde edcba aaaaaaaaaaaabbb aaaaaaaaabb aaaaaazz az aaaaaaaaaz zzzzz gggggggggggggggggggge ggggeeee hyphyphyphyphyphyphyphyphyphyphyphyp eeeeeeeeee hyphyphyphyphyphyphyphyphyphyphyphype eeteeteeteet aaaabbbbbbcccccccc aaabbbbbcccccc
output:
1 0 0 2 0 1 0 1 1 1 2 0 0 0 0 1
result:
wrong answer 10th numbers differ - expected: '2', found: '1'