#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define fi first
#define se second
#define mp make_pair
#define fastIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
const int N = (int)1e5 + 10;
const int LOG = 31;
ll vl[N];
vector<pii> T[N];
ll xr[N];
bool vis[N];
int dep[N];
vector<pii> xar;
int xorval;
void dfs(int u, int pp){
vis[u]=true;
for(auto x : T[u]){
if(vis[x.fi]){
if(dep[u] - dep[x.fi] >= 2){
xorval = (xr[u]^xr[x.fi]^vl[x.se]);
if(xorval != 0)
xar.push_back(mp(x.se, xorval));
}
}
else{
dep[x.fi] = dep[u]+1;
xr[x.fi] = xr[u]^vl[x.se];
dfs(x.fi, u);
}
}
}
int main(){
fastIO;
//freopen("in.txt", "r", stdin);
int n, m;
cin >> n >> m;
int u, v;
for(int i = 1; i <= m ; i ++ ){
cin >> u >> v >> vl[i];
T[u].push_back(mp(v,i));
T[v].push_back(mp(u,i));
}
for(int i = 1; i <= n; i ++ ){
if(!vis[i]){
dfs(i,-1);
}
}
if(xar.empty()){
cout << 0 << "\n";
return 0;
}
cout << 1 << "\n";
cout << xar[0].se << " " << xar.size() << " ";
for(auto x : xar)
cout << x.fi << " ";
cout << "\n";
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
30 ms |
6764 KB |
Output is correct |
2 |
Correct |
38 ms |
7148 KB |
Output is correct |
3 |
Correct |
8 ms |
3564 KB |
Output is correct |
4 |
Correct |
8 ms |
3820 KB |
Output is correct |
5 |
Correct |
89 ms |
12284 KB |
Output is correct |
6 |
Correct |
80 ms |
10988 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
14 ms |
4460 KB |
Output is correct |
2 |
Correct |
14 ms |
4408 KB |
Output is correct |
3 |
Correct |
18 ms |
5376 KB |
Output is correct |
4 |
Correct |
22 ms |
5880 KB |
Output is correct |
5 |
Correct |
76 ms |
10348 KB |
Output is correct |
6 |
Correct |
46 ms |
7404 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
42 ms |
7020 KB |
There is a simple cycle which is not good |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
76 ms |
10220 KB |
There is a simple cycle which is not good |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
45 ms |
8428 KB |
There is a simple cycle which is not good |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
57 ms |
8420 KB |
There is a simple cycle which is not good |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
75 ms |
9728 KB |
There is a simple cycle which is not good |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
93 ms |
11240 KB |
There is a simple cycle which is not good |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
21 ms |
4972 KB |
There is a simple cycle which is not good |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
83 ms |
10348 KB |
There is a simple cycle which is not good |
2 |
Halted |
0 ms |
0 KB |
- |