QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#61822	#3996. Race	ltunjic^#	WA	7ms	17184kb	C++14	1.7kb	2022-11-15 03:33:00	2022-11-15 03:33:00

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-11-15 03:33:00]
Judged

Verdict: WA
Time: 7ms
Memory: 17184kb

Show

[2022-11-15 03:33:00]
Submitted

answer

#include <bits/stdc++.h> 

#define X first
#define Y second
#define pb push_back 

using namespace std;

typedef pair<int, int> pii;

const int LOG = 31;
const int N = 2e5 + 10;

int n, m, q, k, comp[N], base[LOG], mask[N];
int xr[N], bio[N], bioe[N], rep[N], ans[N];

vector<int> space;
vector<pii> g[N];
vector<pair<int, pii>> qs[N];

int add(int x, bool flag){
	while(x && base[__lg(x)] != -1){
		x ^= space[base[__lg(x)]];
	}
	if(!flag){
	//	printf("x = %d\n", x);
		if(x) base[__lg(x)] = space.size();
		space.pb(x);
	}
	return x;
}

void dfs(int u){
	bio[u] = true;
	for(pii e : g[u]){
		int v = e.X, c = mask[e.Y];
		if(bio[v]){
			if(!bioe[e.Y]){
				bioe[e.Y] = true;
				add(xr[u] ^ xr[v] ^ c, 0);
			}
			continue;				
		}
		bioe[e.Y] = true; 
		xr[v] = xr[u] ^ c;
		//printf("xr[%d] = %d\n", v, xr[v]);
		dfs(v);
	}
}

void rec(int u, int c){
	bio[u] = true;
	comp[u] = c;
	for(pii e : g[u]){
		if(!bio[e.X]) rec(e.X, c);
	}
}

int ne(int x){
	for(int i = 0; i < k; i++){
		x ^= 1 << i;
	}
	return x;
}

int main(){
	scanf("%d%d%d%d", &n, &m, &k, &q);
	for(int i = 0; i < m; i++){
		int u, v, c;
		scanf("%d%d%d", &u, &v, &c);
		mask[i] = 1 << (c - 1);
		g[u].pb({v, i});
		g[v].pb({u, i});
	}
	int cnt = 0;
	for(int i = 1; i <= n; i++){
		if(!bio[i]){
			rec(i, cnt);
			rep[cnt] = i;
			cnt++;
		}
	}
	memset(bio, 0, sizeof(bio));
	for(int i = 0; i < q; i++){
		int s, t;
		scanf("%d%d", &s, &t);
		if(comp[s] == comp[t]) qs[comp[s]].pb({i, {s, t}});
	}
	for(int i = 0; i < cnt; i++){
		memset(base, -1, sizeof(base));
		space.clear();
		dfs(rep[i]);
		for(pair<int, pii> p : qs[i]) ans[p.X] = min(add(xr[p.Y.X] ^ xr[p.Y.Y], 1), add(ne(xr[p.Y.X] ^ xr[p.Y.Y]), 1)) == 0;
	}
	for(int i = 0; i < q; i++){
		if(ans[i] == 0) printf("No\n");
		else printf("Yes\n");
	}
	return 0;
}

源文件, 语言: C++14

詳細信息

Test #1:

score: 100

Accepted

time: 7ms

memory: 16240kb

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

memory: 16976kb

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: 17184kb

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

result:

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