oj.uz

Submission #223935

# Submission time Handle Problem Language Result Execution time Memory
223935 2020-04-16T21:43:33 Z super_j6 timeismoney (balkan11_timeismoney) C++14
45 / 100
 2000 ms 62812 KB 
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
#define endl '\n'
#define ll long long
#define pi pair<ll, int>
#define f first
#define s second

const int maxn = 200, maxm = 10000;
int n, m;
int it[maxm], u[maxm], v[maxm], a[maxm], b[maxm];
int par[maxn], rnk[maxn];
vector<pi> ans;

int find(int x){
	return x == par[x] ? x : par[x] = find(par[x]);
}

pi mst(ll x, ll y, bool t = 0){
	for(int i = 0; i < n; i++) par[i] = i, rnk[i] = 0;
	sort(it, it + m, [&](int i, int j){
		return a[i] * x + b[i] * y < a[j] * x + b[j] * y;
	});

	pi ret = {0, 0};
	for(int i = 0; i < m; i++){
		int j = it[i];
		int w = find(u[j]), z = find(v[j]);
		if(w != z){
			ret.f += a[j], ret.s += b[j];
			if(t) ans.push_back({u[j], v[j]});
			if(rnk[w] < rnk[z]) swap(w, z);
			rnk[w] += rnk[w] == rnk[z];
			par[z] = w;
		}
	}
	
	return ret;
}

bool operator<(pi x, pi y){
	return x.f * x.s < y.f * y.s;
}

pi solve(pi l, pi r){
	pi p = mst(r.s - l.s, l.f - r.f);
	if((p.f - l.f) * (r.s - l.s) == (p.s - l.s) * (r.f - l.f)) return min(l, r);
	return min(solve(l, p), solve(p, r));
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	
	cin >> n >> m;
	
	for(int i = 0; i < m; i++){
		cin >> u[i] >> v[i] >> a[i] >> b[i];
		it[i] = i;
	}
	
	pi ret = solve(mst(0, 1), mst(1, 0));
	if(ret != mst(ret.s, ret.f, 1)) while(1) cout << 1 << endl;
	
	cout << ret.f << " " << ret.s << endl;
	for(pi i : ans) cout << i.f << " " << i.s << endl;
	
	return 0;
}

Subtask #1
45.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 6 ms 384 KB Output is correct
8 Correct 10 ms 640 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Incorrect 4 ms 384 KB Output isn't correct
11 Execution timed out 2071 ms 60500 KB Time limit exceeded
12 Execution timed out 2084 ms 62052 KB Time limit exceeded
13 Execution timed out 2082 ms 62548 KB Time limit exceeded
14 Execution timed out 2093 ms 62812 KB Time limit exceeded
15 Execution timed out 2088 ms 58104 KB Time limit exceeded
16 Execution timed out 2079 ms 60312 KB Time limit exceeded
17 Execution timed out 2085 ms 59960 KB Time limit exceeded
18 Execution timed out 2077 ms 60228 KB Time limit exceeded
19 Execution timed out 2083 ms 44040 KB Time limit exceeded
20 Execution timed out 2076 ms 42384 KB Time limit exceeded