oj.uz

Submission #81538

# Submission time Handle Problem Language Result Execution time Memory
81538 2018-10-25T08:57:09 Z win11905 Cipele (COCI18_cipele) C++14
90 / 90
 100 ms 1368 KB 
#include <bits/stdc++.h>
using namespace std;

const int N = 1e5+5;

int n, m;
int A[N], B[N];

bool f(int x) {
    int last = 0;
    for(int i = 0; i < m; ++i) {
        if(last == n) return false;
        int ptr = lower_bound(A+last, A+n, B[i] - x) - A;
        if(ptr == n or abs(A[ptr] - B[i]) > x) return false;
        last = ptr+1;
    }
    return true;
}

int main() {
    scanf("%d %d", &n, &m);
    for(int i = 0; i < n; ++i) scanf("%d", A+i);
    for(int i = 0; i < m; ++i) scanf("%d", B+i);
    if(n < m) {
        for(int i = 0; i < m; ++i) swap(A[i], B[i]);
        swap(n, m);
    }
    sort(A, A+n), sort(B, B+m);
    int l = 0, r = 1e9;
    while(l < r) {
        int m = (l + r) >> 1;
        if(f(m)) r = m;
        else l = m+1;
    }
    printf("%d\n", r);
}

Compilation message

cipele.cpp: In function 'int main()':
cipele.cpp:21:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &n, &m);
     ~~~~~^~~~~~~~~~~~~~~~~
cipele.cpp:22:37: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i = 0; i < n; ++i) scanf("%d", A+i);
                                ~~~~~^~~~~~~~~~~
cipele.cpp:23:37: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i = 0; i < m; ++i) scanf("%d", B+i);
                                ~~~~~^~~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 77 ms 1144 KB Output is correct
2 Correct 100 ms 1268 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 100 ms 1268 KB Output is correct
2 Correct 99 ms 1268 KB Output is correct

Subtask #3
9.0 / 9.0

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

Subtask #4
9.0 / 9.0

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

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1268 KB Output is correct
2 Correct 6 ms 1268 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1268 KB Output is correct
2 Correct 6 ms 1268 KB Output is correct

Subtask #7
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1268 KB Output is correct
2 Correct 6 ms 1268 KB Output is correct

Subtask #8
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 80 ms 1368 KB Output is correct
2 Correct 57 ms 1368 KB Output is correct

Subtask #9
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 1368 KB Output is correct
2 Correct 52 ms 1368 KB Output is correct

Subtask #10
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 80 ms 1368 KB Output is correct
2 Correct 85 ms 1368 KB Output is correct