Submission #773047

#TimeUsernameProblemLanguageResultExecution timeMemory
773047xetrkCircle selection (APIO18_circle_selection)C++14
12 / 100
1525 ms34856 KiB
#pragma warning(disable:4996) #include<bits/stdc++.h> using namespace std; typedef long long ll; typedef long double ld; int n; vector<vector<ll>> circle; vector<pair<ll, int>> sortRadius, sortX, sortY; int ans[301000]; inline ll GetDist(ll x1, ll y1, ll x2, ll y2) { // 아 좌표값 마이너스도 들어오네 ll xx = max(x1, x2) - min(x1, x2); ll yy = max(y1, y2) - min(y1, y2); return (xx * xx) + (yy * yy); } bool comp(const pair<ll,int>& a, const pair<ll,int>& b) { if (a.first == b.first) return a.second < b.second; return a.first < b.first; } bool compSort(const pair<ll, int>& a, const pair<ll, int>& b) { if (a.first == b.first) return a.second < b.second; return a.first > b.first; } int main() { ll x, y, r, r2; scanf("%d", &n); for (int i = 0; i < n; i++) { scanf("%lld %lld %lld", &x, &y, &r); // x = i + 1, y = i + 1, r = (i + 1)*3; circle.push_back({ x,y,r }); sortRadius.push_back({ r,i }); sortX.push_back({ x,i }); sortY.push_back({ y,i }); } sort(sortRadius.begin(), sortRadius.end(), compSort); sort(sortX.begin(), sortX.end()); sort(sortY.begin(), sortY.end()); int cur, curcmp; int xMin, xMax, yMin, yMax; for (int curDelete = 0; curDelete < n; curDelete++) { cur = sortRadius[curDelete].second; if (ans[cur]) continue; x = circle[cur][0], y = circle[cur][1], r = circle[cur][2]; r2 = r * 3 + 2; // a이하를 찾아야하는데 lower bound는 a이상인걸 찾으니까.. 근데 그 이하인걸 찾아야하니 1빼줌 xMin = lower_bound(sortX.begin(), sortX.end(), pair<ll, int>(x - r2, -1), comp) - sortX.begin(); xMax = upper_bound(sortX.begin(), sortX.end(), pair<ll, int>(x + r2, 301000), comp) - sortX.begin(); yMin = lower_bound(sortY.begin(), sortY.end(), pair<ll, int>(y - r2, -1), comp) - sortY.begin(); yMax = upper_bound(sortY.begin(), sortY.end(), pair<ll, int>(y + r2, 301000), comp) - sortY.begin(); xMin--; yMin--; if (xMin < 0) xMin = 0; if (yMin < 0) yMin = 0; if (xMin >= n) xMin = n - 1; if (yMin >= n) yMin = n - 1; if (xMax >= n) xMax = n - 1; if (yMax >= n) yMax = n - 1; ans[cur] = cur; if (xMax - xMin < yMax - yMin) { curcmp = sortX[max(0, xMin - 1)].second; int beforeX = circle[curcmp][0]; for (int i = xMin; i >= 0; i--) { curcmp = sortX[i].second; if (beforeX > circle[curcmp][0]) break; if (ans[curcmp]) continue; if (GetDist(x, y, circle[curcmp][0], circle[curcmp][1]) <= (ll)(((r + circle[curcmp][2]) * (r + circle[curcmp][2])))) ans[curcmp] = cur; } for (int i = xMin; i <= xMax; i++) { curcmp = sortX[i].second; if (ans[curcmp]) continue; if (GetDist(x, y, circle[curcmp][0], circle[curcmp][1]) <= (ll)(((r + circle[curcmp][2]) * (r + circle[curcmp][2])))) ans[curcmp] = cur; } } else { curcmp = sortY[max(0, yMin - 1)].second; int beforeY = circle[curcmp][1]; for (int i = yMin; i >= 0; i--) { curcmp = sortY[i].second; if (beforeY > circle[curcmp][1]) break; if (ans[curcmp]) continue; if (GetDist(x, y, circle[curcmp][0], circle[curcmp][1]) <= (ll)(((r + circle[curcmp][2]) * (r + circle[curcmp][2])))) ans[curcmp] = cur; } for (int i = yMin; i <= yMax; i++) { curcmp = sortY[i].second; if (ans[curcmp]) continue; if (GetDist(x, y, circle[curcmp][0], circle[curcmp][1]) <= (ll)(((r + circle[curcmp][2]) * (r + circle[curcmp][2])))) ans[curcmp] = cur; } } } for (int i = 0; i < n; i++) printf("%d ", ans[i]+1); return 0; }

Compilation message (stderr)

circle_selection.cpp:1: warning: ignoring '#pragma warning ' [-Wunknown-pragmas]
    1 | #pragma warning(disable:4996)
      | 
circle_selection.cpp: In function 'int main()':
circle_selection.cpp:46:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   46 |  scanf("%d", &n);
      |  ~~~~~^~~~~~~~~~
circle_selection.cpp:50:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   50 |   scanf("%lld %lld %lld", &x, &y, &r);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...