제출 #1198272

#제출 시각아이디문제언어결과실행 시간메모리
1198272InvMOD산악 구조대 (JOI13_mountain)C++17
0 / 100
3 ms580 KiB
#include<bits/stdc++.h> #include "grader.h" using namespace std; void Rescue(int r, int c, int rs, int cs, int X){ int i = 1, ptr = cs; while(i <= rs){ while(ptr > 0){ int ck = Measure(i, ptr); if(ck == X) Pinpoint(i, ptr); if(ck > X) --ptr; if(ck < X) break; } i++; } i = 1, ptr = cs + 1; while(i <= rs){ while(ptr <= c){ int ck = Measure(i, ptr); if(ck == X) Pinpoint(i, ptr); if(ck > X) --ptr; if(ck < X) break; } i++; } i = r, ptr = cs; while(i > rs){ while(ptr > 0){ int ck = Measure(i, ptr); if(ck == X) Pinpoint(i, ptr); if(ck > X) --ptr; if(ck < X) break; } i--; } i = r, ptr = cs + 1; while(i > rs){ while(ptr <= c){ int ck = Measure(i, ptr); if(ck == X) Pinpoint(i, ptr); if(ck > X) --ptr; if(ck < X) break; } } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...