QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#48599	#3996. Race	13889577060^#	WA	7ms	15448kb	C++	1.7kb	2022-09-14 17:21:57	2022-09-14 17:22:01

Judging History

This is the latest submission verdict.

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

[2022-09-14 17:22:01]
Judged

Verdict: WA
Time: 7ms
Memory: 15448kb

Show

[2022-09-14 17:21:57]
Submitted

answer

#include<cstdio>
#include<vector>
#include<algorithm>
#include<cstdlib>
using namespace std;
int n,m,k,q,num[200002],cnt,th[200002][33],sum[200002],dfn[200002],tot;
bool fl[200002][32],b[200002],flg[2000002];
typedef struct{
	int to,w;
}P;
vector<P>g[200002];
void dfs(int x){
	flg[x]=1;num[x]=cnt;
	for (int i=0;i<g[x].size();i++)
	{
		fl[cnt][g[x][i].w]=1;
		if (!flg[g[x][i].to])dfs(g[x][i].to);
	}
}
void ins(int num,int x){
	for (int i=k-1;i>=0;i--)
	{
		if (!(x&(1<<i)))continue;
		if (!th[num][i]){th[num][i]=x;break;}
		else x^=th[num][i];
	}
}
bool pd0(int num,int x){
	for (int i=k-1;i>=0;i--)
	if (x&(1<<i))
	{
		if (!th[num][i])return false;
		x^=th[num][i];
	}
	return true;
}
bool pd1(int num,int x){
	for (int i=k-1;i>=0;i--)
	if (!(x&(1<<i)))
	{
		if (!th[num][i])return false;
		x^=th[num][i];
	}
	return true;
}
void dfs2(int x,int y){
	dfn[x]=++tot;sum[x]=y;
	for (int i=0;i<g[x].size();i++)
	if (!dfn[g[x][i].to])dfs2(g[x][i].to,y^(1<<g[x][i].w));
	else ins(num[x],sum[x]^sum[g[x][i].to]^(1<<g[x][i].w));
}
int main()
{
	scanf("%d%d%d%d",&n,&m,&k,&q);
	for (int i=1;i<=m;i++)
	{
		int u,v,w;
		scanf("%d%d%d",&u,&v,&w);w--;
		P aa;aa.to=v;aa.w=w;
		g[u].push_back(aa);
		aa.to=u;aa.w=w;
		g[v].push_back(aa);
	}
	for (int i=1;i<=n;i++)
	if (!flg[i])
	{
		cnt++;dfs(i);
	}
	for (int i=1;i<=cnt;i++)
	{
		b[i]=1;
		for (int j=0;j<k;j++)if (!fl[i][j])b[i]=0;
	}
	for (int i=1;i<=n;i++)
	if (!dfn[i])dfs2(i,0);
	while(q--)
	{
		int u,v;
		scanf("%d%d",&u,&v);
		if (num[u]==num[v] && b[num[u]])
		{
			if (pd0(num[u],sum[u]^sum[v]) || pd1(num[u],sum[u]^sum[v]))puts("Yes");else puts("No");
		}
		else puts("No");
	}
	return 0;
}

Source code, Language: C++

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 7ms

memory: 15448kb

input:

output:

Yes
No
Yes
No

result:

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

Test #2:

score: 0

Accepted

time: 2ms

memory: 14372kb

input:

output:

No
No
Yes
Yes
No

result:

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

Test #3:

score: -100

Wrong Answer

time: 2ms

memory: 13604kb

input:

39 30 5 999
12 22 4
11 1 1
28 13 3
35 1 4
7 17 2
20 19 4
28 7 5
15 33 5
31 38 5
13 33 4
13 35 2
16 12 5
13 33 1
21 15 3
23 32 1
19 16 3
3 22 3
11 14 2
31 26 5
32 17 5
34 17 3
31 26 2
10 37 1
1 3 1
30 12 4
1 35 3
6 1 2
25 15 2
39 23 5
10 5 3
24 34
32 27
4 13
37 28
31 36
12 11
24 6
22 32
7 17
1 15
22 ...

output:

No
No
No
No
No
Yes
No
Yes
No
No
No
No
Yes
No
No
No
Yes
No
No
No
No
No
No
No
No
No
No
Yes
No
Yes
No
No
Yes
Yes
No
No
No
Yes
No
No
No
No
No
Yes
No
Yes
Yes
No
No
No
No
No
Yes
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
No
No
No
No
No
No
No
No
No
No
No
No
No
N...

result:

wrong answer expected YES, found NO [32nd token]