oj.uz

Submission #57611

# Submission time Handle Problem Language Result Execution time Memory
57611 2018-07-15T12:18:06 Z model_code Collapse (JOI18_collapse) C++17
100 / 100
 7553 ms 30812 KB 
#include "collapse.h"
#include <utility>
#include <algorithm>
#include <set>
#include <iostream>
#include <memory>

template<typename T> using vector = std::vector<T>;
template<typename T> using set = std::set<T>;
template<typename T, typename S> using pair = std::pair<T, S>;
using std::make_pair;
using Paths = vector<pair<int, int>>;

const int Bucket = 1000;

class UnionFind {
private:
	vector<int> parent;
	vector<int> rank;
	bool need_change;
	vector<int> change;
public:
	UnionFind(int n, bool need_change_ = false) : parent(n), rank(n, 0), need_change(need_change_) {
		for(int i = 0; i < n; i++) parent[i] = i;
	}
	int findParent(int x) {
		if(parent[x] == x) return x;
		return parent[x] = findParent(parent[x]);
	}
	bool unionGroup(int x, int y) {
		int xp = findParent(x);
		int yp = findParent(y);
		if(xp == yp) {
			return false;
		}
		else {
			if(need_change) {
				change.push_back(xp);
				change.push_back(yp);
			}
			if(rank[xp] > rank[yp]) {
				parent[yp] = xp;
			}
			else if(rank[xp] < rank[yp]) {
				parent[xp] = yp;
			}
			else {
				parent[yp] = xp;
				rank[xp]++;
			}
			return true;
		}
	}
	void reset() {
		for(auto i : change) {
			parent[i] = i;
			rank[i] = 0;
		}
		change.clear();
	}
};

vector<pair<int, int>> solve(
	int n,
	Paths fixed,
	vector<pair<int, pair<int, std::shared_ptr<Paths>>>> query
) {
	auto comp_second = [](const pair<int, int>& a, const pair<int, int>& b){ return a.second < b.second; };
	auto comp_first_only = [](const pair<int, pair<int, std::shared_ptr<Paths>>>& a, const pair<int, pair<int, std::shared_ptr<Paths>>>& b){ return a.first < b.first; };
	sort(fixed.begin(), fixed.end(), comp_second);
	sort(query.begin(), query.end(), comp_first_only);
	vector<pair<int, int>> ret;
	UnionFind large(n), tmp(n, true);
	int now = 0;
	int count = 0;
	for(auto i : query) {
		while(now < (int)fixed.size() && fixed[now].second <= i.first) {
			if(large.unionGroup(fixed[now].first, fixed[now].second)) count++;
			now++;
		}
		int c = count;
		for(auto j : *i.second.second)
			if(j.second <= i.first && tmp.unionGroup(large.findParent(j.first), large.findParent(j.second))) c++;
		ret.push_back(make_pair(i.second.first, i.first + 1 - c));
		tmp.reset();
	}
	return ret;
}

pair<int, int> minMaxPair(int a, int b) {
	return make_pair(std::min(a, b), std::max(a, b));
}

pair<int, int> revPath(int n, pair<int, int> p) {
	return make_pair(n - 1 - p.second, n - 1 - p.first);
}

