oj.uz

Submission #95551

# Submission time Handle Problem Language Result Execution time Memory
95551 2019-02-02T03:50:43 Z kimcoding Cipele (COCI18_cipele) C++17
0 / 90
 33 ms 2808 KB 
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;

#define all(x) (x).begin(), (x).end()

typedef vector <int> vi;

int n, m, ans;
vi a, b;

bool function(int x) {
	for (int i = 1, j = 1; i <= n; i++) {
		while (j <= m && a[i] - b[j] > x) j++;
		if (j > m || b[j] - a[i] > x) return false;
	}
	return true;
}

int main() {
	scanf("%d %d", &n, &m);
	a = vi(n + 1), b = vi(m + 1);
	for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
	for (int i = 1; i <= m; i++) scanf("%d", &b[i]);

	if (n > m) swap(n, m), swap(a, b);
	int left = 0, right = 1e9;
	while (left <= right) {
		int mid = (left + right) / 2;
		if (function(mid)) {
			ans = mid;
			right = mid - 1;
		}
		else left = mid + 1;
	}
	printf("%d\n", ans);
	return 0;
}

Compilation message

cipele.cpp: In function 'int main()':
cipele.cpp:22:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &n, &m);
  ~~~~~^~~~~~~~~~~~~~~~~
cipele.cpp:24:36: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
                               ~~~~~^~~~~~~~~~~~~
cipele.cpp:25:36: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for (int i = 1; i <= m; i++) scanf("%d", &b[i]);
                               ~~~~~^~~~~~~~~~~~~

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 2552 KB Output is correct
2 Incorrect 33 ms 2808 KB Output isn't correct

Subtask #2
0 / 9.0

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

Subtask #3
0 / 9.0

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

Subtask #4
0 / 9.0

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

Subtask #5
0 / 9.0

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

Subtask #6
0 / 9.0

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

Subtask #7
0 / 9.0

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

Subtask #8
0 / 9.0

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

Subtask #9
0 / 9.0

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

Subtask #10
0 / 9.0

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