Submission #1359092

#TimeUsernameProblemLanguageResultExecution timeMemory
1359092chithanhnguyenGrid Coloring (JOI25_ho_t1)C++20
100 / 100
356 ms42712 KiB
/*
Author: Nguyen Chi Thanh - High School for the Gifted - VNU.HCM (i2528)
*/
#include <bits/stdc++.h>
using namespace std;

/* START OF TEMPALTE */

// #define int long long
#define ll long long
#define ull unsigned long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second
#define popcount __builtin_popcountll
#define all(x) (x).begin(), (x).end()
#define BIT(x, i) (((x) >> (i)) & 1)
#define MASK(x) (1ll << (x))
#define SZ(a) ((int32_t)a.size())

#define debug(a, l, r) {for (int _i = (l); _i <= (r); ++_i) cout << (a)[_i] << ' '; cout << '\n';}

template<class X, class Y>
bool minimize(X &x, const Y &y) {
    if (x > y) {
        x = y;
        return true;
    } else return false;
}

template<class X, class Y>
bool maximize(X &x, const Y &y) {
    if (x < y) {
        x = y;
        return true;
    } else return false;
}

/* END OF TEMPALTE */

struct DS {
    int n;
    vector<int> prefmx;
    map<int, int> cnt;

    DS(int _n, vector<int> &a) : n(_n) {
        prefmx.resize(n + 5, 0);
        for (int i = 1; i <= n; ++i) {
            prefmx[i] = max(prefmx[i - 1], a[i]);
            cnt[prefmx[i]]++;
        }
    }

    int getcnt(int x) {
        if (!cnt.count(x)) return 0;
        return cnt[x];
    }

    int cntsmaller(int x) {
        int p = lower_bound(begin(prefmx) + 1, begin(prefmx) + n + 1, x) - begin(prefmx) - 1;
        return p;
    }
};

void solve() {
    int n; cin >> n;
    vector<int> a(n + 5), b(n + 5);
    vector<int> vals;
    map<int, int> mp;
    int corner = 0;

    for (int i = 0; i < n; ++i) {
        if (i == 0) cin >> corner;
        else {
            cin >> a[i];
            vals.push_back(a[i]);
            mp[a[i]]++;
        }
    }

    for (int i = 0; i < n; ++i) {
        if (i == 0) cin >> corner;
        else {
            cin >> b[i];
            vals.push_back(b[i]);
            mp[b[i]]++;
        }
    }

    vals.push_back(corner); --n;
    sort(all(vals));
    vals.erase(unique(all(vals)), end(vals));

    DS dsa(n, a), dsb(n, b);

    int opt_val = -1; ll freq = -1;
    for (auto v : vals) {
        ll cnt = 0;
        cnt += 1ll * dsa.getcnt(v) * dsb.cntsmaller(v);
        cnt += 1ll * dsb.getcnt(v) * dsa.cntsmaller(v);
        cnt += 1ll * dsa.getcnt(v) * dsb.getcnt(v);
        cnt += mp[v];
        cnt += (int)(corner == v);

        if (freq == -1 || cnt >= freq) {
            freq = cnt;
            opt_val = v;
        }
    }

    cout << opt_val << ' ' << freq;
}

signed main() {
    #ifdef NCTHANH
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    #endif
    ios_base::sync_with_stdio(0);
    cin.tie(nullptr); cout.tie(nullptr);

    solve();

    return 0;
}
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...