제출 #829795

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
829795		tolbi	원 고르기 (APIO18_circle_selection)	C++17	7 / 100	3066 ms	20920 KiB

circle_selection

#pragma optimize("Bismillahirrahmanirrahim")
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█■█
//█─█─█▄─█▄─█─█─█─█
//Allahuekber
//ahmet23 orz...
//FatihSultanMehmedHan
//YavuzSultanSelimHan
//AbdulhamidHan
//Sani buyuk Osman Pasa Plevneden cikmam diyor
#define author tolbi
#include <bits/stdc++.h>
using namespace std;
#define deci(x) int x;cin>>x;
#define decstr(x) string x;cin>>x;
#define sortarr(x) sort(x.begin(), x.end())
#define sortrarr(x) sort(x.rbegin(), x.rend())
#define rev(x) reverse(x.begin(), x.end())
#define cinarr(x) for (auto &it : x) cin>>it;
#define coutarr(x) for (auto &it : x) cout<<it<<" ";cout<<endl;
#define tol(bi) (1LL<<((int)(bi)))
#define endl '\n'
#define int long long
mt19937 ayahya(chrono::high_resolution_clock().now().time_since_epoch().count());
inline long double hoayda(int x1, int y1, int x2, int y2){
    return sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));
}
int32_t main(){
    int T = 1;
    int tno = 0;
    while (T-(tno++)){
        deci(n);
        vector<array<int,4>> arr(n);
        for (int i = 0; i < n; ++i)
        {
            cin>>arr[i][0]>>arr[i][1]>>arr[i][2];
            arr[i][3]=i;
        }
        sort(arr.begin(), arr.end(), [&](array<int,4> a, array<int,4> b){
            if (a[2]==b[2]) return (a[3]>b[3]);
            return (a[2]<b[2]);
        });

        vector<int> ansarr(n,-1);
        vector<bool> vis(n,true);
        for (int i = n-1; i >= 0; i--){
            if (!vis[i]) continue;
            for (int j = 0; j <= i; j++){
                if (!vis[j]) continue;
                if (hoayda(arr[i][0],arr[i][1],arr[j][0],arr[j][1])<=arr[j][2]+arr[i][2]){
                    ansarr[arr[j][3]]=arr[i][3]+1;
                    vis[j]=false;
                }
            }
        }
        coutarr(ansarr);
    }
}

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

circle_selection.cpp:1: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    1 | #pragma optimize("Bismillahirrahmanirrahim")
      |

• Subtask 1: 7 / 7
• Subtask 2: 0 / 12
• Subtask 3: 0 / 15
• Subtask 4: 0 / 23
• Subtask 5: 0 / 30
• Subtask 6: 0 / 13