Submission #372646

#TimeUsernameProblemLanguageResultExecution timeMemory
372646phathnv산악 구조대 (JOI13_mountain)C++11
0 / 100
7 ms1388 KiB
#include <bits/stdc++.h> #include "grader.h" using namespace std; void Rescue(int r, int c, int rs, int cs, int expecH){ int maxDist = max(rs - 1, r - rs) + max(cs - 1, c - cs); vector <pair<int, int>> dist[maxDist + 1]; for(int i = 1; i <= r; i++) for(int j = 1; j <= c; j++) dist[abs(i - rs) + abs(j - cs)].push_back({i, j}); int lo = 0, hi = maxDist; while(lo <= hi){ int mid = (lo + hi) >> 1; int last = -1; for(auto p : dist[mid]){ int x, y; tie(x, y) = p; last = Measure(x, y); if (last == expecH) Pinpoint(x, y); } if (last < expecH) hi = mid - 1; else lo = mid + 1; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...