# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
570675 | 2022-05-31T03:56:29 Z | AGE | Simfonija (COCI19_simfonija) | C++14 | 471 ms | 3084 KB |
#include<bits/stdc++.h> #define F first #define S second #define pb push_back using namespace std; const int N=1e6,M=2e3; int a[100005],b[100005]; main() { int n,m; cin>>n>>m; map<int,int>mp; for(int i=0;i<n;i++) cin>>a[i]; for(int i=0;i<n;i++) cin>>b[i]; for(int i=0;i<n;i++) mp[a[i]-b[i]]++; int neg=0,pos=0; for(auto x:mp){ if(x.F<0) neg+=x.S; else pos+=x.S; } int ans=0,anss=1e18; for(int i=0;i<n;i++) ans+=abs(a[i]-b[i]); anss=min(abs(ans),anss); for(int j=-3e6;j>=1;j--){ ans-=pos; ans+=neg; anss=min(anss,abs(ans)); neg+=mp[-j]; pos-=mp[-j]; if(mp[-j]==0) mp.erase(-j); } ans=0,pos=0,neg=0; for(int i=0;i<n;i++) ans+=abs(a[i]-b[i]); for(auto x:mp) if(x.F<0) neg+=x.S; else pos+=x.S; for(int j=1;j<=3e6;j++){ ans-=neg; ans+=pos; anss=min(anss,abs(ans)); neg-=mp[-j]; pos+=mp[-j]; if(mp[-j]==0) mp.erase(-j); } cout<<anss<<endl; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 182 ms | 212 KB | Output is correct |
2 | Correct | 184 ms | 212 KB | Output is correct |
3 | Incorrect | 172 ms | 292 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 359 ms | 1468 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 364 ms | 1512 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 397 ms | 1524 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 231 ms | 1064 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 471 ms | 3048 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 255 ms | 972 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 419 ms | 3084 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 347 ms | 1296 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 269 ms | 1140 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |