oj.uz

답안 #457974

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
457974 2021-08-07T16:33:01 Z Plurm 시간이 돈 (balkan11_timeismoney) C++11
60 / 100
 2000 ms 18496 KB 
#include <bits/stdc++.h>
using namespace std;

function<bool(tuple<int,int,int,int>,tuple<int,int,int,int>)> get_comp(int a, int b){
	return [a, b](tuple<int,int,int,int> x, tuple<int,int,int,int> y){
		return a*get<2>(x) + b*get<3>(x) < a*get<2>(y) + b*get<3>(y);
	};
}

int n, m;
vector<tuple<int,int,int,int> > edges;

class DSU{
	private:
		int p[256];
	public:
		DSU(){
			memset(p, -1, sizeof(p));
		}
		int f(int u){
			if(p[u] == -1) return u;
			else return p[u] = f(p[u]);
		}
		bool u(int x, int y){
			x = f(x); y = f(y);
			if(x == y) return false;
			p[x] = y;
			return true;
		}
};

tuple<int,int,int> compute_value(int a, int b){
	// Careful! This function takes O(M log M + N)
	sort(edges.begin(), edges.end(), get_comp(a,b));
	DSU d;
	int st = 0, sc = 0;
	for(auto e : edges){
		int x, y, t, c; tie(x, y, t, c) = e;
		if(d.u(x, y)){
			st += t;
			sc += c;
		}
	}
	return make_tuple(st * sc, a, b);
}

tuple<int,int,int> track_min(tuple<int,int,int> x, tuple<int,int,int> y){
	if(get<0>(x) > get<0>(y)) return y;
	else return x;
}

tuple<int,int,int> search(int a1, int b1, int a2, int b2){
	auto lv = compute_value(a1, b1);
	auto rv = compute_value(a2, b2);
	int am = a1 + a2;
	int bm = b1 + b2;
	auto mv = compute_value(am, bm);
	auto ret = track_min(lv, track_min(rv, mv));
	if(get<0>(lv) != get<0>(mv)) ret = track_min(ret, search(a1, b1, am, bm));
	if(get<0>(mv) != get<0>(rv)) ret = track_min(ret, search(am, bm, a2, b2));
	return ret;
}

int main(){
	scanf("%d%d",&n,&m);
	int x, y, t, c;
	for(int i = 0; i < m; i++){
		scanf("%d%d%d%d",&x,&y,&t,&c);
		edges.emplace_back(x,y,t,c);
	}
	auto ans = search(1, 0, 0, 1);
	sort(edges.begin(), edges.end(), get_comp(get<1>(ans), get<2>(ans)));
	DSU d;
	int st = 0, sc = 0;
	vector<pair<int,int> > ansvec;
	for(auto e : edges){
		tie(x, y, t, c) = e;
		if(d.u(x, y)){
			st += t;
			sc += c;
			ansvec.emplace_back(x, y);
		}
	}
	printf("%d %d\n", st, sc);
	for(auto p : ansvec){
		printf("%d %d\n", p.first, p.second);
	}
	return 0;
}

Compilation message

timeismoney.cpp: In function 'int main()':
timeismoney.cpp:65:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   65 |  scanf("%d%d",&n,&m);
      |  ~~~~~^~~~~~~~~~~~~~
timeismoney.cpp:68:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   68 |   scanf("%d%d%d%d",&x,&y,&t,&c);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
60.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 288 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 8 ms 716 KB Output is correct
9 Correct 1 ms 296 KB Output is correct
10 Correct 3 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 6 ms 204 KB Output is correct
13 Execution timed out 2064 ms 18496 KB Time limit exceeded
14 Execution timed out 2068 ms 3316 KB Time limit exceeded
15 Execution timed out 2065 ms 4292 KB Time limit exceeded
16 Execution timed out 2073 ms 860 KB Time limit exceeded
17 Execution timed out 2083 ms 852 KB Time limit exceeded
18 Execution timed out 2080 ms 1000 KB Time limit exceeded
19 Execution timed out 2066 ms 912 KB Time limit exceeded
20 Execution timed out 2080 ms 1032 KB Time limit exceeded