oj.uz

Submission #95200

# Submission time Handle Problem Language Result Execution time Memory
95200 2019-01-28T13:56:44 Z Ort Cipele (COCI18_cipele) C++11
90 / 90
 46 ms 2936 KB 
#include<algorithm>
#include<iostream>
#include<vector>
#include<cmath>

using namespace std;

int main() {
	cin.sync_with_stdio(0); cin.tie(0);
	cin.exceptions(cin.failbit);
	int n, m;
	cin >> n >> m;
	vector<int> a(n), b(m);
	for(int i=0;i<n;i++) cin >> a[i];
	for(int i=0;i<m;i++) cin >> b[i];
	sort(a.begin(),a.end()); sort(b.begin(),b.end());
	if(n>m) swap(a,b);
	int low = -1, high = 1e9, mid, t;
	bool valid;
	while(high-low>1) {
		mid = (low+high)>>1;
		t = 0; valid = 1;
		for(int i=0;i<a.size();i++) {
			if(t>=b.size()) {
				valid = 0;
				break;
			}
			while(t<b.size() && b[t]<=a[i] && a[i]-b[t]>mid) t++;
			if(t>=b.size() || abs(a[i]-b[t])>mid) {
				valid = 0;
				break;
			}
			t++;
		}
		if(valid) high = mid;
		else low = mid;
	}
	cout << high;
	return 0;
}

Compilation message

cipele.cpp: In function 'int main()':
cipele.cpp:23:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=0;i<a.size();i++) {
               ~^~~~~~~~~
cipele.cpp:24:8: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    if(t>=b.size()) {
       ~^~~~~~~~~~
cipele.cpp:28:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    while(t<b.size() && b[t]<=a[i] && a[i]-b[t]>mid) t++;
          ~^~~~~~~~~
cipele.cpp:29:8: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    if(t>=b.size() || abs(a[i]-b[t])>mid) {
       ~^~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 2808 KB Output is correct
2 Correct 46 ms 2936 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 2936 KB Output is correct
2 Correct 42 ms 2936 KB Output is correct

Subtask #3
9.0 / 9.0

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

Subtask #4
9.0 / 9.0

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

Subtask #5
9.0 / 9.0

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

Subtask #6
9.0 / 9.0

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

Subtask #7
9.0 / 9.0

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

Subtask #8
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 2424 KB Output is correct
2 Correct 26 ms 1784 KB Output is correct

Subtask #9
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 2680 KB Output is correct
2 Correct 27 ms 2056 KB Output is correct

Subtask #10
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 2396 KB Output is correct
2 Correct 37 ms 2576 KB Output is correct