oj.uz

답안 #113947

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
113947 2019-05-29T09:41:10 Z Kastanda 시간이 돈 (balkan11_timeismoney) C++11
85 / 100
 996 ms 632 KB 
#include<bits/stdc++.h>
using namespace std;
struct Edge {int a, b, c, t;};
const int N = 205, M = 10004;
int n, m, rc, rt, smc, smt, P[N];
Edge E[M], R[N];
int Find(int v)
{
    return (P[v] < 0 ? v : (P[v] = Find(P[v])));
}
inline bool CMP(Edge e1, Edge e2)
{
    return (e1.c * rc + e1.t * rt < e2.c * rc + e2.t * rt);
}
inline void MST()
{
    int _smc = 0, _smt = 0;
    vector < Edge > vec;
    sort(E, E + m, CMP);
    memset(P, -1, sizeof(P));
    for (int i = 0; i < m; i++)
        if (Find(E[i].a) != Find(E[i].b))
        {
            P[Find(E[i].a)] = Find(E[i].b);
            _smc += E[i].c;
            _smt += E[i].t;
            vec.push_back(E[i]);
        }
    if (1LL * smc * smt > 1LL * _smc * _smt)
    {
        smc = _smc; smt = _smt;
        for (int i = 0; i < n - 1; i++)
            R[i] = vec[i];
    }
}
int main()
{
    scanf("%d%d", &n, &m);
    for (int i = 0; i < m; i++)
    {
        int a, b, c, d;
        scanf("%d%d%d%d", &a, &b, &c, &d);
        E[i] = {a, b, c, d};
    }
    smc = smt = M * N; rc = 3;
    for (int i = 0; i < 900; i++)
        rt = i, MST();
    rt = 3;
    for (int i = 0; i < 900; i++)
        rc = i, MST();
    printf("%d %d\n", smc, smt);
    for (int i = 0; i < n - 1; i++)
        printf("%d %d\n", R[i].a, R[i].b);
    return 0;
}

Compilation message

timeismoney.cpp: In function 'int main()':
timeismoney.cpp:38:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &n, &m);
     ~~~~~^~~~~~~~~~~~~~~~
timeismoney.cpp:42:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d%d%d", &a, &b, &c, &d);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
85.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 384 KB Output is correct
2 Correct 3 ms 512 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 7 ms 256 KB Output is correct
5 Correct 30 ms 384 KB Output is correct
6 Correct 25 ms 384 KB Output is correct
7 Correct 157 ms 384 KB Output is correct
8 Correct 761 ms 512 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 3 ms 256 KB Output is correct
12 Correct 8 ms 384 KB Output is correct
13 Correct 7 ms 384 KB Output is correct
14 Correct 33 ms 412 KB Output is correct
15 Incorrect 26 ms 384 KB Output isn't correct
16 Correct 169 ms 440 KB Output is correct
17 Incorrect 172 ms 384 KB Output isn't correct
18 Correct 170 ms 512 KB Output is correct
19 Incorrect 986 ms 512 KB Output isn't correct
20 Correct 996 ms 632 KB Output is correct