oj.uz

Submission #321505

# Submission time Handle Problem Language Result Execution time Memory
321505 2020-11-12T15:30:29 Z aZvezda Sweeping (JOI20_sweeping) C++14
100 / 100
 12335 ms 265884 KB 
#include <bits/stdc++.h>
using namespace std;
//#pragma GCC optimize ("O3")
//#pragma GCC target ("sse4")
#define endl "\n"
typedef long long ll;
template<class T, class T2> inline ostream &operator <<(ostream &out, const pair<T, T2> &x) { out << x.first << " " << x.second; return out;}
template<class T, class T2> inline istream &operator >>(istream &in, pair<T, T2> &x) { in >> x.first >> x.second; return in;}
template<class T, class T2> inline bool chkmax(T &x, const T2 &y) { return x < y ? x = y, 1 : 0; }
template<class T, class T2> inline bool chkmin(T &x, const T2 &y) { return x > y ? x = y, 1 : 0; }
const ll mod = 1e9 + 7;
#define out(x) "{" << (#x) << ": " << x << "} "

const int MAX_N = 1e6 + 10;

struct Query {
	int type, val, x, y;
};

vector<Query> queries;
pair<int, int> ans[MAX_N];
int n, m, q, cnt = 0;

int on[MAX_N];
int wherex[MAX_N], wherey[MAX_N];

