QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#63906 | #3996. Race | ltunjic | WA | 3ms | 17068kb | C++14 | 1.7kb | 2022-11-23 16:48:08 | 2022-11-23 16:48:12 |
Judging History
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 N = 2e5 + 10;
const int LOG = 30;
int n, m, q, k, dep[N], xr[N], base[N], comp[N];
int ans[N];
pii task[N];
vector<pii> g[N];
vector<int> space, t[N];
bool add(int x, bool flag){
while(x && base[__lg(x)] != -1){
x ^= space[base[__lg(x)]];
}
if(flag && x){
base[__lg(x)] = space.size();
space.pb(x);
}
return x == 0;
}
void dfs(int u, int c){
comp[u] = c;
for(pii e : g[u]){
int v = e.X, val = e.Y;
if(comp[v]){
continue;
}
dep[v] = dep[u] + 1;
xr[v] = xr[u] ^ (1 << val);
dfs(v, c);
}
}
void solve(int u){
for(pii e : g[u]){
int v = e.X, val = e.Y;
if(dep[v] <= dep[u]){
bool res = add(xr[u] ^ xr[v] ^ (1 << val), true);
continue;
} else if(dep[v] == dep[u] + 1)
solve(v);
}
}
int main(){
memset(base, -1, sizeof(base));
scanf("%d%d%d%d", &n, &m, &k, &q);
for(int i = 0; i < m; i++){
int u, v, val;
scanf("%d%d%d", &u, &v, &val);
g[u].pb({v, val - 1});
g[v].pb({u, val - 1});
}
for(int i = 1; i <= n; i++){
if(comp[i]) continue;
dfs(i, i);
}
for(int i = 0; i < q; i++){
int u, v;
scanf("%d%d", &u, &v);
task[i] = {u, v};
if(comp[u] == comp[v]){
t[comp[u]].pb(i);
}
}
for(int i = 1; i <= n; i++){
if(t[i].empty()) continue;
memset(base, -1, sizeof(base));
solve(i);
for(int ind : t[i]){
int u = task[ind].X;
int v = task[ind].Y;
int val = xr[u] ^ xr[v];
if(add(val, false) || add(((1 << k) - 1) ^ val, false)) ans[ind] = true;
}
}
for(int i = 0; i < q; i++){
printf(ans[i] ? "Yes\n" : "No\n");
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 3ms
memory: 17068kb
input:
7 9 3 4 1 2 1 2 3 1 3 1 2 1 4 3 5 6 2 6 7 1 6 7 3 7 7 2 5 5 1 6 7 1 4 2 4 2 5
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: 15616kb
input:
9 10 3 5 7 2 2 4 2 1 7 1 1 2 8 1 1 7 2 2 7 3 2 8 1 7 2 1 7 5 1 8 1 2 6 4 6 7 8 4 5 1 8 6
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: 3ms
memory: 16772kb
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]