# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
38731 | oTTo_22 | Fireworks (APIO16_fireworks) | C++14 | 0 ms | 2180 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>
#define se second
#define fi first
#define ll long long
using namespace std;
vector < vector < pair < ll,ll > > > g;
int main () {
ios_base::sync_with_stdio(false);
cin.tie(0);
ll n,m;
cin >> n >> m;
vector < ll > c;
g.resize(n+m+1);
for (int i=2; i<=n+m; i++) {
ll p;
ll cc;
cin >> p >> cc;
c.push_back(cc);
g[i].push_back({p,cc});
g[p].push_back({i,cc});
}
sort (c.begin(),c.end());
if (n==1) {
ll p=c[(c.size()-1)/2];
ll ans=0;
for (int i=0; i<c.size(); i++)
ans=ans+abs(p-c[i]);
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... |