제출 #85224

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
85224		FutymyClone	Cipele (COCI18_cipele)	C++14	90 / 90	100 ms	12308 KiB

cipele

#include <bits/stdc++.h>

using namespace std;

const int N = 1e5 + 5;

int n, m, a[N], b[N];

bool check (int mid, bool small) {
    if (!small) {
        int pt = 1;
        for (int i = 1; i <= n; i++) {
            while (pt <= m && b[pt] < a[i] - mid) pt++;
            if (pt > m || b[pt] > a[i] + mid) return false;
            pt++;
        }
    }
    else {
        int pt = 1;
        for (int i = 1; i <= m; i++) {
            while (pt <= n && a[pt] < b[i] - mid) pt++;
            if (pt > n || a[pt] > b[i] + mid) return false;
            pt++;
        }
    }

    return true;
}

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

    if (n <= m) {
        int l = 0, r = 1e9;
        while (l <= r) {
            int mid = (l + r) / 2;

            if (check(mid, 0)) r = mid - 1;
            else l = mid + 1;
        }

        printf("%d", l);
    }
    else {
        int l = 0, r = 1e9;
        while (l <= r) {
            int mid = (l + r) / 2;

            if (check(mid, 1)) r = mid - 1;
            else l = mid + 1;
        }

        printf("%d", l);
    }
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

cipele.cpp: In function 'int main()':
cipele.cpp:31: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:32:39: 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:33:39: 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: 9 / 9
• Subtask 2: 9 / 9
• Subtask 3: 9 / 9
• Subtask 4: 9 / 9
• Subtask 5: 9 / 9
• Subtask 6: 9 / 9
• Subtask 7: 9 / 9
• Subtask 8: 9 / 9
• Subtask 9: 9 / 9
• Subtask 10: 9 / 9