oj.uz

Submission #345592

# Submission time Handle Problem Language Result Execution time Memory
345592 2021-01-07T15:48:38 Z izhang05 Traffic (IOI10_traffic) C++17
0 / 100
 15 ms 23788 KB 
#ifndef DEBUG
#include <traffic.h>
#endif
#include <bits/stdc++.h>

using namespace std;

void setIO() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
}

const int maxn = 1e6;
vector<int> adj[maxn];

void bfs(int n) {

}

int LocateCentre(int n, int p[], int s[], int d[]) {
    int left = 0, right = 0;
    for (int i = 0; i < n - 1; ++i) {
        adj[s[i]].push_back(d[i]);
        adj[d[i]].push_back(s[i]);
        right += p[i];
    }
    pair<int, int> sol = {right, 1};
    for (int i = 0; i < n; ++i) {
        left += p[i];
        right -= p[i];
        sol = min(sol, make_pair(max(left, right), i + 1));
    }
    return sol.second;
}

Subtask #1
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 15 ms 23788 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 15 ms 23788 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 15 ms 23788 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 15 ms 23788 KB Output isn't correct
2 Halted 0 ms 0 KB -