QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #766951 | #9726. AUS | i_wish_a_girl_friend# | RE | 1ms | 3860kb | C++20 | 1.2kb | 2024-11-20 19:24:46 | 2024-11-20 19:24:47 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
int find(int x)
{
}
void Solve()
{
string a, b, c;
cin >> a >> b >> c;
int n = a.size(), m = c.size();
if (a.size() != b.size())
return cout << "NO\n", void();
vector<int> p(n + 1);
iota(p.begin(), p.end(), 0);
auto find = [&](auto &&find, int x) -> int
{
return x == p[x] ? p[x] : p[x] = find(find, p[x]);
};
auto merge = [&](int u, int v)
{
u = find(find, u), v = find(find, v);
if (u == v)
return;
p[v] = u;
};
for (int i = 0; i < n; i++)
{
int u = a[i] - 'a', v = b[i] - 'a';
merge(u, v);
}
if (n == m)
{
for (int i = 0; i < n; i++)
{
int u = a[i] - 'a', v = c[i] - 'a';
if (find(find, u) != find(find, v))
{
return cout << "YES\n", void();
}
}
cout << "NO\n";
}
else
cout << "YES\n";
}
signed main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int T = 1;
cin >> T;
while (T--)
Solve();
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3860kb
input:
4 abab cdcd abce abab cdcd abcd abab cdcd abc x yz def
output:
YES NO YES NO
result:
ok 4 lines
Test #2:
score: 0
Accepted
time: 0ms
memory: 3676kb
input:
10 ekkzjwextuoazxsosiiiditwrjiztfvxtzaztmdfhxroaqkjcdgsgiitkfglcrtgjquspjyjtodyhxetldbhvxampcvbinzgksxkunduhvbddakqswurshbnuazthfnxmsuyypznmxmatsnvpqovscnkkcjphtcmcsqteeikwggnugskjjwttvlrxmmrkyltxjhfiqicttcfumurdrmiqauruywgdomxxpbeunliyvsutrneexoyckjflhnmmaaovxubnptlemptxbhrflbnfcowktydgbugdxvkvegza...
output:
NO NO NO NO NO NO NO NO NO NO
result:
ok 10 lines
Test #3:
score: 0
Accepted
time: 1ms
memory: 3856kb
input:
100 dntfvviytogwqljvoksaovstrqwpovkncxvmytnvcaoikctmgukaxlivmwahenydtswyowpdvggeeyzykdiojltpxuzzwphdqfsh anbbtriynochhmrtsmjifvatlfsmwiimvxbmyoavcmfiioxatckaxcikmwazenjmdleyjwndvggqkazikdeofaqpbuzkupshfhgh anbflviytfylqlpvvmjaovajllwpoukmvwemgtivvaonkoxagukaxriyuvmypnymtdqyocpdvcgqkazykrihjbipxquzup...
output:
YES YES NO NO NO NO NO NO NO YES NO NO YES NO NO NO YES YES YES YES YES NO YES NO YES NO NO NO NO NO YES NO NO NO NO YES NO YES NO NO YES NO YES NO NO YES NO NO NO YES NO NO YES NO NO YES NO NO NO YES NO NO YES NO NO YES YES NO YES NO NO NO YES NO NO NO YES YES YES NO YES NO NO YES NO NO NO NO NO NO...
result:
ok 100 lines
Test #4:
score: -100
Runtime Error
input:
1000 armvnnqped esmswdspfz czwpnnqpfz tynubfwity tygubajvty tygrqagvty fzhbxdpubn jxqbvdpumd jbhbokpuld smlbevdsjj rmkbevzujj rmkbevdsfd hrojqfcpy qpojqjcpyu erojqfmnsu ywcdpimkgf xwtdexmegf pwgdpckkg miotgaeyif mnmigmlljc ynmtcapyip oziodvpjza ofikevppqr omikuppgza stgwxovhmv jtumxonqcp jogmvouqmv ...