제출 #67308

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
67308		duality	구경하기 (JOI13_watching)	C++11	100 / 100	284 ms	16788 KiB

watching

#define DEBUG 0

#include <bits/stdc++.h>
using namespace std;

#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}

// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
    public:
        template<typename T>
        _Debug& operator,(T val) {
            cout << val << endl;
            return *this;
        }
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif

// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back

// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;

// ---------- END OF TEMPLATE ----------

int A[2000];
int dp[2001][2000];
int main() {
    int i;
    int N,P,Q;
    scanf("%d %d %d",&N,&P,&Q);
    for (i = 0; i < N; i++) scanf("%d",&A[i]);
    sort(A,A+N);
    if ((P+Q) >= N) {
        printf("1\n");
        return 0;
    }

    int j;
    int l = 1,r = 1e9;
    while (l < r) {
        int m = (l+r) / 2;
        for (i = 1; i <= N; i++) {
            int x = upper_bound(A,A+N,A[i-1]-m)-A;
            int y = upper_bound(A,A+N,A[i-1]-2*m)-A;
            for (j = 0; j <= P; j++) {
                dp[i][j] = dp[y][j]+1;
                if (j > 0) dp[i][j] = min(dp[i][j],dp[x][j-1]);
            }
        }
        if (dp[N][P] <= Q) r = m;
        else l = m+1;
    }
    printf("%d\n",l);

    return 0;
}

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

watching.cpp: In function 'int main()':
watching.cpp:63:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d %d",&N,&P,&Q);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~
watching.cpp:64:34: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for (i = 0; i < N; i++) scanf("%d",&A[i]);
                             ~~~~~^~~~~~~~~~~~

• Subtask 1: 50 / 50
• Subtask 2: 50 / 50