이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "planet.h"
#include <algorithm>
using namespace std;
const int EE = 2222;
void ainta() {
for (int i=0; i<104; i++){
paint(i,i);
}
}
void sangsoo() {
int xs = 0, xe = 0, fx = 0, ys = 0, ye = 72, fy = 0;
for (int i=1; i <= 66; i++) {
if(count_row(xe)){
fx = 1;
}
if(!fx){
xs = xe + 1;
xe = xe + min(i,63) + 1;
}
}
xe = min(xe,EE-1);
for (int i=0; i<6; i++) {
if(xs == xe){
count_row(69);
continue;
}
int m = (xs + xe) / 2;
if(count_row(m)) xe = m;
else xs = m+1;
}
for (int i=73; i <= 97; i++) {
if(count_row(ye)){
fy = 1;
}
if(!fx){
ys = ye + 1;
ye = ye + i + 1;
}
}
xe = min(xe,EE-1);
ye = min(ye,EE-1);
for (int i=0; i<7; i++) {
if(ys == ye){
count_row(69);
continue;
}
int m = (ys + ye) / 2;
if(count_col(m)) ye = m;
else ys = m+1;
}
report(xs,ys);
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |