oj.uz

Submission #776762

# Submission time Handle Problem Language Result Execution time Memory
776762 2023-07-08T08:43:44 Z vjudge1 Praktični (COCI18_prakticni) C++17
130 / 130
 86 ms 20940 KB 
#include <bits/stdc++.h>
using namespace std;
#define sp " "
#define endl "\n"
#define fileio() freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout)
#define fastio() cin.tie(0), ios_base::sync_with_stdio(0)
#define pb push_back
#define pii pair<int, int>
#define st first
#define nd second
#define N 200005
#define LOGN 30


vector<array<int, 3>> adj[N];
int dist[N], vis[N], mark[N], val[N], base[N];

void dfs(int node, int root, int d){
	dist[node] = d;
	vis[node] = 1;
	for (auto i : adj[node]){
		int curr = i[0], w = i[1], ind = i[2];
		if (curr == root) continue;
		if (vis[curr]){
			mark[ind] = 1;
			val[ind] = w ^ dist[curr] ^ dist[node];
		}
		else{
			dfs(curr, node, d ^ w);
		}
	}
}

int32_t main(){
	#ifndef ONLINE_JUDGE
	//fileio();
	#endif
	fastio();

	int n, m;
	cin>>n>>m;
	for (int i = 1; i <= m; i++){
		int u, v, w;
		cin>>u>>v>>w;
		adj[u].pb({v, w, i});
		adj[v].pb({u, w, i});
	}

	dfs(1, 0, 0);

	for (int i = 1; i <= m; i++){
		if (mark[i]){
			int x = val[i];
			for (int j = LOGN; j >= 0; j--){
				if (x & (1<<j)){
					if (base[j] != 0){
						x ^= base[j];
					}
					else{
						base[j] = x;
						break;
					}
				}
			}
		}
	}

	vector<int> ans[LOGN + 1];

	for (int i = 1; i <= m; i++){
		if (mark[i]){
			int x = val[i];
			for (int j = LOGN; j >= 0; j--){
				if (x & (1<<j)){
					ans[j].pb(i);
					x ^= base[j];
				}
			}
		}
	}

	int res = 0;
	for (int i = LOGN; i >= 0; i--){
		if (ans[i].size()) res++;
	}

	cout<<res<<endl;
	for (int i = LOGN; i >= 0; i--){
		if (ans[i].size()){
			cout<<base[i]<<sp<<ans[i].size()<<sp;
			for (auto j : ans[i])
				cout<<j<<sp;
			cout<<endl;
		}
	}


	cerr<<"time taken : "<<(float)clock() / CLOCKS_PER_SEC<<" seconds\n";
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 9940 KB Output is correct
2 Correct 21 ms 10172 KB Output is correct
3 Correct 9 ms 6100 KB Output is correct
4 Correct 10 ms 6268 KB Output is correct
5 Correct 42 ms 14952 KB Output is correct
6 Correct 37 ms 13952 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 7124 KB Output is correct
2 Correct 11 ms 7380 KB Output is correct
3 Correct 13 ms 8116 KB Output is correct
4 Correct 16 ms 8660 KB Output is correct
5 Correct 38 ms 14260 KB Output is correct
6 Correct 24 ms 10700 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 10840 KB Output is correct
2 Correct 39 ms 12700 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct

Subtask #4
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 13880 KB Output is correct
2 Correct 68 ms 18756 KB Output is correct
3 Correct 3 ms 5204 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 11960 KB Output is correct
2 Correct 36 ms 12744 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 14900 KB Output is correct
2 Correct 28 ms 10068 KB Output is correct

Subtask #7
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 14384 KB Output is correct
2 Correct 58 ms 16872 KB Output is correct
3 Correct 36 ms 12808 KB Output is correct

Subtask #8
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 18460 KB Output is correct
2 Correct 86 ms 20940 KB Output is correct
3 Correct 74 ms 20228 KB Output is correct

Subtask #9
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 7992 KB Output is correct
2 Correct 24 ms 9108 KB Output is correct
3 Correct 50 ms 15136 KB Output is correct

Subtask #10
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 15444 KB Output is correct
2 Correct 28 ms 11084 KB Output is correct
3 Correct 66 ms 19316 KB Output is correct