oj.uz

답안 #241402

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
241402 2020-06-24T07:25:01 Z Vimmer Mag (COCI16_mag) C++14
12 / 120
 2561 ms 103000 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")

#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define N 1000501
#define M ll(1e9 + 7)
#define inf 1e9 + 1e9


using namespace std;
//using namespace __gnu_pbds;

typedef long double ld;
typedef long long ll;
typedef short int si;
typedef array <int, 3> a3;

//typedef tree <int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;


int a[N];

ld ans = -1;

ll l, r;

vector <int> g[N];

bool cmp(int x, int y)
{
    return a[x] < a[y];
}

void dfs(int v, int p, int kol, ll sum)
{
    ll sumr = sum;

    sum *= ll(a[v]);

    if (sum < sumr) return;

    if (sum > 1e18) return;

    ld res = ld(ld(sum) / ld(kol));

    if (ans < 0 || ans - res > 0)
    {
        ans = res;

        l = sum; r = kol;
    }

    for (auto it : g[v])
    {
        if (it == p) continue;

        dfs(it, v, kol + 1, sum);
    }
}
int main()
{
    //freopen("input.txt", "r", stdin); //freopen("output4.txt", "w", stdout);

    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int n;

    cin >> n;

    vector <int> gr; gr.clear();

    for (int i = 1; i < n; i++)
    {
        int x, y;

        cin >> x >> y;

        g[x].pb(y);

        g[y].pb(x);
    }

    for (int i = 1; i <= n; i++) {gr.pb(i); cin >> a[i];}

    sort(gr.begin(), gr.end(), cmp);

    for (int i = 0; i < min(n, 100); i++) dfs(gr[i], -1, 1, 1);

    cout << l << "/" << r << endl;
}

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 23936 KB Output is correct
2 Correct 20 ms 23808 KB Output is correct

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 23 ms 23808 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2561 ms 88928 KB Output isn't correct

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 23808 KB Output is correct
2 Incorrect 458 ms 62940 KB Output isn't correct

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2494 ms 103000 KB Output isn't correct

Subtask #6
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1530 ms 63092 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1236 ms 64228 KB Output is correct
2 Incorrect 690 ms 28020 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #8
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 749 ms 28048 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1412 ms 61276 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2225 ms 63424 KB Output isn't correct
2 Halted 0 ms 0 KB -