oj.uz

Submission #345660

# Submission time Handle Problem Language Result Execution time Memory
345660 2021-01-07T19:28:48 Z pggp Paint (COI20_paint) C++14
40 / 100
 3000 ms 184488 KB 
#include <bits/stdc++.h>

using namespace std;

int R, S;
int parent[250000];
int siz[250000];

bool db = false;

int find(int x){
	if(parent[x] == x){
		return x;
	}
	return parent[x] = find(parent[x]);
}

void un(int x, int y){
	parent[find(x)] = find(y);
}



vector < int > E[250000];
int col[250000];
bool active[250000];

void union_vertices(vector < int > X, int y){
	if(!active[y])	return;
	vector < int > X1;
	set < int > x1S;
	for(int x : X){
		if(active[x]){
			X1.push_back(x);
			x1S.insert(x);
			un(x, y);
			active[x] = false;
		}	
	}
	//cout << "UNION " << x << " " << y << endl;
	
	set < int > S;
	vector < int > v;
	vector < int > v1;
	for(int ver : E[y]){
		if(x1S.find(ver) == x1S.end() and active[ver]){
			S.insert(ver);
			v.push_back(ver);
		}
	}
	for(int x : X1){
		for(int ver : E[x]){
			if(S.find(ver) == S.end() and active[ver]){
				S.insert(ver);
				v1.push_back(ver);
			}
		}
	}
	E[y].clear();
	for(int ver : v){
		//cout << "ver = " << ver << endl;
		E[y].push_back(ver);
	}
	for(int ver : v1){
		if(ver == y)	continue;
		//cout << "ver = " << ver << endl;
		E[y].push_back(ver);
		E[ver].push_back(y);
	}
}

bool used[250000];
stack < int > us;


void color(int v, int c){
	//cout << v << ":" << c << endl;
	col[v] = c;
	vector < int > t = E[v];
	vector < int > to_activ;
	for(int ver : t){
		if(col[ver] == c){
			to_activ.push_back(ver);
		}
	}
	union_vertices(to_activ, v);
}



void print_output(){
	for (int y = 0; y < R; ++y)
	{
		for (int x = 0; x < S; ++x)
		{
			cout << col[find(y * S + x)] << " ";
			if(db)	cout << "(" << find(y * S + x) << ")";
		}
		cout << endl;
	}
	if(db)
	{
		for(int i = 0; i < R * S; i++){
		cout << i << ": ";
		for(int v : E[i]){
			cout << v << " ";
		}
		cout << endl;
		}
	}
}

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

	cin >> R >> S;
	for (int i = 0; i < R * S; ++i)
	{
		active[i] = true;
		col[i] = 100001 + i;
		parent[i] = i;
		if(i % S != S - 1){
			E[i].push_back(i + 1);
		}
		if(i % S != 0){
			E[i].push_back(i - 1);
		}
		if(i >= S){
			E[i].push_back(i - S);
		}
		if(i < R*S - S){
			E[i].push_back(i + S);
		}
	}

	for (int y = 0; y < R; ++y)
	{
		for (int x = 0; x < S; ++x)
		{
			int c;
			cin >> c;
			color(find(y * S + x), c);
			//print_output();
			//cout << endl << endl;
		}
	}

	int q;

	cin >> q;
	while(q--){
		int r, s, c;
		cin >> r >> s >> c;
		r--;
		s--;
		if(db)	print_output();
		if(db)	cout << endl << endl;
		color(find(r * S + s), c);
			//print_output();
			//cout << endl << endl;
	}
	
	print_output();
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 6252 KB Output is correct
2 Correct 6 ms 6380 KB Output is correct
3 Correct 13 ms 6636 KB Output is correct
4 Correct 23 ms 6892 KB Output is correct
5 Execution timed out 3078 ms 124496 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 85 ms 8428 KB Output is correct
2 Correct 143 ms 10860 KB Output is correct
3 Correct 196 ms 16996 KB Output is correct

Subtask #3
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 328 ms 18412 KB Output is correct
2 Correct 313 ms 19180 KB Output is correct
3 Correct 342 ms 19180 KB Output is correct
4 Correct 351 ms 19308 KB Output is correct
5 Correct 267 ms 18032 KB Output is correct

Subtask #4
0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 386 ms 16108 KB Output is correct
2 Execution timed out 3102 ms 184488 KB Time limit exceeded
3 Halted 0 ms 0 KB -