QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #775618 | #9726. AUS | zqx | TL | 175ms | 7700kb | C++20 | 1.2kb | 2024-11-23 16:20:08 | 2024-11-23 16:20:08 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define endl "\n"
using namespace std;
const int N = 1000000;
int s[N];
void init_set() { //初始化
for (int i = 1; i <= N; i++) s[i] = i;
}
int find_set(int x) { //查找
return x == s[x] ? x : find_set(s[x]);
}
void merge_set(int x, int y) { //合并
x = find_set(x); y = find_set(y);
if (x != y) s[x] = s[y]; //把x合并到y上，y的根成为x的根
}
void solve()
{
init_set();
string s1, s2, s3;
cin >> s1 >> s2 >> s3;
if (s1.size() != s2.size())
{
cout << "NO" << endl;
return;
}
for (int i = 0; i < s1.size(); i++)
{
merge_set(s1[i] - 'a' + 1, s2[i] - 'a' + 1);
}
if (s1.size() != s3.size())
{
cout << "YES" << endl;
return;
}
for (int i = 0; i < s1.size(); i++)
{
if (find_set(s1[i] - 'a' + 1) != find_set(s3[i] - 'a' + 1))
{
cout << "YES" << endl;
return;
}
}
cout << "NO" << endl;
}
int main(void)
{
ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int t;
cin >> t;
while (t--)
{
solve();
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 7424kb
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: 4ms
memory: 7504kb
input:
10 ekkzjwextuoazxsosiiiditwrjiztfvxtzaztmdfhxroaqkjcdgsgiitkfglcrtgjquspjyjtodyhxetldbhvxampcvbinzgksxkunduhvbddakqswurshbnuazthfnxmsuyypznmxmatsnvpqovscnkkcjphtcmcsqteeikwggnugskjjwttvlrxmmrkyltxjhfiqicttcfumurdrmiqauruywgdomxxpbeunliyvsutrneexoyckjflhnmmaaovxubnptlemptxbhrflbnfcowktydgbugdxvkvegza...
output:
NO NO NO NO NO NO NO NO NO NO
result:
ok 10 lines
Test #3:
score: 0
Accepted
time: 19ms
memory: 7700kb
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: 0
Accepted
time: 175ms
memory: 7504kb
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 ...
output:
YES YES YES YES NO YES YES YES YES NO YES YES NO NO NO YES YES YES NO YES YES YES NO YES YES YES YES NO YES YES YES NO NO NO YES YES YES YES YES YES YES YES NO YES YES YES NO YES YES YES YES YES NO YES YES YES YES YES YES YES YES YES YES NO YES YES YES NO YES YES YES YES YES YES YES YES YES YES YES ...
result:
ok 1000 lines
Test #5:
score: -100
Time Limit Exceeded
input:
10000 b e a o o l w z w r s r g i m n g g o u u p p p g g g z x x z z m a a z e j d e m e q a t p f p e z h u w u x x n e m e f f c r j r u o r f f f j e n w x m f h f i q w e e w s r m r r o o j l b b w x x z s x x g v s h j j h h d h j j c d t z v v q v n j j q m z w p p s d c l c c c l s a r a m ...
output:
YES YES NO NO YES NO NO NO NO NO YES YES YES NO YES NO YES NO YES NO YES NO YES NO YES YES NO YES YES YES YES YES YES YES NO YES NO YES NO YES NO YES YES YES YES YES NO YES YES YES NO YES YES YES YES YES NO YES YES NO NO YES NO YES YES YES YES NO YES YES YES NO NO YES YES NO NO NO NO NO YES NO YES Y...