oj.uz

Submission #779085

# Submission time Handle Problem Language Result Execution time Memory
779085 2023-07-11T07:36:41 Z vjudge1 Cipele (COCI18_cipele) C++17
90 / 90
 38 ms 9524 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long lo; 

#define fi first
#define se second
#define endl "\n"
#define int long long
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)

const lo inf = 1000000000;
const lo li = 500005;
const lo mod = 1000000007;

int n,m,a[li],k,flag,t,b[li];
int cev;
string s;
vector<int> v;

inline int in(){
	int x;
	scanf("%lld",&x);
	return x;
}

int32_t main(void){
	n=in(),m=in();
	FOR a[i]=in();
	for(int i=1;i<=m;i++){
		b[i]=in();
	}
	//n kucuk olsun
	if(n>m){
		swap(n,m);
		swap(a,b);
	}
	sort(a+1,a+n+1);
	sort(b+1,b+m+1);
	int bas=0;
	int son=100000000000000;
	while(bas<=son){
		int ind=0;
		int tut=1;
		FOR{
			flag=0;
			while(ind<m){
				ind++;
				//~ cout<<a[i]<<" :: "<<b[ind]<<" :: "<<abs(b[ind]-a[i])<<" :: "<<ort<<endl;
				if(abs(b[ind]-a[i])<=ort){flag=1;break;}
			}
			if(flag==0){tut=0;break;}
		}
		if(tut)son=ort-1;
		else bas=ort+1;
	}
	printf("%lld\n",bas);
	return 0;
}

Compilation message

cipele.cpp: In function 'long long int in()':
cipele.cpp:28:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   28 |  scanf("%lld",&x);
      |  ~~~~~^~~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 1844 KB Output is correct
2 Correct 32 ms 1876 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 1864 KB Output is correct
2 Correct 38 ms 1796 KB Output is correct

Subtask #3
9.0 / 9.0

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

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 468 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 2 ms 424 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 2 ms 468 KB Output is correct

Subtask #7
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 2 ms 424 KB Output is correct

Subtask #8
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 1468 KB Output is correct
2 Correct 24 ms 9044 KB Output is correct

Subtask #9
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 1708 KB Output is correct
2 Correct 21 ms 9172 KB Output is correct

Subtask #10
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 1524 KB Output is correct
2 Correct 31 ms 9524 KB Output is correct