답안 #65555

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
65555 2018-08-08T01:15:46 Z qkxwsm 시간이 돈 (balkan11_timeismoney) C++17
90 / 100
2000 ms 1212 KB
/*
PROG: source
LANG: C++11
    _____
  .'     '.
 /  0   0  \
|     ^     |
|  \     /  |
 \  '---'  /
  '._____.'
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;

struct chash
{
        int operator()(int x) const
        {
                x ^= (x >> 20) ^ (x >> 12);
                return x ^ (x >> 7) ^ (x >> 4);
        }
        int operator()(long long x) const
        {
                return x ^ (x >> 32);
        }
};

template<typename T> using orderedset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using hashtable = gp_hash_table<T, U, chash>;

template<class T>
void readi(T &x)
{
	T input = 0;
	bool negative = false;
	char c = ' ';
	while (c < '-')
        {
		c = getchar();
	}
	if (c == '-')
	{
		negative = true;
		c = getchar();
	}
	while (c >= '0')
	{
		input = input * 10 + (c - '0');
		c = getchar();
	}
	if (negative)
	{
		input = -input;
	}
	x = input;
}
template<class T>
void printi(T output)
{
	if (output == 0)
	{
		putchar('0');
		return;
	}
	if (output < 0)
	{
		putchar('-');
		output = -output;
	}
	int aout[20];
	int ilen = 0;
	while(output)
	{
		aout[ilen] = ((output % 10));
		output /= 10;
		ilen++;
	}
	for (int i = ilen - 1; i >= 0; i--)
	{
		putchar(aout[i] + '0');
	}
	return;
}
template<class T>
void ckmin(T &a, T b)
{
	a = min(a, b);
}
template<class T>
void ckmax(T &a, T b)
{
	a = max(a, b);
}
template<class T, class U>
T normalize(T x, U mod = 1000000007)
{
	return (((x % mod) + mod) % mod);
}
long long randomizell(long long mod)
{
	return ((1ll << 45) * rand() + (1ll << 30) * rand() + (1ll << 15) * rand() + rand()) % mod;
}
int randomize(int mod)
{
	return ((1ll << 15) * rand() + rand()) % mod;
}

#define y0 ___y0
#define y1 ___y1
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define PF push_front
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define debug(x) cerr << #x << " = " << x << endl;

const long double PI = 4.0 * atan(1.0);
const long double EPS = 1e-10;

#define MAGIC 347
#define SINF 10007
#define CO 1000007
#define INF 1000000007
#define BIG 1000000931
#define LARGE 1696969696967ll
#define GIANT 2564008813937411ll
#define LLINF 2696969696969696969ll
#define MAXN 213

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<pll, pii> ppp;
typedef pair<ld, ld> pdd;

int N, M;
vector<ppp> edges;
vector<pii> ret;
ll r1, r2;
int dsu[MAXN];
ll ans = LLINF, bt, bc;

int find_parent(int u)
{
        return (u == dsu[u] ? u : dsu[u] = find_parent(dsu[u]));
}
bool merge(int u, int v)
{
        u = find_parent(u);
        v = find_parent(v);
        if (u == v) return false;
        dsu[u] = v;
        return true;
}
bool cmp(ppp x, ppp y)
{
        return r1 * x.fi.fi + r2 * x.fi.se < r1 * y.fi.fi + r2 * y.fi.se;
}
void test(ll c1, ll c2)
{
        r1 = c1;
        r2 = c2;
        sort(edges.begin(), edges.end(), cmp);
        for (int i = 0; i < N; i++)
        {
                dsu[i] = i;
        }
        ll t = 0, c = 0;
        vector<pii> e;
        for (int i = 0; i < M; i++)
        {
                if (merge(edges[i].se.fi, edges[i].se.se))
                {
                        t += edges[i].fi.fi;
                        c += edges[i].fi.se;
                        e.PB(edges[i].se);
                }
        }
        if (t * c < ans)
        {
                ret = e;
                ans = t * c;
                bt = t;
                bc = c;
        }
        return;
}
int32_t main()
{
	ios_base::sync_with_stdio(0);
	srand(time(0));
	//	cout << fixed << setprecision(10);
	//	cerr << fixed << setprecision(10);
	if (fopen("input.in", "r"))
	{
		freopen ("input.in", "r", stdin);
		freopen ("output.out", "w", stdout);
	}
        cin >> N >> M;
        for (int i = 0; i < M; i++)
        {
                int u, v; ll t, c;
                cin >> u >> v >> t >> c;
                edges.PB({{t, c}, {u, v}});
        }
        test(0, 1);
        test(1, 0);
        for (int i = 1; i <= 50; i++)
        {
                for (int j = 1; j <= 50; j++)
                {
                        if (__gcd(i, j) != 1)
                        {
                                continue;
                        }
                        test(i, j);
                }
        }
        cout << bt << ' ' << bc << '\n';
        for (pii x : ret)
        {
                cout << x.fi << ' ' << x.se << '\n';
        }
	//	cerr << "time elapsed = " << (clock() / (CLOCKS_PER_SEC / 1000)) << " ms" << endl;
	return 0;
}

Compilation message

timeismoney.cpp: In function 'int32_t main()':
timeismoney.cpp:204:11: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen ("input.in", "r", stdin);
   ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
timeismoney.cpp:205:11: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen ("output.out", "w", stdout);
   ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 376 KB Output is correct
2 Correct 4 ms 376 KB Output is correct
3 Correct 5 ms 432 KB Output is correct
4 Correct 14 ms 560 KB Output is correct
5 Correct 57 ms 576 KB Output is correct
6 Correct 41 ms 672 KB Output is correct
7 Correct 263 ms 672 KB Output is correct
8 Correct 1597 ms 1148 KB Output is correct
9 Correct 4 ms 1148 KB Output is correct
10 Correct 10 ms 1148 KB Output is correct
11 Correct 5 ms 1148 KB Output is correct
12 Correct 13 ms 1148 KB Output is correct
13 Correct 13 ms 1148 KB Output is correct
14 Correct 71 ms 1148 KB Output is correct
15 Correct 55 ms 1148 KB Output is correct
16 Correct 395 ms 1148 KB Output is correct
17 Correct 395 ms 1148 KB Output is correct
18 Correct 404 ms 1148 KB Output is correct
19 Execution timed out 2065 ms 1212 KB Time limit exceeded
20 Execution timed out 2075 ms 1212 KB Time limit exceeded