oj.uz

Submission #258867

# Submission time Handle Problem Language Result Execution time Memory
258867 2020-08-06T16:08:58 Z amoo_safar Hamburg Steak (JOI20_hamburg) C++14
21 / 100
 2007 ms 289936 KB 
// Zende bad Shoma nasime faghat !
#include <bits/stdc++.h>

#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " : " << x << '\n'

using namespace std;

typedef long long ll;
typedef long double ld;
typedef string str;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;

const ll Mod = 1000000007LL;
const int N = 2e5 + 10;
const ll Inf = 2242545357980376863LL;
const ll Log = 30;

int n, k;
int L[N], R[N], U[N], D[N];

vector<int> uX, uY;
vector<pii> points;

void Done(){
	while((int) points.size() < k) points.pb(pii(0, 0));
	for(auto x : points) printf("%d %d\n", uX[x.F], uY[x.S]);
	exit(0);
}

int mk[N];
bool In(pii P, int id){
	return L[id] <= P.F && P.F <= R[id] && D[id] <= P.S && P.S <= U[id];
}
void On(pii P, int col){
	for(int i = 0; i < n; i++){
		if(L[i] <= P.F && P.F <= R[i] && D[i] <= P.S && P.S <= U[i] && !mk[i]) mk[i] = col;
	}
	points.pb(P);
}
void Off(int col){
	for(int i = 0; i < n; i++)
		if(mk[i] == col)
			mk[i] = 0;
	points.pop_back();
}

void Solve(int y){
	if(y == 0){
		for(int i = 0; i < n; i++)
			if(!mk[i])
				return ;
	}
	int mnx = N, mxx = -1;
	for(int i = 0; i < n; i++)
		if(!mk[i])
			mnx = min(mnx, R[i]), mxx = max(mxx, L[i]);
	if(mxx == -1){
		for(int i = 0; i < y; i++) points.pb(pii(0, 0));
		Done();
	}


	int mny = N, mxy = -1;
	for(int i = 0; i < n; i++)
		if(!mk[i])
			mny = min(mny, U[i]), mxy = max(mxy, D[i]);
	
	for(int px : {mnx, mxx}){
		for(int py : {mny, mxy}){
			On({px, py}, y);
			Solve(y - 1);
			Off(y);
		}
	}
}

const int N2 = N * 16;
vector<int> O[N2], I[N2];
void AddE(int u, int v){
	O[u].pb(v);
	I[v].pb(u);
}
void AddC(int u, int v){
	//if(u == v);
	AddE(u ^ 1, v);
	AddE(v ^ 1, u);
}
void Ban(int u, int v){
	AddC(u ^ 1, v ^ 1);
}

int mark[N2];
vector<int> top;
void DFS(int u){
	mark[u] = 1;
	for(auto adj : O[u]) if(!mark[adj]) DFS(adj);
	top.pb(u);
}

void DFS(int u, int c){
	mark[u] = c;
	for(auto adj : I[u]) if(!mark[adj]) DFS(adj, c);
}

bool isst[N2];

