oj.uz

Submission #165543

# Submission time Handle Problem Language Result Execution time Memory
165543 2019-11-27T12:26:31 Z muhi1112 Cipele (COCI18_cipele) C++17
36 / 90
 1000 ms 6120 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;

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

Compilation message

cipele.cpp: In function 'int main()':
cipele.cpp:21:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld",&a);
   ~~~~~^~~~~~~~~~~
cipele.cpp:26:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld",&a);
   ~~~~~^~~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 4324 KB Output is correct
2 Correct 60 ms 5864 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 4320 KB Output is correct
2 Correct 62 ms 6120 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 504 KB Output is correct
2 Correct 8 ms 632 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 504 KB Output is correct
2 Correct 7 ms 504 KB Output is correct

Subtask #5
0 / 9.0

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

Subtask #6
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 632 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 604 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 1058 ms 3740 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 1079 ms 4064 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 1040 ms 3808 KB Time limit exceeded
2 Halted 0 ms 0 KB -