QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#752179	#5307. Subgraph Isomorphism	einekleine18	WA	75ms	3856kb	C++20	896b	2024-11-15 22:33:54	2024-11-15 22:33:55

Judging History

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

[2024-11-15 22:33:55]
评测

测评结果：WA
用时：75ms
内存：3856kb

查看

[2024-11-15 22:33:54]
提交

answer

#include<bits/stdc++.h>
#include <vector>

#define int long long
void slove(){
    int n,m;
    std::cin>>n>>m;
    std::vector g(n,std::set<int>());
    for(int i=0;i<m;++i){
        int a,b;
        std::cin>>a>>b;
        --a,--b;
        g[a].insert(b);
        g[b].insert(a);
    }
    m=0;
    for(int i=0;i<n;++i){
        m+=g[i].size();
    }
    m/=2;
    int f=0;
    if(m==n-1){
        f=1;
    }else if(m==n){
        f=1;
        for(int i=0;i<n;++i){
            if((int)g[i].size()!=2){
                f=0;
            }
        }
    }
    std::cout<<(f?"YES\n":"NO\n");
}
signed main(){
#ifdef LOCAL
    std::freopen("in.txt","r",stdin);
    std::freopen("out.txt","w",stdout);
#endif
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int _=1;
    std::cin>>_;
    for(int i=0;i<_;++i){
        slove();
    }
}

Source code, Language: C++20

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3612kb

input:

output:

YES
YES
NO
YES

result:

ok 4 token(s): yes count is 3, no count is 1

Test #2:

score: -100

Wrong Answer

time: 75ms

memory: 3856kb

input:

output:

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

result:

wrong answer expected YES, found NO [39th token]