oj.uz

Submission #412603

# Submission time Handle Problem Language Result Execution time Memory
412603 2021-05-27T07:17:54 Z 장태환(#7565) Bread First Search (CCO21_day2problem2) C++17
0 / 25
 2 ms 460 KB 
#pragma GCC optimize("Ofast")
#pragma GCC optimization("unroll-loops")
#pragma GCC target("avx,avx2,fma")
#include <vector>
#include <algorithm>
#include <iostream>

using namespace std;
int arr[200100];
int nex[200100][4];
int sta[200100];
int siz;
int main()
{
	int N, M, K;
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin >> N >> M;
	int i, j;
	for (i = 0; i < N; i++)
	{
		for (j = 0; j < M; j++)
		{
			int cu = i * M + j + 1;
			cin >> arr[cu];
			if (i)
				nex[cu][2] = cu - M;
			if (i < N - 1)
				nex[cu][3] = cu + M;
			if (j)
				nex[cu][0] = cu - 1;
			if (j < M - 1)
				nex[cu][1] = cu + 1;
		}
	}
	cin >> K;
	for (i = 0; i < K; i++)
	{
		int a, b, c;
		cin >> a >> b >> c;
		a--;
		b--;
		if (arr[a * M + b + 1] == c)
			continue;
		sta[0] = a * M + b + 1;
		int curc = arr[a * M + b + 1];
		siz = 0;
		while (siz >= 0)
		{

			int cu = sta[siz--];
			if (arr[cu] ^ curc)
				continue;
			arr[cu] = c;
			sta[++siz] = nex[cu][0];
			sta[++siz] = nex[cu][1];
			sta[++siz] = nex[cu][2];
			sta[++siz] = nex[cu][3];
		}
	}
	for (i = 0; i < N; i++)
	{
		for (j = 0; j < M; j++)
		{
			int cu = i * M + j + 1;
			cout << arr[cu] << ' ';
		}
		cout << '\n';
	}
}

Compilation message

Main.cpp:2: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    2 | #pragma GCC optimization("unroll-loops")
      |

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 460 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 460 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 460 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -