Submission #147062

#	Time	Username	Problem	Language	Result	Execution time	Memory
147062		albino_ojuz	Cipele (COCI18_cipele)	C++14	54 / 90	167 ms	3704 KiB

cipele

#include <bits/stdc++.h>

using namespace std;

const int N = 1e5+5;
 
int n,m;
int mini,maks;
long long niz1[N],niz2[N];

bool f(int mid) {
	long long zas = 0;
	long long pom = 0,ad = 0;
	for (long long i = 0;i < n;i++) {
			for (long long j = i + ad;j < m;j++) {
				if (abs(niz1[i] - niz2[j]) <= mid) {
					//uspio sam uparit
					break;
				}
				if (j == m - 1) {//nisam ga naso uopce
					zas = 1;
				}
			pom++;
		}
		ad = pom;
	}
	
	if (zas == 1) {
		return false;
	}
	return true;
}

int main () {
	
	cin >> n >> m;
	for (long long i = 0;i < n;i++) {
		cin >> niz1[i];
		if (niz1[i] > maks) {
			maks = niz1[i];
		}
		if (niz1[i] < mini) {
			mini = niz1[i];
		}
	}
	for (long long i = 0;i < m;i++) {
		cin >> niz2[i];
		if (niz2[i] > maks) {
			maks = niz2[i];
		}
		if (niz2[i] < mini) {
			mini = niz2[i];
		}
	}
	sort(niz1,niz1 + n);
	sort(niz2,niz2 + m);
	// 											prvi je manji prvi je manji prvi je manji
	if (n > m) {
		for (long long i = 0;i < n;i++) {
			swap(niz1[i],niz2[i]);
		}
		swap(n,m);
	}
	
	long long lo = 0, hi = maks;
	while (lo != hi) {
		long long zas = 0;
		long long pom = 0,ad = 0;
		long long mid = (lo + hi) / 2;
		
		if (f(mid) == 1) {
			hi = mid;
		}
		else {
			lo = mid + 1;
		}
	}
	while(f(lo-1) == 1) {
		lo--;
	}
	if (f(lo) == 0) {
		lo++;
	}
	cout << lo << endl; 	
	
	return 0;
}

Compilation message (stderr)

cipele.cpp: In function 'int main()':
cipele.cpp:67:13: warning: unused variable 'zas' [-Wunused-variable]
   long long zas = 0;
             ^~~
cipele.cpp:68:13: warning: unused variable 'pom' [-Wunused-variable]
   long long pom = 0,ad = 0;
             ^~~
cipele.cpp:68:21: warning: unused variable 'ad' [-Wunused-variable]
   long long pom = 0,ad = 0;
                     ^~

• Subtask 1: 9 / 9
• Subtask 2: 0 / 9
• Subtask 3: 9 / 9
• Subtask 4: 9 / 9
• Subtask 5: 0 / 9
• Subtask 6: 9 / 9
• Subtask 7: 9 / 9
• Subtask 8: 9 / 9
• Subtask 9: 0 / 9
• Subtask 10: 0 / 9