Submission #213396

#	Time	Username	Problem	Language	Result	Execution time	Memory
213396		popovicirobert	Hamburg Steak (JOI20_hamburg)	C++14	6 / 100	3088 ms	3576 KiB

hamburg

#include <bits/stdc++.h>
#define lsb(x) (x & (-x))
#define ll long long
#define ull unsigned long long
#define uint unsigned int


using namespace std;

const int INF = (int) 2e9;

struct Rect {
	int x1, y1, x2, y2;
	Rect(int _x1 = -INF, int _y1 = -INF, int _x2 = INF, int _y2 = INF) : x1(_x1), y1(_y1), x2(_x2), y2(_y2) {}
	bool ok() {
		return x1 <= x2 && y1 <= y2;
	}
};

inline Rect inter(Rect a, Rect b) {
	return Rect(max(a.x1, b.x1), max(a.y1, b.y1), min(a.x2, b.x2), min(a.y2, b.y2));
}

int main() {
#ifdef HOME
    ifstream cin("A.in");
    ofstream cout("A.out");
#endif
    int i, n, k;
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);

    cin >> n >> k;
    vector<Rect> r(n);
    for(i = 0; i < n; i++) {
    	cin >> r[i].x1 >> r[i].y1 >> r[i].x2 >> r[i].y2;
    }

    mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
    while(true) {
    	shuffle(r.begin(), r.end(), rng);
    	vector<pair<int, int>> sol;
    	vector<bool> vis(n);
    	for(int j = 0; j < k; j++) {
    		Rect cur;
    		for(i = 0; i < n; i++) {
    			if(vis[i] == 0) {
    				if(inter(cur, r[i]).ok()) {
    					cur = inter(cur, r[i]);
    					vis[i] = 1;
    				}
    			}
    		}
    		sol.push_back({cur.x1, cur.y1});
    	}
    	if(count(vis.begin(), vis.end(), 1) == n) {
    		int sz = (int)sol.size();
    		for(i = 0; i < k; i++) {
    			cout << sol[i % sz].first << " " << sol[i % sz].second << "\n";
    		}
    		return 0;
    	}
    }

    return 0;
}

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