QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#327083#3828. László Babaiwritingdog#AC ✓0ms3640kbC++201.6kb2024-02-14 18:44:152024-02-14 18:44:15

Judging History

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

  • [2024-02-14 18:44:15]
  • 评测
  • 测评结果:AC
  • 用时:0ms
  • 内存:3640kb
  • [2024-02-14 18:44:15]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;

#define int long long
#define endl '\n'
typedef unsigned long long ull;

const int N=1e5;
const int INF=0x3f3f3f3f3f3f3f3f;

int a[4][4],b[4][4];

void solve()
{
    for(int i=1;i<=3;++i)
    {
        for(int j=1;j<=3;++j)
        {
            a[i][j]=b[i][j]=0;
        }
    }
    
    int m;
    cin >> m;
    for(int i=1;i<=m;++i)
    {
        int u,v;
        cin >> u >> v;
        a[u][v]=a[v][u]=1;
    }
    cin >> m;
    for(int i=1;i<=m;++i)
    {
        int u,v;
        cin >> u >> v;
        b[u][v]=b[v][u]=1;
    }
    int f[4];
    for(f[1]=1;f[1]<=3;++f[1])
    {
        for(f[2]=1;f[2]<=3;++f[2])
        {
            for(f[3]=1;f[3]<=3;++f[3])
            {
                if(f[1]==f[2]||f[1]==f[3]||f[2]==f[3])    continue;
                // i,j,k   1,2,3 a -> b
                int ok=1;
                for(int x=1;x<=3;++x)
                {
                    for(int y=1;y<=3;++y)
                    {
                        if(a[x][y]!=b[f[x]][f[y]])
                        {
                            ok=0;
                        }
                    }
                }
                if(ok)
                {
                    cout << "yes\n";
                    return;
                }
                
            }
        }
    }
    cout << "no\n";

}

signed main()
{
    //cout.flags(ios::fixed); cout.precision(8);
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    int T=1;
    cin >> T;
    for(int i=1;i<=T;++i)
    {
        solve();
    }
    return 0;
}
/*

*/

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3640kb

input:

100
1
2 3
2
1 3
1 2
3
1 2
2 3
1 3
3
1 3
1 2
3 2
1
3 2
0
2
1 2
3 2
3
3 2
1 3
2 1
1
3 2
2
3 1
3 2
0
1
3 2
0
0
1
3 2
2
2 3
3 1
0
1
2 3
2
3 2
1 3
2
3 1
3 2
3
1 3
2 1
2 3
3
3 1
2 3
2 1
3
1 2
3 2
3 1
0
2
1 3
2 3
2
2 1
3 2
0
0
2
3 2
1 3
0
2
1 3
1 2
1
1 3
0
0
2
2 3
1 2
3
2 3
3 1
1 2
1
1 2
0
2
1 2
1 3
2
2 3
...

output:

no
yes
no
no
no
no
yes
no
no
yes
yes
no
yes
yes
no
no
yes
no
no
yes
no
no
no
yes
no
yes
yes
yes
no
no
no
no
no
no
yes
no
yes
yes
no
yes
no
yes
no
no
no
no
yes
no
no
yes
no
no
no
no
yes
no
no
yes
no
no
no
no
yes
yes
no
yes
no
no
no
no
yes
yes
no
yes
no
no
no
no
yes
yes
no
no
no
no
no
no
yes
no
no
yes...

result:

ok 100 lines