oj.uz

답안 #239228

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
239228 2020-06-14T21:12:55 Z rqi The Kingdom of JOIOI (JOI17_joioi) C++14
100 / 100
 668 ms 117672 KB 
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef double db; 
typedef string str; 

typedef pair<int,int> pi;
typedef pair<ll,ll> pl; 
typedef pair<db,db> pd; 

typedef vector<int> vi; 
typedef vector<ll> vl; 
typedef vector<db> vd; 
typedef vector<str> vs; 
typedef vector<pi> vpi;
typedef vector<pl> vpl; 
typedef vector<pd> vpd; 

#define mp make_pair
#define f first
#define s second
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend() 
#define rsz resize
#define ins insert 
#define ft front() 
#define bk back()
#define pf push_front 
#define pb push_back
#define eb emplace_back 
#define lb lower_bound 
#define ub upper_bound 

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

const int MOD = 1e9+7; // 998244353;
const int MX = 2e5+5; 
const ll INF = 1e18; 
const ld PI = acos((ld)-1);
const int xd[4] = {1,0,-1,0}, yd[4] = {0,1,0,-1}; 
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); 

template<class T> bool ckmin(T& a, const T& b) { 
    return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { 
    return a < b ? a = b, 1 : 0; } 
int pct(int x) { return __builtin_popcount(x); } 
int bits(int x) { return 31-__builtin_clz(x); } // floor(log2(x)) 
int cdiv(int a, int b) { return a/b+!(a<0||a%b == 0); } // division of a by b rounded up, assumes b > 0 
int fstTrue(function<bool(int)> f, int lo, int hi) {
    hi ++; assert(lo <= hi); // assuming f is increasing
    while (lo < hi) { // find first index such that f is true 
        int mid = (lo+hi)/2; 
        f(mid) ? hi = mid : lo = mid+1; 
    } 
    return lo;
}

// INPUT
template<class A> void re(complex<A>& c);
template<class A, class B> void re(pair<A,B>& p);
template<class A> void re(vector<A>& v);
template<class A, size_t SZ> void re(array<A,SZ>& a);

template<class T> void re(T& x) { cin >> x; }
void re(db& d) { str t; re(t); d = stod(t); }
void re(ld& d) { str t; re(t); d = stold(t); }
template<class H, class... T> void re(H& h, T&... t) { re(h); re(t...); }

template<class A> void re(complex<A>& c) { A a,b; re(a,b); c = {a,b}; }
template<class A, class B> void re(pair<A,B>& p) { re(p.f,p.s); }
template<class A> void re(vector<A>& x) { trav(a,x) re(a); }
template<class A, size_t SZ> void re(array<A,SZ>& x) { trav(a,x) re(a); }

// TO_STRING
#define ts to_string
str ts(char c) { return str(1,c); }
str ts(bool b) { return b ? "true" : "false"; }
str ts(const char* s) { return (str)s; }
str ts(str s) { return s; }
template<class A> str ts(complex<A> c) { 
    stringstream ss; ss << c; return ss.str(); }
str ts(vector<bool> v) { 
    str res = "{"; F0R(i,sz(v)) res += char('0'+v[i]);
    res += "}"; return res; }
template<size_t SZ> str ts(bitset<SZ> b) {
    str res = ""; F0R(i,SZ) res += char('0'+b[i]);
    return res; }
template<class A, class B> str ts(pair<A,B> p);
template<class T> str ts(T v) { // containers with begin(), end()
    bool fst = 1; str res = "{";
    for (const auto& x: v) {
        if (!fst) res += ", ";
        fst = 0; res += ts(x);
    }
    res += "}"; return res;
}
template<class A, class B> str ts(pair<A,B> p) {
    return "("+ts(p.f)+", "+ts(p.s)+")"; }

// OUTPUT
template<class A> void pr(A x) { cout << ts(x); }
template<class H, class... T> void pr(const H& h, const T&... t) { 
    pr(h); pr(t...); }
void ps() { pr("\n"); } // print w/ spaces
template<class H, class... T> void ps(const H& h, const T&... t) { 
    pr(h); if (sizeof...(t)) pr(" "); ps(t...); }

// DEBUG
void DBG() { cerr << "]" << endl; }
template<class H, class... T> void DBG(H h, T... t) {
    cerr << ts(h); if (sizeof...(t)) cerr << ", ";
    DBG(t...); }
#ifdef LOCAL // compile with -DLOCAL
#define dbg(...) cerr << "LINE(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 0
#endif

// FILE I/O
void setIn(string s) { freopen(s.c_str(),"r",stdin); }
void setOut(string s) { freopen(s.c_str(),"w",stdout); }
void unsyncIO() { ios_base::sync_with_stdio(0); cin.tie(0); }
void setIO(string s = "") {
    unsyncIO();
    // cin.exceptions(cin.failbit); 
    // throws exception when do smth illegal
    // ex. try to read letter into int
    if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
}

int H, W;
int A[2005][2005];
int mn = 2*MOD, mx = -MOD;
int mnl[2005][2005];
int mnr[2005][2005];
int mxl[2005][2005];
int mxr[2005][2005];


void build(){
    for(int i = 1; i <= H; i++){
        for(int j = 1; j <= W; j++){
            mnl[i][j] = mxl[i][j] = mnr[i][j] = mxr[i][j] = A[i][j];
        }
    }
    for(int i = 1; i <= H; i++){
        mnl[i][0] = 2*MOD;
        mxl[i][0] = -MOD;
        for(int j = 1; j <= W; j++){
            ckmin(mnl[i][j], mnl[i][j-1]);
            ckmax(mxl[i][j], mxl[i][j-1]);
        }

        mnr[i][W+1] = 2*MOD;
        mxr[i][W+1] = -MOD;
        for(int j = W; j >= 1; j--){
            ckmin(mnr[i][j], mnr[i][j+1]);
            ckmax(mxr[i][j], mxr[i][j+1]);
        }
    }
}

bool check(int lim){
    int curind = 0;
    bool works = 1;
    ////// mn on left, mx on right
    for(int i = 1; i <= H; i++){
        while(curind+1 <= W && mx-mnr[i][curind+1] > lim){
            curind++;
        }
        //if(lim == 10) dbg(i, curind, mnr[i][curind+1]);
        if(mx-mnr[i][curind+1] > lim || mxl[i][curind]-mn > lim){
            works = 0;
            break;
        }
    }

    //if(lim == 10) dbg(works);
    if(works == 1) return 1;
    curind = 0;
    works = 1;
    ////// mx on left, mn on right
    for(int i = 1; i <= H; i++){
        while(curind+1 <= W && mxr[i][curind+1]-mn > lim){
            curind++;
        }
        if(mxr[i][curind+1]-mn > lim || mx-mnl[i][curind] > lim){
            works = 0;
            break;
        }
    }

    if(works == 1) return 1;
    return 0;
}

int solve(){
    int lo = 0;
    int hi = 1000000000;
    while(lo < hi){
        int mid = (lo+hi)/2; // diffs <= mid
        //dbg(mid, check(mid));
        if(check(mid) == true){
            hi = mid;
        }
        else lo = mid+1;
    }
    return lo;
}

int main() {
    setIO();
    cin >> H >> W;
    for(int i = 1; i <= H; i++){
        for(int j = 1; j <= W; j++){
            cin >> A[i][j];
            ckmin(mn, A[i][j]);
            ckmax(mx, A[i][j]);
        }
    }

    
    build();
    int ans1 = solve();

    for(int i = 1; i <= H; i++){
        for(int j = 1; j <= W/2; j++){
            swap(A[i][j], A[i][W+1-j]);
        }
    }

    build();
    int ans2 = solve();

    ps(min(ans1, ans2));

    // you should actually read the stuff at the bottom
}

/* stuff you should look for
    * int overflow, array bounds
    * special cases (n=1?)
    * do smth instead of nothing and stay organized
    * WRITE STUFF DOWN
*/

Compilation message

joioi.cpp: In function 'void setIn(std::__cxx11::string)':
joioi.cpp:128:31: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
 void setIn(string s) { freopen(s.c_str(),"r",stdin); }
                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
joioi.cpp: In function 'void setOut(std::__cxx11::string)':
joioi.cpp:129:32: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
 void setOut(string s) { freopen(s.c_str(),"w",stdout); }
                         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 5 ms 512 KB Output is correct
5 Correct 5 ms 512 KB Output is correct
6 Correct 5 ms 512 KB Output is correct
7 Correct 5 ms 512 KB Output is correct
8 Correct 5 ms 512 KB Output is correct
9 Correct 5 ms 640 KB Output is correct
10 Correct 5 ms 640 KB Output is correct
11 Correct 5 ms 512 KB Output is correct
12 Correct 4 ms 512 KB Output is correct
13 Correct 5 ms 512 KB Output is correct
14 Correct 5 ms 512 KB Output is correct

Subtask #2
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 5 ms 512 KB Output is correct
5 Correct 5 ms 512 KB Output is correct
6 Correct 5 ms 512 KB Output is correct
7 Correct 5 ms 512 KB Output is correct
8 Correct 5 ms 512 KB Output is correct
9 Correct 5 ms 640 KB Output is correct
10 Correct 5 ms 640 KB Output is correct
11 Correct 5 ms 512 KB Output is correct
12 Correct 4 ms 512 KB Output is correct
13 Correct 5 ms 512 KB Output is correct
14 Correct 5 ms 512 KB Output is correct
15 Correct 5 ms 640 KB Output is correct
16 Correct 9 ms 5120 KB Output is correct
17 Correct 12 ms 5376 KB Output is correct
18 Correct 12 ms 5376 KB Output is correct
19 Correct 12 ms 5376 KB Output is correct
20 Correct 11 ms 4864 KB Output is correct
21 Correct 13 ms 5504 KB Output is correct
22 Correct 13 ms 5504 KB Output is correct
23 Correct 13 ms 5504 KB Output is correct
24 Correct 12 ms 4992 KB Output is correct
25 Correct 13 ms 5504 KB Output is correct
26 Correct 13 ms 5504 KB Output is correct
27 Correct 13 ms 5504 KB Output is correct
28 Correct 13 ms 5504 KB Output is correct

Subtask #3
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 5 ms 512 KB Output is correct
5 Correct 5 ms 512 KB Output is correct
6 Correct 5 ms 512 KB Output is correct
7 Correct 5 ms 512 KB Output is correct
8 Correct 5 ms 512 KB Output is correct
9 Correct 5 ms 640 KB Output is correct
10 Correct 5 ms 640 KB Output is correct
11 Correct 5 ms 512 KB Output is correct
12 Correct 4 ms 512 KB Output is correct
13 Correct 5 ms 512 KB Output is correct
14 Correct 5 ms 512 KB Output is correct
15 Correct 5 ms 640 KB Output is correct
16 Correct 9 ms 5120 KB Output is correct
17 Correct 12 ms 5376 KB Output is correct
18 Correct 12 ms 5376 KB Output is correct
19 Correct 12 ms 5376 KB Output is correct
20 Correct 11 ms 4864 KB Output is correct
21 Correct 13 ms 5504 KB Output is correct
22 Correct 13 ms 5504 KB Output is correct
23 Correct 13 ms 5504 KB Output is correct
24 Correct 12 ms 4992 KB Output is correct
25 Correct 13 ms 5504 KB Output is correct
26 Correct 13 ms 5504 KB Output is correct
27 Correct 13 ms 5504 KB Output is correct
28 Correct 13 ms 5504 KB Output is correct
29 Correct 488 ms 96888 KB Output is correct
30 Correct 511 ms 100344 KB Output is correct
31 Correct 510 ms 101880 KB Output is correct
32 Correct 501 ms 101892 KB Output is correct
33 Correct 429 ms 89208 KB Output is correct
34 Correct 512 ms 102108 KB Output is correct
35 Correct 668 ms 117584 KB Output is correct
36 Correct 561 ms 111984 KB Output is correct
37 Correct 642 ms 117672 KB Output is correct