oj.uz

답안 #7505

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
7505 2014-08-09T12:49:59 Z gs13068 행성 탐사 (GA8_planet) C++
21.3 / 100
 3000 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);
    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);
    for(i=0;i<1000;i++)paint(0,0);
}
  
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);
    for(i=0;i<1000;i++)count_row(0);
  
    report(x,y);
}

Subtask #1
21.3 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 476 ms 1756 KB Output is partially correct : max_calls = 1101
2 Partially correct 472 ms 1756 KB Output is partially correct : max_calls = 1101
3 Partially correct 476 ms 1756 KB Output is partially correct : max_calls = 1101
4 Partially correct 472 ms 1756 KB Output is partially correct : max_calls = 1101
5 Partially correct 472 ms 1756 KB Output is partially correct : max_calls = 1101
6 Partially correct 488 ms 1756 KB Output is partially correct : max_calls = 1101
7 Partially correct 476 ms 1756 KB Output is partially correct : max_calls = 1101
8 Partially correct 480 ms 1756 KB Output is partially correct : max_calls = 1101
9 Partially correct 476 ms 1756 KB Output is partially correct : max_calls = 1101
10 Partially correct 480 ms 1756 KB Output is partially correct : max_calls = 1101
11 Partially correct 476 ms 1756 KB Output is partially correct : max_calls = 1101
12 Partially correct 472 ms 1756 KB Output is partially correct : max_calls = 1101
13 Partially correct 476 ms 1756 KB Output is partially correct : max_calls = 1101
14 Partially correct 472 ms 1756 KB Output is partially correct : max_calls = 1101
15 Partially correct 484 ms 1756 KB Output is partially correct : max_calls = 1101
16 Partially correct 480 ms 1756 KB Output is partially correct : max_calls = 1101
17 Partially correct 480 ms 1756 KB Output is partially correct : max_calls = 1101
18 Partially correct 480 ms 1756 KB Output is partially correct : max_calls = 1101
19 Partially correct 476 ms 1756 KB Output is partially correct : max_calls = 1101
20 Partially correct 568 ms 1756 KB Output is partially correct : max_calls = 1101

Subtask #2
0.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3000 ms 1752 KB Program timed out
2 Halted 0 ms 0 KB -