제출 #915322

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
915322		bachhoangxuan	함박 스테이크 (JOI20_hamburg)	C++17	21 / 100	3097 ms	14488 KiB

hamburg

// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/

#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<int,pii>
#define mpp make_pair
#define fi first
#define se second
const int inf=1e18;
const int mod=998244353;
const int maxn=200005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=1000005;
const int maxl=25;
const int maxa=1000000;
const int root=3;
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
const int base=131;

const ld eps = 1e-10;

struct Rec{
    int x,y,u,v;
    Rec(int x=0,int y=0,int u=0,int v=0):x(x),y(y),u(u),v(v){}
    friend Rec operator+(Rec a,Rec b){
        return Rec(max(a.x,b.x),max(a.y,b.y),min(a.u,b.u),min(a.v,b.v));
    }
    int area(){
        if(x>u || y>v) return 0;
        else return (u-x+1)*(v-y+1);
    }
};

int n,k;
Rec p[maxn];

int rand_int(int l,int r){
    return l+(int)(rng()%(r-l+1));
}

void solve(){
    cin >> n >> k;
    for(int i=1;i<=n;i++) cin >> p[i].x >> p[i].y >> p[i].u >> p[i].v;
    vector<Rec> res;
    auto cal = [&](){
        res.clear();
        set<int> s;
        for(int i=0;i<k;i++){
            int id=rand_int(1,n);
            while(s.find(id)!=s.end()) id=rand_int(1,n);
            s.insert(id);
            res.push_back(p[id]);
        }
        for(int i=1;i<=n;i++){
            if(s.find(i)!=s.end()) continue;
            ld d=0;
            int t=-1;
            for(int j=0;j<k;j++){
                ld cc=(ld)(res[j]+p[i]).area()/res[j].area();
                if(cc>d+eps) d=cc,t=j;
            }
            if(t==-1) return false;
            res[t]=res[t]+p[i];
        }
        return true;
    };
    while(!cal());
    for(auto c:res) cout << c.x << ' ' << c.y << '\n';
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

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