Submission #991164

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
991164	2024-06-01T13:40:01 Z	LOLOLO	Mag (COCI16_mag)	C++17	120 / 120	307 ms	167340 KB

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
 
#define           f     first
#define           s     second
#define           pb    push_back
#define           ep    emplace
#define           eb    emplace_back
#define           lb    lower_bound
#define           ub    upper_bound
#define       all(x)    x.begin(), x.end()
#define      rall(x)    x.rbegin(), x.rend()
#define   uniquev(v)    sort(all(v)), (v).resize(unique(all(v)) - (v).begin())
#define     mem(f,x)    memset(f , x , sizeof(f))
#define        sz(x)    (ll)(x).size()
#define  __lcm(a, b)    (1ll * ((a) / __gcd((a), (b))) * (b))
#define          mxx    *max_element
#define          mnn    *min_element
#define    cntbit(x)    __builtin_popcountll(x)
#define       len(x)    (int)(x.length())
 
const int N = 1e6 + 10;
ll a[N];
int down[N], up[N], p[N];
vector <int> ed[N];
 
void dfs(int u, int v) {
    if (a[u] == 1)
        down[u] = 1;

    up[u] = 1;
    p[u] = v;

    int m1 = 0, m2 = 0;
    for (auto x : ed[u]) {
        if (x == v)
            continue;
 
        dfs(x, u);
        if (a[u] == 1) {
            down[u] = max(down[u], down[x] + 1);
        }
    }
}

void dfs2(int u, int v) {
    int m1 = 0, m2 = 0;
    for (auto x : ed[u]) {
        if (x == v)
            continue;

        if (m1 < down[x]) {
            m2 = m1;
            m1 = down[x];
        } else {
            m2 = max(m2, down[x]);
        }
    }

    for (auto x : ed[u]) {
        if (x == v)
            continue;
        
        if (a[u] == 1) {
            if (down[x] == m1) {
                up[x] = max(up[u] + 1, m2 + 2);
            } else {
                up[x] = max(up[u] + 1, m1 + 2);
            }
        }

        dfs2(x, u);
    }
}
 
ll solve() {
    int n;
    cin >> n;
 
    for (int i = 1; i < n; i++) {
        int a, b;
        cin >> a >> b;
        ed[a].pb(b);
        ed[b].pb(a);
    }
 
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }
 
    dfs(1, 1);
    dfs2(1, 1);
 
    ll x = -1, y = 1;
    for (int i = 1; i <= n; i++) {
        int m1 = 0, m2 = 0;
        for (auto x : ed[i]) {
            if (x == p[i])
                continue;
 
            if (m1 < down[x]) {
                m2 = m1;
                m1 = down[x];
            } else {
                m2 = max(m2, down[x]);
            }
        }
 
        ll len = max(m1 + m2 + 1, up[i] + m1);
        if (x == -1 || (x * len > a[i] * y)) {
            x = a[i];
            y = len;
        }
    }
 
    ll g = __gcd(x, y);
    cout << x / g << "/" << y / g << '\n';
 
    return 0;
}
 
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
 
 
    int t = 1;
    //cin >> t;
 
    while (t--) {
        solve();
    }
 
    return 0;
}

Compilation message

mag.cpp: In function 'void dfs(int, int)':
mag.cpp:35:9: warning: unused variable 'm1' [-Wunused-variable]
   35 |     int m1 = 0, m2 = 0;
      |         ^~
mag.cpp:35:17: warning: unused variable 'm2' [-Wunused-variable]
   35 |     int m1 = 0, m2 = 0;
      |                 ^~

Subtask #1
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	29276 KB	Output is correct
2	Correct	5 ms	31356 KB	Output is correct

Subtask #2
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	31320 KB	Output is correct
2	Correct	5 ms	31364 KB	Output is correct

Subtask #3
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	220 ms	98292 KB	Output is correct

Subtask #4
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	6 ms	31324 KB	Output is correct
2	Correct	294 ms	167340 KB	Output is correct

Subtask #5
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	280 ms	150096 KB	Output is correct

Subtask #6
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	266 ms	74576 KB	Output is correct
2	Correct	149 ms	64556 KB	Output is correct

Subtask #7
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	212 ms	75532 KB	Output is correct
2	Correct	37 ms	34648 KB	Output is correct
3	Correct	307 ms	152916 KB	Output is correct

Subtask #8
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	37 ms	34392 KB	Output is correct
2	Correct	214 ms	75084 KB	Output is correct
3	Correct	195 ms	55636 KB	Output is correct

Subtask #9
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	184 ms	72368 KB	Output is correct
2	Correct	205 ms	74064 KB	Output is correct

Subtask #10
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	212 ms	75216 KB	Output is correct
2	Correct	184 ms	55644 KB	Output is correct