oj.uz

답안 #481125

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
481125 2021-10-19T14:07:30 Z Lobo The Kingdom of JOIOI (JOI17_joioi) C++17
60 / 100
 3386 ms 262144 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 2200

ii n, m, a[maxn][maxn];
map<ii,vector<pair<ii,ii>>> val;
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;

    for(ii i = 1; i <= n; i++) {
        for(ii j = 1; j <= m; j++) {
            cin >> a[i][j];
            val[a[i][j]].pb(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;

    for(auto x : val) {
        pq.pb(mp(mp(x.fr-mn,0),x.sc));
        pq.pb(mp(mp(mx-x.fr,1),x.sc));
    }

    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) {
        ii mid = (l+r)/2;
        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 >= mid; i++) {
            ii tp = pq[i].fr.sc;

            for(auto x : pq[i].sc) {
                if(tp == 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 mid quero abaixar o mid
            ans1 = mid-1;
            r = mid-1;
        }
        else {
            l = mid+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) {
        ii mid = (l+r)/2;
        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 >= mid; i++) {
            ii tp = pq[i].fr.sc;

            for(auto x : pq[i].sc) {
                if(tp == 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 mid quero abaixar o mid
            ans2 = mid-1;
            r = mid-1;
        }
        else {
            l = mid+1;
        }
    }

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

}

Compilation message

joioi.cpp: In function 'int main()':
joioi.cpp:69: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]
   69 |         for(ii i = 0; i < pq.size() && pq[i].fr.fr >= mid; i++) {
      |                       ~~^~~~~~~~~~~
joioi.cpp:106: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]
  106 |     for(ii i = 0; i < pq.size(); i++) {
      |                   ~~^~~~~~~~~~~
joioi.cpp:121: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]
  121 |         for(ii i = 0; i < pq.size() && pq[i].fr.fr >= mid; i++) {
      |                       ~~^~~~~~~~~~~
joioi.cpp:112:8: warning: 'ans2' may be used uninitialized in this function [-Wmaybe-uninitialized]
  112 |     ii ans2;
      |        ^~~~
joioi.cpp:60:8: warning: 'ans1' may be used uninitialized in this function [-Wmaybe-uninitialized]
   60 |     ii ans1;
      |        ^~~~

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 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 1 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 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 1 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 4 ms 2252 KB Output is correct
17 Correct 38 ms 11956 KB Output is correct
18 Correct 50 ms 11868 KB Output is correct
19 Correct 41 ms 11896 KB Output is correct
20 Correct 33 ms 11324 KB Output is correct
21 Correct 45 ms 12228 KB Output is correct
22 Correct 51 ms 12180 KB Output is correct
23 Correct 46 ms 12212 KB Output is correct
24 Correct 45 ms 11556 KB Output is correct
25 Correct 44 ms 12088 KB Output is correct
26 Correct 40 ms 12104 KB Output is correct
27 Correct 44 ms 12128 KB Output is correct
28 Correct 41 ms 12132 KB Output is correct

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 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 1 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 4 ms 2252 KB Output is correct
17 Correct 38 ms 11956 KB Output is correct
18 Correct 50 ms 11868 KB Output is correct
19 Correct 41 ms 11896 KB Output is correct
20 Correct 33 ms 11324 KB Output is correct
21 Correct 45 ms 12228 KB Output is correct
22 Correct 51 ms 12180 KB Output is correct
23 Correct 46 ms 12212 KB Output is correct
24 Correct 45 ms 11556 KB Output is correct
25 Correct 44 ms 12088 KB Output is correct
26 Correct 40 ms 12104 KB Output is correct
27 Correct 44 ms 12128 KB Output is correct
28 Correct 41 ms 12132 KB Output is correct
29 Correct 3088 ms 163076 KB Output is correct
30 Correct 2980 ms 158284 KB Output is correct
31 Correct 3122 ms 149480 KB Output is correct
32 Correct 3223 ms 155756 KB Output is correct
33 Correct 2539 ms 149344 KB Output is correct
34 Correct 3097 ms 148724 KB Output is correct
35 Runtime error 3386 ms 262144 KB Execution killed with signal 9
36 Halted 0 ms 0 KB -