Submission #7271

#TimeUsernameProblemLanguageResultExecution timeMemory
7271gs13068행성 탐사 (GA8_planet)C++98
100 / 100
704 ms1756 KiB
#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,91)) { if(z==90) { z++; x+=count_row((x+1)%2222); } 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); } if(z==99)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...