oj.uz

Submission #1071059

# Submission time Handle Problem Language Result Execution time Memory
1071059 2024-08-23T04:01:08 Z steveonalex Traffic (IOI10_traffic) C++17
0 / 100
 6 ms 31360 KB 
#include <bits/stdc++.h>
#include "traffic.h"
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
#define block_of_code if(true)
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
double rngesus_d(double l, double r){
    double cur = rngesus(0, MASK(60) - 1);
    cur /= MASK(60) - 1;
    return l + cur * (r - l);
}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

const ll INF = 1e18 + 69;

const int N = 1e6 + 69;

ll sz[N];
vector<int> graph[N];
ll ans = INF;

void go(int u, int p){
    for(int v: graph[u]) if (v != p){
        go(v, u);
        sz[u] += sz[v];
    }
}

void dfs(int u, int p){
    ll ma = 0;
    for(int v: graph[u]) maximize(ma, sz[v]);
    minimize(ans, ma);

    for(int v: graph[u]) if (v != p){
        sz[u] -= sz[v];
        sz[v] += sz[u];
        dfs(v, u);

        sz[v] -= sz[u];
        sz[u] += sz[v];
    } 
}

int LocateCentre(int n, int pp[], int S[], int D[]) {
    for(int i = 0; i<n; ++i) sz[i] = pp[i];
    for(int i = 0; i<n-1; ++i) {
        int u = S[i], v = D[i];
        graph[u].push_back(v);
        graph[v].push_back(u);
    }

    go(0, 0);
    dfs(0, 0);

    return ans;
}


// int main(void){
//     ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
//     clock_t start = clock();
 
//     cerr << "Time elapsed: " << clock() - start << " ms\n";
//     return 0;
// }

Subtask #1
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 31320 KB Output is correct
2 Incorrect 6 ms 31360 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 31320 KB Output is correct
2 Incorrect 6 ms 31360 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 31320 KB Output is correct
2 Incorrect 6 ms 31360 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 31320 KB Output is correct
2 Incorrect 6 ms 31360 KB Output isn't correct
3 Halted 0 ms 0 KB -