oj.uz

Submission #18710

# Submission time Handle Problem Language Result Execution time Memory
18710 2016-02-14T11:03:37 Z pichulia 여왕벌 (KOI15_queen) C++
68 / 100
 5000 ms 15964 KB 
#include<stdio.h>
#include<algorithm>
using namespace std;
int m, n;
char a[701][701][3][3][3];
int r[701][701];
char x[999];
int p[709];
int q[709];
void process()
{
	int i0, i1, i2;
	int i, j, k, l;
	scanf("%d %d %d", &i0, &i1, &i2);
	// p = start of 1, q = start of 2
	if (i0 + i1 < n)
	{
		p[0] = 0; q[0] = 0;
	}
	else if (i0 < n)
	{
		p[0] = 0; q[0] = n - i2;
	}
	else
	{
		p[0] = i0 - n + 1; q[0] = n - i2;
	}
	for (i = 1; i < n; i++)
	{
		int np, nq;
		np = p[i - 1];
		nq = q[i - 1];
		int si = 0;
		if (i0 + i1 < (n - i))si = 2;
		else if (i0 < (n - i)) si = 1;
		else si = 0;

		if (si == 0)
		{
			if (p[i - 1]> 0) // 0 0 0 x x x
			{
				if (p[i - 1] != q[i - 1]) // 0 0 0 1 1 1 2 2 2
				{
					for (j = p[i - 1]; j < n && j < q[i - 1]; j++)
					{
						if (j == p[i-1] && a[i][j][0][0][1] == 1)
							break;
						else if (j > p[i - 1] && a[i][j][0][1][1] == 1)
							break;
					}
					if (j < q[i - 1])
					{
						np = j;
						for (j = q[i - 1]; j < n; j++)
						{
							if (j == q[i-1] && a[i][j][1][1][2] == 2)
								break;
							else if (j > q[i - 1] && a[i][j][1][2][2] == 2)
								break;
						}
						nq = j;
					}
					else
					{
						if (j < n && a[i][j][0][1][2] == 1)
						{
							np = j;
							for (j = q[i - 1]+1; j < n; j++)
							{
								if (a[i][j][1][2][2] == 2)
									break;
							}
							nq = j;
						}
						else
						{
							for (j = q[i - 1]; j < n; j++)
							{
								if (j == q[i - 1] && a[i][j][0][1][2] == 2)
									break;
								else if (j > q[i - 1] && a[i][j][0][2][2] == 2)
									break;
							}
							nq = j;
							np = nq;
						}
					}
				}
				else // 0 0 0 2 2 2
				{

					for (j = q[i - 1]; j < n; j++)
					{
						if (j == q[i - 1] && a[i][j][0][0][2] == 2)
							break;
						else if (j > q[i - 1] && a[i][j][0][2][2] == 2)
							break;
					}
					nq = j;
					np = nq;
				}
			}
			else if (q[i - 1] > 0) // 1 1 1 x x x
			{
				for (j = 1; j < n && j < q[i - 1]; j++)
				{
					if (a[i][j][0][1][1] == 1)
						break;
				}
				if (j < q[i - 1])
				{
					np = j;
					for (j = q[i - 1]; j < n; j++)
					{
						if (j == q[i - 1] && a[i][j][1][1][2] == 2)
							break;
						else if (j > q[i - 1] && a[i][j][1][2][2] == 2)
							break;
					}
					nq = j;
				}
				else
				{
					if (j < n && a[i][j][0][1][2] == 1)
					{
						np = j;
						for (j = q[i - 1] + 1; j < n; j++)
						{
							if (a[i][j][1][2][2] == 2)
								break;
						}
						nq = j;
					}
					else
					{
						for (j = q[i - 1]; j < n; j++)
						{
							if (j == q[i - 1] && a[i][j][0][1][2] == 2)
								break;
							else if (j > q[i - 1] && a[i][j][0][2][2] == 2)
								break;
						}
						nq = j;
						np = nq;
					}
				}
			}
			else // 2 2 2 ... 
			{
				for (j = 1; j < n; j++)
					if (a[i][j][0][2][2] == 2)
						break;
				nq = j;
				np = nq;
			}
		} // end of si == 0
		else if (si == 1)
		{
			np = 0;
			if (q[i - 1] > 0) // 1 1 1 x x x
			{
				for (j = q[i - 1]; j < n; j++)
				{
					if (j == q[i - 1] && a[i][j][1][1][2] == 2)
						break;
					else if (j > q[i - 1] && a[i][j][1][2][2] == 2)
						break;
				}
				nq = j;
			}
			else // 2 2 2 x x x
			{
				for (j = 1; j < n; j++)
					if (a[i][j][1][2][2] == 2)
						break;
				nq = j;
			}
		} // end of si == 1
		else
		{
			np = nq = 0;
		} // end of si == 2
		p[i] = np;
		q[i] = nq;
	}
	for (i = 0; i < n; i++)
	{
	//	printf("%d %d\n", p[i], q[i]);
		r[i][p[i]]++;
		r[i][q[i]]++;
	}
}
int main()
{
	scanf("%d %d", &n, &m);
	int i, j, k;
	for (i = 1; i < n; i++)
		for (j = 1; j < n; j++)
		{
			scanf("%s", x);
			k = 0;
			for (char ii = 0; ii < 3; ii++)
				for (char jj = 0; jj < 3; jj++)
					for (char kk = 0; kk < 3; kk++)
					{
						char cc = x[k++];
						if (cc == 'L')
						{
							cc = ii;
						}
						else if (cc == 'D')
						{
							cc = jj;
						}
						else
						{
							cc = kk;
						}
						a[i][j][ii][jj][kk] = cc;
					}
		}
	while (m--)
	{
		process();
	}
	for (i = 0; i < n; i++)
	{
		k = 1;
		for (j = 0; j < n; j++)
		{
			k += r[i][j];
			printf("%d ", k);
		}
		printf("\n");
	}
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 15964 KB Output is correct
2 Correct 0 ms 15964 KB Output is correct
3 Correct 3 ms 15964 KB Output is correct
4 Correct 2 ms 15964 KB Output is correct
5 Correct 59 ms 15964 KB Output is correct
6 Correct 27 ms 15964 KB Output is correct
7 Correct 37 ms 15964 KB Output is correct
8 Correct 80 ms 15964 KB Output is correct
9 Correct 100 ms 15964 KB Output is correct
10 Correct 199 ms 15964 KB Output is correct
11 Correct 243 ms 15964 KB Output is correct
12 Correct 230 ms 15964 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 15964 KB Output is correct
2 Correct 101 ms 15964 KB Output is correct
3 Correct 129 ms 15964 KB Output is correct
4 Correct 414 ms 15964 KB Output is correct
5 Correct 358 ms 15964 KB Output is correct
6 Correct 355 ms 15964 KB Output is correct

Subtask #3
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 15964 KB Output is correct
2 Correct 23 ms 15964 KB Output is correct
3 Correct 272 ms 15964 KB Output is correct
4 Correct 440 ms 15964 KB Output is correct
5 Correct 562 ms 15964 KB Output is correct
6 Correct 550 ms 15964 KB Output is correct
7 Correct 444 ms 15964 KB Output is correct
8 Correct 388 ms 15964 KB Output is correct
9 Correct 390 ms 15964 KB Output is correct

Subtask #4
0.0 / 32.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5000 ms 15960 KB Program timed out
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 15964 KB Output is correct
2 Correct 0 ms 15964 KB Output is correct
3 Correct 0 ms 15964 KB Output is correct
4 Correct 0 ms 15964 KB Output is correct
5 Correct 282 ms 15964 KB Output is correct
6 Correct 312 ms 15964 KB Output is correct
7 Correct 312 ms 15964 KB Output is correct
8 Correct 316 ms 15964 KB Output is correct
9 Execution timed out 5000 ms 15960 KB Program timed out
10 Halted 0 ms 0 KB -