void solve(int x, int y, vector<Query> &now) {
	int midx = (x + n - y) / 2ll, midy = (y + n - x) / 2ll;
	//cout << endl << x << " " << y << " " << midx << " " << midy << "! " << now.size() << endl << endl;
	if(now.empty()) {return;}
	
	vector<Query> up, rght;
	priority_queue<int> pqx, pqy;
	map<int, vector<int> > groupx, groupy;
	map<int, int> valx, headx;
	map<int, int> valy, heady;	
	int helpCnt = 0;
	
	//cout << x << " " << y << " " << " " << midx << " " << midy << endl;
	
	for(auto it : now) {
		//cout << it.type << " " << it.val << " " << it.x << " " << it.y << endl;
		if(it.type == 4) {
			if(it.y > midy) {
				on[it.val] = 1;
				//cout << "Up" << endl;
				up.push_back(it);
				continue;
			} else if(it.x > midx) {
				on[it.val] = 2;
				//cout << "Rght" << endl;
				rght.push_back(it);
				continue;
			}
			
			int whereToPut;
			on[it.val] = 0;
			
			if(headx.find(it.x) == headx.end()) {
				headx[it.x] = ++ helpCnt;
				valx[helpCnt] = it.x;
			}
			whereToPut = headx[it.x];		
			wherex[it.val] = whereToPut;
			if(groupx[whereToPut].empty()) {pqx.push(-it.x);}
			groupx[whereToPut].push_back(it.val);
		
			if(heady.find(it.y) == heady.end()) {
				heady[it.y] = ++ helpCnt;
				valy[helpCnt] = it.y;
			}
			whereToPut = heady[it.y];		
			wherey[it.val] = whereToPut;
			if(groupy[whereToPut].empty()) {pqy.push(-it.y);}
			groupy[whereToPut].push_back(it.val);						
		} else if(it.type == 1) {
			//cout << "Asking " << it.val << " " << on[it.val] << endl;
			
			if(on[it.val] == 0) {
 				ans[it.x] = {valx[wherex[it.val]], valy[wherey[it.val]]}; 
			} else if(on[it.val] == 1) {
				up.push_back(it);
			} else if(on[it.val] == 2) {
				rght.push_back(it);
			}
		} else if(it.type == 2) {
			if(n - it.val <= midx) {
				while(!pqx.empty() && -pqx.top() < n - it.val) {
					auto curr = -pqx.top(); pqx.pop();
					
					if(headx.find(n - it.val) == headx.end()) {
						headx[n - it.val] = ++ helpCnt;
						valx[helpCnt] = n - it.val;
						pqx.push(-n + it.val);
					} 					
					int heada = headx[curr], headb = headx[n - it.val];
					
					if(groupx[heada].size() >= groupx[headb].size()) {
						for(auto toMove : groupx[headb]) {
							groupx[heada].push_back(toMove);
							wherex[toMove] = heada;
						}
						valx[heada] = n - it.val;
						headx[n - it.val] = heada;
						headx.erase(curr);
						groupx.erase(headb);
						valx.erase(headb);
					} else {
						for(auto toMove : groupx[heada]) {
							groupx[headb].push_back(toMove);
							wherex[toMove] = headb;
						}						
						headx.erase(curr);
						groupx.erase(heada);
						valx.erase(heada);
					}					
					///
				}
				up.push_back(it);
			} else {
				while(!pqy.empty() && -pqy.top() <= it.val) {
					auto curr = -pqy.top(); pqy.pop();		
					//cout << "Popping " << curr << endl;
					int heada = heady[curr];			
					for(auto toMove : groupy[heada]) {
						if(on[toMove] == 0) {
							rght.push_back({4, toMove, n - it.val, valy[wherey[toMove]]});
							on[toMove] = 2;
						}
					}
					heady.erase(curr);
					groupy.erase(heada);
					valy.erase(heada);
				}
				rght.push_back(it);
			}
		} else if(it.type == 3) {
			if(n - it.val <= midy) {
				while(!pqy.empty() && -pqy.top() < n - it.val) {
					auto curr = -pqy.top(); pqy.pop();
					
					if(heady.find(n - it.val) == heady.end()) {
						heady[n - it.val] = ++ helpCnt;
						valy[helpCnt] = n - it.val;
						pqy.push(-n + it.val);
					} 					
					int heada = heady[curr], headb = heady[n - it.val];
					
					if(groupy[heada].size() >= groupy[headb].size()) {
						for(auto toMove : groupy[headb]) {
							groupy[heada].push_back(toMove);
							wherey[toMove] = heada;
						}
						valy[heada] = n - it.val;
						heady[n - it.val] = heada;
						heady.erase(curr);
						groupy.erase(headb);
						valy.erase(headb);
					} else {
						for(auto toMove : groupy[heada]) {
							groupy[headb].push_back(toMove);
							wherey[toMove] = headb;
						}						
						heady.erase(curr);
						groupy.erase(heada);
						valy.erase(heada);
					}					
					///
				}
				rght.push_back(it);
			} else {
				while(!pqx.empty() && -pqx.top() <= it.val) {
					auto curr = -pqx.top(); pqx.pop();		
					//cout << "Popping " << curr << endl;
					int heada = headx[curr];			
					for(auto toMove : groupx[heada]) {
						if(on[toMove] == 0) {
							//cout << "Get up " << toMove << endl;
							up.push_back({4, toMove, valx[wherex[toMove]], n - it.val});
							on[toMove] = 1;
						}
					}
					headx.erase(curr);
					groupx.erase(heada);
					valx.erase(heada);
				}
				up.push_back(it);
			}			
		}
		continue;
		cout << "Groups" << endl;
		for(auto it : groupx) {
			cout << it.first << ", " << valx[it.first] << ": ";
			for(auto it2 : it.second) {
				if(on[it2] == 0) {
 					cout << it2 << " ";
 				}
			}
			cout << endl;
		}		
		cout << "x" << endl;
		for(auto it : groupy) {
			cout << it.first << ", " << valy[it.first] << ": ";
			for(auto it2 : it.second) {
				if(on[it2] == 0) {
 					cout << it2 << " ";
 				}
			}
			cout << endl;
		}
		cout << "End groups" << endl;
	}
	
	for(auto it : now) {if(it.type == 4) {on[it.val] = -1;}}
	
	groupx.clear();
	groupy.clear();
	valx.clear();
	valy.clear();
	headx.clear();
	heady.clear();
	
	if(x + midy + 1 <= n) {
		solve(x, midy + 1, up);
	}
	
	if(y + midx + 1 <= n) {
		solve(midx + 1, y, rght);
	}
}

