# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
61235 | dukati8 | Fireworks (APIO16_fireworks) | C++14 | 39 ms | 1660 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;
#define rep(i,a,b) for (int i=a; i<int(b); i++)
int main() {
int n,m;
cin >> n >> m;
vector<int>p(n+m);
vector<long long>c(n+m);
p[0]=-1;
c[0]=-1;
rep (i,1,n+m) {
cin >> p[i] >> c[i];
p[i]--; //0-indexed
}
if (n==1 && m<=100) {
rep (i,1,m+1) {
assert(p[i]==0);
}
sort(c.begin(),c.end());
long long goal=c[m/2+1];
long long ans=0;
rep (i,1,m+1) {
ans+=abs(goal-c[i]);
}
cout << ans << endl;
}
else {
//assume N+M <=300 and longest path <=300;
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... |