QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#768472	#9726. AUS	TauLee01^#	WA	1ms	3780kb	C++23	1.5kb	2024-11-21 11:02:44	2024-11-21 11:02:44

Judging History

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

[2024-11-21 11:02:44]
评测

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

查看

[2024-11-21 11:02:44]
提交

answer

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define inf 0x3f3f3f3f3f3f3f3f

const int maxn = 1e5 + 10;
const int mod = 1e9 + 7;
int fa[maxn];
int find(int x)
{
    return (x == fa[x]) ? fa[x] : (fa[x] = find(fa[x]));
}
void merge(int x, int y)
{
    x = find(x), y = find(y);
    fa[x] = y;
    return;
}
void solve()
{
    string s1, s2, s3;
    cin >> s1 >> s2 >> s3;
    map<int, int> mp;
    if (s1.size() != s2.size())
    {
        cout << "NO" << endl;
        return;
    }
    if (s1.size() != s3.size())
    {
        cout << "YES" << endl;
        return;
    }
    int n = s1.size();
    for (int i = 1; i <= 26; i++)
    {
        fa[i] = i;
    }
    int cnt = 0;
    for (int i = 0; i < n; i++)
    {
        int tp1 = s1[i] - 'a', tp2 = s2[i] - 'a', tp3 = s3[i] - 'a';
        merge(tp1, tp2);
    }
    // cout << s1[1] << " " << s2[1] << " " << s3[1] << "\n";
    // cout << cnt << endl;
    // if (cnt > 26)
    // {
    //     cout << "NO" << endl;
    //     return;
    // }
    for (int i = 0; i < n; i++)
    {
        int tp1 = s1[i] - 'a', tp2 = s2[i] - 'a', tp3 = s3[i] - 'a';
        tp1 = find(tp1);
        tp2 = find(tp2);
        tp3 = find(tp3);
        if (tp1 != tp3)
        {
            cout << "YES" << endl;
            return;
        }
    }
    cout << "NO" << endl;
}
signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    cin >> t;
    while (t--)
        solve();
    return 0;
}

源文件, 语言: C++23

详细

Test #1:

score: 100

Accepted

time: 0ms

memory: 3508kb

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: 3780kb

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: 3744kb

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
NO
YES
NO
YES
NO
NO
YES
NO
NO
NO
NO
NO
NO
...

result:

wrong answer 78th lines differ - expected: 'YES', found: 'NO'