void Main(){

	int mnx = N, mxx = -1;
	for(int i = 0; i < n; i++)
		if(!mk[i])
			mnx = min(mnx, R[i]), mxx = max(mxx, L[i]);
	int mny = N, mxy = -1;
	for(int i = 0; i < n; i++)
		if(!mk[i])
			mny = min(mny, U[i]), mxy = max(mxy, D[i]);
	
	vector<pii> po;
	vector<int> ln;
	{ // Nodes
		int st = 0;
		for(int i = mnx + 1; i < mxx; i++)
			po.pb({i, mny});	
		
		isst[st] = true;
		for(int i = st; i + 1 < (int) po.size(); i++)
			Ban(i << 1 | 1, (i + 1) << 1);
		st = po.size();
		/////////////////////
		for(int i = mnx + 1; i < mxx; i++)
			po.pb({i, mxy});

		isst[st] = true;
		for(int i = st; i + 1 < (int) po.size(); i++)
			Ban(i << 1 | 1, (i + 1) << 1);
		st = po.size();
		/////////////////////
		for(int i = mny + 1; i < mxy; i++)
			po.pb({mnx, i});	
		
		isst[st] = true;
		for(int i = st; i + 1 < (int) po.size(); i++)
			Ban(i << 1 | 1, (i + 1) << 1);
		st = po.size();
		/////////////////////
		for(int i = mny + 1; i < mxy; i++)
			po.pb({mxx, i});

		isst[st] = true;
		for(int i = st; i + 1 < (int) po.size(); i++)
			Ban(i << 1 | 1, (i + 1) << 1);
		st = po.size();
	}
	int m = po.size();
	for(int i = 0; i < m; i++) if(isst[i]) ln.pb(i);
	ln.pb(m);
	assert(ln.size() == 5);
	assert(2 * m < N2);
	int fst, la;
	vector<pii> seg;
	for(int i = 0; i < n; i++){
		seg.clear();
		/*for(int j = 0; j < 4; j++){
			fst = -1; la = -1;
			for(int l = ln[j]; l < ln[j + 1]; l++){
				if(In(po[l], i)){
					la = l;
					if(fst == -1) fst = l;
				}
			}

			if(fst == -1) continue;
			seg.pb({fst, la});
		}
		*/
		// 1
		if(D[i] <= mny){
			fst = max(mnx + 1, L[i]) - (mnx + 1);
			la = min(mxx - 1, R[i]) - (mnx + 1);
			if(fst <= la) seg.pb(pii(fst + ln[0], la + ln[0]));
		}
		// 2
		if(U[i] >= mxy){
			fst = max(mnx + 1, L[i]) - (mnx + 1);
			la = min(mxx - 1, R[i]) - (mnx + 1);
			if(fst <= la) seg.pb(pii(fst + ln[1], la + ln[1]));
		}
		// 3
		if(L[i] <= mnx){
			fst = max(mny + 1, D[i]) - (mny + 1);
			la = min(mxy - 1, U[i]) - (mny + 1);
			if(fst <= la) seg.pb(pii(fst + ln[2], la + ln[2]));
		}
		// 4
		if(R[i] >= mxx){
			fst = max(mny + 1, D[i]) - (mny + 1);
			la = min(mxy - 1, U[i]) - (mny + 1);
			if(fst <= la) seg.pb(pii(fst + ln[3], la + ln[3]));
		}


		if(seg.empty() || seg.size() > 2) continue;
		if(seg.size() == 1){
			AddC(seg[0].S << 1 | 1, seg[0].S << 1 | 1);
			if(!isst[seg[0].F])
				AddC((seg[0].F - 1) << 1, (seg[0].F - 1) << 1);
		} else {
			vector<int> B[2];
			for(int j = 0; j < 2; j++){
				B[j].pb(seg[j].S << 1 | 0);
				if(!isst[seg[j].F])
					B[j].pb((seg[j].F - 1) << 1 | 1);
			}
			for(int b1 : B[0]) for(int b2 : B[1]) Ban(b1, b2);
		}
	}

	for(int i = 0; i < m + m; i++){
		if(!mark[i]) DFS(i);
	}
	reverse(all(top));
	memset(mark, 0, sizeof mark);
	int cnt = 1;
	for(auto x : top) if(!mark[x]){
		DFS(x, cnt);
		cnt ++;
	}
	vector<int> val(m, 0);
	for(int i = 0; i < m; i++)
		val[i] = (mark[i + i] < mark[i + i + 1] ? 1 : 0);

	for(int j = 0; j < 4; j++){
		for(int l = ln[j]; l < ln[j + 1]; l++){
			if(val[l]){
				points.pb(po[l]);
				break;
			}
		}
	}
	Done();
}

