oj.uz

Submission #712447

# Submission time Handle Problem Language Result Execution time Memory
712447 2023-03-18T19:32:10 Z study timeismoney (balkan11_timeismoney) C++17
40 / 100
 181 ms 468 KB 
#include <bits/stdc++.h>
#define int long long
using namespace std;

const int N = 201, nbIter = 10000,inf = sqrt(LLONG_MAX/2);

int comp[N],siz[N],t[N],c[N],x[N],y[N];
int fin1=inf,fin2=inf;
vector<pair<int,int>> res;

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

bool merge(int a, int b){
	a = getComp(a);
	b = getComp(b);
	if (a != b){
		if (siz[a] < siz[b]) swap(a,b);
		siz[a] += siz[b];
		comp[b] = a;
		return true;
	}
	return false;
}

int32_t main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	int n,m;
	cin >> n >> m;
	for (int i=0; i<m; ++i){
		cin >> x[i] >> y[i] >> t[i] >> c[i];
	}
	for (int nb=0; nb<=nbIter; ++nb){
		vector<pair<int,int>> v,ans;
		for (int i=0; i<m; ++i){
			v.emplace_back(t[i]*(nbIter-nb)+c[i]*nb,i);
			if (i < n){
				comp[i] = i;
				siz[i] = 1;
			}
		}
		sort(v.begin(),v.end());
		int sum1 = 0, sum2 = 0;
		for (auto [comp,id]:v){
			if (merge(x[id],y[id])){
				sum1 += t[id];
				sum2 += c[id];
				ans.emplace_back(x[id],y[id]);
			}
		}
		if (sum1*sum2 < fin1*fin2){
			res = ans;
			fin1 = sum1;
			fin2 = sum2;
		} 
	}
	cout << fin1 << ' ' << fin2 << '\n';
	for (auto i:res) cout << i.first << ' ' << i.second << '\n';
	return 0;
}

Subtask #1
40.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 72 ms 340 KB Output isn't correct
2 Correct 7 ms 212 KB Output is correct
3 Correct 11 ms 328 KB Output is correct
4 Correct 30 ms 308 KB Output is correct
5 Incorrect 181 ms 340 KB Output isn't correct
6 Incorrect 127 ms 340 KB Output isn't correct
7 Runtime error 1 ms 468 KB Execution killed with signal 11
8 Runtime error 1 ms 468 KB Execution killed with signal 11
9 Correct 6 ms 328 KB Output is correct
10 Correct 16 ms 332 KB Output is correct
11 Correct 10 ms 332 KB Output is correct
12 Correct 31 ms 212 KB Output is correct
13 Correct 24 ms 328 KB Output is correct
14 Incorrect 160 ms 340 KB Output isn't correct
15 Incorrect 136 ms 460 KB Output isn't correct
16 Runtime error 1 ms 468 KB Execution killed with signal 11
17 Runtime error 1 ms 468 KB Execution killed with signal 11
18 Runtime error 1 ms 468 KB Execution killed with signal 11
19 Runtime error 2 ms 468 KB Execution killed with signal 11
20 Runtime error 2 ms 468 KB Execution killed with signal 11