oj.uz

Submission #210286

# Submission time Handle Problem Language Result Execution time Memory
210286 2020-03-17T02:01:58 Z SorahISA Traffic (IOI10_traffic) C++17
0 / 100
 176 ms 262148 KB 
#include "traffic.h"

// #pragma GCC target("avx2")
#pragma GCC optimize("O3", "unroll-loops")

// #include <bits/extc++.h>
// using namespace __gnu_pbds;

#include <bits/stdc++.h>
using namespace std;

// #define int long long
// template <typename T>
// using pbds_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
using pii = pair<int, int>;
template<typename T>
using prior = priority_queue<T, vector<T>, greater<T>>;
template<typename T>
using Prior = priority_queue<T>;

#define X first
#define Y second

#define fastIO() ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define RANDOM() random_device __rd; \
                 mt19937 __gen = mt19937(__rd()); \
                 uniform_int_distribution<int> __dis(0, 1); \
                 auto rnd = bind(__dis, __gen);

const int INF = 2E9;
const int mod = 1E9 + 7;
const int maxn = 1E6 + 5;

int sum = 0, ans = INF;
vector<int> adj[maxn], sz(maxn);

void dfs(int now, int lst) {
    int maxChild = 0;
    for (auto x : adj[now]) {
        if (x == now) continue;
        dfs(x, now);
        sz[now] += sz[x];
        maxChild = max(maxChild, sz[x]);
    }
    ans = min(ans, max(maxChild, sum - sz[now]));
}

int LocateCentre(int N, int P[], int S[], int D[]) {
    for (int i = 0; i < N; ++i) sum += (sz[i] = P[i]);
    for (int i = 0; i < N-1; ++i) {
        adj[S[i]].push_back(D[i]);
        adj[D[i]].push_back(S[i]);
    }
    dfs(0, -1);
    return ans;
}

/*
int32_t main() {
    fastIO();
    
    
    
    return 0;
}*/

Subtask #1
0 / 25.0

# Verdict Execution time Memory Grader output
1 Runtime error 176 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Runtime error 176 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Runtime error 176 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Runtime error 176 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -