Submission #13882

#TimeUsernameProblemLanguageResultExecution timeMemory
13882gs14004행성 탐사 (GA8_planet)C++14
82.70 / 100
859 ms1752 KiB
#include "planet.h" #include <algorithm> using namespace std; const int EE = 2222; void ainta() { for (int i=0; i<66; i++) { paint(i,0); // step 1. } for (int i=0; i<66; i++) { paint(0,i); // step 1. } for (int i=0; i<7; i++) { paint(0,0); // ignore step 2. } } void sangsoo() { /****** calcing position X ******/ int s = 0, e = 0, f = 0; for (int i=1; i <= 66; i++) { if(count_row(e)){ f = 1; } if(f) continue; s = e+1; e = e + i + 1; } e = min(e,EE-1); /****** calcing position X and Y ******/ int ns = 0, ne = 1; f = 0; for(int i=1; i<=13; i+=2){ if(s != e){ int m = (s+e) / 2; if(count_row(m)) e = m; else s = m+1; } else{ count_row(42); } if(count_col(ne)){ f = 1; } if(f) continue; ns = ne+1; ne = ne + i + 2; } /****** calcing position Y ******/ int posx = s; for (int i=15; i <= 66; i++) { if(count_col(ne)){ f = 1; } if(f) continue; ns = ne+1; ne = ne + i + 1; // printf("[%d,%d] %d\n",ns,ne,i); } ne = min(ne,EE-1); s = ns, e = ne; for(int i=0; i<7; i++){ if(s == e){ count_row(42); continue; } int m = (s+e) / 2; if(count_col(m)) e = m; else s = m+1; } int posy = s; report(posx,posy); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...