oj.uz

답안 #712267

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
712267 2023-03-18T13:40:18 Z study 시간이 돈 (balkan11_timeismoney) C++17
0 / 100
 6 ms 852 KB 
#include <bits/stdc++.h>
using namespace std;

const int N = 201;

int comp[N],siz[N];
int sum=0;
vector<pair<int,int>> ans;

int getComp(int node){
	if (comp[node] != node) comp[node] = getComp(comp[node]);
	return comp[node];
}

void merge(int a, int b, int cost){
	a = getComp(a);
	b = getComp(b);
	if (a != b){
		if (siz[a] < siz[b]) swap(a,b);
		ans.emplace_back(a,b);
		siz[a] += siz[b];
		comp[b] = a;
		sum += cost;
	}
}

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	int n,m;
	cin >> n >> m;
	vector<tuple<int,int,int,int>> v;
	for (int i=0; i<m; ++i){
		int x,y,t,c;
		cin >> x >> y >> t >> c;
		v.emplace_back(t,c,x,y);
	}
	for (int i=0; i<n; ++i){
		siz[i] = 1;
		comp[i] = i;
	}
	sort(v.begin(),v.end());
	for (auto [t,c,x,y]:v){
		merge(x,y,c);
	}
	cout << sum << ' ' << sum << '\n';
	for (auto i:ans) cout << i.first << ' ' << i.second << '\n';
	return 0;
}

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Incorrect 1 ms 212 KB Output isn't correct
4 Incorrect 1 ms 212 KB Output isn't correct
5 Incorrect 1 ms 340 KB Output isn't correct
6 Incorrect 1 ms 340 KB Output isn't correct
7 Incorrect 2 ms 340 KB Output isn't correct
8 Incorrect 5 ms 852 KB Output isn't correct
9 Incorrect 1 ms 212 KB Output isn't correct
10 Incorrect 1 ms 212 KB Output isn't correct
11 Incorrect 1 ms 212 KB Output isn't correct
12 Incorrect 0 ms 212 KB Output isn't correct
13 Incorrect 1 ms 212 KB Output isn't correct
14 Incorrect 1 ms 332 KB Output isn't correct
15 Incorrect 1 ms 340 KB Output isn't correct
16 Incorrect 1 ms 468 KB Output isn't correct
17 Incorrect 1 ms 340 KB Output isn't correct
18 Incorrect 1 ms 340 KB Output isn't correct
19 Incorrect 6 ms 852 KB Output isn't correct
20 Incorrect 5 ms 848 KB Output isn't correct