oj.uz

Submission #260220

# Submission time Handle Problem Language Result Execution time Memory
260220 2020-08-09T20:01:19 Z shayan_p Hamburg Steak (JOI20_hamburg) C++14
21 / 100
 3000 ms 21552 KB 
// And you curse yourself for things you never done

#include<bits/stdc++.h>

#define F first
#define S second
#define PB push_back
#define sz(s) int((s).size())
#define bit(n,k) (((n)>>(k))&1)

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<pii, pii> rect;

const int maxn = 2e5 + 10, mod = 1e9 + 7, inf = 1e9;

rect operator & (rect a, rect b){
    return { {max(a.F.F, b.F.F), max(a.F.S, b.F.S)}, {min(a.S.F, b.S.F), min(a.S.S, b.S.S)} };
}
pii operator & (pii a, pii b){
    return {max(a.F, b.F), min(a.S, b.S)};
}
bool inside(rect a, pii b){
    return a.F.F <= b.F && b.F <= a.S.F && a.F.S <= b.S && b.S <= a.S.S;
}
bool emp(rect a){
    return a.F.F > a.S.F || a.F.S > a.S.S;
}
bool emp(pii a){
    return a.F > a.S;
}
    
    

rect big = { {1, 1}, {inf, inf} };

int choose_and_del(vector<pii> &v){
    if(v.empty())
	return 1;
    int x = v[0].S;
    for(pii p : v)
	x = min(x, p.S);
    vector<pii> v2;
    for(pii p : v){
	if(x < p.F)
	    v2.PB(p);
    }
    v = v2;
    return x;
}

bool ok(vector<rect> &inp, vector<pii> &ans){
    for(auto a : inp){
	bool is = 0;
	for(auto b : ans)
	    is|= inside(a, b);
	if(!is)
	    return 0;
    }
    return 1;
}
vector<rect> del(vector<rect> &inp, pii p){
    vector<rect> ans;
    for(auto r : inp){
	if(inside(r, p) == 0)
	    ans.PB(r);
    }
    return ans;
}
/*
bool delta(vector<pii> &v){
    if(v.empty()){
	v.PB({1, inf});
	v.PB({1, inf});
	return 1;
    }
    vector<pii> ans;
    while(sz(v) < 2)
	v.PB(v.back());
    for(int i = 1; i < sz(v); i++)
	if(v[i].S < v[0].S)
	    swap(v[i], v[0]);
    for(int i = 2; i < sz(v); i++)
	if(v[1].F < v[i].F)
	    swap(v[i], v[1]);
    if(v[1].F <= v[0].S){
	int L = v[1].F, R = v[0].S;
	ans.PB({v[1].F, v[0].S});
	ans.PB({1, inf});
	v[1].F = R + 1;
	v[0].S = L - 1;
	for(pii p : v){
	    if((v[0] & p) == v[0] || (v[1] & p == v[1]))
		continue;	    
	}
	if(v[0].F <= v[0].S && v[1].F <= v[1].S)
		    
    }
    else{
    }
}
*/

pair<bool, vector<pii> > solve(vector<rect> inp, int k){
    if(k == 4){
	vector<rect> inp2, inp3;
	while(true){
	    inp2.clear();
	    inp3.clear();
	    rect r = big;
	    for(rect p : inp){
		if(!emp(p & r))
		    r = r & p, inp3.PB(p);
		else
		    inp2.PB(p);
	    }
	    auto x = solve(inp2, k-1);
	    if(x.F){
		x.S.PB(r.F);
		return {1, x.S};
	    }
	    random_shuffle(inp2.begin(), inp2.end());
	    random_shuffle(inp3.begin(), inp3.end());
	    inp.clear();
	    for(auto x : inp2)
		inp.PB(x);
	    for(auto x : inp3)
		inp.PB(x);
	}	
    }

    vector<pii> ans;
    rect r = big;
    for(auto x : inp)
	r = r & x;
    if(r.F.F <= r.S.F){
	vector<pii> v;
	for(rect r : inp)
	    v.PB({r.F.S, r.S.S});
	for(int i = 0; i < k; i++)
	    ans.PB({r.F.F, choose_and_del(v)});
	if(v.empty())
	    return {1, ans};
	else
	    ans.clear();
	return {0, ans};
    }
    if(r.F.S <= r.S.S){
	vector<pii> v;
	for(rect r : inp)
	    v.PB({r.F.F, r.S.F});
	for(int i = 0; i < k; i++)
	    ans.PB({choose_and_del(v), r.F.S});
	if(v.empty())
	    return {1, ans};
	else
	    ans.clear();
	return {0, ans};	
    }
    if(k == 1){
	return {0, ans};
    }
    
    swap(r.F, r.S);
    
    if(k == 2){
	ans.PB(r.F);
	ans.PB(r.S);
	if(ok(inp, ans))
	    return {1, ans};
	swap(ans[0].S, ans[1].S);
	if(ok(inp, ans))
	    return {1, ans};
	ans.clear();
	return {0, ans};
    }

    for(int x : {r.F.F, r.S.F})
	for(int y : {r.F.S, r.S.S}){
	    auto p = solve(del(inp, {x, y}), k-1);
	    if(p.F){
		p.S.PB({x, y});
		return p;
	    }
	}
    if(k == 3){
	return {0, ans};
    }


    assert(0);
    
    // now k == 4
    /*
    vector<pii> UD, LR;
    
    rect D = {r.F, {r.S.F, r.F.S}}, U = {{r.F.F, r.S.S}, r.S}, L = {r.F, {r.F.F, r.S.S}}, R = {{r.S.F, r.F.S}, r.S};
    for(rect p : inp){
	rect eD = D & p, eU = U & p, eL = L & p, eR = R & p;
	int C = emp(eD) + emp(eU) + emp(eL) + emp(eR);
	if(C == 4)
	    return {0, ans};
	if(C == 3){
	    if(!emp(eD))
		D = eD;
	    if(!emp(eU))
		U = eU;
	    if(!emp(eL))
		L = eL;
	    if(!emp(eR))
		R = eR;
	}
	if(C == 2){
	    if(!emp(eD) && !emp(eU))
		UD.PB({p.F.F, p.S.F});
	    if(!emp(eL) && !emp(eR))
		LR.PB({p.F.S, p.S.S});	    
	}
    }
    if(emp(D) || emp(U) || emp(L) || emp(R)){
	return {0, ans};
    }

    if(!delta(UD))
	return {0, ans};
    if(!delta(LR))
	return {0, ans};
    */
}

