# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
472254 | 2021-09-13T10:24:03 Z | SaraMostafa | Cipele (COCI18_cipele) | C++14 | 1000 ms | 2668 KB |
#include <bits/stdc++.h> #include<unordered_map> using namespace std; #define ll long long #define endl "\n" #define Sara ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL); const long long mod=998244353; const double PI=acos(-1); int main() { //freopen("input.in","r",stdin); Sara // 2nd st int n,m; cin>>n>>m; vector<ll>a(n),b(m); for(int i=0; i<n; i++) cin>>a[i]; for(int i=0; i<m; i++) cin>>b[i]; int id=0; sort(a.begin(),a.end()); sort(b.begin(),b.end()); if(n<m) { vector<bool>vs(m); vector<ll>bn(n); for(int i=n-1; i>=0; i--) { ll mn=1e9; for(int j=0; j<m; j++) { if(vs[j]) continue; if(abs(a[i]-b[j])<mn) { mn=abs(a[i]-b[j]); id=j; } } vs[id]=1; bn[i]=b[id]; } ll mx=0; for(int i=0; i<n; i++) { mx=max(mx,abs(a[i]-bn[i])); } cout<<mx<<endl; return 0; } vector<bool>vs(n); vector<ll>an(m); for(int i=m-1; i>=0; i--) { ll mn=1e9; for(int j=0; j<n; j++) { if(vs[j]) continue; if(abs(b[i]-a[j])<mn) { mn=abs(b[i]-a[j]); id=j; } } vs[id]=1; an[i]=a[id]; } ll mx=0; for(int i=0; i<m; i++) { mx=max(mx,abs(b[i]-an[i])); } cout<<mx<<endl; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1087 ms | 2636 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1082 ms | 2668 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 9 ms | 332 KB | Output is correct |
2 | Incorrect | 35 ms | 332 KB | Output isn't correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 332 KB | Output is correct |
2 | Incorrect | 43 ms | 332 KB | Output isn't correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 49 ms | 388 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 51 ms | 332 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 51 ms | 408 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1081 ms | 2112 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1078 ms | 2352 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1089 ms | 2072 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |