제출 #710028

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

circle_selection

#include <bits/stdc++.h>
#define int long long
using namespace std;
const int maxn = 3e5 + 10;
typedef pair<int,int> ii;
typedef pair<ii,int> iii;
#define ff first
#define ss second
int calc(ii x, ii y)
{
    return (x.ff-y.ff)*(x.ff-y.ff) + (x.ss-y.ss)*(x.ss-y.ss);
}
bool dau[maxn];
int res[maxn];
int n;
iii a[maxn];
int id[maxn];
bool cmp(int x, int y)
{
    if (a[x].ss!=a[y].ss) return a[x].ss>a[y].ss;
    return x<y;
}
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);
    cin>>n;
    for (int i=1; i<=n; i++)
    {
        cin>>a[i].ff.ff>>a[i].ff.ss>>a[i].ss;
        dau[i]=0;
        id[i]=i;
    }
    sort(id+1,id+n+1,cmp);
    for (int i=1; i<=n; i++)
    {
        int j = id[i];
        if (dau[j]) continue;
        dau[j] = 1;
        res[j] = j;
        for (int z=1; z<=n; z++)
        {
            if (dau[z]) continue;
            int temp = calc(a[z].ff,a[j].ff);
            int val = (a[j].ss + a[z].ss) * (a[j].ss + a[z].ss);
            if (temp<=val)
            {
                dau[z] = 1;
                res[z] = j;
            }
        }
    }
    for (int i=1; i<=n; i++) cout<<res[i]<<' '; cout<<'\n';
}

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

circle_selection.cpp: In function 'int main()':
circle_selection.cpp:53:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   53 |     for (int i=1; i<=n; i++) cout<<res[i]<<' '; cout<<'\n';
      |     ^~~
circle_selection.cpp:53:49: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   53 |     for (int i=1; i<=n; i++) cout<<res[i]<<' '; cout<<'\n';
      |                                                 ^~~~

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