oj.uz

Submission #670462

# Submission time Handle Problem Language Result Execution time Memory
670462 2022-12-09T07:43:42 Z radal The Kingdom of JOIOI (JOI17_joioi) C++17
60 / 100
 4000 ms 196948 KB 
#include <bits/stdc++.h>
#pragma GCC target("sse,sse2,avx2")
#pragma GCC optimize("unroll-loops,O2")
#define rep(i,l,r) for (int i = l; i < r; i++)
#define repr(i,r,l) for (int i = r; i >= l; i--)
#define X first
#define Y second
#define all(x) (x).begin() , (x).end()
#define pb push_back
#define endl '\n'
#define debug(x) cerr << #x << " : " << x << endl;
using namespace std;
typedef long long ll;
typedef pair<int,int> pll;
constexpr int N = 2e3+10,mod = 1e9+7,maxm = 210;
constexpr ll inf = 1e9+10;
inline int mkay(int a,int b){
    if (a+b >= mod) return a+b-mod;
   // if (a+b < 0) return a+b+mod;
    return a+b;
}
 
inline int poww(int a,int k){
    if (k < 0) return 0;
    int z = 1;
    while (k){
        if (k&1) z = 1ll*z*a%mod;
        a = 1ll*a*a%mod;
        k >>= 1;
    } 
    return z; 
}
 

int h,w,l[N];
int a[N][N],b[N][N];
int ans,sz,mi;
bool on[N][N];
multiset<int> st;
vector<pll> ve;

bool cmp(pll q,pll p){
	return (a[p.X][p.Y] > a[q.X][q.Y]);
}

void rlx(int x){
	if (l[x] == l[x+1] || !on[x][l[x]+1]) return;
	while (l[x] < l[x+1] && on[x][l[x]+1]){
		l[x]++;
		st.erase(st.find(a[x][l[x]]));
	}
	if (x) rlx(x-1);
}

void rst(){
	st.clear();
	rep(i,1,h+1){
		l[i] = 0;
		rep(j,1,w+1){
			a[i][j] = b[i][j];
			st.insert(a[i][j]);
			on[i][j] = 0;
		}
	}
}

void calc(){
    rep(i,0,sz-1){
        int x = ve[i].X,y = ve[i].Y;
        if (a[x][y]-mi >= ans) break;
        on[x][y] = 1;
        rlx(x);
        if ((int)st.size() == sz) continue;
        ans = min(ans,max(a[x][y]-mi,(*st.rbegin())-(*st.begin())));
    }
}

int main(){
	ios :: sync_with_stdio(0); cin.tie(0); 
	cin >> h >> w;
	rep(i,1,h+1){
		rep(j,1,w+1){
			cin >> a[i][j];
			b[i][j] = a[i][j];
			st.insert(a[i][j]);
			ve.pb({i,j});
		}
	}
	l[h+1] = w;
	ans = (*st.rbegin())-(*st.begin());
	sort(all(ve),cmp);
	sz = h*w;
	mi = a[ve[0].X][ve[0].Y];

	calc();
	rst(); 

	rep(i,1,h+1){
		if (h-i+1 <= i) break;
		rep(j,1,w+1)
			swap(a[i][j],a[h-i+1][j]);
	}
	sort(all(ve),cmp);

	calc();
	rst();

	rep(j,1,w+1){
		if (w-j+1 <= j) break;
		rep(i,1,h+1)
			swap(a[i][j],a[i][w-j+1]);
	}

	sort(all(ve),cmp);

	calc();
	rst();

    rep(i,1,h+1){
        if (h-i+1 <= i) break;
        rep(j,1,w+1)
            swap(a[i][j],a[h-i+1][j]);
    }
    rep(j,1,w+1){
        if (w-j+1 <= j) break;
        rep(i,1,h+1)
            swap(a[i][j],a[i][w-j+1]);
    }

	sort(all(ve),cmp); 

	calc();
	cout << ans << endl;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 324 KB Output is correct

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 324 KB Output is correct
15 Correct 2 ms 596 KB Output is correct
16 Correct 42 ms 4680 KB Output is correct
17 Correct 69 ms 5028 KB Output is correct
18 Correct 60 ms 5068 KB Output is correct
19 Correct 66 ms 5000 KB Output is correct
20 Correct 59 ms 4556 KB Output is correct
21 Correct 75 ms 5068 KB Output is correct
22 Correct 65 ms 5068 KB Output is correct
23 Correct 74 ms 5172 KB Output is correct
24 Correct 53 ms 4524 KB Output is correct
25 Correct 70 ms 4992 KB Output is correct
26 Correct 63 ms 5068 KB Output is correct
27 Correct 73 ms 5080 KB Output is correct
28 Correct 72 ms 5060 KB Output is correct

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 324 KB Output is correct
15 Correct 2 ms 596 KB Output is correct
16 Correct 42 ms 4680 KB Output is correct
17 Correct 69 ms 5028 KB Output is correct
18 Correct 60 ms 5068 KB Output is correct
19 Correct 66 ms 5000 KB Output is correct
20 Correct 59 ms 4556 KB Output is correct
21 Correct 75 ms 5068 KB Output is correct
22 Correct 65 ms 5068 KB Output is correct
23 Correct 74 ms 5172 KB Output is correct
24 Correct 53 ms 4524 KB Output is correct
25 Correct 70 ms 4992 KB Output is correct
26 Correct 63 ms 5068 KB Output is correct
27 Correct 73 ms 5080 KB Output is correct
28 Correct 72 ms 5060 KB Output is correct
29 Execution timed out 4078 ms 196948 KB Time limit exceeded
30 Halted 0 ms 0 KB -