signed main() {
	ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
	for(int i = 0; i < MAX_N; i ++) {ans[i] = {-1, -1}; on[i] = -1;}
	cin >> n >> m >> q;
	for(int i = 0; i < m; i ++) {
		int x, y;
		cin >> x >> y;
		queries.push_back({4, ++ cnt, x, y});
	}
	for(int i = 0; i < q; i ++) {
		int t;
		cin >> t;
		if(t == 1) {
			int ind;
			cin >> ind; 
			queries.push_back({t, ind, i, -1});
		} else if(t == 2) {
			int val;
			cin >> val;
			queries.push_back({t, val, -1, -1});
		} else if(t == 3) {
			int val;
			cin >> val;
			queries.push_back({t, val, -1, -1});
		} else {
			int x, y;
			cin >> x >> y;
			queries.push_back({t, ++ cnt, x, y});
		}
	}
	
	solve(0, 0, queries);

	for(int i = 0; i < q; i ++) {
		if(ans[i].first != -1) {
			cout << ans[i] << endl;
		}
	}
	return 0;
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 12908 KB Output is correct
2 Correct 19 ms 12524 KB Output is correct
3 Correct 17 ms 13292 KB Output is correct
4 Correct 25 ms 12972 KB Output is correct
5 Correct 22 ms 12652 KB Output is correct
6 Correct 10 ms 12524 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4881 ms 123032 KB Output is correct
2 Correct 4544 ms 123428 KB Output is correct
3 Correct 4538 ms 123544 KB Output is correct
4 Correct 6644 ms 206452 KB Output is correct
5 Correct 12335 ms 199452 KB Output is correct
6 Correct 9149 ms 205904 KB Output is correct
7 Correct 4506 ms 123616 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3791 ms 136096 KB Output is correct
2 Correct 3427 ms 139260 KB Output is correct
3 Correct 3482 ms 215552 KB Output is correct
4 Correct 6065 ms 222988 KB Output is correct
5 Correct 4418 ms 201124 KB Output is correct
6 Correct 3244 ms 141616 KB Output is correct

Subtask #4
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 3791 ms 136096 KB Output is correct
2 Correct 3427 ms 139260 KB Output is correct
3 Correct 3482 ms 215552 KB Output is correct
4 Correct 6065 ms 222988 KB Output is correct
5 Correct 4418 ms 201124 KB Output is correct
6 Correct 3244 ms 141616 KB Output is correct
7 Correct 3745 ms 126104 KB Output is correct
8 Correct 3597 ms 130672 KB Output is correct
9 Correct 3753 ms 124676 KB Output is correct
10 Correct 7399 ms 213792 KB Output is correct
11 Correct 8955 ms 223340 KB Output is correct
12 Correct 6952 ms 183740 KB Output is correct
13 Correct 6359 ms 247748 KB Output is correct
14 Correct 188 ms 66176 KB Output is correct
15 Correct 2758 ms 112160 KB Output is correct
16 Correct 3846 ms 129336 KB Output is correct
17 Correct 3418 ms 133016 KB Output is correct

Subtask #5
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 12908 KB Output is correct
2 Correct 19 ms 12524 KB Output is correct
3 Correct 17 ms 13292 KB Output is correct
4 Correct 25 ms 12972 KB Output is correct
5 Correct 22 ms 12652 KB Output is correct
6 Correct 10 ms 12524 KB Output is correct
7 Correct 4881 ms 123032 KB Output is correct
8 Correct 4544 ms 123428 KB Output is correct
9 Correct 4538 ms 123544 KB Output is correct
10 Correct 6644 ms 206452 KB Output is correct
11 Correct 12335 ms 199452 KB Output is correct
12 Correct 9149 ms 205904 KB Output is correct
13 Correct 4506 ms 123616 KB Output is correct
14 Correct 3791 ms 136096 KB Output is correct
15 Correct 3427 ms 139260 KB Output is correct
16 Correct 3482 ms 215552 KB Output is correct
17 Correct 6065 ms 222988 KB Output is correct
18 Correct 4418 ms 201124 KB Output is correct
19 Correct 3244 ms 141616 KB Output is correct
20 Correct 3745 ms 126104 KB Output is correct
21 Correct 3597 ms 130672 KB Output is correct
22 Correct 3753 ms 124676 KB Output is correct
23 Correct 7399 ms 213792 KB Output is correct
24 Correct 8955 ms 223340 KB Output is correct
25 Correct 6952 ms 183740 KB Output is correct
26 Correct 6359 ms 247748 KB Output is correct
27 Correct 188 ms 66176 KB Output is correct
28 Correct 2758 ms 112160 KB Output is correct
29 Correct 3846 ms 129336 KB Output is correct
30 Correct 3418 ms 133016 KB Output is correct
31 Correct 3475 ms 143388 KB Output is correct
32 Correct 4417 ms 125688 KB Output is correct
33 Correct 3775 ms 117528 KB Output is correct
34 Correct 6122 ms 136128 KB Output is correct
35 Correct 5516 ms 129828 KB Output is correct
36 Correct 8730 ms 214752 KB Output is correct
37 Correct 11323 ms 257336 KB Output is correct
38 Correct 7397 ms 265884 KB Output is correct
39 Correct 6760 ms 236276 KB Output is correct
40 Correct 3959 ms 136744 KB Output is correct