int main(){
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie();

    srand(time(0));
    
    int n, k;
    cin >> n >> k;
    vector< rect > inp(n);
    for(int i = 0; i < n; i++){
	cin >> inp[i].F.F >> inp[i].F.S >> inp[i].S.F >> inp[i].S.S;
    }
    auto _ = solve(inp, k);
    vector<pii> v = _.S;
    assert(_.F);
    for(pii p : v)
	cout << p.F << " " << p.S << "\n";
    return 0;
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct

Subtask #2
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct

Subtask #3
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 2 ms 488 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 1 ms 512 KB Output is correct

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 3 ms 512 KB Output is correct
8 Correct 3 ms 512 KB Output is correct
9 Correct 7 ms 512 KB Output is correct
10 Correct 8 ms 512 KB Output is correct
11 Correct 3 ms 512 KB Output is correct
12 Correct 2 ms 512 KB Output is correct
13 Correct 3 ms 512 KB Output is correct
14 Correct 2 ms 512 KB Output is correct
15 Correct 4 ms 512 KB Output is correct
16 Correct 3 ms 512 KB Output is correct
17 Correct 2 ms 512 KB Output is correct
18 Correct 2 ms 512 KB Output is correct
19 Correct 2 ms 512 KB Output is correct
20 Correct 2 ms 512 KB Output is correct
21 Correct 2 ms 512 KB Output is correct
22 Correct 2 ms 512 KB Output is correct
23 Correct 3 ms 512 KB Output is correct
24 Correct 6 ms 512 KB Output is correct
25 Correct 5 ms 512 KB Output is correct
26 Correct 3 ms 512 KB Output is correct
27 Correct 3 ms 512 KB Output is correct
28 Correct 5 ms 512 KB Output is correct
29 Correct 6 ms 512 KB Output is correct
30 Correct 2 ms 512 KB Output is correct
31 Correct 14 ms 512 KB Output is correct
32 Correct 4 ms 512 KB Output is correct
33 Correct 2 ms 512 KB Output is correct
34 Correct 3 ms 512 KB Output is correct
35 Correct 2 ms 512 KB Output is correct
36 Correct 6 ms 544 KB Output is correct
37 Correct 2 ms 512 KB Output is correct
38 Correct 4 ms 564 KB Output is correct
39 Correct 7 ms 512 KB Output is correct
40 Correct 8 ms 512 KB Output is correct
41 Correct 5 ms 512 KB Output is correct
42 Correct 4 ms 512 KB Output is correct
43 Correct 2 ms 512 KB Output is correct
44 Correct 3 ms 512 KB Output is correct
45 Correct 4 ms 512 KB Output is correct
46 Correct 6 ms 512 KB Output is correct
47 Correct 2 ms 512 KB Output is correct
48 Correct 13 ms 512 KB Output is correct
49 Correct 3 ms 512 KB Output is correct
50 Correct 6 ms 512 KB Output is correct
51 Correct 16 ms 512 KB Output is correct
52 Correct 5 ms 512 KB Output is correct
53 Correct 6 ms 512 KB Output is correct
54 Correct 2 ms 512 KB Output is correct
55 Correct 2 ms 512 KB Output is correct
56 Correct 4 ms 512 KB Output is correct
57 Correct 3 ms 512 KB Output is correct
58 Correct 7 ms 512 KB Output is correct

Subtask #5
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 100 ms 8848 KB Output is correct
6 Correct 103 ms 8816 KB Output is correct
7 Correct 100 ms 8816 KB Output is correct
8 Correct 105 ms 8816 KB Output is correct

Subtask #6
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 104 ms 6652 KB Output is correct
6 Correct 99 ms 6648 KB Output is correct
7 Correct 102 ms 6648 KB Output is correct
8 Correct 108 ms 6608 KB Output is correct

Subtask #7
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 2 ms 488 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 1 ms 512 KB Output is correct
13 Correct 105 ms 9912 KB Output is correct
14 Correct 114 ms 9920 KB Output is correct
15 Correct 107 ms 9196 KB Output is correct
16 Correct 102 ms 9148 KB Output is correct
17 Correct 119 ms 9964 KB Output is correct
18 Correct 125 ms 9068 KB Output is correct
19 Correct 105 ms 8772 KB Output is correct
20 Correct 101 ms 8772 KB Output is correct
21 Correct 133 ms 13852 KB Output is correct
22 Correct 142 ms 10744 KB Output is correct
23 Correct 114 ms 10860 KB Output is correct
24 Correct 126 ms 10860 KB Output is correct

Subtask #8
0 / 79.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 3 ms 512 KB Output is correct
8 Correct 3 ms 512 KB Output is correct
9 Correct 7 ms 512 KB Output is correct
10 Correct 8 ms 512 KB Output is correct
11 Correct 3 ms 512 KB Output is correct
12 Correct 2 ms 512 KB Output is correct
13 Correct 3 ms 512 KB Output is correct
14 Correct 2 ms 512 KB Output is correct
15 Correct 4 ms 512 KB Output is correct
16 Correct 3 ms 512 KB Output is correct
17 Correct 2 ms 512 KB Output is correct
18 Correct 2 ms 512 KB Output is correct
19 Correct 2 ms 512 KB Output is correct
20 Correct 2 ms 512 KB Output is correct
21 Correct 2 ms 512 KB Output is correct
22 Correct 2 ms 512 KB Output is correct
23 Correct 3 ms 512 KB Output is correct
24 Correct 6 ms 512 KB Output is correct
25 Correct 5 ms 512 KB Output is correct
26 Correct 3 ms 512 KB Output is correct
27 Correct 3 ms 512 KB Output is correct
28 Correct 5 ms 512 KB Output is correct
29 Correct 6 ms 512 KB Output is correct
30 Correct 2 ms 512 KB Output is correct
31 Correct 14 ms 512 KB Output is correct
32 Correct 4 ms 512 KB Output is correct
33 Correct 2 ms 512 KB Output is correct
34 Correct 3 ms 512 KB Output is correct
35 Correct 2 ms 512 KB Output is correct
36 Correct 6 ms 544 KB Output is correct
37 Correct 2 ms 512 KB Output is correct
38 Correct 4 ms 564 KB Output is correct
39 Correct 7 ms 512 KB Output is correct
40 Correct 8 ms 512 KB Output is correct
41 Correct 5 ms 512 KB Output is correct
42 Correct 4 ms 512 KB Output is correct
43 Correct 2 ms 512 KB Output is correct
44 Correct 3 ms 512 KB Output is correct
45 Correct 4 ms 512 KB Output is correct
46 Correct 6 ms 512 KB Output is correct
47 Correct 2 ms 512 KB Output is correct
48 Correct 13 ms 512 KB Output is correct
49 Correct 3 ms 512 KB Output is correct
50 Correct 6 ms 512 KB Output is correct
51 Correct 16 ms 512 KB Output is correct
52 Correct 5 ms 512 KB Output is correct
53 Correct 6 ms 512 KB Output is correct
54 Correct 2 ms 512 KB Output is correct
55 Correct 2 ms 512 KB Output is correct
56 Correct 4 ms 512 KB Output is correct
57 Correct 3 ms 512 KB Output is correct
58 Correct 7 ms 512 KB Output is correct
59 Correct 154 ms 16528 KB Output is correct
60 Correct 187 ms 13736 KB Output is correct
61 Correct 137 ms 16268 KB Output is correct
62 Correct 193 ms 13576 KB Output is correct
63 Correct 417 ms 17840 KB Output is correct
64 Correct 162 ms 12024 KB Output is correct
65 Correct 392 ms 19440 KB Output is correct
66 Correct 660 ms 16488 KB Output is correct
67 Correct 917 ms 19376 KB Output is correct
68 Correct 620 ms 18968 KB Output is correct
69 Correct 414 ms 19628 KB Output is correct
70 Correct 2560 ms 19208 KB Output is correct
71 Execution timed out 3050 ms 21552 KB Time limit exceeded
72 Halted 0 ms 0 KB -