oj.uz

답안 #398713

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
398713 2021-05-04T18:39:04 Z duality The Kingdom of JOIOI (JOI17_joioi) C++11
0 / 100
 1 ms 332 KB 
#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][2000],A2[2000][2000];
int pre[2000][2000];
int main() {
    int i,j;
    int H,W;
    scanf("%d %d",&H,&W);
    for (i = 0; i < H; i++) {
        for (j = 0; j < W; j++) scanf("%d",&A[i][j]);
    }

    int s = A[0][0],b = A[0][0];
    for (i = 0; i < H; i++) {
        for (j = 0; j < W; j++) s = min(s,A[i][j]),b = max(b,A[i][j]);
    }
    int l = 0,r = b-s-1;
    while (l < r) {
        int m = (l+r) / 2;

        int t;
        for (t = 0; t < 4; t++) {
            for (i = 0; i < H; i++) {
                for (j = 0; j < W; j++) {
                    if (A[i][j]-s > m) pre[i][j] = 1;
                    else pre[i][j] = 0;
                }
            }
            for (i = 0; i < H; i++) {
                for (j = 0; j < W; j++) {
                    if (i > 0) pre[i][j] += pre[i-1][j];
                    if (j > 0) pre[i][j] += pre[i][j-1];
                    if ((i > 0) && (j > 0)) pre[i][j] -= pre[i-1][j-1];
                }
            }
            int f = 0;
            for (i = 0; i < H; i++) {
                for (j = 0; j < W; j++) {
                    if (b-A[i][j] > m) {
                        if (pre[i][j] > 0) f = 1;
                    }
                    if (f) break;
                }
                if (f) break;
            }
            if (!f) break;
            else {
                for (i = 0; i < H; i++) {
                    for (j = 0; j < W; j++) A2[W-j-1][i] = A[i][j];
                }
                for (i = 0; i < W; i++) {
                    for (j = 0; j < H; j++) A[i][j] = A2[i][j];
                }
                swap(H,W);
            }
        }
        if (t < 4) r = m;
        else l = m+1;
    }
    printf("%d\n",l);

    return 0;
}

Compilation message

joioi.cpp: In function 'int main()':
joioi.cpp:63:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   63 |     scanf("%d %d",&H,&W);
      |     ~~~~~^~~~~~~~~~~~~~~
joioi.cpp:65:38: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   65 |         for (j = 0; j < W; j++) scanf("%d",&A[i][j]);
      |                                 ~~~~~^~~~~~~~~~~~~~~

Subtask #1
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 332 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 332 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 332 KB Output isn't correct
2 Halted 0 ms 0 KB -