# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
403120 | fidgetspinnerkid | Traffic (IOI10_traffic) | C++11 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h> // see /general/running-code-locally
using namespace std;
using ll = long long;
using vi = vector<int>;
#define pb push_back
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
using pi = pair<int,int>;
#define f first
#define s second
#define mp make_pair
void setIO(string name = "") {
cin.tie(0)->sync_with_stdio(0); // see /general/fast-io
if (sz(name)) {
freopen((name+".in").c_str(), "r", stdin); // see /general/io
freopen((name+".out").c_str(), "w", stdout);
}
}
const int SZ = 1000;
int n;
vector<int> adjlist[SZ];
int p[SZ];
int pref[SZ+1];
void fill_pref() {
for(int i=0; i<n; i++) {
pref[i+1] = pref[i] + p[i];
}
}
int main() {
setIO();
cin >> n;
for(int i=0; i<n; i++) {
int x;
cin >> x;
p[i] = x;
}
for(int i=0; i<n-1; i++) {
int x, y;
cin >> x >> y;
adjlist[x-1].push_back(y-1);
adjlist[y-1].push_back(x-1);
}
fill_pref();
int sol = 0;
int min_cong = 2000000001;
for(int i=0; i<n; i++) {
int s = max(pref[i], pref[n-1]-pref[i+1]);
if(min_cong>s) {
min_cong = s;
sol = i;
}
}
}