답안 #7268

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
7268	2014-07-28T18:37:38 Z	gs13068	행성 탐사 (GA8_planet)	C++	99.3 / 100	1252 ms	1756 KB

planet

#include "planet.h"
#include <algorithm>
  
void ainta()
{
  int i,j,k;
  paint(0,0);
  for(i=1;i<64;i++)paint(2222-i,2222-i);
  i=64;
  for(j=0;j<8;j++)for(k=0;k<j;k++)paint((2222-j)%2222,2222-(i++));
  for(i=92;i<95;i++)paint(7,2222-i);
  paint(1,2221);
  paint(2,2220);
  paint(3,2220);
  paint(4,2219);
  paint(5,2219);
  paint(6,2219);
}
  
void sangsoo()
{
  int x,y,z=0;
  int i,j,k,t=0;
  for(x=0;;x+=std::min(z,64))
  {
    if(x+std::min(z,63)>=2221)
    {
      i=x+std::min(z,63);
      break;
    }
    z++;
    if(count_row(x))
    {
      i=x+std::min(z-1,63);
        break;
    }
  }
  if(i>2221)i=2221;
  while(i-x>7)
  {
    k=(x+i+1)/2;
    z++;
    if(count_row(k))x=k;
    else i=k-1;
  }
  for(y=0;;y+=std::min(z,95))
  {
    if(z==91)
    {
      z++;
      x+=count_row(x)-1;
    }
    if(y+std::min(z,94)>=2221)
    {
      j=y+std::min(z,94);
      break;
    }
    z++;
    if(count_col(y))
    {
      j=y+std::min(z-1,94);
      break;
    }
  }
  if(j>2221)j=2221;
  while(j-y>3)
  {
    k=(y+j+1)/2;
    z++;
    if(count_col(k))y=k;
    else j=k-1;
  }
  while(z<99)
  {
    z++;
    count_col(0);
  }
  if(z==99)x+=count_row(x)-1;
  y+=count_col(y)-1;
  report(x,y);
}

Subtask #1

39.7 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Partially correct	60 ms	1756 KB	Output is partially correct : max_calls = 102
2	Partially correct	64 ms	1756 KB	Output is partially correct : max_calls = 102
3	Partially correct	60 ms	1756 KB	Output is partially correct : max_calls = 102
4	Partially correct	64 ms	1756 KB	Output is partially correct : max_calls = 102
5	Partially correct	60 ms	1756 KB	Output is partially correct : max_calls = 102
6	Partially correct	60 ms	1756 KB	Output is partially correct : max_calls = 102
7	Partially correct	60 ms	1756 KB	Output is partially correct : max_calls = 102
8	Partially correct	64 ms	1756 KB	Output is partially correct : max_calls = 102
9	Partially correct	60 ms	1756 KB	Output is partially correct : max_calls = 102
10	Partially correct	64 ms	1756 KB	Output is partially correct : max_calls = 102
11	Partially correct	68 ms	1756 KB	Output is partially correct : max_calls = 102
12	Partially correct	64 ms	1756 KB	Output is partially correct : max_calls = 102
13	Partially correct	64 ms	1756 KB	Output is partially correct : max_calls = 102
14	Partially correct	64 ms	1756 KB	Output is partially correct : max_calls = 102
15	Partially correct	60 ms	1756 KB	Output is partially correct : max_calls = 102
16	Partially correct	68 ms	1756 KB	Output is partially correct : max_calls = 102
17	Partially correct	68 ms	1756 KB	Output is partially correct : max_calls = 102
18	Partially correct	68 ms	1756 KB	Output is partially correct : max_calls = 102
19	Partially correct	68 ms	1756 KB	Output is partially correct : max_calls = 102
20	Partially correct	156 ms	1756 KB	Output is partially correct : max_calls = 102

Subtask #2

59.6 / 60.0

#	결과	실행 시간	메모리	Grader output
1	Partially correct	608 ms	1756 KB	Output is partially correct : max_calls = 102
2	Partially correct	620 ms	1756 KB	Output is partially correct : max_calls = 102
3	Partially correct	620 ms	1756 KB	Output is partially correct : max_calls = 102
4	Partially correct	632 ms	1756 KB	Output is partially correct : max_calls = 102
5	Partially correct	640 ms	1756 KB	Output is partially correct : max_calls = 102
6	Partially correct	656 ms	1756 KB	Output is partially correct : max_calls = 102
7	Partially correct	636 ms	1756 KB	Output is partially correct : max_calls = 102
8	Partially correct	644 ms	1756 KB	Output is partially correct : max_calls = 102
9	Partially correct	640 ms	1756 KB	Output is partially correct : max_calls = 102
10	Partially correct	648 ms	1756 KB	Output is partially correct : max_calls = 102
11	Partially correct	200 ms	1756 KB	Output is partially correct : max_calls = 102
12	Partially correct	652 ms	1756 KB	Output is partially correct : max_calls = 102
13	Partially correct	660 ms	1756 KB	Output is partially correct : max_calls = 102
14	Partially correct	680 ms	1756 KB	Output is partially correct : max_calls = 102
15	Partially correct	688 ms	1756 KB	Output is partially correct : max_calls = 102
16	Partially correct	668 ms	1756 KB	Output is partially correct : max_calls = 102
17	Partially correct	1252 ms	1756 KB	Output is partially correct : max_calls = 102
18	Partially correct	776 ms	1756 KB	Output is partially correct : max_calls = 102
19	Partially correct	796 ms	1756 KB	Output is partially correct : max_calls = 102
20	Partially correct	712 ms	1756 KB	Output is partially correct : max_calls = 102
21	Partially correct	696 ms	1756 KB	Output is partially correct : max_calls = 102
22	Partially correct	708 ms	1756 KB	Output is partially correct : max_calls = 102
23	Partially correct	704 ms	1756 KB	Output is partially correct : max_calls = 102