oj.uz

Submission #165500

# Submission time Handle Problem Language Result Execution time Memory
165500 2019-11-27T11:39:49 Z muhi1112 Cipele (COCI18_cipele) C++17
0 / 90
 301 ms 1576 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define endl '\n'
#define f1 first
#define s2 second
#define pb push_back
#define mp make_pair
#define ll long long
#define fri(a) freopen(a,"r",stdin);
#define fro(a) freopen(a,"w",stdout);
const int N=405;

int n,m,a,ans;
vector<int>l,r;
int main(){
	//fri("in.txt");
	//fro("out.txt");
	cin>>n>>m;
	for(int i=0;i<n;i++){
		cin>>a;
		l.pb(a);
	}
	for(int i=0;i<m;i++){
		cin>>a;
		r.pb(a);
	}
	sort(l.begin(),l.end());
	sort(r.begin(),r.end());
	if(n<m){
		for(int i=n-1;i>=0;i--){
			auto j=lower_bound(r.begin(),r.end(),l[i]);
			if(j==r.end())j--;
			if(j-(r.begin())>i && abs(*j-l[i])>abs(*(j-1)-l[i]))j--;
			ans=max(ans,abs(*j-l[i]));
			r.erase(j);
		}
	}
	else{
		for(int i=m-1;i>=0;i--){
			auto j=lower_bound(l.begin(),l.end(),r[i]);
			if(j==l.end())j--;
			if(j-(l.begin())>i && abs(*j-r[i])>abs(*(j-1)-r[i]))j--;
			ans=max(ans,abs(*j-r[i]));
			l.erase(j);
		}
	}
	cout<<ans<<endl;
	return 0;
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 147 ms 1548 KB Output is correct
2 Incorrect 175 ms 1576 KB Output isn't correct

Subtask #2
0 / 9.0

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

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 376 KB Output is correct
2 Incorrect 12 ms 448 KB Output isn't correct

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 300 KB Output is correct
2 Incorrect 33 ms 532 KB Output isn't correct

Subtask #5
0 / 9.0

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

Subtask #6
0 / 9.0

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

Subtask #7
0 / 9.0

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

Subtask #8
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 301 ms 1304 KB Output is correct
2 Incorrect 111 ms 1136 KB Output isn't correct

Subtask #9
0 / 9.0

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

Subtask #10
0 / 9.0

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