oj.uz

답안 #260219

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
260219 2020-08-09T19:54:28 Z shayan_p 함박 스테이크 (JOI20_hamburg) C++14
21 / 100
 3000 ms 14448 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;
	while(true){
	    random_shuffle(inp.begin(), inp.end());
	    inp2.clear();
	    rect r = big;
	    for(rect p : inp){
		if(!emp(p & r))
		    r = r & p;
		else
		    inp2.PB(p);
	    }
	    auto x = solve(inp2, k-1);
	    if(x.F){
		x.S.PB(r.F);
		return {1, x.S};
	    }
	}	
    }

    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

# 결과 실행 시간 메모리 Grader output
1 Correct 2 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 2 ms 384 KB Output is correct

Subtask #2
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 1 ms 384 KB Output is correct

Subtask #3
3.0 / 3.0

# 결과 실행 시간 메모리 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 1 ms 384 KB Output is correct
5 Correct 3 ms 488 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 1 ms 488 KB Output is correct
12 Correct 1 ms 512 KB Output is correct

Subtask #4
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 512 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 102 ms 512 KB Output is correct
8 Correct 28 ms 512 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 43 ms 512 KB Output is correct
11 Correct 71 ms 512 KB Output is correct
12 Correct 4 ms 512 KB Output is correct
13 Correct 64 ms 556 KB Output is correct
14 Correct 12 ms 512 KB Output is correct
15 Correct 10 ms 512 KB Output is correct
16 Correct 40 ms 552 KB Output is correct
17 Correct 4 ms 512 KB Output is correct
18 Correct 44 ms 556 KB Output is correct
19 Correct 10 ms 512 KB Output is correct
20 Correct 58 ms 512 KB Output is correct
21 Correct 3 ms 512 KB Output is correct
22 Correct 15 ms 512 KB Output is correct
23 Correct 66 ms 512 KB Output is correct
24 Correct 18 ms 512 KB Output is correct
25 Correct 8 ms 512 KB Output is correct
26 Correct 11 ms 512 KB Output is correct
27 Correct 3 ms 512 KB Output is correct
28 Correct 53 ms 512 KB Output is correct
29 Correct 75 ms 512 KB Output is correct
30 Correct 12 ms 512 KB Output is correct
31 Correct 74 ms 512 KB Output is correct
32 Correct 75 ms 552 KB Output is correct
33 Correct 8 ms 512 KB Output is correct
34 Correct 7 ms 512 KB Output is correct
35 Correct 5 ms 512 KB Output is correct
36 Correct 69 ms 512 KB Output is correct
37 Correct 30 ms 512 KB Output is correct
38 Correct 132 ms 512 KB Output is correct
39 Correct 14 ms 512 KB Output is correct
40 Correct 73 ms 520 KB Output is correct
41 Correct 54 ms 564 KB Output is correct
42 Correct 46 ms 512 KB Output is correct
43 Correct 4 ms 512 KB Output is correct
44 Correct 21 ms 512 KB Output is correct
45 Correct 20 ms 512 KB Output is correct
46 Correct 114 ms 512 KB Output is correct
47 Correct 41 ms 512 KB Output is correct
48 Correct 23 ms 512 KB Output is correct
49 Correct 4 ms 512 KB Output is correct
50 Correct 4 ms 512 KB Output is correct
51 Correct 30 ms 640 KB Output is correct
52 Correct 11 ms 512 KB Output is correct
53 Correct 50 ms 512 KB Output is correct
54 Correct 5 ms 512 KB Output is correct
55 Correct 2 ms 512 KB Output is correct
56 Correct 2 ms 512 KB Output is correct
57 Correct 3 ms 512 KB Output is correct
58 Correct 2 ms 512 KB Output is correct

Subtask #5
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 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 2 ms 384 KB Output is correct
5 Correct 111 ms 8816 KB Output is correct
6 Correct 110 ms 8816 KB Output is correct
7 Correct 119 ms 8816 KB Output is correct
8 Correct 99 ms 8816 KB Output is correct

