oj.uz

답안 #7270

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
7270 2014-07-28T18:49:36 Z gs13068 행성 탐사 (GA8_planet) C++
0 / 100
 0 ms 1756 KB 
#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);
  i=63;
  for(j=0;j<8;j++)for(k=0;k<j;k++)paint((2222-j)%2222,2222-(i++));
  paint(2,2221);
  paint(2,2220);
  paint(3,2220);
  paint(2,2219);
  paint(3,2219);
  paint(4,2219);
  paint(2,2218);
  paint(3,2218);
  paint(4,2218);
  paint(5,2218);
}
  
void sangsoo()
{
  int x,y,z=0;
  int i,j,k,t=0;
  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,94))
  {
    if(z==90)
    {
      z++;
      x+=count_row((x+1)%2222);
    }
    if(y+std::min(z,93)>=2221)
    {
      j=y+std::min(z,93);
      break;
    }
    z++;
    if(count_col(y))
    {
      j=y+std::min(z-1,93);
      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);
  }
  if(z==99)x+=count_row((x+1)%2222);
  y+=count_col((y+1)%2222);
  report(x,y);
}

Subtask #1
0.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 1756 KB Output isn't correct - 답이 틀려서 프로그램을 종료합니다.
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Halted 0 ms 0 KB -