int main(){
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	scanf("%d%d", &n, &k);
	for(int i = 0; i < n; i++) scanf("%d%d%d%d", L + i, D + i, R + i, U + i);

	for(int i = 0; i < n; i++) uX.pb(L[i]), uY.pb(D[i]), uX.pb(R[i]), uY.pb(U[i]);
	
	sort(all(uX)); uX.resize(unique(all(uX)) - uX.begin());
	sort(all(uY)); uY.resize(unique(all(uY)) - uY.begin());

	for(int i = 0; i < n; i++){
		L[i] = lower_bound(all(uX), L[i]) - uX.begin();
		R[i] = lower_bound(all(uX), R[i]) - uX.begin();
		U[i] = lower_bound(all(uY), U[i]) - uY.begin();
		D[i] = lower_bound(all(uY), D[i]) - uY.begin();
	}

	//assert(k <= 3);

	Solve(k);
	assert(k == 4);
	Main();

	return 0;
}

/*
4 4
1 4 1 4
2 1 2 1
3 0 3 0
4 3 4 3

*/

Compilation message

hamburg.cpp: In function 'int main()':
hamburg.cpp:250:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  250 |  scanf("%d%d", &n, &k);
      |  ~~~~~^~~~~~~~~~~~~~~~
hamburg.cpp:251:34: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  251 |  for(int i = 0; i < n; i++) scanf("%d%d%d%d", L + i, D + i, R + i, U + i);
      |                             ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 112 ms 150776 KB Output is correct
2 Correct 111 ms 150812 KB Output is correct
3 Correct 116 ms 150780 KB Output is correct
4 Correct 120 ms 150776 KB Output is correct

Subtask #2
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 111 ms 150776 KB Output is correct
2 Correct 111 ms 150776 KB Output is correct
3 Correct 107 ms 150776 KB Output is correct
4 Correct 129 ms 150700 KB Output is correct

Subtask #3
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 113 ms 150776 KB Output is correct
2 Correct 107 ms 150776 KB Output is correct
3 Correct 116 ms 150776 KB Output is correct
4 Correct 111 ms 150776 KB Output is correct
5 Correct 108 ms 150776 KB Output is correct
6 Correct 122 ms 150776 KB Output is correct
7 Correct 108 ms 150776 KB Output is correct
8 Correct 111 ms 150776 KB Output is correct
9 Correct 113 ms 150776 KB Output is correct
10 Correct 114 ms 150760 KB Output is correct
11 Correct 116 ms 150776 KB Output is correct
12 Correct 111 ms 150776 KB Output is correct

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 109 ms 150784 KB Output is correct
2 Correct 111 ms 150728 KB Output is correct
3 Correct 114 ms 150904 KB Output is correct
4 Correct 118 ms 150864 KB Output is correct
5 Correct 109 ms 150780 KB Output is correct
6 Correct 113 ms 150776 KB Output is correct
7 Correct 116 ms 150776 KB Output is correct
8 Correct 113 ms 150764 KB Output is correct
9 Correct 113 ms 150780 KB Output is correct
10 Correct 115 ms 150816 KB Output is correct
11 Correct 108 ms 150776 KB Output is correct
12 Correct 114 ms 150776 KB Output is correct
13 Correct 121 ms 150776 KB Output is correct
14 Correct 134 ms 164260 KB Output is correct
15 Correct 129 ms 150776 KB Output is correct
16 Correct 112 ms 150832 KB Output is correct
17 Correct 137 ms 164472 KB Output is correct
18 Correct 111 ms 150776 KB Output is correct
19 Correct 129 ms 150808 KB Output is correct
20 Correct 131 ms 164732 KB Output is correct
21 Correct 119 ms 150776 KB Output is correct
22 Correct 121 ms 150768 KB Output is correct
23 Correct 132 ms 164856 KB Output is correct
24 Correct 116 ms 150776 KB Output is correct
25 Correct 119 ms 150776 KB Output is correct
26 Correct 120 ms 150776 KB Output is correct
27 Correct 112 ms 150776 KB Output is correct
28 Correct 115 ms 150780 KB Output is correct
29 Correct 116 ms 150776 KB Output is correct
30 Correct 121 ms 150776 KB Output is correct
31 Correct 139 ms 164380 KB Output is correct
32 Correct 135 ms 164088 KB Output is correct
33 Correct 150 ms 164400 KB Output is correct
34 Correct 147 ms 164216 KB Output is correct
35 Correct 124 ms 164728 KB Output is correct
36 Correct 133 ms 164216 KB Output is correct
37 Correct 133 ms 165036 KB Output is correct
38 Correct 127 ms 165112 KB Output is correct
39 Correct 131 ms 164472 KB Output is correct
40 Correct 138 ms 164284 KB Output is correct
41 Correct 132 ms 164472 KB Output is correct
42 Correct 137 ms 164552 KB Output is correct
43 Correct 134 ms 164600 KB Output is correct
44 Correct 155 ms 164600 KB Output is correct
45 Correct 129 ms 150776 KB Output is correct
46 Correct 140 ms 164724 KB Output is correct
47 Correct 152 ms 164612 KB Output is correct
48 Correct 143 ms 164984 KB Output is correct
49 Correct 149 ms 164520 KB Output is correct
50 Correct 162 ms 164388 KB Output is correct
51 Correct 133 ms 164856 KB Output is correct
52 Correct 146 ms 164344 KB Output is correct
53 Correct 133 ms 164472 KB Output is correct
54 Correct 130 ms 164988 KB Output is correct
55 Correct 141 ms 164544 KB Output is correct
56 Correct 136 ms 164524 KB Output is correct
57 Correct 144 ms 164472 KB Output is correct
58 Correct 131 ms 164472 KB Output is correct

