# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
38726 | Waschbar | Fireworks (APIO16_fireworks) | C++14 | 6 ms | 11392 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>
using namespace std;
const int MAXN = 300000;
int N, n, m, ans;
int dis[MAXN+1], pr[MAXN+1];
vector < vector < int > > g(MAXN+1);
int main() {
cin >> n >> m;
N = n+m;
for(int i = 2; i <= N; i++) {
cin >> pr[i] >> dis[i];
g[pr[i]].push_back(i);
g[i].push_back(pr[i]);
}
if(n == 1) {
vector < int > vv;
for(int i = 2; i <= N; i++)
vv.push_back(dis[i]);
sort(vv.begin(),vv.end());
int xx = vv[vv.size()/2];
for(int i = 0; i < vv.size(); i++)
ans += abs(vv[i]-xx);
cout << ans;
return 0;
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |