제출 #298926

#제출 시각아이디문제언어결과실행 시간메모리
298926mhy908원 고르기 (APIO18_circle_selection)C++14
37 / 100
3107 ms535044 KiB
#include <bits/stdc++.h> #define mp make_pair #define eb emplace_back #define F first #define S second #define all(x) x.begin(), x.end() #define svec(x) sort(all(x)) #define press(x) x.erase(unique(all(x)), x.end()); using namespace std; typedef long long LL; typedef pair<int, int> pii; typedef pair<int, LL> pil; typedef pair<LL, int> pli; typedef pair<LL, LL> pll; const int INF=1e9; const LL LLINF=1e18; int n, ans[300010], l[300010], r[300010]; pair<pii, pii> arr[300010]; vector<int> idx; bool cmp(pair<pii, pii> a, pair<pii, pii> b){return mp(a.S.F, -a.S.S)>mp(b.S.F, -b.S.S);} bool is_con(int a, int b){ LL d=(LL)(arr[a].F.F-arr[b].F.F)*(arr[a].F.F-arr[b].F.F)+(LL)(arr[a].F.S-arr[b].F.S)*(arr[a].F.S-arr[b].F.S); LL rs=(LL)(arr[a].S.F+arr[b].S.F)*(arr[a].S.F+arr[b].S.F); return rs>=d; } struct NODE{ vector<pii> vc; vector<int> par; int findpar(int num){return num==par[num]?num:par[num]=findpar(par[num]);} void query(int s, int e, int num){ int nw=lower_bound(all(vc), mp(s, 0))-vc.begin(); while(1){ nw=findpar(nw); //printf("%d %d\n", nw); if(nw>=vc.size()||vc[nw].F>e)break; int nw2=vc[nw].S; if(ans[arr[nw2].S.S])par[nw]=findpar(nw+1); else if(is_con(nw2, num))ans[arr[nw2].S.S]=arr[num].S.S; nw++; } } void init(){ svec(vc); par.resize(vc.size()+1); for(int i=0; i<par.size(); i++)par[i]=i; } }tree[2400010]; void update(int point, int s, int e, int num, pii val){ tree[point].vc.eb(val); if(s==e)return; if(num<=(s+e)/2)update(point*2, s, (s+e)/2, num, val); else update(point*2+1, (s+e)/2+1, e, num, val); } void query(int point, int s, int e, int sx, int ex, int sy, int ey, int num){ if(e<sx||s>ex)return; if(sx<=s&&e<=ex){ tree[point].query(sy, ey, num); return; } query(point*2, s, (s+e)/2, sx, ex, sy, ey, num); query(point*2+1, (s+e)/2+1, e, sx, ex, sy, ey, num); } void init(int point, int s, int e){ tree[point].init(); if(s==e)return; init(point*2, s, (s+e)/2); init(point*2+1, (s+e)/2+1, e); } int main(){ scanf("%d", &n); for(int i=1; i<=n; i++){ scanf("%d %d %d", &arr[i].F.F, &arr[i].F.S, &arr[i].S.F); idx.eb(arr[i].F.F-arr[i].S.F); idx.eb(arr[i].F.F+arr[i].S.F); arr[i].S.S=i; } sort(arr+1, arr+n+1, cmp); svec(idx); press(idx); for(int i=1; i<=n; i++){ l[i]=lower_bound(all(idx), arr[i].F.F-arr[i].S.F)-idx.begin()+1; r[i]=lower_bound(all(idx), arr[i].F.F+arr[i].S.F)-idx.begin()+1; update(1, 1, idx.size(), l[i], mp(arr[i].F.S-arr[i].S.F, i)); update(1, 1, idx.size(), l[i], mp(arr[i].F.S+arr[i].S.F, i)); update(1, 1, idx.size(), r[i], mp(arr[i].F.S-arr[i].S.F, i)); update(1, 1, idx.size(), r[i], mp(arr[i].F.S+arr[i].S.F, i)); } init(1, 1, idx.size()); for(int i=1; i<=n; i++){ if(ans[arr[i].S.S])continue; query(1, 1, idx.size(), l[i], r[i], arr[i].F.S-arr[i].S.F, arr[i].F.S+arr[i].S.F, i); } for(int i=1; i<=n; i++)printf("%d ", ans[i]); }

컴파일 시 표준 에러 (stderr) 메시지

circle_selection.cpp: In member function 'void NODE::query(int, int, int)':
circle_selection.cpp:37:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |             if(nw>=vc.size()||vc[nw].F>e)break;
      |                ~~^~~~~~~~~~~
circle_selection.cpp: In member function 'void NODE::init()':
circle_selection.cpp:47:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   47 |         for(int i=0; i<par.size(); i++)par[i]=i;
      |                      ~^~~~~~~~~~~
circle_selection.cpp: In function 'int main()':
circle_selection.cpp:73:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   73 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
circle_selection.cpp:75:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   75 |         scanf("%d %d %d", &arr[i].F.F, &arr[i].F.S, &arr[i].S.F);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
#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...