oj.uz

Submission #165554

# Submission time Handle Problem Language Result Execution time Memory
165554 2019-11-27T12:39:45 Z muhi1112 Cipele (COCI18_cipele) C++17
18 / 90
 60 ms 4580 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++){
			ans=max(ans,abs(l[i]-r[i]));
		}
		for(int i=0;i+n<=m;i++){
			ans=min(ans,max(abs(l[0]-r[i]),abs(l[n-1]-r[i+n-1])));
		}
	}
	else if(n>m){
		for(int i=0;i<m;i++){
			ans=max(ans,abs(l[i]-r[i]));
		}
		for(int i=0;i+m<=n;i++){
			ans=min(ans,max(abs(l[i]-r[0]),abs(l[i+m-1]-r[m-1])));
		}
	}
	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 37 ms 4452 KB Output is correct
2 Correct 59 ms 4580 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 4452 KB Output is correct
2 Correct 60 ms 4500 KB Output is correct

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 476 KB Output is correct
2 Incorrect 5 ms 632 KB Output isn't correct

Subtask #4
0 / 9.0

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

Subtask #5
0 / 9.0

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

Subtask #6
0 / 9.0

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

Subtask #7
0 / 9.0

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

Subtask #8
0 / 9.0

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

Subtask #9
0 / 9.0

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

Subtask #10
0 / 9.0

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