QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #644419 | #7618. Pattern Search | ucup-team4479# | WA | 48ms | 3868kb | C++23 | 1.6kb | 2024-10-16 13:51:45 | 2024-10-16 13:51:47 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int sbac[30], tbac[30];
void solve() {
string s, t;
cin >> s >> t;
int n = s.length(), m = t.length();
for (int i = 0; i < n; ++i) sbac[s[i] - 'a']++;
for (int i = 0; i < m; ++i) tbac[t[i] - 'a']++;
bool flag = 1;
string one = "", two = "", thr = "";
for (int i = 0; i < 26; ++i) {
char ch = 'a' + i;
if (tbac[i] % 3 == 1) {
flag = 0;
break;
} if (tbac[i] % 3 == 2)
two = two + ch;
while (tbac[i] >= 3) {
tbac[i] -= 3;
thr = thr + ch;
}
}
int border = 0;
if (!flag) {
two = "";
for (int i = 0; i < 26; ++i) {
char ch = 'a' + i;
if (tbac[i] & 1) one = one + ch;
while (tbac[i] >= 2) {
tbac[i] -= 2;
two = two + ch;
}
}
t = two + one + two;
border = two.length();
} else t = thr + two + thr + two + thr, border = thr.length() * 2 + two.length();
// cout << t << endl;
int now = 0, ans = 0;
for (int i = 0; i < n; ++i) {
if (sbac[t[now] - 'a']) {
sbac[t[now] - 'a']--;
if (now == m - 1) ans++, now = border;
else now++;
} else break;
}
cout << ans << endl;
for (int i = 0; i < 26; ++i) sbac[i] = tbac[i] = 0;
}
int main() {
cin.tie(nullptr) -> ios::sync_with_stdio(false);
cout.tie(0);
int T;
cin >> T;
while (T--) solve();
return 0;
}
/*
1
bajkaaaalll aaall
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3868kb
input:
2 bajkaaall aal abca cba
output:
2 1
result:
ok 2 number(s): "2 1"
Test #2:
score: 0
Accepted
time: 0ms
memory: 3744kb
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 2 2 0 0 0 0 1
result:
ok 16 numbers
Test #3:
score: -100
Wrong Answer
time: 48ms
memory: 3796kb
input:
90522 cyykzyylklyll ylcyllklzk ttusuuudtdtqus uuddu uefyqfkiblyfkyd ffyyqde qfxqecljeqeedea jqdxf prrbfxdxffpbpp ffppd ynjgygygjnjnjg jgynjggn maenpaksmxyya saxkep nrdnbnjipnjowjz djbwojzrpni oputuoufoojupu uoouopo mphmhphpkpkpmhp phmhpppp zwznzpzqyjczzy wczjnpzqy pfxfxxkfffpfx fxffkffxpx hzdhzhhh h...
output:
1 1 1 1 1 0 1 1 1 1 1 0 1 1 0 1 1 1 1 1 1 1 4 1 1 1 2 1 1 4 1 1 1 1 1 1 1 0 0 1 1 1 1 2 0 2 1 1 1 1 0 2 3 1 1 0 1 0 1 1 1 1 2 2 1 1 1 0 1 2 1 1 1 1 4 1 1 1 1 1 1 1 3 1 1 3 1 0 1 1 1 1 0 1 1 1 1 3 0 1 4 0 1 1 1 1 1 1 0 1 0 5 1 7 1 1 1 1 0 3 1 1 1 1 1 0 1 0 1 1 1 2 1 1 0 1 1 1 0 0 1 0 1 1 1 0 0 1 1 2 ...
result:
wrong answer 6th numbers differ - expected: '1', found: '0'