제출 #1288261

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1288261		Faisal_Saqib	The Kingdom of JOIOI (JOI17_joioi)	C++20	15 / 100	4094 ms	2156 KiB

joioi

/* 
    VENI VIDI VICI
*/

// #pragma GCC optimize("Ofast","unroll-all-loops","fast-math","no-stack-protector","give-no-*****")
#include <bits/stdc++.h>
// #include <iostream>
// #include <vector>
// #include <algorithm>
// #include <set>
// #include <map>

using namespace std;
#define fi first
#define se second
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()

#define rep(i,x, n) for (int i = (x); i < (n); ++i)
#define repr(i,x, n) for (int i = (n) - 1; i >= (x); --i)
mt19937 RNG(chrono::steady_clock::now().time_since_epoch().count());  
// #define sum accumulate

//using i128 = __int128;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using str = string;
using pi = pair<int, int>;
using pl = pair<ll, ll>;

using vi = vector<int>;
using vl = vector<ll>;
using vpi = vector<pair<int, int>>;
using vvi = vector<vi>;
using sll = set<ll>;

template<class T>
istream& operator>>(istream& is, vector<T>& v) {
    for(auto &i:v) is>>i;
    return is;
}
template<class T1,class T2>
istream& operator>>(istream& is, pair<T1,T2>& p) {
    is>>p.fi>>p.se;
    return is;
}
template<class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
    for(const auto &i:v) os<<i<<' ';
    return os;
}
template<class T1,class T2>
ostream& operator<<(ostream& os, const pair<T1,T2>& p) {
    os<<p.fi<<' '<<p.se; return os;
}
void pyn(bool x)
{
    cout<<(x?"YES":"NO")<<endl;
}
void pYN(bool x)
{
    cout<<(x?"Yes":"No")<<endl;
}
void pAB(bool x)
{
    cout<<(x?"Alice":"Bob")<<endl;
}
ll powmod(ll a,ll b,ll modulo)
{
  if(b==0){
    return 1;
  }
  ll temp=powmod(a,b/2,modulo);
  if(b%2==0){
    return (temp*temp)%modulo;
  }
  else{
    return (a*((temp*temp)%modulo))%modulo;
  }
}
bool Prime(ll n){
    for (ll i = 2; i*i <= n; i++)
        if (n % i == 0)
            return false;
    return (n>1);
}
void readIO() {
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
}

void solve();

int main() {
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    // readIO();

    int uwu=1;

    // cin>>uwu;

    for(int tc=1;tc<=uwu;tc++) {
        // cout<<"Case #"<<tc<<": ";
        solve();
    }
    return 0;
}
const int N=1000;
int g[N][N],n,m,stp[N][N];
int getval()
{
    int ans=2e9;
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<m;j++)
        {
            int mx=-2e9,mi=2e9;
            int mx2=-2e9,mi2=2e9;
            int lp=m;
            for(int r=0;r<=i;r++)
            {
                for(int c=0;c<=j;c++)
                {
                    mx=max(mx,g[r][c]);
                    mi=min(mi,g[r][c]);             
                }
            }
            // cout<<"For "<<i<<' '<<j<<' '<<mx<<' '<<mi<<endl;
            for(int r=0;r<n;r++)
            {
                for(int c=0;c<lp;c++)
                {
                    if(r<=i and c<=j)
                    {
                        mx=max(mx,g[r][c]);
                        mi=min(mi,g[r][c]);
                    }
                    else if(mi<=g[r][c] and g[r][c]<=mx)
                    {
                        mx=max(mx,g[r][c]);
                        mi=min(mi,g[r][c]);                        
                    }
                    else
                    {
                        for(int cp=c;cp<m;cp++)
                        {
                            mi2=min(g[r][cp],mi2);
                            mx2=max(mx2,g[r][cp]);
                        }
                        lp=c;
                        break;
                    }
                }
                for(int cp=lp;cp<m;cp++){
                    mi2=min(g[r][cp],mi2);
                    mx2=max(mx2,g[r][cp]);
                }
            }
            if(mi2!=2e9 and mi!=2e9)
            {
                ans=min(ans,max(mx2-mi2,mx-mi));
            }
        }
    }
    return ans;
}
void rotate()
{
  for(int i=0;i<n;i++)
  {
    for(int j=0;j<m;j++)
    {
      stp[i][j]=g[i][j];
    }
  }
  swap(n,m);
  for(int i=0;i<n;i++)
  {
    for(int j=0;j<m;j++)
    {
      g[i][j]=stp[j][i];
    }
  }
  for(int i=0;i<n;i++)
  {
    reverse(g[i],g[i]+m);
  }
}
void solve()
{
    cin>>n>>m;
    // swap(n,m);
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<m;j++)
        {
            cin>>g[i][j];
            stp[i][j]=g[i][j];
        }
    }
  //   swap(n,m);
  // for(int i=0;i<n;i++)
  // {
  //   for(int j=0;j<m;j++)
  //   {
  //     g[i][j]=stp[j][i];
  //   }
  // }
    // swap(n,m);
    int cur=2e9;
    for(int i=0;i<4;i++)
    {
      rotate();
      cur=min(cur,getval());
    }
    // cout<<endl;
    cout<<cur<<endl;
}

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

joioi.cpp: In function 'void readIO()':
joioi.cpp:90:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   90 |     freopen("input.txt", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
joioi.cpp:91:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   91 |     freopen("output.txt", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 15 / 15
• Subtask 2: 0 / 45
• Subtask 3: 0 / 40