Subtask #6
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 1 ms 384 KB Output is correct
5 Correct 100 ms 6592 KB Output is correct
6 Correct 100 ms 6648 KB Output is correct
7 Correct 92 ms 6648 KB Output is correct
8 Correct 98 ms 6648 KB Output is correct

Subtask #7
6.0 / 6.0

# 결과 실행 시간 메모리 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 1 ms 384 KB Output is correct
5 Correct 3 ms 488 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 1 ms 488 KB Output is correct
12 Correct 1 ms 512 KB Output is correct
13 Correct 109 ms 9964 KB Output is correct
14 Correct 102 ms 9920 KB Output is correct
15 Correct 112 ms 9152 KB Output is correct
16 Correct 98 ms 9196 KB Output is correct
17 Correct 101 ms 9964 KB Output is correct
18 Correct 104 ms 9068 KB Output is correct
19 Correct 102 ms 8764 KB Output is correct
20 Correct 100 ms 8816 KB Output is correct
21 Correct 121 ms 13764 KB Output is correct
22 Correct 113 ms 10720 KB Output is correct
23 Correct 117 ms 10816 KB Output is correct
24 Correct 111 ms 10860 KB Output is correct

Subtask #8
0 / 79.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 512 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 102 ms 512 KB Output is correct
8 Correct 28 ms 512 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 43 ms 512 KB Output is correct
11 Correct 71 ms 512 KB Output is correct
12 Correct 4 ms 512 KB Output is correct
13 Correct 64 ms 556 KB Output is correct
14 Correct 12 ms 512 KB Output is correct
15 Correct 10 ms 512 KB Output is correct
16 Correct 40 ms 552 KB Output is correct
17 Correct 4 ms 512 KB Output is correct
18 Correct 44 ms 556 KB Output is correct
19 Correct 10 ms 512 KB Output is correct
20 Correct 58 ms 512 KB Output is correct
21 Correct 3 ms 512 KB Output is correct
22 Correct 15 ms 512 KB Output is correct
23 Correct 66 ms 512 KB Output is correct
24 Correct 18 ms 512 KB Output is correct
25 Correct 8 ms 512 KB Output is correct
26 Correct 11 ms 512 KB Output is correct
27 Correct 3 ms 512 KB Output is correct
28 Correct 53 ms 512 KB Output is correct
29 Correct 75 ms 512 KB Output is correct
30 Correct 12 ms 512 KB Output is correct
31 Correct 74 ms 512 KB Output is correct
32 Correct 75 ms 552 KB Output is correct
33 Correct 8 ms 512 KB Output is correct
34 Correct 7 ms 512 KB Output is correct
35 Correct 5 ms 512 KB Output is correct
36 Correct 69 ms 512 KB Output is correct
37 Correct 30 ms 512 KB Output is correct
38 Correct 132 ms 512 KB Output is correct
39 Correct 14 ms 512 KB Output is correct
40 Correct 73 ms 520 KB Output is correct
41 Correct 54 ms 564 KB Output is correct
42 Correct 46 ms 512 KB Output is correct
43 Correct 4 ms 512 KB Output is correct
44 Correct 21 ms 512 KB Output is correct
45 Correct 20 ms 512 KB Output is correct
46 Correct 114 ms 512 KB Output is correct
47 Correct 41 ms 512 KB Output is correct
48 Correct 23 ms 512 KB Output is correct
49 Correct 4 ms 512 KB Output is correct
50 Correct 4 ms 512 KB Output is correct
51 Correct 30 ms 640 KB Output is correct
52 Correct 11 ms 512 KB Output is correct
53 Correct 50 ms 512 KB Output is correct
54 Correct 5 ms 512 KB Output is correct
55 Correct 2 ms 512 KB Output is correct
56 Correct 2 ms 512 KB Output is correct
57 Correct 3 ms 512 KB Output is correct
58 Correct 2 ms 512 KB Output is correct
59 Execution timed out 3083 ms 14448 KB Time limit exceeded
60 Halted 0 ms 0 KB -