oj.uz

답안 #77053

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
77053 2018-09-20T12:49:37 Z tmwilliamlin168 시간이 돈 (balkan11_timeismoney) C++14
100 / 100
 369 ms 1672 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long

const int mxN=200;
int n, m, a[mxN][mxN], b[mxN][mxN], e[mxN];
array<ll, 2> a1={INT_MAX, INT_MAX}, r1;
vector<array<int, 2>> a2, r2;

array<ll, 2> prim(ll x, ll y) {
	r1={};
	r2={};
	memset(e, 0, 4*n);
	e[0]=-1;
	for(int it=0; it<n-1; ++it) {
		int mi=-1;
		for(int i=0; i<n; ++i)
			if(e[i]!=-1&&(mi==-1||x*a[i][e[i]]+y*b[i][e[i]]<x*a[mi][e[mi]]+y*b[mi][e[mi]]))
				mi=i;
		r1[0]+=a[mi][e[mi]];
		r1[1]+=b[mi][e[mi]];
		r2.push_back({mi, e[mi]});
		e[mi]=-1;
		for(int i=0; i<n; ++i)
			if(e[i]!=-1&&x*a[i][mi]+y*b[i][mi]<x*a[i][e[i]]+y*b[i][e[i]])
				e[i]=mi;
	}
	if(r1[0]*r1[1]<a1[0]*a1[1]) {
		a1=r1;
		a2=r2;
	}
//	cout << r1[0] << " " << r1[1] << endl;
	return r1;
}

void c(array<ll, 2> p1, array<ll, 2> p2) {
//	cout << p1[0] << " " << p1[1] << " " << p2[0] << " " << p2[1] << endl;
	array<ll, 2> p3=prim(p1[1]-p2[1], p2[0]-p1[0]);
	if((p2[0]-p1[0])*(p3[1]-p1[1])!=(p3[0]-p1[0])*(p2[1]-p1[1])) {
		c(p1, p3);
		c(p3, p2);
	}
}

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n >> m;
	memset(a, 1, sizeof(a));
	memset(b, 1, sizeof(b));
	while(m--) {
		int u, v;
		cin >> u >> v;
		cin >> a[u][v] >> b[u][v], a[v][u]=a[u][v], b[v][u]=b[u][v];
	}
//	for(int i=0; i<n; ++i) {
//		for(int j=0; j<n; ++j)
//			cout << a[i][j] << " ";
//		cout << "\n";
//	}
	array<ll, 2> p1=prim(1, 0), p2=prim(0, 1);
	if(p1!=p2)
		c(p1, p2);
	cout << a1[0] << " " << a1[1] << "\n";
	for(array<int, 2> ai : a2)
		cout << ai[0] << " " << ai[1] << "\n";
}

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 632 KB Output is correct
2 Correct 2 ms 760 KB Output is correct
3 Correct 2 ms 760 KB Output is correct
4 Correct 2 ms 896 KB Output is correct
5 Correct 3 ms 968 KB Output is correct
6 Correct 3 ms 968 KB Output is correct
7 Correct 4 ms 980 KB Output is correct
8 Correct 7 ms 1280 KB Output is correct
9 Correct 2 ms 1280 KB Output is correct
10 Correct 2 ms 1352 KB Output is correct
11 Correct 2 ms 1352 KB Output is correct
12 Correct 3 ms 1352 KB Output is correct
13 Correct 3 ms 1352 KB Output is correct
14 Correct 19 ms 1352 KB Output is correct
15 Correct 59 ms 1352 KB Output is correct
16 Correct 227 ms 1352 KB Output is correct
17 Correct 236 ms 1352 KB Output is correct
18 Correct 231 ms 1360 KB Output is correct
19 Correct 350 ms 1672 KB Output is correct
20 Correct 369 ms 1672 KB Output is correct