oj.uz

Submission #481133

# Submission time Handle Problem Language Result Execution time Memory
481133 2021-10-19T14:29:05 Z Lobo The Kingdom of JOIOI (JOI17_joioi) C++17
60 / 100
 2368 ms 262148 KB 
#include <bits/stdc++.h>
 
using namespace std;

const long long INFll = (long long) 1e18 + 10;
const int INFii = (int) 1e9 + 10;
typedef long long ll;
typedef int ii;
typedef long double dbl;
#define endl '\n'
#define sc second
#define fr first
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()

#define maxn 2002

ii n, m, a[maxn][maxn];
pair<ii,ii> p[maxn];

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

    //freopen("in.in", "r", stdin);
    //freopen("out.out", "w", stdout);

    cin >> n >> m;

    ii mn = INFii;
    ii mx = 0;

    priority_queue<pair<ii,pair<ii,ii>>> val;
    for(ii i = 1; i <= n; i++) {
        for(ii j = 1; j <= m; j++) {
            cin >> a[i][j];
            val.push(mp(a[i][j],mp(i,j)));
            mn = min(mn,a[i][j]);
            mx = max(mx,a[i][j]);
        }
    }

    if(mn == mx) {
        cout << 0 << endl;
        return 0;
    }

    vector<pair<pair<ii,ii>,vector<pair<ii,ii>>>> pq;
    vector<pair<ii,ii>> vazio;

    ii ant = -1;
    while(val.size()) {
        if(val.top().fr != ant) {
            ant = val.top().fr;
            pq.pb(mp(mp(val.top().fr-mn,0),vazio));
            pq.pb(mp(mp(mx-val.top().fr,1),vazio));
        }
        else {
            pq[pq.size()-1].sc.pb(val.top().sc);
            pq[pq.size()-2].sc.pb(val.top().sc);
            val.pop();
        }
    }

    

    sort(all(pq), greater<pair<pair<ii,ii>,vector<pair<ii,ii>>>>());
    // com minimo na esquerda:

    ii l = 0;
    ii r = 1e9+1;
    ii ans1;

    while(l <= r) {
        for(ii i = 1; i <= n; i++) {
            p[i].fr = 0;
            p[i].sc = m+1;
        }

        for(ii i = 0; i < pq.size() && pq[i].fr.fr >= (l+r)/2; i++) {
            for(auto x : pq[i].sc) {
                if(pq[i].fr.sc == 1) { // tem que ta junto com o mn
                    p[x.fr].fr = max(p[x.fr].fr,x.sc);
                }
                else {
                    p[x.fr].sc = min(p[x.fr].sc,x.sc-1);
                }
            }
        }
    
        //ver se ta crescente/decrescente
        ii actc = 0; bool okc = 1;
        ii actd = m+1; bool okd = 1;

        for(ii i = 1; i <= n; i++) {
            actc = max(actc,p[i].fr);
            if(actc > p[i].sc || p[i].fr > p[i].sc) okc = 0;

            actd = min(actd,p[i].sc);
            if(actd < p[i].fr || p[i].fr > p[i].sc) okd = 0;
        }

        if(okc || okd) {
            //se deu bom com esse (l+r)/2 quero abaixar o (l+r)/2
            ans1 = (l+r)/2-1;
            r = (l+r)/2-1;
        }
        else {
            l = (l+r)/2+1;
        }
    }

    //com mx na esquerda

    for(ii i = 0; i < pq.size(); i++) {
        pq[i].fr.sc^= 1;
    }

    l = 0;
    r = 1e9+1;
    ii ans2;

    while(l <= r) {
        for(ii i = 1; i <= n; i++) {
            p[i].fr = 0;
            p[i].sc = m+1;
        }

        for(ii i = 0; i < pq.size() && pq[i].fr.fr >= (l+r)/2; i++) {
            for(auto x : pq[i].sc) {
                if(pq[i].fr.sc == 1) { // tem que ta junto com o mn
                    p[x.fr].fr = max(p[x.fr].fr,x.sc);
                }
                else {
                    p[x.fr].sc = min(p[x.fr].sc,x.sc-1);
                }
            }
        }
    
        //ver se ta crescente/decrescente
        ii actc = 0; bool okc = 1;
        ii actd = m+1; bool okd = 1;

        for(ii i = 1; i <= n; i++) {
            actc = max(actc,p[i].fr);
            if(actc > p[i].sc || p[i].fr > p[i].sc) okc = 0;

            actd = min(actd,p[i].sc);
            if(actd < p[i].fr || p[i].fr > p[i].sc) okd = 0;
        }

        if(okc || okd) {
            //se deu bom com esse (l+r)/2 quero abaixar o (l+r)/2
            ans2 = (l+r)/2-1;
            r = (l+r)/2-1;
        }
        else {
            l = (l+r)/2+1;
        }
    }

    cout << min(ans1,ans2) << endl;

}

