oj.uz

답안 #958494

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
958494 2024-04-05T22:25:10 Z shadow_sami The Kingdom of JOIOI (JOI17_joioi) C++17
100 / 100
 1627 ms 70760 KB 
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef pair<ll,ll> pi;
typedef map<ll,ll> mi;
typedef long double ld;
typedef vector<ld> vd;
typedef vector<vector<ld>> vvd;
typedef pair<ld,ld> pd;
#define ff first
#define ss second
#define srt(a) sort(a.begin(),a.end());
#define fip(k, n) for (ll i = k; i < n; i++)
#define fjp(k, n) for (ll j = k; j < n; j++)
#define fin(k, n) for (ll i = k; i >= n; i--)
#define fjn(k, n) for (ll j = k; j >= n; j--)
#define fp(k, n, m) for (ll k = n; k < m; k++)
#define fn(k, n, m) for (ll k = n; k >= m; k--)
#define ordered_set tree<pi, null_type,less< pi >, rb_tree_tag,tree_order_statistics_node_update>
#define totalOne(n) __builtin_popcount(n)
#define backZero(n) __builtin_ctzll(n)
#define frontZero(n) __builtin_clzll(n)
#define fx(k) for ( auto x : k )
#define test ll t;cin >> t;while (t--)
#define nli "\n"

// ==========================(debug)============================================================================================== //

#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x <<" "; _printn(x); cerr << nli;
#else
#define debug(x)
#endif

void _printn(ll x){ cerr<<x<<" "; }
void _printn(int x){ cerr<<x<<" "; }
void _printn(ld x){ cerr<<x<<" "; }
void _printn(double x){ cerr<<x<<" "; }
void _printn(string x){ cerr<<x<<" "; }
void _printn(char x){ cerr<<x<<" "; }
void _printn(bool x){ cerr<<x<<" "; }
template<class T,class V>void _printn(pair<T,V> vv);
template<class T> void _printn(vector<T> vv);
template<class T> void _printn(set<T> vv);
template<class T,class V> void _printn(map<T,V> vv);
template<class T> void _printn(multiset<T> vv);
template<class T,class V>void _printn(pair<T,V> vv){ cerr<<"( ";_printn(vv.ff);cerr<<",";_printn(vv.ss);cerr<<")";}
template<class T> void _printn(vector<T> vv){ cerr<<"[ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"]"; };
template<class T> void _printn(set<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T> void _printn(multiset<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T,class V> void _printn(map<T,V> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };

// ==========================(debug)============================================================================================== //

ll n,m,tp,tp2,res,cnt,sum,tptp,ans;
const ll mx = 2e3+5;
const ll mod = 1e9+7;

// ==========================(MOD)=============================================================================================== //

ll mod_add(ll aa,ll bb){ return ((aa%mod)+(bb%mod))%mod; }
ll mod_minus(ll aa,ll bb){ return (((aa%mod)-(bb%mod))+10*mod)%mod; }
ll mod_mul(ll aa,ll bb){ return ((aa%mod)*(bb%mod))%mod; }
ll mod_power(ll aa,ll bb){ aa%=mod; ll empowered = 1; bb%=mod-1; while(bb > 0){ if(bb & 1) empowered = mod_mul(empowered,aa); bb = bb >> 1; aa = mod_mul(aa,aa); } return empowered; }
ll mod_divi(ll aa,ll bb){ aa=mod_mul(aa,mod_power(bb,mod-2)); return aa; }

// ==========================(MOD)=============================================================================================== //

bool f = false;
// ll n,m;
ll a[mx][mx];
ll l,r,mid,pt;

bool meow(ll x){
	tptp = 0;
	fip(0,n){
		fjp(0,m){
			if(tp2 - a[i][j] > x)
				tptp = max(j+1,tptp);
		}
		fjp(0,m){
			if(a[i][j] - tp > x)
				if(j < tptp)
					return 0;
		}
	}
	return 1;
}
ll get(){
	l = 0;
	r = tp2 - tp;
	pt = 1e18;
	while(l<=r){
		mid = l + (r-l) / 2;
		if(meow(mid)){
			pt = mid;
			r = mid - 1;
		}else
			l = mid + 1;
	}
	return pt;
}
void cng(){
	fip(0,(n>>1))
		fjp(0,m)
			swap(a[i][j],a[n-i-1][j]);
	return;
}
void lpg(){
	fip(0,n)
		fjp(0,(m>>1))
			swap(a[i][j],a[i][m-j-1]);
	return;
}

int main(){
    // ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    // #ifndef ONLINE_JUDGE
    //     freopen("input1.txt", "r", stdin);
    //     freopen("output1.txt", "w", stdout);
    //     freopen("error1.txt", "w", stderr);
    // #endif // ONLINE_JUDGE

        cin>>n>>m;
        tp = 1e18;
        tp2 = -1e18;
        fip(0,n)
        	fjp(0,m){
        		cin>>a[i][j];
        		tp = min(a[i][j],tp);
        		tp2 = max(a[i][j],tp2);
        	}
        ans = 1e18;
        ans = min(get(),ans);
        cng();
        ans = min(get(),ans);
        lpg();
        ans = min(get(),ans);
        cng();
        ans = min(get(),ans);
        cout<<ans<<nli;
        
    cerr << "Time elapsed: " << setprecision(6) << 1000.0 * clock() / CLOCKS_PER_SEC << "ms\n";
    return 0;
}

Subtask #1
15.0 / 15.0

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

Subtask #2
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 500 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 5 ms 4444 KB Output is correct
17 Correct 12 ms 4700 KB Output is correct
18 Correct 11 ms 4700 KB Output is correct
19 Correct 13 ms 4884 KB Output is correct
20 Correct 11 ms 4696 KB Output is correct
21 Correct 15 ms 4952 KB Output is correct
22 Correct 16 ms 4956 KB Output is correct
23 Correct 17 ms 4964 KB Output is correct
24 Correct 16 ms 4848 KB Output is correct
25 Correct 20 ms 5008 KB Output is correct
26 Correct 16 ms 4956 KB Output is correct
27 Correct 15 ms 4992 KB Output is correct
28 Correct 15 ms 4964 KB Output is correct

Subtask #3
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 500 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 5 ms 4444 KB Output is correct
17 Correct 12 ms 4700 KB Output is correct
18 Correct 11 ms 4700 KB Output is correct
19 Correct 13 ms 4884 KB Output is correct
20 Correct 11 ms 4696 KB Output is correct
21 Correct 15 ms 4952 KB Output is correct
22 Correct 16 ms 4956 KB Output is correct
23 Correct 17 ms 4964 KB Output is correct
24 Correct 16 ms 4848 KB Output is correct
25 Correct 20 ms 5008 KB Output is correct
26 Correct 16 ms 4956 KB Output is correct
27 Correct 15 ms 4992 KB Output is correct
28 Correct 15 ms 4964 KB Output is correct
29 Correct 834 ms 53452 KB Output is correct
30 Correct 851 ms 53340 KB Output is correct
31 Correct 1006 ms 55124 KB Output is correct
32 Correct 821 ms 54860 KB Output is correct
33 Correct 738 ms 49288 KB Output is correct
34 Correct 910 ms 54796 KB Output is correct
35 Correct 1461 ms 70760 KB Output is correct
36 Correct 1337 ms 65516 KB Output is correct
37 Correct 1627 ms 70444 KB Output is correct