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 ll long long int
#define sz(x) (int)x.size()
#define ff first
#define ss second
const ll N = 3005;
const ll M = 1e9 + 7;
int T, n, m, a[N], b[N], vis[N];
int main(){
ios::sync_with_stdio(false); cin.tie(0);
cin >> n >> m;
int s = 0;
for(int i = 1; i <= n+m-1; i++){
cin >> a[i] >> b[i];
if(a[i] >= n+1 and vis[a[i]] == 0){
s += a[i];
vis[a[i]] = 1;
}
if(b[i] >= n+1 and vis[b[i]] == 0){
s += b[i];
vis[b[i]] = 1;
}
}
s /= m;
int ans = 0;
for(int i = 0; i <= n+m; i++) vis[i] = 0;
for(int i = 1; i <= n+m-1; i++){
if(a[i] >= n+1 and vis[a[i]] == 0){
ans += abs(a[i]-s);
vis[a[i]] = 1;
}
if(b[i] >= n+1 and vis[b[i]] == 0){
ans += abs(b[i]-s);
vis[b[i]] = 1;
}
}
cout << ans;
return 0;
}
# | 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... |