제출 #7272

#제출 시각아이디문제언어결과실행 시간메모리
7272gs13068행성 탐사 (GA8_planet)C++98
98.70 / 100
684 ms1756 KiB
#include "planet.h"
#include <algorithm>
   
void ainta()
{
  int i,j,k;
  paint(0,0);
  for(i=1;i<57;i++)paint(2222-i,2222-i);
  for(j=0;j<7;j++)for(k=0;k<j;k++)paint(2222-j,2222-(i++));
  for(j=0;j<7;j++)for(k=0;k<j;k++)paint(k+2,2222-j);
}
   
void sangsoo()
{
  int x,y,z=0;
  int i,j,k,t=0;
  for(x=0;;x+=std::min(z,57))
  {
    if(x+std::min(z,56)>=2221)
    {
      i=x+std::min(z,56);
      break;
    }
    z++;
    if(count_row(x))
    {
      i=x+std::min(z-1,56);
        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,78))
  {
    if(z==77)
    {
      z++;
      x+=count_row((x+1)%2222);
    }
    if(y+std::min(z,77)>=2221)
    {
      j=y+std::min(z,77);
      break;
    }
    z++;
    if(count_col(y))
    {
      j=y+std::min(z-1,77);
      break;
    }
  }
  if(j>2221)j=2221;
  while(j-y>7)
  {
    k=(y+j+1)/2;
    z++;
    if(count_col(k))y=k;
    else j=k-1;
  }
  while(z<98)
  {
    z++;
    count_col(0);
  }
  if(z==98)x+=count_row((x+1)%2222);
  y+=count_col((y+1)%2222);
  report(x,y);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...