oj.uz

Submission #1013177

# Submission time Handle Problem Language Result Execution time Memory
1013177 2024-07-03T09:12:28 Z vjudge1 timeismoney (balkan11_timeismoney) C++11
45 / 100
 3 ms 856 KB 
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define pll pair<long long,long long>
#define f first
#define s second
using namespace std;
int mod = 1e9+7;
ll inf = 1e18+5;
int n,m,size[205],link[205],reza1,reza2;
vector<pair<pii,pii>> putovi;
vector<pii> reza;
int find(int a){
	if(link[a]==a)return a;
	return link[a] = find(link[a]);
}

bool same(int a,int b){
	return (find(a)==find(b));
}


int main(){
	ios::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	for(int i = 0; i<205; i++){size[i]=1; link[i]=i;}	
	cin>>n>>m;
	for(int i = 0; i<m; i++){
		int a,b,c,d;
		cin>>a>>b>>c>>d;
		putovi.push_back({{c,d},{a,b}});
	}
	sort(putovi.begin(),putovi.end());
	for(auto z : putovi){
		int a = z.s.f;
		int b = z.s.s;
		if(same(a,b))continue;
		a = find(a);
		b = find(b);
		if(size[a]>size[b])swap(a,b);
		//size od a je manji od size od b
		size[b]+=size[a];
		link[b]=a;
		reza1+=z.f.f;
		reza2+=z.f.s;
		reza.push_back({z.s.f,z.s.s});
	}
	cout<<reza1<<" "<<reza2<<endl;
	for(auto z : reza)cout<<z.f<<" "<<z.s<<endl;
return 0;
}

Subtask #1
45.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 3 ms 856 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Incorrect 0 ms 348 KB Output isn't correct
11 Incorrect 0 ms 344 KB Output isn't correct
12 Incorrect 0 ms 348 KB Output isn't correct
13 Incorrect 0 ms 348 KB Output isn't correct
14 Incorrect 1 ms 348 KB Output isn't correct
15 Incorrect 1 ms 348 KB Output isn't correct
16 Incorrect 1 ms 348 KB Output isn't correct
17 Incorrect 1 ms 348 KB Output isn't correct
18 Incorrect 1 ms 348 KB Output isn't correct
19 Incorrect 3 ms 736 KB Output isn't correct
20 Incorrect 3 ms 736 KB Output isn't correct