Submission #985982

#	Time	Username	Problem	Language	Result	Execution time	Memory
985982		GrindMachine	Hamburg Steak (JOI20_hamburg)	C++17	1 / 100	882 ms	1048576 KiB

hamburg

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

void solve(int test_case)
{
    ll n,k; cin >> n >> k;
    vector<array<ll,4>> a(n+5);
    rep1(i,n) rep(j,4) cin >> a[i][j];

    vector<ll> b1,b2;
    rep1(i,n){
        auto [l,d,r,u] = a[i];
        b1.pb(l), b1.pb(r+1);
        b2.pb(d), b2.pb(u+1);
    }

    b1.pb(0), b2.pb(0);
    sort(all(b1));
    sort(all(b2));
    b1.resize(unique(all(b1))-b1.begin());
    b2.resize(unique(all(b2))-b2.begin());

    rep1(i,n){
        auto &[l,d,r,u] = a[i];
        l = lower_bound(all(b1),l)-b1.begin();
        d = lower_bound(all(b2),d)-b2.begin();
        r = lower_bound(all(b1),r+1)-b1.begin();
        u = lower_bound(all(b2),u+1)-b2.begin();
    }

    ll siz1 = sz(b1), siz2 = sz(b2);
    ll p[siz1+5][siz2+5];
    vector<bool> done(n+5);
    vector<pll> ans;

    rep1(iter,k){
        memset(p,0,sizeof p);
        rep1(i,n){
            if(done[i]) conts;
            auto [r1,c1,r2,c2] = a[i];
            p[r1][c1]++;
            p[r1][c2]--;
            p[r2][c1]--;
            p[r2][c2]++;
        }

        rep1(i,siz1){
            rep1(j,siz2){
                p[i][j] += p[i-1][j]+p[i][j-1]-p[i-1][j-1];
            }
        }

        array<ll,3> best = {-1,-1,-1};
        rep1(i,siz1){
            rep1(j,siz2){
                array<ll,3> ar = {p[i][j],i,j};
                amax(best,ar);
            }
        }

        ans.pb({b1[best[1]],b2[best[2]]});

        rep1(i,n){
            if(done[i]) conts;
            auto [r1,c1,r2,c2] = a[i];
            if(r1 <= best[1] and best[1] < r2 and c1 <= best[2] and best[2] < c2){
                done[i] = 1;
            }
        }
    }

    assert(count(all(done),1) == n);

    for(auto [x,y] : ans){
        cout << x << " " << y << endl;
    }
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

• Subtask 1: 1 / 1
• Subtask 2: 0 / 1
• Subtask 3: 0 / 3
• Subtask 4: 0 / 6
• Subtask 5: 0 / 1
• Subtask 6: 0 / 3
• Subtask 7: 0 / 6
• Subtask 8: 0 / 79