Submission #7267

#TimeUsernameProblemLanguageResultExecution timeMemory
7267gs13068행성 탐사 (GA8_planet)C++98
99.30 / 100
1148 ms1756 KiB
#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(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); } x+=count_row(x)-1; y+=count_col(y)-1; report(x,y); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...