QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#326203	#5745. Graph Isomorphism	ushg8877	WA	26ms	3772kb	C++14	557b	2024-02-12 16:35:46	2024-02-12 16:35:47

Judging History

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

[2024-02-12 16:35:47]
评测

测评结果：WA
用时：26ms
内存：3772kb

查看

[2024-02-12 16:35:46]
提交

answer

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define MP make_pair
mt19937 rnd(time(0));
const int MAXN=1e5+5;
int n,m,d[MAXN];
void solve(){
	cin>>n>>m;
	for(int i=1;i<=n;i++) d[i]=0;
	for(int i=1;i<=m;i++){
		int u,v;cin>>u>>v;
		d[u]++;d[v]++;
	}
	if(n<=3) return cout<<"YES"<<endl,void();
	int cnt=0;
	for(int i=1;i<=n;i++) if(d[i]==n-1) cnt++;
	if(cnt==1&&m==n-1||cnt==n) cout<<"YES"<<endl;
	else cout<<"NO"<<endl;
}
int main(){
	ios::sync_with_stdio(false);
	int _;cin>>_;
	while(_--) solve();
	return 0;
}

Source code, Language: C++14

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 1ms

memory: 3772kb

input:

output:

YES
YES
NO

result:

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

Test #2:

score: 0

Accepted

time: 15ms

memory: 3772kb

input:

output:

YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
...

result:

ok 39982 token(s): yes count is 39982, no count is 0

Test #3:

score: -100

Wrong Answer

time: 26ms

memory: 3772kb

input:

output:

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

result:

wrong answer expected YES, found NO [83rd token]