Submission #936499

#	Time	Username	Problem	Language	Result	Execution time	Memory
936499		Marco_Escandon	The Kingdom of JOIOI (JOI17_joioi)	C++11	60 / 100	3868 ms	262144 KiB

joioi

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<vector<ll>> rotate_matrix(vector<vector<ll>> cad)
{
    vector<vector<ll>> sol(cad[0].size(),vector<ll>(cad.size(),0));
    for (int i = 0; i < cad.size(); ++i) {
        for (int j = 0; j < cad[0].size(); ++j) {
            sol[j][cad.size() - 1 - i] = cad[i][j];
        }
    }
    return sol;
}
int main()
{
    ll n,m;
    cin>>n>>m;
    vector<vector<ll>> cad(n+2,vector<ll>(m+2,0));
    for(int i=1; i<=n; i++)
        for(int j=1; j<=m; j++)
            cin>>cad[i][j];
    ll bs=1e19;
    for(int zxcv=0; zxcv<4; zxcv++)
    {
        n=cad.size();m=cad[0].size();
        vector<vector<pair<ll,ll>>> t(n,vector<pair<ll,ll>>(m,{0,1e15}));
        vector<pair<ll,ll>> sol;
        multiset<ll> s;
        for(int i=1; i<n-1; i++)
        {
            for(int j=1; j<m-1; j++)
            {
                t[i][j]={cad[i][j],cad[i][j]};
                s.insert(cad[i][j]);
                /*t[i][j].first=max(t[i][j].first,t[i][j-1].first);
                t[i][j].first=max(t[i][j].first,t[i-1][j].first);*/
                t[i][j].second=min(t[i][j].second,t[i][j-1].second);
                t[i][j].second=min(t[i][j].second,t[i-1][j].second);
                sol.push_back(t[i][j]);
            }
        }
        sort(sol.begin(),sol.end());
        reverse(sol.begin(),sol.end());
        ll mini=sol[0].first;
        for(int i=0; i<sol.size()-1; i++)
        {
            if(i>0)
            {
                //sol[i].first=max(sol[i].first,sol[i-1].first);
                sol[i].second=min(sol[i].second,sol[i-1].second);
            }
            mini=min(mini,sol[i].second);
            auto it = s.find(sol[i].first);
            if (it != s.end()) {
                s.erase(it);
            }
            if(s.size()!=0)
            {
                int mayor = *s.rbegin();
                //cout<<mini<<sol[i].first<<" "<<sol.back().first<<mayor<<"\n";
                bs=min(max(sol[0].first-mini,mayor-sol.back().first),bs);
            }
        }
        cad=rotate_matrix(cad);
        //cout<<bs<<"\n\n";
    }
    cout<<bs;
}

Compilation message (stderr)

joioi.cpp: In function 'std::vector<std::vector<long long int> > rotate_matrix(std::vector<std::vector<long long int> >)':
joioi.cpp:7:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    7 |     for (int i = 0; i < cad.size(); ++i) {
      |                     ~~^~~~~~~~~~~~
joioi.cpp:8:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    8 |         for (int j = 0; j < cad[0].size(); ++j) {
      |                         ~~^~~~~~~~~~~~~~~
joioi.cpp: In function 'int main()':
joioi.cpp:22:11: warning: overflow in conversion from 'double' to 'll' {aka 'long long int'} changes value from '1.0e+19' to '9223372036854775807' [-Woverflow]
   22 |     ll bs=1e19;
      |           ^~~~
joioi.cpp:45:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |         for(int i=0; i<sol.size()-1; i++)
      |                      ~^~~~~~~~~~~~~

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