Subtask #5
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 112 ms 150776 KB Output is correct
2 Correct 111 ms 150812 KB Output is correct
3 Correct 116 ms 150780 KB Output is correct
4 Correct 120 ms 150776 KB Output is correct
5 Correct 491 ms 157924 KB Output is correct
6 Correct 498 ms 157952 KB Output is correct
7 Correct 505 ms 157940 KB Output is correct
8 Correct 504 ms 157864 KB Output is correct

Subtask #6
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 111 ms 150776 KB Output is correct
2 Correct 111 ms 150776 KB Output is correct
3 Correct 107 ms 150776 KB Output is correct
4 Correct 129 ms 150700 KB Output is correct
5 Correct 505 ms 157904 KB Output is correct
6 Correct 505 ms 157856 KB Output is correct
7 Correct 531 ms 157896 KB Output is correct
8 Correct 541 ms 157908 KB Output is correct

Subtask #7
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 113 ms 150776 KB Output is correct
2 Correct 107 ms 150776 KB Output is correct
3 Correct 116 ms 150776 KB Output is correct
4 Correct 111 ms 150776 KB Output is correct
5 Correct 108 ms 150776 KB Output is correct
6 Correct 122 ms 150776 KB Output is correct
7 Correct 108 ms 150776 KB Output is correct
8 Correct 111 ms 150776 KB Output is correct
9 Correct 113 ms 150776 KB Output is correct
10 Correct 114 ms 150760 KB Output is correct
11 Correct 116 ms 150776 KB Output is correct
12 Correct 111 ms 150776 KB Output is correct
13 Correct 545 ms 157904 KB Output is correct
14 Correct 525 ms 157912 KB Output is correct
15 Correct 533 ms 157932 KB Output is correct
16 Correct 505 ms 157916 KB Output is correct
17 Correct 496 ms 157912 KB Output is correct
18 Correct 516 ms 157952 KB Output is correct
19 Correct 509 ms 157916 KB Output is correct
20 Correct 532 ms 157904 KB Output is correct
21 Correct 681 ms 157968 KB Output is correct
22 Correct 621 ms 157916 KB Output is correct
23 Correct 591 ms 157924 KB Output is correct
24 Correct 623 ms 158060 KB Output is correct

