제출 #552425

#제출 시각아이디문제언어결과실행 시간메모리
552425zaneyu원 고르기 (APIO18_circle_selection)C++14
7 / 100
3082 ms19000 KiB
/*input 11 9 9 2 13 2 1 11 8 2 3 3 2 3 12 1 12 14 1 9 8 5 2 8 2 5 2 1 14 4 2 14 14 1 */ #include<bits/stdc++.h> #pragma GCC optimize("Ofast") #pragma target("avx3") using namespace std; #define REP(i,n) for(int i=0;i<n;i++) const int maxn=3e5+5; #define pb push_back #define lowb(x) x&(-x) #define ll long long #define MNTO(x,y) x=min(x,y) #define REP1(i,n) for(int i=1;i<=n;i++) #define pii pair<ll,ll> #define f first #define s second pair<pii,ll> arr[maxn]; inline bool inter(int a,int b){ ll d=(arr[a].f.s-arr[b].f.s)*(arr[a].f.s-arr[b].f.s)+(arr[a].f.f-arr[b].f.f)*(arr[a].f.f-arr[b].f.f); return d<=(arr[a].s+arr[b].s)*(arr[a].s+arr[b].s); } bool ok[maxn]; int ans[maxn]; int main(){ ios::sync_with_stdio(false),cin.tie(0); int n; cin>>n; vector<int> v; REP(i,n) cin>>arr[i].f.f>>arr[i].f.s>>arr[i].s,v.pb(i); REP(i,n){ int p=-1; for(int j:v){ if(ok[j]) continue; if(p==-1 or arr[p].s<arr[j].s) p=j; } if(p==-1) break; vector<int> nv; for(int j:v){ if(inter(j,p)) ans[j]=p,ok[j]=1; else nv.pb(j); } v=nv; } REP(i,n){ cout<<ans[i]+1<<' '; } }

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

circle_selection.cpp:17: warning: ignoring '#pragma target ' [-Wunknown-pragmas]
   17 | #pragma target("avx3")
      |
#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...