oj.uz

Submission #936500

# Submission time Handle Problem Language Result Execution time Memory
936500 2024-03-02T02:37:18 Z Marco_Escandon The Kingdom of JOIOI (JOI17_joioi) C++11
60 / 100
 3907 ms 262144 KB 
#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].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].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)
            {
                ll mayor = *s.rbegin();
                bs=min(max(sol[0].first-mini,mayor-sol.back().first),bs);
            }
        }
        cad=rotate_matrix(cad);
        //cout<<bs<<"\n\n";
    }
    cout<<bs;
}

Compilation message

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:20:11: warning: overflow in conversion from 'double' to 'll' {aka 'long long int'} changes value from '1.0e+19' to '9223372036854775807' [-Woverflow]
   20 |     ll bs=1e19;
      |           ^~~~
joioi.cpp:41: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]
   41 |         for(int i=0; i<sol.size()-1; i++)
      |                      ~^~~~~~~~~~~~~

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 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 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 1 ms 504 KB Output is correct

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 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 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 1 ms 504 KB Output is correct
15 Correct 2 ms 604 KB Output is correct
16 Correct 37 ms 3908 KB Output is correct
17 Correct 51 ms 3932 KB Output is correct
18 Correct 49 ms 4324 KB Output is correct
19 Correct 53 ms 4576 KB Output is correct
20 Correct 45 ms 3792 KB Output is correct
21 Correct 63 ms 4096 KB Output is correct
22 Correct 52 ms 4052 KB Output is correct
23 Correct 53 ms 4048 KB Output is correct
24 Correct 46 ms 3808 KB Output is correct
25 Correct 53 ms 4068 KB Output is correct
26 Correct 53 ms 4184 KB Output is correct
27 Correct 57 ms 4440 KB Output is correct
28 Correct 54 ms 4184 KB Output is correct

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 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 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 1 ms 504 KB Output is correct
15 Correct 2 ms 604 KB Output is correct
16 Correct 37 ms 3908 KB Output is correct
17 Correct 51 ms 3932 KB Output is correct
18 Correct 49 ms 4324 KB Output is correct
19 Correct 53 ms 4576 KB Output is correct
20 Correct 45 ms 3792 KB Output is correct
21 Correct 63 ms 4096 KB Output is correct
22 Correct 52 ms 4052 KB Output is correct
23 Correct 53 ms 4048 KB Output is correct
24 Correct 46 ms 3808 KB Output is correct
25 Correct 53 ms 4068 KB Output is correct
26 Correct 53 ms 4184 KB Output is correct
27 Correct 57 ms 4440 KB Output is correct
28 Correct 54 ms 4184 KB Output is correct
29 Runtime error 3907 ms 262144 KB Execution killed with signal 9
30 Halted 0 ms 0 KB -