QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #360247 | #3996. Race | sanbi52 | WA | 0ms | 3664kb | C++17 | 2.0kb | 2024-03-21 15:56:53 | 2024-03-21 15:56:54 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
struct Basic{
vector<int> b;
void insert(int x){
for(auto i : b){
x = min(x, x ^ i);
}
for(auto &i : b){
i = i ^ x;
}
if(x)b.push_back(x);
}
bool query(int x){
for(auto i : b){
x = min(x, i ^ x);
}
return !x;
}
};
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n, m, k, q;
cin >> n >> m >> k >> q;
vector<vector<pair<int, int>>> adj(n);
for(int i = 0; i < m; i++){
int u, v, w;
cin >> u >> v >> w;
u--, v--, w--;
adj[u].push_back({v, 1 << w});
adj[v].push_back({u, 1 << w});
}
vector<Basic> W(n + 1);
vector<int> Xor(n);
vector<int> State(n + 1);
vector<int> dep(n);
int id = 0;
vector<int> vis(n);
auto dfs = [&](auto self, int u, int fa) -> void{
vis[u] = id;
for(auto [i, w] : adj[u]){
State[id] |= w;
if(i == fa)continue;
if(!vis[i]){
dep[i] = dep[u] + 1;
Xor[i] = Xor[u] ^ w;
self(self, i, u);
}
else if(dep[i] >= dep[u]){
W[id].insert(Xor[u] ^ Xor[i] ^ w);
}
}
};
for(int i = 0; i < n; i++){
if(!vis[i]){
id++;
dfs(dfs, i, -1);
}
}
for(int i = 0; i < q; i++){
int S, T;
cin >> S >> T;
S--, T--;
if(S == T){
cout << "Yes\n";
continue;
}
if(vis[S] != vis[T]){
cout << "No\n";
continue;
}
if(State[vis[S]] != (1 << k) - 1){
cout << "No\n";
continue;
}
int val = Xor[S] ^ Xor[T];
cout << (W[vis[S]].query(val) || W[vis[S]].query((1 << k) - 1 - val) ? "Yes\n" : "No\n");
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3592kb
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: 0ms
memory: 3648kb
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: 0
Accepted
time: 0ms
memory: 3660kb
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:
ok 999 token(s): yes count is 119, no count is 880
Test #4:
score: -100
Wrong Answer
time: 0ms
memory: 3664kb
input:
38 37 6 1000 6 17 6 9 20 2 19 9 5 21 31 4 36 30 3 17 22 3 32 17 6 17 28 5 25 32 2 11 18 5 26 23 1 36 19 6 1 22 1 11 2 2 10 14 6 12 21 4 19 5 1 8 23 1 17 31 3 12 36 6 5 28 2 25 4 3 9 36 4 13 30 5 11 13 3 24 21 1 19 3 6 28 23 3 38 1 4 19 23 4 10 20 4 16 35 6 7 12 1 10 25 6 9 13 4 23 22 2 35 16 2 30 37...
output:
No No No Yes No No No No No No Yes No No No No No No No No No No Yes No No No No No Yes Yes No No No No No No No No No Yes Yes No No Yes Yes Yes No No Yes Yes No Yes Yes Yes No Yes Yes No No Yes No No No No No No Yes Yes Yes No Yes Yes Yes No Yes No No No No No Yes No No No No Yes No No No No No No ...
result:
wrong answer expected YES, found NO [2nd token]