Compilation message

joioi.cpp: In function 'int main()':
joioi.cpp:80:25: warning: comparison of integer expressions of different signedness: 'ii' {aka 'int'} and 'std::vector<std::pair<std::pair<int, int>, std::vector<std::pair<int, int> > > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   80 |         for(ii i = 0; i < pq.size() && pq[i].fr.fr >= (l+r)/2; i++) {
      |                       ~~^~~~~~~~~~~
joioi.cpp:115:21: warning: comparison of integer expressions of different signedness: 'ii' {aka 'int'} and 'std::vector<std::pair<std::pair<int, int>, std::vector<std::pair<int, int> > > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  115 |     for(ii i = 0; i < pq.size(); i++) {
      |                   ~~^~~~~~~~~~~
joioi.cpp:129:25: warning: comparison of integer expressions of different signedness: 'ii' {aka 'int'} and 'std::vector<std::pair<std::pair<int, int>, std::vector<std::pair<int, int> > > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  129 |         for(ii i = 0; i < pq.size() && pq[i].fr.fr >= (l+r)/2; i++) {
      |                       ~~^~~~~~~~~~~
joioi.cpp:121:8: warning: 'ans2' may be used uninitialized in this function [-Wmaybe-uninitialized]
  121 |     ii ans2;
      |        ^~~~
joioi.cpp:72:8: warning: 'ans1' may be used uninitialized in this function [-Wmaybe-uninitialized]
   72 |     ii ans1;
      |        ^~~~

Subtask #1
15.0 / 15.0

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

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 11 ms 2348 KB Output is correct
17 Correct 29 ms 7916 KB Output is correct
18 Correct 33 ms 7924 KB Output is correct
19 Correct 29 ms 7868 KB Output is correct
20 Correct 23 ms 7720 KB Output is correct
21 Correct 28 ms 7908 KB Output is correct
22 Correct 35 ms 7928 KB Output is correct
23 Correct 33 ms 7868 KB Output is correct
24 Correct 31 ms 7740 KB Output is correct
25 Correct 32 ms 7868 KB Output is correct
26 Correct 26 ms 7928 KB Output is correct
27 Correct 31 ms 7808 KB Output is correct
28 Correct 28 ms 7836 KB Output is correct

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 11 ms 2348 KB Output is correct
17 Correct 29 ms 7916 KB Output is correct
18 Correct 33 ms 7924 KB Output is correct
19 Correct 29 ms 7868 KB Output is correct
20 Correct 23 ms 7720 KB Output is correct
21 Correct 28 ms 7908 KB Output is correct
22 Correct 35 ms 7928 KB Output is correct
23 Correct 33 ms 7868 KB Output is correct
24 Correct 31 ms 7740 KB Output is correct
25 Correct 32 ms 7868 KB Output is correct
26 Correct 26 ms 7928 KB Output is correct
27 Correct 31 ms 7808 KB Output is correct
28 Correct 28 ms 7836 KB Output is correct
29 Correct 2206 ms 156164 KB Output is correct
30 Correct 2013 ms 148920 KB Output is correct
31 Correct 2368 ms 155488 KB Output is correct
32 Correct 2286 ms 166272 KB Output is correct
33 Correct 2229 ms 145268 KB Output is correct
34 Correct 2257 ms 154128 KB Output is correct
35 Runtime error 1504 ms 262148 KB Execution killed with signal 9
36 Halted 0 ms 0 KB -