QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#107047	#5307. Subgraph Isomorphism	SmallBlack	WA	7ms	6328kb	C++14	2.3kb	2023-05-20 09:46:29	2023-10-15 17:25:20

Judging History

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

[2023-10-15 17:25:20]
管理员手动重测本题所有提交记录

测评结果：WA
用时：7ms
内存：6328kb

查看

[2023-08-10 23:21:45]
System Update: QOJ starts to keep a history of the judgings of all the submissions.

[2023-05-20 09:46:33]
评测

测评结果：0
用时：13ms
内存：5844kb

查看

[2023-05-20 09:46:29]
提交

answer

// Problem: D - Subgraph Isomorphism
// Contest: Virtual Judge - 过什么520做题要紧
// URL: https://vjudge.net/contest/559671#problem/D
// Memory Limit: 1024 MB
// Time Limit: 3000 ms
// Date:2023-05-20 07:53:15
// By:SmallBlack
// 
// Powered by CP Editor (https://cpeditor.org)

#include<bits/stdc++.h>
using namespace std;
inline long long read()
{
	long long s=0,k=1;
	char c=getchar();
	while(!isdigit(c))
	{
		k=(c=='-')?-1:1;
		c=getchar();
	}
	while(isdigit(c))
	{
		s=s*10+c-'0';
		c=getchar();
	}
	return s*k;
}
#define d read()
#define ll long long
#define ull unsigned long long
#define Maxn 10010
#define Size 100010
#define mp make_pair
#define pb push_back
#define fi first
#define se second
vector<ll>e[Size];
vector<ll>st,loop,LP;
bool ins[Size],fin=0;
void dfs(ll u,ll fa)
{
	ins[u]=1,st.pb(u);
	for(auto v:e[u])
	{
		if(v==fa) continue;
		if(ins[v])
		{
			while(st.back()!=v)
			{
				loop.pb(st.back());
				st.pop_back();
			}
			loop.pb(v);
			fin=1;
			return;
		}
		dfs(v,u);
		if(fin) return;
	}
	st.pop_back(),ins[u]=0;
}
ull mask;
ull shift(ull x)
{
	x=x^mask^((x^mask)<<13),x^=x>>7,x^=x<<17;
	return x^mask;
}
ull tag[Size];
void Hash(ll u,ll fa)
{
	tag[u]=1;
	for(auto v:e[u])
	{
		if(v==fa||ins[v]) continue;
		Hash(v,u);
		tag[u]+=shift(tag[v]);
	}
}
ll t;
void solve()
{
	mask=std::chrono::steady_clock::now().time_since_epoch().count()*(t+1);
	ll n=d,m=d;
	for(int i=1;i<=n;i++) e[i].clear(),ins[i]=0,tag[i]=0;
	for(int i=0;i<m;i++)
	{
		ll x=d,y=d;
		e[x].pb(y),e[y].pb(x);
	}
	if(m==n-1) return (void)puts("YES");
	else if(m>n) return (void)puts("NO");
	fin=0,st.clear(),loop.clear(),dfs(1,0);
	for(int i=1;i<=n;i++) ins[i]=0;
	for(auto x:loop) ins[x]=1;
	if(loop.size()==n) return (void)puts("YES");
	LP.clear();
	for(int i=0;i<loop.size();i++)
		if(e[loop[i]].size()>2) Hash(loop[i],0),LP.pb(i);
	// if(LP.size()<2) return (void)puts("NO");
	// if(LP[1]-LP[0]>2) return (void)puts("NO");
	if(LP[0]+loop.size()-LP[LP.size()-1]!=LP[1]-LP[0])
		return (void)puts("NO");
	for(int i=2;i<LP.size();i++)
		if(LP[i]-LP[i-1]!=LP[1]-LP[0])
			return (void)puts("NO");
	for(int i=1;i<LP.size();i++)
		if(tag[loop[LP[i]]]!=tag[loop[LP[0]]])
			return (void)puts("NO");
	puts("YES");
}
int main()
{
	t=d;
	while(t--) solve();
}

源文件, 语言: C++14

詳細信息

Test #1:

score: 100

Accepted

time: 1ms

memory: 6280kb

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

memory: 6328kb

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

result:

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