Subtask #8
0 / 79.0

# Verdict Execution time Memory Grader output
1 Correct 109 ms 150784 KB Output is correct
2 Correct 111 ms 150728 KB Output is correct
3 Correct 114 ms 150904 KB Output is correct
4 Correct 118 ms 150864 KB Output is correct
5 Correct 109 ms 150780 KB Output is correct
6 Correct 113 ms 150776 KB Output is correct
7 Correct 116 ms 150776 KB Output is correct
8 Correct 113 ms 150764 KB Output is correct
9 Correct 113 ms 150780 KB Output is correct
10 Correct 115 ms 150816 KB Output is correct
11 Correct 108 ms 150776 KB Output is correct
12 Correct 114 ms 150776 KB Output is correct
13 Correct 121 ms 150776 KB Output is correct
14 Correct 134 ms 164260 KB Output is correct
15 Correct 129 ms 150776 KB Output is correct
16 Correct 112 ms 150832 KB Output is correct
17 Correct 137 ms 164472 KB Output is correct
18 Correct 111 ms 150776 KB Output is correct
19 Correct 129 ms 150808 KB Output is correct
20 Correct 131 ms 164732 KB Output is correct
21 Correct 119 ms 150776 KB Output is correct
22 Correct 121 ms 150768 KB Output is correct
23 Correct 132 ms 164856 KB Output is correct
24 Correct 116 ms 150776 KB Output is correct
25 Correct 119 ms 150776 KB Output is correct
26 Correct 120 ms 150776 KB Output is correct
27 Correct 112 ms 150776 KB Output is correct
28 Correct 115 ms 150780 KB Output is correct
29 Correct 116 ms 150776 KB Output is correct
30 Correct 121 ms 150776 KB Output is correct
31 Correct 139 ms 164380 KB Output is correct
32 Correct 135 ms 164088 KB Output is correct
33 Correct 150 ms 164400 KB Output is correct
34 Correct 147 ms 164216 KB Output is correct
35 Correct 124 ms 164728 KB Output is correct
36 Correct 133 ms 164216 KB Output is correct
37 Correct 133 ms 165036 KB Output is correct
38 Correct 127 ms 165112 KB Output is correct
39 Correct 131 ms 164472 KB Output is correct
40 Correct 138 ms 164284 KB Output is correct
41 Correct 132 ms 164472 KB Output is correct
42 Correct 137 ms 164552 KB Output is correct
43 Correct 134 ms 164600 KB Output is correct
44 Correct 155 ms 164600 KB Output is correct
45 Correct 129 ms 150776 KB Output is correct
46 Correct 140 ms 164724 KB Output is correct
47 Correct 152 ms 164612 KB Output is correct
48 Correct 143 ms 164984 KB Output is correct
49 Correct 149 ms 164520 KB Output is correct
50 Correct 162 ms 164388 KB Output is correct
51 Correct 133 ms 164856 KB Output is correct
52 Correct 146 ms 164344 KB Output is correct
53 Correct 133 ms 164472 KB Output is correct
54 Correct 130 ms 164988 KB Output is correct
55 Correct 141 ms 164544 KB Output is correct
56 Correct 136 ms 164524 KB Output is correct
57 Correct 144 ms 164472 KB Output is correct
58 Correct 131 ms 164472 KB Output is correct
59 Correct 504 ms 157980 KB Output is correct
60 Correct 535 ms 157968 KB Output is correct
61 Correct 474 ms 157912 KB Output is correct
62 Correct 498 ms 157856 KB Output is correct
63 Correct 502 ms 157888 KB Output is correct
64 Correct 553 ms 158036 KB Output is correct
65 Correct 671 ms 158020 KB Output is correct
66 Incorrect 2007 ms 289936 KB Output isn't correct
67 Halted 0 ms 0 KB -