QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#742530	#9726. AUS	Microperson^#	WA	1ms	5872kb	C++20	1.1kb	2024-11-13 16:45:48	2024-11-13 16:45:49

Judging History

你现在查看的是最新测评结果

[2024-11-13 16:45:49]
评测

测评结果：WA
用时：1ms
内存：5872kb

查看

[2024-11-13 16:45:48]
提交

answer


#include<bits/stdc++.h>

using namespace std;
typedef long long ll;
const ll N = 1000007;
ll arr[30][30];
int p[N];
int flag[N];
int found(int x){
	if(p[x]!=x){
		p[x]=found(p[x]);
		return p[x];
	}
	return x;
}
void merge(int x,int y){
	int px = found(x);
	int py = found(y);
	p[px]=py;
}
void solve( ){
	string a,b,c;
	cin >>a >>b>> c;
	if(a.length()!=b.length()){
		cout<<"NO\n";
		return;

	}

	if(a.length()!=c.length()){
		cout<<"YES\n";
		return;

	}
	int f=0;
	int n=a.length();
	for(int i='a';i<='z';i++)p[i]=i;
	for(int i='a';i<='z';i++)flag[i]=0;
	for(int i=0;i<n;i++){
		if(flag[a[i]]==0||flag[b[i]]==0){
			flag[a[i]]=1,flag[b[i]]=1;
			merge(a[i],b[i]);

		}else{
			if(found(a[i])!=found(b[i])){
				cout<<"NO\n";
				return;
			}
		}

	}
	for(int i=0;i<n;i++){
		if(found(c[i])!=found(a[i])){
			cout<<"YES\n";
			return;
		}
	}
	cout<<"NO\n";

	

}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    ll T=1;
    cin >> T;
    while(T--){
        solve();
    }
}
/*
4
abab
cdcd
abce
abab
cdcd
abcd
abab
cdcd
abc
x
yz
def
 */

Source code, Language: C++20

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 1ms

memory: 5548kb

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: 1ms

memory: 5872kb

input:

10
ekkzjwextuoazxsosiiiditwrjiztfvxtzaztmdfhxroaqkjcdgsgiitkfglcrtgjquspjyjtodyhxetldbhvxampcvbinzgksxkunduhvbddakqswurshbnuazthfnxmsuyypznmxmatsnvpqovscnkkcjphtcmcsqteeikwggnugskjjwttvlrxmmrkyltxjhfiqicttcfumurdrmiqauruywgdomxxpbeunliyvsutrneexoyckjflhnmmaaovxubnptlemptxbhrflbnfcowktydgbugdxvkvegza...

output:

NO
NO
NO
NO
NO
NO
NO
NO
NO
NO

result:

ok 10 lines

Test #3:

score: -100

Wrong Answer

time: 1ms

memory: 5616kb

input:

100
dntfvviytogwqljvoksaovstrqwpovkncxvmytnvcaoikctmgukaxlivmwahenydtswyowpdvggeeyzykdiojltpxuzzwphdqfsh
anbbtriynochhmrtsmjifvatlfsmwiimvxbmyoavcmfiioxatckaxcikmwazenjmdleyjwndvggqkazikdeofaqpbuzkupshfhgh
anbflviytfylqlpvvmjaovajllwpoukmvwemgtivvaonkoxagukaxriyuvmypnymtdqyocpdvcgqkazykrihjbipxquzup...

output:

YES
NO
NO
NO
NO
NO
NO
NO
NO
YES
NO
NO
NO
NO
NO
NO
NO
NO
YES
NO
NO
NO
YES
NO
YES
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
YES
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
YES
NO
NO
YES
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
YES
NO
NO
...

result:

wrong answer 2nd lines differ - expected: 'YES', found: 'NO'