oj.uz

Submission #158753

# Submission time Handle Problem Language Result Execution time Memory
158753 2019-10-18T16:10:49 Z InfiniteJest Cipele (COCI18_cipele) C++14
27 / 90
 1000 ms 3064 KB 
#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <algorithm>
#include <math.h>
#include <map>
#include <set>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;

ifstream in("input.txt");
ofstream out("output.txt");

typedef long long ll;

int n,m;
int va[100001];
int vb[100001];
deque<pair<int,int> > p;

int main(){
  cin>>n>>m;
  for(int i=0;i<n;i++)cin>>va[i];
  for(int i=0;i<m;i++)cin>>vb[i];
  sort(va,va+n);
  sort(vb,vb+m);
  if(n<m){
    swap(va,vb);
    swap(n,m);
  }
  int minn=1e9+4;
  //int mas=-1;
  for(int i=0;i<=n-m;i++){
    /*while(!p.empty()&&p.front().fi<abs(va[i]-vb[i]))p.pop_front();
    p.push_front(abs(va[i]-vb[i]));*/
    int mas=-1;
    for(int y=0;y<m;y++){
      mas=max(mas,abs(va[i+y]-vb[y]));
    }
    minn=min(minn,mas);
  }
  /*minn=min(minn,p.back().fi);
  for(int i=0;i<va.size();i++){
    if(!p.empty()&&p.back().se==i-vb.size())p.pop_back();
    while(p.front().fi<abs())
  }*/
  cout<<minn;





}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 131 ms 2724 KB Output is correct
2 Correct 157 ms 3064 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 156 ms 2936 KB Output is correct
2 Correct 156 ms 2936 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1144 KB Output is correct
2 Correct 11 ms 1144 KB Output is correct

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 1272 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 14 ms 1144 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 14 ms 1272 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 11 ms 1144 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 9.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1016 ms 2584 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 9.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1064 ms 2660 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 9.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1079 ms 2556 KB Time limit exceeded
2 Halted 0 ms 0 KB -