Submission #7275

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
7275	2014-07-29T05:40:09 Z	gs13068	행성 탐사 (GA8_planet)	C++	100 / 100	692 ms	1756 KB

planet

#include "planet.h"
#include <algorithm>

void ainta()
{
	int i,j,k;
	paint(0,0);
	for(i=1;i<63;i++)paint(2222-i,2222-i);
	for(j=0;j<8;j++)for(k=0;k<j;k++)paint(2222-j,2222-(i++));
	for(j=0;j<5;j++)for(k=0;k<j;k++)paint(k+2,2222-j);
}

void sangsoo()
{
	int x,y,z=0;
	int i,j,k;

	for(x=0;;x+=std::min(z,63))
	{
		if(x+std::min(z,62)>=2221)
		{
			i=x+std::min(z,62);
			break;
		}
		z++;
		if(count_row(x))
		{
			i=x+std::min(z-1,62);
				break;
		}
	}
	if(i>2221)i=2221;
	while(i-x>8)
	{
		k=(x+i+1)/2;
		z++;
		if(count_row(k))x=k;
		else i=k-1;
	}

	for(y=0;;y+=std::min(z,91))
	{
		if(y+std::min(z,90)>=2221)
		{
			j=y+std::min(z,90);
			break;
		}
		z++;
		if(count_col(y))
		{
			j=y+std::min(z-1,90);
			break;
		}
	}
	if(j>2221)j=2221;
	while(j-y>5)
	{
		k=(y+j+1)/2;
		z++;
		if(count_col(k))y=k;
		else j=k-1;
	}

	while(z<99)
	{
		z++;
		count_col(0);
	}
	x+=count_row((x+1)%2222);
	y+=count_col((y+1)%2222);

	report(x,y);
}

Subtask #1

40.0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	56 ms	1756 KB	Output is correct - max_calls = 101
2	Correct	60 ms	1756 KB	Output is correct - max_calls = 101
3	Correct	60 ms	1756 KB	Output is correct - max_calls = 101
4	Correct	56 ms	1756 KB	Output is correct - max_calls = 101
5	Correct	60 ms	1756 KB	Output is correct - max_calls = 101
6	Correct	60 ms	1756 KB	Output is correct - max_calls = 101
7	Correct	60 ms	1756 KB	Output is correct - max_calls = 101
8	Correct	56 ms	1756 KB	Output is correct - max_calls = 101
9	Correct	64 ms	1756 KB	Output is correct - max_calls = 101
10	Correct	56 ms	1756 KB	Output is correct - max_calls = 101
11	Correct	64 ms	1756 KB	Output is correct - max_calls = 101
12	Correct	64 ms	1756 KB	Output is correct - max_calls = 101
13	Correct	64 ms	1756 KB	Output is correct - max_calls = 101
14	Correct	64 ms	1756 KB	Output is correct - max_calls = 101
15	Correct	64 ms	1756 KB	Output is correct - max_calls = 101
16	Correct	60 ms	1756 KB	Output is correct - max_calls = 101
17	Correct	64 ms	1756 KB	Output is correct - max_calls = 101
18	Correct	68 ms	1756 KB	Output is correct - max_calls = 101
19	Correct	64 ms	1756 KB	Output is correct - max_calls = 101
20	Correct	152 ms	1756 KB	Output is correct - max_calls = 101

Subtask #2

60.0 / 60.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	600 ms	1756 KB	Output is correct - max_calls = 101
2	Correct	604 ms	1756 KB	Output is correct - max_calls = 101
3	Correct	616 ms	1756 KB	Output is correct - max_calls = 101
4	Correct	612 ms	1756 KB	Output is correct - max_calls = 101
5	Correct	620 ms	1756 KB	Output is correct - max_calls = 101
6	Correct	616 ms	1756 KB	Output is correct - max_calls = 101
7	Correct	632 ms	1756 KB	Output is correct - max_calls = 101
8	Correct	636 ms	1756 KB	Output is correct - max_calls = 101
9	Correct	636 ms	1756 KB	Output is correct - max_calls = 101
10	Correct	644 ms	1756 KB	Output is correct - max_calls = 101
11	Correct	196 ms	1756 KB	Output is correct - max_calls = 101
12	Correct	672 ms	1756 KB	Output is correct - max_calls = 101
13	Correct	672 ms	1756 KB	Output is correct - max_calls = 101
14	Correct	672 ms	1756 KB	Output is correct - max_calls = 101
15	Correct	684 ms	1756 KB	Output is correct - max_calls = 101
16	Correct	684 ms	1756 KB	Output is correct - max_calls = 101
17	Correct	664 ms	1756 KB	Output is correct - max_calls = 101
18	Correct	668 ms	1756 KB	Output is correct - max_calls = 101
19	Correct	676 ms	1756 KB	Output is correct - max_calls = 101
20	Correct	680 ms	1756 KB	Output is correct - max_calls = 101
21	Correct	672 ms	1756 KB	Output is correct - max_calls = 101
22	Correct	692 ms	1756 KB	Output is correct - max_calls = 101
23	Correct	676 ms	1756 KB	Output is correct - max_calls = 101