제출 #85387

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
85387		DiegoGarcia	Cipele (COCI18_cipele)	C++11	0 / 90	1085 ms	6180 KiB

cipele

#include <stdio.h>
#include <math.h>
#include <climits>
#include <algorithm>
#define ll long long
using namespace std;
const ll MAXN = 1e5 + 3;
ll n,m,L[MAXN],R[MAXN],sol[MAXN],ans=LLONG_MAX;
bool vis[MAXN];
void dfs( ll niv, ll curans )
{
    if( curans >= ans ) return;
    if( niv > min(n,m) ){
        ans = min( ans, curans );
        return;
    }
    for( ll i=1; i<=max(n,m); i++ )
    {
        if(vis[i]) continue;
        sol[niv] = i;
        vis[i] = true;
        if( n >= m ){
            if( llabs(R[niv] - L[sol[niv]]) >= ans ){
               vis[i] = false;
               continue;
            }
            dfs( niv+1, max(curans, llabs(R[niv] - L[sol[niv]]) ) );
        }
        else{
            if( llabs(L[niv] - R[sol[niv]]) >= ans ){
                vis[i] = false;
                continue;
            }
            dfs( niv+1, max(curans, llabs(L[niv] - R[sol[niv]] ) ) );
        }
        vis[i] = false;
    }
}
int main()
{
    // O( max(n,m)! / |n-m|! * max(n,m) ) = ??
    scanf("%lld %lld",&n,&m);
    for( ll i=1; i<=n; i++ ) scanf("%lld",&L[i]);
    for( ll i=1; i<=m; i++ ) scanf("%lld",&R[i]);
    dfs( 1, -LLONG_MAX );
    printf("%lld", ans);
    return 0;
}

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

cipele.cpp: In function 'int main()':
cipele.cpp:42:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%lld %lld",&n,&m);
     ~~~~~^~~~~~~~~~~~~~~~~~~
cipele.cpp:43:35: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for( ll i=1; i<=n; i++ ) scanf("%lld",&L[i]);
                              ~~~~~^~~~~~~~~~~~~~
cipele.cpp:44:35: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for( ll i=1; i<=m; i++ ) scanf("%lld",&R[i]);
                              ~~~~~^~~~~~~~~~~~~~

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