vector<int> simulateCollapse(
	int N,
	vector<int> T,
	vector<int> X,
	vector<int> Y,
	vector<int> W,
	vector<int> P
) {
	vector<pair<pair<int, int>, int>> q;
	for(int i = 0; i < (int)W.size(); i++) {
		q.push_back(make_pair(make_pair(W[i], P[i]), i));
	}
	sort(q.begin(), q.end());
	vector<int> ans(q.size(), 0);
	set<pair<int, int>> path;
	int now = 0;
	for(int s = 0; s < (int)T.size(); s += Bucket) {
		int e = std::min(s + Bucket, (int)T.size());
		
		set<pair<int, int>> change;
		for(int i = s; i < e; i++) change.insert(minMaxPair(X[i], Y[i]));
		
		auto fixed_ = path;
		set<pair<int, int>> np;
		for(auto i : change) if(fixed_.find(i) != fixed_.end()) {
			fixed_.erase(i);
			np.insert(i);
		}
		
		Paths fixed1, fixed2;
		for(auto i : fixed_) {
			fixed1.push_back(i);
			fixed2.push_back(revPath(N, i));
		}
		
		vector<pair<int, pair<int, std::shared_ptr<Paths>>>> query1, query2;
		for(int i = s; i < e; i++) {
			if(T[i] == 0) {
				path.insert(minMaxPair(X[i], Y[i]));
				np.insert(minMaxPair(X[i], Y[i]));
			}
			else {
				path.erase(minMaxPair(X[i], Y[i]));
				np.erase(minMaxPair(X[i], Y[i]));
			}
			std::shared_ptr<Paths> p1(new Paths), p2(new Paths);
			for(auto j : np) {
				p1->push_back(j);
				p2->push_back(revPath(N, j));
			}
			while(now < (int)q.size() && q[now].first.first == i) {
				query1.push_back(make_pair(q[now].first.second, make_pair(q[now].second, p1)));
				query2.push_back(make_pair(N - 2 - q[now].first.second, make_pair(q[now].second, p2)));
				now++;
			}
		}
		
		for(auto i : solve(N, fixed1, query1)) ans[i.first] += i.second;
		for(auto i : solve(N, fixed2, query2)) ans[i.first] += i.second;
	}
	return ans;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 828 KB Output is correct
2 Correct 8 ms 1220 KB Output is correct
3 Correct 7 ms 1300 KB Output is correct
4 Correct 8 ms 1392 KB Output is correct
5 Correct 19 ms 1392 KB Output is correct
6 Correct 130 ms 8352 KB Output is correct
7 Correct 6 ms 8352 KB Output is correct
8 Correct 9 ms 8352 KB Output is correct
9 Correct 36 ms 8352 KB Output is correct
10 Correct 99 ms 8352 KB Output is correct
11 Correct 183 ms 8524 KB Output is correct
12 Correct 152 ms 8768 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 15004 KB Output is correct
2 Correct 76 ms 15284 KB Output is correct
3 Correct 404 ms 15284 KB Output is correct
4 Correct 98 ms 15284 KB Output is correct
5 Correct 846 ms 15284 KB Output is correct
6 Correct 415 ms 17740 KB Output is correct
7 Correct 5583 ms 29552 KB Output is correct
8 Correct 979 ms 29552 KB Output is correct
9 Correct 82 ms 29552 KB Output is correct
10 Correct 90 ms 29552 KB Output is correct
11 Correct 386 ms 29552 KB Output is correct
12 Correct 1282 ms 29552 KB Output is correct
13 Correct 3994 ms 29552 KB Output is correct
14 Correct 6272 ms 30704 KB Output is correct
15 Correct 6397 ms 30812 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 106 ms 30812 KB Output is correct
2 Correct 97 ms 30812 KB Output is correct
3 Correct 132 ms 30812 KB Output is correct
4 Correct 93 ms 30812 KB Output is correct
5 Correct 365 ms 30812 KB Output is correct
6 Correct 551 ms 30812 KB Output is correct
7 Correct 3414 ms 30812 KB Output is correct
8 Correct 5064 ms 30812 KB Output is correct
9 Correct 83 ms 30812 KB Output is correct
10 Correct 1377 ms 30812 KB Output is correct
11 Correct 6225 ms 30812 KB Output is correct
12 Correct 7553 ms 30812 KB Output is correct
13 Correct 6948 ms 30812 KB Output is correct
14 Correct 6980 ms 30812 KB Output is correct
15 Correct 6277 ms 30812 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 828 KB Output is correct
2 Correct 8 ms 1220 KB Output is correct
3 Correct 7 ms 1300 KB Output is correct
4 Correct 8 ms 1392 KB Output is correct
5 Correct 19 ms 1392 KB Output is correct
6 Correct 130 ms 8352 KB Output is correct
7 Correct 6 ms 8352 KB Output is correct
8 Correct 9 ms 8352 KB Output is correct
9 Correct 36 ms 8352 KB Output is correct
10 Correct 99 ms 8352 KB Output is correct
11 Correct 183 ms 8524 KB Output is correct
12 Correct 152 ms 8768 KB Output is correct
13 Correct 81 ms 15004 KB Output is correct
14 Correct 76 ms 15284 KB Output is correct
15 Correct 404 ms 15284 KB Output is correct
16 Correct 98 ms 15284 KB Output is correct
17 Correct 846 ms 15284 KB Output is correct
18 Correct 415 ms 17740 KB Output is correct
19 Correct 5583 ms 29552 KB Output is correct
20 Correct 979 ms 29552 KB Output is correct
21 Correct 82 ms 29552 KB Output is correct
22 Correct 90 ms 29552 KB Output is correct
23 Correct 386 ms 29552 KB Output is correct
24 Correct 1282 ms 29552 KB Output is correct
25 Correct 3994 ms 29552 KB Output is correct
26 Correct 6272 ms 30704 KB Output is correct
27 Correct 6397 ms 30812 KB Output is correct
28 Correct 106 ms 30812 KB Output is correct
29 Correct 97 ms 30812 KB Output is correct
30 Correct 132 ms 30812 KB Output is correct
31 Correct 93 ms 30812 KB Output is correct
32 Correct 365 ms 30812 KB Output is correct
33 Correct 551 ms 30812 KB Output is correct
34 Correct 3414 ms 30812 KB Output is correct
35 Correct 5064 ms 30812 KB Output is correct
36 Correct 83 ms 30812 KB Output is correct
37 Correct 1377 ms 30812 KB Output is correct
38 Correct 6225 ms 30812 KB Output is correct
39 Correct 7553 ms 30812 KB Output is correct
40 Correct 6948 ms 30812 KB Output is correct
41 Correct 6980 ms 30812 KB Output is correct
42 Correct 6277 ms 30812 KB Output is correct
43 Correct 599 ms 30812 KB Output is correct
44 Correct 4928 ms 30812 KB Output is correct
45 Correct 850 ms 30812 KB Output is correct
46 Correct 5579 ms 30812 KB Output is correct
47 Correct 76 ms 30812 KB Output is correct
48 Correct 116 ms 30812 KB Output is correct
49 Correct 596 ms 30812 KB Output is correct
50 Correct 1387 ms 30812 KB Output is correct
51 Correct 1628 ms 30812 KB Output is correct
52 Correct 3830 ms 30812 KB Output is correct
53 Correct 3876 ms 30812 KB Output is correct
54 Correct 4578 ms 30812 KB Output is correct
55 Correct 4475 ms 30812 KB Output is correct
56 Correct 4939 ms 30812 KB Output is correct
57 Correct 5779 ms 30812 KB Output is correct
58 Correct 6384 ms 30812 KB Output is correct
59 Correct 6434 ms 30812 KB Output is correct
60 Correct 6787 ms 30812 KB Output is correct